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.

6403 Publications


1991 | Journal Article | IST-REx-ID: 4052
Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1991). A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/0304-3975(91)90261-Y
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, H., Seidel, R., & Sharir, M. (1991). On the zone theorem for hyperplane arrangements (Vol. 555, pp. 108–123). Presented at the New Results and New Trends in Computer Science , Springer. https://doi.org/10.1007/BFb0038185
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner, H., & Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation (pp. 414–423). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/SFCS.1991.185400
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4056
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. Elsevier. https://doi.org/10.1016/0097-3165(91)90042-F
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner, H. (1991). Corrigendum. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/0022-0000(91)90013-U
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J. (1991). Computing a face in an arrangement of line segments (pp. 441–448). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
 

1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., & Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations (Vol. 510, pp. 661–673). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/3-540-54233-7_172
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4061
Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., & Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02574698
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4062
Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Wenger, R. (1991). Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02574700
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4508
Henzinger, T. A., Manna, Z., & Pnueli, A. (1991). Temporal proof methodologies for real-time systems (pp. 353–366). Presented at the POPL: Principles of Programming Languages, ACM. https://doi.org/10.1145/99583.99629
View | DOI | Download (ext.)
 

Search

Filter Publications