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.
539 Publications
1990 | Conference Paper | IST-REx-ID: 4078
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4077
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4510
T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990, pp. 717–730.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4522
T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in Proceedings of the 9th annual ACM symposium on Principles of distributed computing, Quebec City, Canada, 1990, pp. 281–296.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4597
R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” in 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, USA, 1990, pp. 390–401.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen, Germany, 1989, pp. 145–151.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4596
R. Alur and T. A. Henzinger, “A really temporal logic,” in 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 1989, pp. 164–169.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4097
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 214–229.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
H. Edelsbrunner, “Geometric structures in computational geometry,” in 15th International Colloquium on Automata, Languages and Programming, Tampere, Finland, 1988, vol. 317, pp. 201–213.
View
| DOI
| Download None (ext.)
1988 | Book Chapter | IST-REx-ID: 4317
N. H. Barton, “Speciation,” in Analytical biogeography: An integrated approach to the study of animal and plant distributions, 1st ed., A. Myers and P. Giller, Eds. Springer, 1988, pp. 185–218.
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4102
D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” Journal of Algorithms, vol. 8, no. 3. Academic Press, pp. 348–361, 1987.
View
| DOI
| Download None (ext.)
1987 | Conference Paper | IST-REx-ID: 3514
H. Edelsbrunner, J. Pach, J. Schwartz, and M. Sharir, “On the lower envelope of bivariate functions and its applications,” in 28th Annual Symposium on Foundations of Computer Science , Los Angeles, CA, USA, 1987, pp. 27–37.
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 3665 | 
N. H. Barton, “The effects of linkage and density-dependent regulation on gene flow,” Heredity, vol. 57. Nature Publishing Group, pp. 415–426, 1986.
[Published Version]
View
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” Journal of Combinatorial Theory Series A, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.
View
| DOI
| Download None (ext.)
1984 | Journal Article | IST-REx-ID: 4121
W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
View
| DOI
| Download None (ext.)