Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 6(1), 407–422.
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. 6(1), 435–442.
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 353–366.
LibreCat: https://research-explorer.ista.ac.at/record/4508
DOI: 10.1145/99583.99629

Henzinger TA. 1991. The temporal specification and verification of real-time systems . Stanford University.
LibreCat: https://research-explorer.ista.ac.at/record/4516

Alur R, Henzinger TA. 1991. Time for logic. SIGACT News. 22(3), 6–12.
LibreCat: https://research-explorer.ista.ac.at/record/4592

Alur R, Feder T, Henzinger TA. 1991. The benefits of relaxing punctuality. Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 139–152.
LibreCat: https://research-explorer.ista.ac.at/record/4621
DOI: 10.1145/227595.227602

Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. 1990. Cloning and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 265(2), 623–628.
LibreCat: https://research-explorer.ista.ac.at/record/2480
DOI: 10.1016/s0021-9258(19)40095-1 
PMID: 2153106 

Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. 1990. Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors. European Journal of Biochemistry. 193(3), 751–757.
LibreCat: https://research-explorer.ista.ac.at/record/2481
DOI: 10.1111/j.1432-1033.1990.tb19396.x
PMID: 1701145

Sugimoto T, Tanabe Y, Shigemoto R, Iwai M, Takumi T, Ohkubo H, Nakanishi S. 1990. Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells. Journal of Membrane Biology. 113(1), 39–47.
LibreCat: https://research-explorer.ista.ac.at/record/2528
DOI: 10.1007/BF01869604
PMID: 2154581

Erdös L, Tuyen D. 1990. Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier. Journal of Statistical Physics. 59(5–6), 1589–1602.
LibreCat: https://research-explorer.ista.ac.at/record/2721
DOI: 10.1007/BF01334766

Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. 124(4), 921–936.
LibreCat: https://research-explorer.ista.ac.at/record/3650
DOI: 10.1093/genetics/124.4.921
PMID: 2323556

Turelli M, Barton NH. 1990. Dynamics of polygenic characters under selection. Theoretical Population Biology. 38(1), 1–57.
LibreCat: https://research-explorer.ista.ac.at/record/3649
DOI: 10.1016/0040-5809(90)90002-D

Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782.
LibreCat: https://research-explorer.ista.ac.at/record/3651
DOI: 10.1093/genetics/124.3.773 
PMID: 2311921

Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428.
LibreCat: https://research-explorer.ista.ac.at/record/4067
DOI: 10.1007/3-540-52921-7_91

Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 5(1), 197–216.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 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. 5(1), 161–196.
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 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. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.
LibreCat: https://research-explorer.ista.ac.at/record/4070
DOI: 10.1080/00207169008803871

Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.
LibreCat: https://research-explorer.ista.ac.at/record/4071
DOI: 10.1145/98524.98535

Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. 5(1), 35–42.
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778