Colquhoun, D., Peter M Jonas, and Bert Sakmann. “Action of Brief Pulses of Glutamate on AMPA/Kainate Receptors in Patches from Different Neurones of Rat Hippocampal Slices.”https://doi.org/10.1113/jphysiol.1992.sp019417__Journal of Physiology. Wiley-Blackwell, 1992.https://doi.org/10.1113/jphysiol.1992.sp019417 .

Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”https://doi.org/10.1137/0913058__SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics , 1992.https://doi.org/10.1137/0913058 .

Henzinger, Thomas A, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. “Symbolic Model Checking for Real-Time Systems.”https://doi.org/10.1109/LICS.1992.185551__In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, 394–406. IEEE, 1992.https://doi.org/10.1109/LICS.1992.185551 .

Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” In Discrete &; Computational Geometry: Papers from the Dimacs Special Year, 6:77–93. Springer, 1991.

Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.”https://doi.org/10.1137/0220016 __SIAM Journal on Computing. SIAM, 1991.https://doi.org/10.1137/0220016  .

Szymura, Jacek, and Nicholas 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.”https://doi.org/10.1111/j.1558-5646.1991.tb04400.x__Evolution. Wiley-Blackwell, 1991.https://doi.org/10.1111/j.1558-5646.1991.tb04400.x .

Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.”https://doi.org/10.1007/3-540-54233-7_172__In 18th International Colloquium on Automata, Languages and Programming, 510:661–73. Springer, 1991.https://doi.org/10.1007/3-540-54233-7_172 .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1007/BF02574698__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574698 .

Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Temporal Proof Methodologies for Real-Time Systems.”https://doi.org/10.1145/99583.99629__In Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 353–66. ACM, 1991.https://doi.org/10.1145/99583.99629 .

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

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”https://doi.org/10.1007/BF02187785__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187785 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”https://doi.org/10.1007/BF02187784__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187784 .

Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.”https://doi.org/10.1080/00207169008803871__International Journal of Computer Mathematics. Taylor &; Francis, 1990.https://doi.org/10.1080/00207169008803871 .

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”https://doi.org/10.1007/BF02187778__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187778 .

Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.”https://doi.org/10.1007/978-1-4613-8997-2_25__In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990.https://doi.org/10.1007/978-1-4613-8997-2_25 .

Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.”https://doi.org/10.1080/01621459.1990.10475313__Journal of the American Statistical Association. American Statistical Association, 1990.https://doi.org/10.1080/01621459.1990.10475313 .

Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”https://doi.org/10.1007/BF02187783__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187783 .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1145/98524.98567__In Proceedings of the 6th Annual Symposium on Computational Geometry, 203–10. ACM, 1990.https://doi.org/10.1145/98524.98567 .

Ino, Tadashi, Kazuo Itoh, Hiroto Kamiya, Takeshi Kaneko, Ryuichi Shigemoto, Ichiro Akiguchi, and Noboru Mizuno. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.”https://doi.org/10.1016/0006-8993(89)91346-2__Brain Research. Elsevier, 1989.https://doi.org/10.1016/0006-8993(89)91346-2 .

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.”https://doi.org/10.1007/BF02187742__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187742 .