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.
1950 Publications
1992 | Conference Paper | IST-REx-ID: 4504
What good are digital clocks?
T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on Automata, Languages and Programming, Springer, 1992, pp. 545–558.
View
| DOI
| Download None (ext.)
T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on Automata, Languages and Programming, Springer, 1992, pp. 545–558.
1991 | Journal Article | IST-REx-ID: 2482
Sequence and expression of a metabotropic glutamate receptor
M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991) 760–765.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991) 760–765.
1991 | Book Chapter | IST-REx-ID: 3566
A hyperplane incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, American Mathematical Society, 1991, pp. 253–263.
View
| Download None (ext.)
H. Edelsbrunner, M. Sharir, in:, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, American Mathematical Society, 1991, pp. 253–263.
1991 | Journal Article | IST-REx-ID: 4056 | 
A lower bound on the number of unit distances between the vertices of a convex polygon
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.
1991 | Conference Paper | IST-REx-ID: 4054
On the zone theorem for hyperplane arrangements
H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.
1991 | Conference Paper | IST-REx-ID: 4059
Ray shooting in polygons using geodesic triangulations
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming, Springer, 1991, pp. 661–673.
1991 | Journal Article | IST-REx-ID: 4061 |
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
1990 | Journal Article | IST-REx-ID: 3651 |
Pleiotropic models of quantitative variation
N.H. Barton, Genetics 124 (1990) 773–782.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
N.H. Barton, Genetics 124 (1990) 773–782.
1990 | Conference Paper | IST-REx-ID: 4067
A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
1990 | Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
1990 | Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
1990 | Journal Article | IST-REx-ID: 4065
Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
1990 | Journal Article | IST-REx-ID: 4074
Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
View
| DOI
| Download None (ext.)
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
1990 | Conference Paper | IST-REx-ID: 4076
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
1990 | Conference Paper | IST-REx-ID: 4077
Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
View
| DOI
| Download None (ext.)
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
1990 | Journal Article | IST-REx-ID: 4075
Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
View
| DOI
| Download None (ext.)
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
1990 | Book Chapter | IST-REx-ID: 4311
Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.
View
| DOI
| Download None (ext.)
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.
1989 | Journal Article | IST-REx-ID: 4088 |
Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
1989 | Journal Article | IST-REx-ID: 4083 |
Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
[Published Version]
View
| DOI
| Download Published Version (ext.)
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
1989 | Journal Article | IST-REx-ID: 4084 |
Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.