Henzinger, T. A., Manna, Z., &; Pnueli, A. (1993). Towards refining temporal specifications into hybrid systems. In R. Grossman, A. Nerode, A. Ravn, &; H. Rischel (Eds.), International Hybrid Systems Workshop (Vol. 736, pp. 60–76). Springer.https://doi.org/10.1007/3-540-57318-6_24 

Alur, R., Henzinger, T. A., &; Ho, P. (1993). Automatic symbolic verification of embedded systems. In 1993 Proceedings Real-Time Systems Symposium (pp. 2–11). Raleigh, NC, United States of America: IEEE.https://doi.org/10.1109/REAL.1993.393520  

Jonas, P. M., &; Sakmann, B. (1992). Glutamate receptor channels in isolated patches from C and C pyramidal cells of rat hippocampal slices. Journal of Physiology. Wiley-Blackwell.https://doi.org/10.1113/jphysiol.1992.sp019294  

Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1992). Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/0925-7721(92)90009-H 

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &; Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer.https://doi.org/10.1007/BFb0023816 

Henzinger, T. A., Nicollin, X., Sifakis, J., &; Yovine, S. (1992). Symbolic model checking for real-time systems. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (pp. 394–406). Santa Cruz, CA, United States of America: IEEE.https://doi.org/10.1109/LICS.1992.185551 

Nakanishi, S., Ohkubo, H., Kakizuka, A., Yokota, Y., Shigemoto, R., Sasai, Y., &; Takumi, T. (1991). Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In Recent Progress in Hormone Research (Vol. 46, pp. 59–83). The Endocrine Society.https://doi.org/10.1016/b978-0-12-571146-3.50007-9 

Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Snoeyink, J. (1991). Computing a face in an arrangement of line segments. In Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms (pp. 441–448). San Francisco, CA, United States of America: SIAM.

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574698 

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1991). Temporal proof methodologies for real-time systems. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 353–366). Orlando, FL, United States of America: ACM.https://doi.org/10.1145/99583.99629 

Alur, R., Feder, T., &; Henzinger, T. A. (1991). The benefits of relaxing punctuality. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (pp. 139–152). Montreal, Canada: ACM.https://doi.org/10.1145/227595.227602 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187785 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187784 

Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE.https://doi.org/10.1109/FSCS.1990.89543 

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98535 

Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98551 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1990).https://doi.org/10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM.https://doi.org/10.1145/98524.98567 

Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Wenger, R. (1990). Points and triangles in the plane and halving planes in space. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98548 

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1990). An interleaving model for real time. In https://doi.org/10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE.https://doi.org/10.1109/JCIT.1990.128356 

Henzinger, T. A. (1990). Half-order modal logic: How to prove real-time properties. In Proceedings of the 9th annual ACM symposium on Principles of distributed computing (pp. 281–296). Quebec City, Canada: ACM.https://doi.org/10.1145/93385.93429