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
R. Alur, T. A. Henzinger, and P. Ho, “Automatic symbolic verification of embedded systems,” in 1993 Proceedings Real-Time Systems Symposium, Raleigh, NC, United States of America, 1993, pp. 2–11.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 3470 | OA
P. M. Jonas and B. Sakmann, “Glutamate receptor channels in isolated patches from CA1 and CA3 pyramidal cells of rat hippocampal slices,” Journal of Physiology, vol. 455. Wiley-Blackwell, pp. 143–171, 1992.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

1992 | Journal Article | IST-REx-ID: 3581 | OA
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” Computational Geometry: Theory and Applications, vol. 1, no. 6. Elsevier, pp. 305–323, 1992.
[Published Version] View | DOI | Download Published Version (ext.)
 

1992 | Conference Paper | IST-REx-ID: 4049
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.
View | DOI | Download None (ext.)
 

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

1991 | Book Chapter | IST-REx-ID: 2530
S. Nakanishi et al., “Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel,” in Recent Progress in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1991 | Conference Paper | IST-REx-ID: 4058
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States of America, 1991, pp. 441–448.
View | Download None (ext.)
 

1991 | Journal Article | IST-REx-ID: 4061 | OA
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete & Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Conference Paper | IST-REx-ID: 4508
T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Orlando, FL, United States of America, 1991, pp. 353–366.
View | DOI | Download None (ext.)
 

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

1990 | Journal Article | IST-REx-ID: 4066
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4072
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4073
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4071
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
View | DOI | Download None (ext.)
 

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

1986 | Journal Article | IST-REx-ID: 4106
H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” Journal of Symbolic Computation, vol. 2, no. 2. Elsevier, pp. 171–178, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4109
H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” Computer Journal, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.
View | DOI
 

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

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

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

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

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

1983 | Book Chapter | IST-REx-ID: 4328
N. H. Barton and G. Hewitt, “Hybrid zones as barriers to gene flow,” in Protein polymorphism: Adaptive and taxonomic significance, vol. 24, G. Oxford and D. Rollinson, Eds. Academic Press, 1983, pp. 341–359.
View
 

1982 | Journal Article | IST-REx-ID: 4131
H. Edelsbrunner and M. Overmars, “On the equivalence of some rectangle problems,” Information Processing Letters, vol. 14, no. 3. Elsevier, pp. 124–127, 1982.
View | DOI
 

Filters and Search Terms

isbn%3D978-331956616-0

Search

Filter Publications