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
Alur R, Henzinger TA, Ho P. 1993. Automatic symbolic verification of embedded systems. 1993 Proceedings Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium, 2–11.
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 3470 | 
Jonas PM, Sakmann B. 1992. Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices. Journal of Physiology. 455, 143–171.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1992 | Journal Article | IST-REx-ID: 3581 |
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1(6), 305–323.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1992 | Conference Paper | IST-REx-ID: 4049
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.
View
| DOI
| Download None (ext.)
1992 | Conference Paper | IST-REx-ID: 4505
Henzinger TA, Nicollin X, Sifakis J, Yovine S. 1992. Symbolic model checking for real-time systems. Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 394–406.
View
| DOI
| Download None (ext.)
1991 | Book Chapter | IST-REx-ID: 2530
Nakanishi S, Ohkubo H, Kakizuka A, Yokota Y, Shigemoto R, Sasai Y, Takumi T. 1991.Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: Recent Progress in Hormone Research. vol. 46, 59–83.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.
View
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 6(1), 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Conference Paper | IST-REx-ID: 4508
Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 353–366.
View
| DOI
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4621
Alur R, Feder T, Henzinger TA. 1991. The benefits of relaxing punctuality. Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 139–152.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4510
Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time. Proceedings of the 5th Jerusalem Conference on Information Technology. JCIT: Jerusalem Conference on Information Technology, 717–730.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4522
Henzinger TA. 1990. Half-order modal logic: How to prove real-time properties. Proceedings of the 9th annual ACM symposium on Principles of distributed computing. PODC: Principles of Distributed Computing, 281–296.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4597
Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness. 5th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 390–401.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4596
Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. 15th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner H. 1988. Geometric structures in computational geometry. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.
View
| DOI
| Download None (ext.)
1988 | Book Chapter | IST-REx-ID: 4317
Barton NH. 1988.Speciation. In: Analytical biogeography: An integrated approach to the study of animal and plant distributions. , 185–218.
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4102
Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
View
| DOI
| Download None (ext.)
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. 28th Annual Symposium on Foundations of Computer Science . FOCS: Foundations of Computer Science, 27–37.
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 3665 |
Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.
[Published Version]
View
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
View
| DOI
| Download None (ext.)
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.
View
| DOI
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications. Advances in Computing Research, vol. 1, 35–59.
View
1983 | Book Chapter | IST-REx-ID: 3562
Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.
View
| Download None (ext.)
1983 | Book Chapter | IST-REx-ID: 4328
Barton NH, Hewitt G. 1983.Hybrid zones as barriers to gene flow. In: Protein polymorphism: Adaptive and taxonomic significance. Systematics Association Special Volume, vol. 24, 341–359.
View