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.
LibreCat: https://research-explorer.ista.ac.at/record/3566

Lines in space – A collection of results
H. Edelsbrunner, in:, Discrete &; Computational Geometry: Papers from the Dimacs Special Year, Springer, 1991, pp. 77–93.
LibreCat: https://research-explorer.ista.ac.at/record/3567

A singly exponential stratification scheme for real semi-algebraic varieties and its applications
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Theoretical Computer Science 84 (1991) 77–105.
LibreCat: https://research-explorer.ista.ac.at/record/4052
DOI: 10.1016/0304-3975(91)90261-Y

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.
LibreCat: https://research-explorer.ista.ac.at/record/4056
DOI: 10.1016/0097-3165(91)90042-F

On the zone theorem for hyperplane arrangements
H. Edelsbrunner, R. Seidel, M. Sharir, in:, Springer, 1991, pp. 108–123.
LibreCat: https://research-explorer.ista.ac.at/record/4054
DOI: 10.1007/BFb0038185

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.
LibreCat: https://research-explorer.ista.ac.at/record/4058

A quadratic time algorithm for the minmax length triangulation
H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–423.
LibreCat: https://research-explorer.ista.ac.at/record/4055
DOI: 10.1109/SFCS.1991.185400

An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

Corrigendum
H. Edelsbrunner, Journal of Computer and System Sciences 42 (1991) 249–251.
LibreCat: https://research-explorer.ista.ac.at/record/4057
DOI: 10.1016/0022-0000(91)90013-U

ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability
P.M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, W. Vogel, Pflügers Archivf: European Journal of Physiology 418 (1991) 68–73.
LibreCat: https://research-explorer.ista.ac.at/record/3468
DOI: 10.1007/BF00370453
PMID: 2041727

The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci
J. Szymura, N.H. Barton, Evolution 45 (1991) 237–261.
LibreCat: https://research-explorer.ista.ac.at/record/3646
DOI: 10.1111/j.1558-5646.1991.tb04400.x
PMID: 28567861 

Natural and sexual selection on many loci
N.H. Barton, M. Turelli, Genetics 127 (1991) 229–255.
LibreCat: https://research-explorer.ista.ac.at/record/3647
DOI: 10.1093/genetics/127.1.229
PMID: 2016044

The probability of fixation of a new karyotype in a continuous population
N.H. Barton, S. Rouhani, Evolution 45 (1991) 499–517.
LibreCat: https://research-explorer.ista.ac.at/record/3648
DOI: 10.1111/j.1558-5646.1991.tb04326.x
PMID: 28568824

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.
LibreCat: https://research-explorer.ista.ac.at/record/4059
DOI: 10.1007/3-540-54233-7_172

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &; Computational Geometry 6 (1991) 407–422.
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete &; Computational Geometry 6 (1991) 435–442.
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

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.
LibreCat: https://research-explorer.ista.ac.at/record/4508
DOI: 10.1145/99583.99629

The temporal specification and verification of real-time systems 
T.A. Henzinger, The Temporal Specification and Verification of Real-Time Systems , Stanford University, 1991.
LibreCat: https://research-explorer.ista.ac.at/record/4516

Time for logic
R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.
LibreCat: https://research-explorer.ista.ac.at/record/4592

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.
LibreCat: https://research-explorer.ista.ac.at/record/4621
DOI: 10.1145/227595.227602