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.

538 Publications


1993 | Conference Paper | IST-REx-ID: 4616
Automatic symbolic verification of embedded systems
R. Alur, T.A. Henzinger, P. Ho, in:, 1993 Proceedings Real-Time Systems Symposium, IEEE, 1993, pp. 2–11.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 3470 | OA [Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

1992 | Journal Article | IST-REx-ID: 3581 | OA
Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Computational Geometry: Theory and Applications 1 (1992) 305–323.
[Published Version] View | DOI | Download Published Version (ext.)
 

1992 | Conference Paper | IST-REx-ID: 4049
Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, in:, I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics, Springer, 1992, pp. 46–60.
View | DOI | Download None (ext.)
 

1992 | Conference Paper | IST-REx-ID: 4505
Symbolic model checking for real-time systems
T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, in:, Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406.
View | DOI | Download None (ext.)
 

1991 | Book Chapter | IST-REx-ID: 2530
Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel
S. Nakanishi, H. Ohkubo, A. Kakizuka, Y. Yokota, R. Shigemoto, Y. Sasai, T. Takumi, in:, Recent Progress in Hormone Research, The Endocrine Society, 1991, pp. 59–83.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1991 | Conference Paper | IST-REx-ID: 4058
Computing a face in an arrangement of line segments
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, in:, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–448.
View | Download None (ext.)
 

1991 | Journal Article | IST-REx-ID: 4061 | OA
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.)
 

1991 | Conference Paper | IST-REx-ID: 4508
Temporal proof methodologies for real-time systems
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.
View | DOI | Download None (ext.)
 

1991 | Conference Paper | IST-REx-ID: 4621
The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, in:, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–152.
View | DOI | Download None (ext.)
 

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.)
 

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.)
 

1990 | Conference Paper | IST-REx-ID: 4073
Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4071
An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4078
Slimming down by adding; selecting heavily covered points
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.
View | DOI | Download None (ext.)
 

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.)
 

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.)
 

1990 | Conference Paper | IST-REx-ID: 4510
An interleaving model for real time
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4522
Half-order modal logic: How to prove real-time properties
T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4597
Real-time logics: Complexity and expressiveness
R. Alur, T.A. Henzinger, in:, 5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401.
View | DOI | Download None (ext.)
 

1989 | Conference Paper | IST-REx-ID: 4085
An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–151.
View | DOI | Download None (ext.)
 

1989 | Conference Paper | IST-REx-ID: 4596
A really temporal logic
R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.
View | DOI | Download None (ext.)
 

1988 | Conference Paper | IST-REx-ID: 4097
Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 214–229.
View | DOI | Download None (ext.)
 

1988 | Conference Paper | IST-REx-ID: 4096
Geometric structures in computational geometry
H. Edelsbrunner, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 201–213.
View | DOI | Download None (ext.)
 

1988 | Book Chapter | IST-REx-ID: 4317
Speciation
N.H. Barton, in:, A. Myers, P. Giller (Eds.), Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, 1st ed., Springer, 1988, pp. 185–218.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4102
Space searching for intersecting objects
D. Dobkin, H. Edelsbrunner, Journal of Algorithms 8 (1987) 348–361.
View | DOI | Download None (ext.)
 

1987 | Conference Paper | IST-REx-ID: 3514
On the lower envelope of bivariate functions and its applications
H. Edelsbrunner, J. Pach, J. Schwartz, M. Sharir, in:, 28th Annual Symposium on Foundations of Computer Science , IEEE, 1987, pp. 27–37.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 3665 | OA [Published Version] View | Download Published Version (ext.)
 

1986 | Journal Article | IST-REx-ID: 4098 | OA
The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4106
Computing a ham-sandwich cut in two dimensions
H. Edelsbrunner, R. Waupotitsch, Journal of Symbolic Computation 2 (1986) 171–178.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4109
Rectangular point location in d-dimensions with applications
H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.
View | DOI
 

1984 | Journal Article | IST-REx-ID: 4121
Efficient algorithms for agglomerative hierarchical clustering methods
W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.
View | DOI | Download None (ext.)
 

1984 | Conference Paper | IST-REx-ID: 4122
Key-problems and key-methods in computational geometry
H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.
View | DOI
 

1984 | Conference Paper | IST-REx-ID: 4119
Monotone edge sequences in line arrangements and applications
H. Edelsbrunner, E. Welzl, in:, 11th International Symposium on Mathematical Foundations of Computer Science, Springer, 1984, pp. 265–272.
View | DOI
 

1983 | Book Chapter | IST-REx-ID: 3563
Graphics in Flatland: a case study
H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59.
View
 

1983 | Book Chapter | IST-REx-ID: 3562
On expected- and worst-case segment trees
W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 109–125.
View | Download None (ext.)
 

1983 | Book Chapter | IST-REx-ID: 4328
Hybrid zones as barriers to gene flow
N.H. Barton, G. Hewitt, in:, G. Oxford, D. Rollinson (Eds.), Protein Polymorphism: Adaptive and Taxonomic Significance, Academic Press, 1983, pp. 341–359.
View
 

1982 | Journal Article | IST-REx-ID: 4131
On the equivalence of some rectangle problems
H. Edelsbrunner, M. Overmars, Information Processing Letters 14 (1982) 124–127.
View | DOI
 

Filters and Search Terms

isbn%3D978-331956616-0

Search

Filter Publications