Colquhoun D, Jonas PM, Sakmann B. 1992. Action of brief pulses of glutamate on AMPA/kainate receptors in patches from different neurones of rat hippocampal slices. Journal of Physiology. 458, 261–287.
LibreCat: https://research-explorer.ista.ac.at/record/3471
DOI: 10.1113/jphysiol.1992.sp019417
PMID: 1338788

Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.
LibreCat: https://research-explorer.ista.ac.at/record/4053
DOI: 10.1007/BF01285815

Burnashev N, Khodorova A, Jonas PM, Helm P, Wisden W, Monyer H, Seeburg P, Sakmann B. 1992. Calcium-permeable AMPA-kainate receptors in fusiform cerebellar glial cells. Science. 256(5063), 1566–1570.
LibreCat: https://research-explorer.ista.ac.at/record/3469
DOI: 10.1126/science.1317970
PMID: 1317970

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.
LibreCat: https://research-explorer.ista.ac.at/record/4049
DOI: 10.1007/BFb0023816

Henzinger TA, Manna Z, Pnueli A. 1992. What good are digital clocks? 19th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 623, 545–558.
LibreCat: https://research-explorer.ista.ac.at/record/4504
DOI: 10.1007/3-540-55719-9_103

Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. 1991. Sequence and expression of a metabotropic glutamate receptor. Nature. 349(6312), 760–765.
LibreCat: https://research-explorer.ista.ac.at/record/2482
DOI: 10.1038/349760a0
PMID: 1847995 

Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, 253–263.
LibreCat: https://research-explorer.ista.ac.at/record/3566

Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.
LibreCat: https://research-explorer.ista.ac.at/record/4056
DOI: 10.1016/0097-3165(91)90042-F

Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.
LibreCat: https://research-explorer.ista.ac.at/record/4054
DOI: 10.1007/BFb0038185

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.
LibreCat: https://research-explorer.ista.ac.at/record/4059
DOI: 10.1007/3-540-54233-7_172

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

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

Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.
LibreCat: https://research-explorer.ista.ac.at/record/4065
DOI: 10.1016/0012-365X(90)90147-A

Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. 5(1), 99–160.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990.  Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404