Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

5875 Publications


1990 | Journal Article | IST-REx-ID: 4064
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, pp. 115–119, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4065
H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2, pp. 153–164, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
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, pp. 197–216, 1990.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications to counting distances,” presented at the SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , 1990, vol. 450, pp. 419–428.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1, pp. 35–42, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3, pp. 251–260, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
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, pp. 129–144, 1990.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 44–52.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
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, pp. 161–196, 1990.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” presented at the FOCS: Foundations of Computer Science, 1990, pp. 242–251.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4074
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, pp. 99–160, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4075
D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4, pp. 561–571, 1990.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 203–210.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4077
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 112–115.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4078
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” presented at the SCG: Symposium on Computational Geometry, 1990, pp. 116–127.
View | DOI
 

1990 | Book Review | IST-REx-ID: 4310
N. H. Barton and S. Jones, “The language of the genes,” Nature, vol. 346. Nature Publishing Group, pp. 415–416, 1990.
View | DOI
 

1990 | Book Chapter | IST-REx-ID: 4311
N. H. Barton and A. Clark, “Population structure,” in Population biology: ecological and evolutionary viewpoints, K. Wöhrmann and S. Jain, Eds. Springer, 1990, pp. 115–174.
View
 

1990 | Conference Paper | IST-REx-ID: 4510
T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” presented at the JCIT: Jerusalem Conference on Information Technology, 1990, pp. 717–730.
View | Download (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4522
T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” presented at the PODC: Principles of Distributed Computing, 1990, pp. 281–296.
View | DOI | Download (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4597
R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” presented at the LICS: Logic in Computer Science, 1990, pp. 390–401.
View | DOI | Download (ext.)
 

Search

Filter Publications