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

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.

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.

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.

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.

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.

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.

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

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

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.

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.

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.

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.

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.

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.

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.

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

Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. 420, 365–385.

Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.

Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.