N. H. Barton, “On the spread of new gene combinations in the third phase of Wright’s shifting balance,” Evolution; International Journal of Organic Evolution, vol. 46, no. 2. Wiley-Blackwell, pp. 551–557, 1992.

N. H. Barton, “The genetic consequences of dispersal,” in Animal dispersal: small mammals as a model, N. Stenseth and W. Lidicker, Eds. Chapman Hall, 1992, pp. 37–60.

N. H. Barton and N. Goldman, “Genetics and geography,” Nature, vol. 357. Nature Publishing Group, pp. 440–441, 1992.

N. Burnashev et al., “Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells.,” Science, vol. 256, no. 5063. American Association for the Advancement of Science, pp. 1566–1570, 1992.

B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” Computational Geometry: Theory and Applications, vol. 1, no. 6. Elsevier, pp. 305–323, 1992.

N. Sanderson, J. Szymura, and N. H. Barton, “Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata,” Evolution, vol. 46, no. 3. Wiley-Blackwell, pp. 595–607, 1992.

M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.

H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” Theoretical Computer Science, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.

B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.

H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2 log n) time algorithm for the MinMax angle triangulation,” SIAM Journal on Scientific Computing, vol. 13, no. 4. Society for Industrial and Applied Mathematics , pp. 994–1008, 1992.

A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.

T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” in Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, United States of America, 1992, pp. 394–406.

T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,” in 19th International Colloquium on Automata, Languages and Programming, Vienna, Austria, 1992, vol. 623, pp. 545–558.

T. A. Henzinger, Z. Manna, and A. Pnueli, “Timed transition systems,” in Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 226–251.

T. A. Henzinger, “Sooner Is Safer Than Later,” Information Processing Letters, vol. 43, no. 3. Elsevier, pp. 135–141, 1992.

R. Alur and T. A. Henzinger, “Logics and models of real time: A survey,” in REX Workshop on Real Time: Theory in Practice, Mook, The Netherlands, 1992, vol. 600, pp. 74–106.

R. Alur and T. A. Henzinger, “Back to the future: Towards a theory of timed regular languages,” in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, United States of America, 1992, pp. 177–186.

S. Za0tsev, L. A. Sazanov, A. Koshkin, G. Sud’Ina, and S. Varfolomeev, “Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Al] methionine enkephalinamide,” FEBS Letters, vol. 291, no. 1. Elsevier, pp. 84–86, 1991.

K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, and S. Nakanishi, “Molecular cloning and characterization of the rat NMDA receptor,” Nature, vol. 353, no. 6348. Nature Publishing Group, pp. 31–37, 1991.

M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, and S. Nakanishi, “Sequence and expression of a metabotropic glutamate receptor,” Nature, vol. 349, no. 6312. Nature Publishing Group, pp. 760–765, 1991.

Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, and N. Mizuno, “Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat,” Experimental Brain Research, vol. 85, no. 1. Springer, pp. 75–84, 1991.

S. Nakanishi et al., “Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel,” in Recent Progress in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83.

H. Edelsbrunner and M. Sharir, “A hyperplane incidence problem with applications to counting distances,” in Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–263.

H. Edelsbrunner, “Lines in space – A collection of results,” in Discrete &; Computational Geometry: Papers from the Dimacs Special Year, vol. 6, Springer, 1991, pp. 77–93.

B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” Theoretical Computer Science, vol. 84, no. 1. Elsevier, pp. 77–105, 1991.

H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” Journal of Combinatorial Theory Series A, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.

H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” presented at the New Results and New Trends in Computer Science , 1991, vol. 555, pp. 108–123.

B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States of America, 1991, pp. 441–448.

H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in 32nd Annual Symposium of Foundations of Computer Science, San Juan, PR, United States of America, 1991, pp. 414–423.

H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM, pp. 259–269, 1991.

H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.

P. M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, and W. Vogel, “ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability,” Pflügers Archivf: European Journal of Physiology, vol. 418, no. 1–2. Springer, pp. 68–73, 1991.

J. Szymura and N. H. Barton, “The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci,” Evolution, vol. 45, no. 2. Wiley-Blackwell, pp. 237–261, 1991.

N. H. Barton and M. Turelli, “Natural and sexual selection on many loci,” Genetics, vol. 127, no. 1. Genetics Society of America, pp. 229–255, 1991.

N. H. Barton and S. Rouhani, “The probability of fixation of a new karyotype in a continuous population,” Evolution, vol. 45, no. 3. Wiley-Blackwell, pp. 499–517, 1991.

B. Chazelle et al., “Ray shooting in polygons using geodesic triangulations,” in 18th International Colloquium on Automata, Languages and Programming, Madrid, Spain, 1991, vol. 510, pp. 661–673.

P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete &; Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.

B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” Discrete &; Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.

T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Orlando, FL, United States of America, 1991, pp. 353–366.

T. A. Henzinger, “The temporal specification and verification of real-time systems ,” Stanford University, 1991.

R. Alur and T. A. Henzinger, “Time for logic,” SIGACT News, vol. 22, no. 3. ACM, pp. 6–12, 1991.

R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” in Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, 1991, pp. 139–152.

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.

T. Kaneko, K. Itoh, R. Shigemoto, and N. Mizuno, “Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat,” Neuroscience, vol. 32, no. 1. Elsevier, pp. 79–98, 1989.

Y. Yokota et al., “Molecular characterization of a functional cDNA for rat substance P receptor,” Journal of Biological Chemistry, vol. 264, no. 30. American Society for Biochemistry and Molecular Biology, pp. 17649–17652, 1989.

T. Ino et al., “Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat,” Brain Research, vol. 479, no. 1. Elsevier, pp. 157–161, 1989.

Akimoto M. et al., “Effect of endothelin on gastric mucosal blood flow in rat,” Japanese Journal of Gastroenterology, vol. 86, no. 11. Japanese Society of Gastroenterology, p. 2627, 1989.

J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent selection,” Genetics, vol. 122, no. 4. Genetics Society of America, pp. 967–976, 1989.

J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid zone,” Evolution, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.

N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” Nature, vol. 341. Nature Publishing Group, pp. 497–503, 1989.

H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.

H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” Journal of Computer and System Sciences, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.

H. Edelsbrunner et al., “On arrangements of Jordan arcs with three intersections per pair,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 523–539, 1989.

F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384, 1989.

H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” Theoretical Computer Science, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.

H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” in  International Symposium on Symbolic and Algebraic Computation, Rome, Italy, 1989, vol. 358, pp. 315–331.

H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen, Germany, 1989, pp. 145–151.

H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” Discrete &; Computational Geometry, vol. 4, no. 4. Springer, pp. 337–343, 1989.

M. Slatkin and N. H. Barton, “A comparison of three methods for estimating average levels of gene flow,” Evolution; International Journal of Organic Evolution, vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.

P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels,” PNAS, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.

P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289, 1989.

H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.

H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.

H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” Geometriae Dedicata, vol. 32, no. 1. Springer, pp. 1–12, 1989.

H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” American Mathematical Monthly, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989.

B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” in 16th International Colloquium on Automata, Languages, and Programming, Stresa, Italy, 1989, vol. 372, pp. 179–193.

B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181, 1989.

N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” Genetical Research, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.

N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little do we know?,” Annual Review of Genetics, vol. 23. Annual Reviews, pp. 337–370, 1989.

N. H. Barton, “Founder effect speciation,” in Speciation and its consequences, D. Otte and J. Endler, Eds. Sinauer Press, 1989.