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
2024 | Journal Article | IST-REx-ID: 14820 | 
Schmid S, Svoboda J, Yeo MX. 2024. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. 989, 114353.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2023 | Journal Article | IST-REx-ID: 12566 |
Alistarh D-A, Ellen F, Rybicki J. 2023. Wait-free approximate agreement on graphs. Theoretical Computer Science. 948(2), 113733.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 14362 |
Castellano I, Giordano Bruno A, Zava N. 2023. Weakly weighted generalised quasi-metric spaces and semilattices. Theoretical Computer Science. 977, 114129.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9647 |
Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 9827 |
Chatterjee B, Walulya I, Tsigas P. 2021. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 886, 27–48.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2019 | Journal Article | IST-REx-ID: 11898 |
Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 11901 |
Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 573, 1–15.
View
| DOI
| Download None (ext.)
2013 | Journal Article | IST-REx-ID: 11902
Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32.
View
| Files available
| DOI
1995 | Journal Article | IST-REx-ID: 4613
Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho P, Nicollin X, Olivero A, Sifakis J, Yovine S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science. 138(1), 3–34.
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4047 |
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.
[Published Version]
View
| DOI
| Download Published Version (ext.)
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. 84(1), 77–105.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Journal Article | IST-REx-ID: 4116 |
Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1981 | Journal Article | IST-REx-ID: 4133 |
Edelsbrunner H, Maurer H. 1981. A space-optimal solution of general region location. Theoretical Computer Science. 16(3), 329–336.
[Published Version]
View
| DOI
| Download Published Version (ext.)