Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.”10.1109/FSCS.1990.89543__31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.

Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.”10.1080/00207169008803871__International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor &; Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.

Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.”10.1145/98524.98535__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”10.1007/BF02187778__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.

Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”10.1007/BF02122779__Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.

Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.”10.1113/jphysiol.1990.sp017918__Journal of Physiology, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:10.1113/jphysiol.1990.sp017918.

Dobkin, David, et al. “Probing Convex Polytopes.”10.1007/978-1-4613-8997-2_25__Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.

Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.”10.1080/01621459.1990.10475313__Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.

Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.”10.1145/77635.77639__ACM Transactions on Graphics, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:10.1145/77635.77639.

Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.”10.1016/S0747-7171(08)80068-5__Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.

Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.”10.1016/0012-365X(90)90147-A__Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.

Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”10.1007/BF02187783__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.

Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.”10.1145/98524.98551__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1145/98524.98567__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1145/98524.98548__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.

Dobkin, David, et al. “Searching for Empty Convex Polygons.”10.1007/BF01840404__Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.

Barton, Nicholas H., and A. Clark. “Population Structure and Processes in Evolution.”10.1007/978-3-642-74474-7_5__Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, Springer, 1990, pp. 115–74, doi:10.1007/978-3-642-74474-7_5.

Barton, Nicholas H., and Steve Jones. “The Language of the Genes.”10.1038/346415a0__Nature, vol. 346, Nature Publishing Group, 1990, pp. 415–16, doi:10.1038/346415a0.

Henzinger, Thomas A., et al. “An Interleaving Model for Real Time.”10.1109/JCIT.1990.128356__10.1109/JCIT.1990.128356__Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–30, doi:10.1109/JCIT.1990.128356.

Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties.”10.1145/93385.93429__Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–96, doi:10.1145/93385.93429.

Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.”10.1109/LICS.1990.113764__10.1109/LICS.1990.113764__5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401, doi:10.1109/LICS.1990.113764.