Please note that ISTA 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.
18 Publications
2019 | Journal Article | IST-REx-ID: 11898 | 
Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science. Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 11901 |
Henzinger, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.033.
View
| DOI
| Download None (ext.)
2015 | Journal Article | IST-REx-ID: 5804
Biswas, Ranita, and Partha Bhowmick. “From Prima Quadraginta Octant to Lattice Sphere through Primitive Integer Operations.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.11.018.
View
| DOI
2015 | Journal Article | IST-REx-ID: 5807
Biswas, Ranita, and Partha Bhowmick. “On Different Topological Classes of Spherical Geodesic Paths and Circles InZ3.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.09.003.
View
| DOI
2013 | Journal Article | IST-REx-ID: 11902
Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.” Theoretical Computer Science. Elsevier, 2013. https://doi.org/10.1016/j.tcs.2013.01.030.
View
| Files available
| DOI
2002 | Journal Article | IST-REx-ID: 4407
Raskin, Jean, Pierre Schobbens, and Thomas A Henzinger. “Axioms for Real-Time Logics.” Theoretical Computer Science. Elsevier, 2002. https://doi.org/10.1016/S0304-3975(00)00308-X.
View
| DOI
1999 | Journal Article | IST-REx-ID: 4442
Henzinger, Thomas A, and Peter Kopke. “Discrete-Time Control for Rectangular Hybrid Automata.” Theoretical Computer Science. Elsevier, 1999. https://doi.org/10.1016/S0304-3975(99)00038-9.
View
| DOI
1995 | Journal Article | IST-REx-ID: 4613
Alur, Rajeev, Costas Courcoubetis, Nicolas Halbwachs, Thomas A Henzinger, Pei Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. “The Algorithmic Analysis of Hybrid Systems.” Theoretical Computer Science. Elsevier, 1995. https://doi.org/10.1016/0304-3975(94)00202-T.
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4047 |
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science. Elsevier, 1992. https://doi.org/10.1016/0304-3975(92)90319-B.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4052 |
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science. Elsevier, 1991. https://doi.org/10.1016/0304-3975(91)90261-Y.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science. Elsevier, 1989. https://doi.org/10.1016/0304-3975(89)90133-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Journal Article | IST-REx-ID: 4116 |
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science. Elsevier, 1985. https://doi.org/10.1016/0304-3975(85)90005-2.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1981 | Journal Article | IST-REx-ID: 4133 |
Edelsbrunner, Herbert, and Hermann Maurer. “A Space-Optimal Solution of General Region Location.” Theoretical Computer Science. Elsevier, 1981. https://doi.org/10.1016/0304-3975(81)90103-1.
[Published Version]
View
| DOI
| Download Published Version (ext.)