R. Shigemoto, Y. Yokota, K. Tsuchida, and S. Nakanishi, “Cloning and expression of a rat neuromedin K receptor cDNA,” Journal of Biological Chemistry, vol. 265, no. 2. American Society for Biochemistry and Molecular Biology, pp. 623–628, 1990.

K. Tsuchida, R. Shigemoto, Y. Yokota, and S. Nakanishi, “Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors,” European Journal of Biochemistry, vol. 193, no. 3. Wiley-Blackwell, pp. 751–757, 1990.

T. Sugimoto 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,” Journal of Membrane Biology, vol. 113, no. 1. Springer, pp. 39–47, 1990.

L. Erdös and D. Tuyen, “Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier,” Journal of Statistical Physics, vol. 59, no. 5–6. Springer, pp. 1589–1602, 1990.

J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley, “Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones,” Genetics, vol. 124, no. 4. Genetics Society of America, pp. 921–936, 1990.

M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,” Theoretical Population Biology, vol. 38, no. 1. Academic Press, pp. 1–57, 1990.

N. H. Barton, “Pleiotropic models of quantitative variation,” Genetics, vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.

H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications to counting distances,” in Proceedings of the International Symposium on Algorithms, Tokyo, Japan, 1990, vol. 450, pp. 419–428.

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.

B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.

H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor &; Francis, pp. 129–144, 1990.

H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.

H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.

H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.

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

D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.

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

H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” ACM Transactions on Graphics, vol. 9, no. 1. ACM, pp. 66–104, 1990.

H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4. Elsevier, pp. 335–347, 1990.

H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.

K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.

B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.

P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.

B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.

D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4. Springer, pp. 561–571, 1990.

N. H. Barton and A. Clark, “Population structure and processes in evolution,” in Population biology: Ecological and evolutionary viewpoints, K. Wöhrmann and S. Jain, Eds. Springer, 1990, pp. 115–174.

N. H. Barton and S. Jones, “The language of the genes,” Nature, vol. 346. Nature Publishing Group, pp. 415–416, 1990.

T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in  Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990, pp. 717–730.

T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in Proceedings of the 9th annual ACM symposium on Principles of distributed computing, Quebec City, Canada, 1990, pp. 281–296.

R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” in  5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, USA, 1990, pp. 390–401.