Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.”10.1145/147508.147511__Journal of the ACM, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.

Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”10.1137/0913058__SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.

Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.”10.1016/0020-0190(92)90133-G__Information Processing Letters, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi:10.1016/0020-0190(92)90133-G.

Henzinger, Thomas A., et al. “Symbolic Model Checking for Real-Time Systems.”10.1109/LICS.1992.185551__Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406, doi:10.1109/LICS.1992.185551.

Henzinger, Thomas A., et al. “What Good Are Digital Clocks?”10.1007/3-540-55719-9_103__19th International Colloquium on Automata, Languages and Programming, vol. 623, Springer, 1992, pp. 545–58, doi:10.1007/3-540-55719-9_103.

Henzinger, Thomas A., et al. “Timed Transition Systems.”10.1007/BFb0031995__Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 226–51, doi:10.1007/BFb0031995.

Henzinger, Thomas A. “Sooner Is Safer Than Later.”10.1016/0020-0190(92)90005-G__Information Processing Letters, vol. 43, no. 3, Elsevier, 1992, pp. 135–41, doi:10.1016/0020-0190(92)90005-G.

Alur, Rajeev, and Thomas A. Henzinger. “Logics and Models of Real Time: A Survey.”10.1007/BFb0031984__REX Workshop on Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 74–106, doi:10.1007/BFb0031984.

Alur, Rajeev, and Thomas A. Henzinger. “Back to the Future: Towards a Theory of Timed Regular Languages.”10.1109/SFCS.1992.267774__Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 177–86, doi:10.1109/SFCS.1992.267774.

Za0tsev, Sergei, et al. “Respiratory Burst Inhibition in Human Neutrophils by Ultra-Low Doses of [D-Al] Methionine Enkephalinamide.”10.1016/0014-5793(91)81109-L__FEBS Letters, vol. 291, no. 1, Elsevier, 1991, pp. 84–86, doi:10.1016/0014-5793(91)81109-L.

Moriyoshi, Koki, et al. “Molecular Cloning and Characterization of the Rat NMDA Receptor.”10.1038/354031a0__Nature, vol. 353, no. 6348, Nature Publishing Group, 1991, pp. 31–37, doi:10.1038/354031a0.

Masu, Masayuki, et al. “Sequence and Expression of a Metabotropic Glutamate Receptor.”10.1038/349760a0__Nature, vol. 349, no. 6312, Nature Publishing Group, 1991, pp. 760–65, doi:10.1038/349760a0.

Yasui, Yukihiko, et al. “Topographical Projections from the Cerebral Cortex to the Nucleus of the Solitary Tract in the Cat.”10.1007/BF00229988__Experimental Brain Research, vol. 85, no. 1, Springer, 1991, pp. 75–84, doi:10.1007/BF00229988.

Nakanishi, Shigetada, et al. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.”10.1016/b978-0-12-571146-3.50007-9__Recent Progress in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83, doi:10.1016/b978-0-12-571146-3.50007-9.

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.