Dobkin, D., Edelsbrunner, H., &; Yap, C. (1990). Probing convex polytopes. In I. Cox &; G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer.https://doi.org/10.1007/978-1-4613-8997-2_25 

Edelsbrunner, H., &; Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. American Statistical Association.https://doi.org/10.1080/01621459.1990.10475313 

Edelsbrunner, H., Robison, A., &; Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics. Elsevier.https://doi.org/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. Springer.https://doi.org/10.1007/BF02187783 

Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1990). Slimming down by adding; selecting heavily covered points. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98551 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1990).https://doi.org/10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM.https://doi.org/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. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98548 

Henzinger, T. A., Manna, Z., &; Pnueli, A. (1990). An interleaving model for real time. In https://doi.org/10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE.https://doi.org/10.1109/JCIT.1990.128356 

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187742 

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 

Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension. In Proceedings of the 5th annual symposium on Computational geometry (pp. 145–151). Saarbruchen, Germany: ACM.https://doi.org/10.1145/73833.73850 

Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187734 

Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. Springer.https://doi.org/10.1007/BF01870958 

Edelsbrunner, H., Hasan, N., Seidel, R., &; Shen, X. (1989). Circles through two points that always enclose many points. Geometriae Dedicata. Springer.https://doi.org/10.1007/BF00181432 

Barton, N. H. (1989). The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. Cambridge University Press.https://doi.org/10.1017/S0016672300028378 

Alur, R., &; Henzinger, T. A. (1989). A really temporal logic. In 30th Annual Symposium on Foundations of Computer Science (pp. 164–169). Research Triangle Park, NC, USA: IEEE.https://doi.org/10.1109/SFCS.1989.63473 

Mizuno, N., Ueyama, T., Itoh, K., Satoda, T., Tashiro, T., &; Shigemoto, R. (1988). Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey. Neuroscience Letters. Elsevier.https://doi.org/10.1016/0304-3940(88)90473-9 

Edelsbrunner, H., &; Preparata, F. (1988). Minimum polygonal separation. Information and Computation. Elsevier.https://doi.org/10.1016/0890-5401(88)90049-1 

Edelsbrunner, H., &; Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0217054  

Rouhani, S., &; Barton, N. H. (1987). Instantons in stochastic quantization. Physica A: Statistical Mechanics and Its Applications. Elsevier.https://doi.org/10.1016/0378-4371(87)90064-1