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.

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.

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.

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.

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.

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.

Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”10.1007/BF02187785__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.

Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”10.1007/BF02187784__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.

Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.”10.1109/FSCS.1990.89543__31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.

Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.”10.1145/98524.98535__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.

Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.”10.1145/98524.98551__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1145/98524.98567__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1145/98524.98548__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.

Henzinger, Thomas A., et al. “An Interleaving Model for Real Time.”10.1109/JCIT.1990.128356__10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–30, doi:10.1109/JCIT.1990.128356.

Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.”10.1145/93385.93429__Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–96, doi:10.1145/93385.93429.

Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.”10.1109/LICS.1990.113764__10.1109/LICS.1990.113764__5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401, doi:10.1109/LICS.1990.113764.

Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”10.1145/73833.73850__Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.

Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.”10.1109/SFCS.1989.63473__30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–69, doi:10.1109/SFCS.1989.63473.

Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.”10.1007/3-540-19488-6_118__15th International Colloquium on Automata, Languages and Programming, vol. 317, Springer, 1988, pp. 214–29, doi:10.1007/3-540-19488-6_118.

Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.”10.1007/3-540-19488-6_117__15th International Colloquium on Automata, Languages and Programming, vol. 317, Springer, 1988, pp. 201–13, doi:10.1007/3-540-19488-6_117.