Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–63.

Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” Discrete &; Computational Geometry: Papers from the Dimacs Special Year, vol. 6, Springer, 1991, pp. 77–93.

Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.”10.1016/0304-3975(91)90261-Y__Theoretical Computer Science, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi:10.1016/0304-3975(91)90261-Y.

Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.”10.1016/0097-3165(91)90042-F__Journal of Combinatorial Theory Series A, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:10.1016/0097-3165(91)90042-F.

Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements. Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.

Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.” Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–48.

Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.”10.1109/SFCS.1991.185400__32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.

Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.”10.1137/0220016 __SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .

Edelsbrunner, Herbert. “Corrigendum.”10.1016/0022-0000(91)90013-U__Journal of Computer and System Sciences, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:10.1016/0022-0000(91)90013-U.

Jonas, Peter M., et al. “ATP-Sensitive and Ca-Activated K Channels in Vertebrate Axons: Novel Links between Metabolism and Excitability.”10.1007/BF00370453__Pflügers Archivf: European Journal of Physiology, vol. 418, no. 1–2, Springer, 1991, pp. 68–73, doi:10.1007/BF00370453.

Szymura, Jacek, and Nicholas H. Barton. “The Genetic Structure of the Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata: Comparisons between Transects and between Loci.”10.1111/j.1558-5646.1991.tb04400.x__Evolution, vol. 45, no. 2, Wiley-Blackwell, 1991, pp. 237–61, doi:10.1111/j.1558-5646.1991.tb04400.x.

Barton, Nicholas H., and Michael Turelli. “Natural and Sexual Selection on Many Loci.”10.1093/genetics/127.1.229__Genetics, vol. 127, no. 1, Genetics Society of America, 1991, pp. 229–55, doi:10.1093/genetics/127.1.229.

Barton, Nicholas H., and Shahin Rouhani. “The Probability of Fixation of a New Karyotype in a Continuous Population.”10.1111/j.1558-5646.1991.tb04326.x__Evolution, vol. 45, no. 3, Wiley-Blackwell, 1991, pp. 499–517, doi:10.1111/j.1558-5646.1991.tb04326.x.

Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.”10.1007/3-540-54233-7_172__18th International Colloquium on Automata, Languages and Programming, vol. 510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1007/BF02574698__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1007/BF02574700__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:10.1007/BF02574700.

Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.”10.1145/99583.99629__Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–66, doi:10.1145/99583.99629.

Henzinger, Thomas A. The Temporal Specification and Verification of Real-Time Systems . Stanford University, 1991.

Alur, Rajeev, and Thomas A. Henzinger. “Time for Logic.” SIGACT News, vol. 22, no. 3, ACM, 1991, pp. 6–12.

Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.”10.1145/227595.227602__Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–52, doi:10.1145/227595.227602.