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.

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.

The temporal specification and verification of real-time systems 
T.A. Henzinger, The Temporal Specification and Verification of Real-Time Systems , Stanford University, 1991.

Time for logic
R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.

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.

Cloning and expression of a rat neuromedin K receptor cDNA
R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.

Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors
K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry 193 (1990) 751–757.

Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells
T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi, Journal of Membrane Biology 113 (1990) 39–47.

Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier
L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.

Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones
J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics 124 (1990) 921–936.

Dynamics of polygenic characters under selection
M. Turelli, N.H. Barton, Theoretical Population Biology 38 (1990) 1–57.

Pleiotropic models of quantitative variation
N.H. Barton, Genetics 124 (1990) 773–782.

A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 197–216.

The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 161–196.

Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.

Ranking intervals under visibility constraints
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.

An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.

The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2
H. Edelsbrunner, M. Sharir, Discrete &; Computational Geometry 5 (1990) 35–42.

An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.