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.

Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.”10.1016/s0021-9258(19)40095-1 __Journal of Biological Chemistry, vol. 265, no. 2, American Society for Biochemistry and Molecular Biology, 1990, pp. 623–28, doi:10.1016/s0021-9258(19)40095-1 .

Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin Receptors.”10.1111/j.1432-1033.1990.tb19396.x__European Journal of Biochemistry, vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:10.1111/j.1432-1033.1990.tb19396.x.

Sugimoto, Tetsuo, et al. “Immunohistochemical Study of a Rat Membrane Protein Which Induces a Selective Potassium Permeation: Its Localization in the Apical Membrane Portion of Epithelial Cells.”10.1007/BF01869604__Journal of Membrane Biology, vol. 113, no. 1, Springer, 1990, pp. 39–47, doi:10.1007/BF01869604.

Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh Gas with a Semipermeable Barrier.”10.1007/BF01334766__Journal of Statistical Physics, vol. 59, no. 5–6, Springer, 1990, pp. 1589–602, doi:10.1007/BF01334766.

Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.”10.1093/genetics/124.4.921__Genetics, vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:10.1093/genetics/124.4.921.

Turelli, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters under Selection.”10.1016/0040-5809(90)90002-D__Theoretical Population Biology, vol. 38, no. 1, Academic Press, 1990, pp. 1–57, doi:10.1016/0040-5809(90)90002-D.

Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.”10.1093/genetics/124.3.773 __Genetics, vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:10.1093/genetics/124.3.773 .

Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.”10.1007/3-540-52921-7_91__Proceedings of the International Symposium on Algorithms, vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.

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. “Ranking Intervals under Visibility Constraints.”10.1080/00207169008803871__International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor &; Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.

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.

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”10.1007/BF02187778__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.