Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
9101 Publications
1989 | Journal Article | IST-REx-ID: 4088 | 
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4082 |
Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” Journal of Computer and System Sciences, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” International Symposium on Symbolic and Algebraic Computation, vol. 358, Springer, 1989, pp. 315–31, doi:10.1007/3-540-51084-2_31.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4309
Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” Evolution; International Journal of Organic Evolution, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68, doi:10.1111/j.1558-5646.1989.tb02587.x .
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Journal Article | IST-REx-ID: 3466 |
Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” PNAS, vol. 86, no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:10.1073/pnas.86.18.7238.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1989 | Journal Article | IST-REx-ID: 3465
Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” Journal of Membrane Biology, vol. 112, no. 3, Springer, 1989, pp. 277–89, doi:10.1007/BF01870958.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.
View
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4081 |
Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata, vol. 32, no. 1, Springer, 1989, pp. 1–12, doi:10.1007/BF00181432.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” American Mathematical Monthly, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18, doi:10.1080/00029890.1989.11972250.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” 16th International Colloquium on Automata, Languages, and Programming, vol. 372, Springer, 1989, pp. 179–93, doi:10.1007/BFb0035760.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:10.1007/BF02187720.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4314
Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” Genetical Research, vol. 54, no. 1, Cambridge University Press, 1989, pp. 59–78, doi:10.1017/S0016672300028378.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Journal Article | IST-REx-ID: 4312
Barton, Nicholas H., and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” Annual Review of Genetics, vol. 23, Annual Reviews, 1989, pp. 337–70, doi:10.1146/annurev.ge.23.120189.002005.
View
| DOI
| Download None (ext.)
1989 | Book Chapter | IST-REx-ID: 4313
Barton, Nicholas H. “Founder Effect Speciation.” Speciation and Its Consequences, edited by Daniel Otte and John Endler, Sinauer Press, 1989.
View
| Download None (ext.)