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 | OA
S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” Theoretical Computer Science, vol. 989. Elsevier, 2024.
[Published Version] View | DOI | Download Published Version (ext.)
 

2023 | Journal Article | IST-REx-ID: 12566 | OA
D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” Theoretical Computer Science, vol. 948, no. 2. Elsevier, 2023.
[Published Version] View | Files available | DOI | WoS
 

2023 | Journal Article | IST-REx-ID: 14362 | OA
I. Castellano, A. Giordano Bruno, and N. Zava, “Weakly weighted generalised quasi-metric spaces and semilattices,” Theoretical Computer Science, vol. 977. Elsevier, 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9647 | OA
T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9827 | OA
B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” Theoretical Computer Science, vol. 886. Elsevier, pp. 27–48, 2021.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2019 | Journal Article | IST-REx-ID: 11898 | OA
S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 11901 | OA
M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.
View | DOI | Download None (ext.)
 

2015 | Journal Article | IST-REx-ID: 5804
R. Biswas and P. Bhowmick, “From prima quadraginta octant to lattice sphere through primitive integer operations,” Theoretical Computer Science, vol. 624, no. 4. Elsevier, pp. 56–72, 2015.
View | DOI
 

2015 | Journal Article | IST-REx-ID: 5807
R. Biswas and P. Bhowmick, “On different topological classes of spherical geodesic paths and circles inZ3,” Theoretical Computer Science, vol. 605, no. 11. Elsevier, pp. 146–163, 2015.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 11902
P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” Theoretical Computer Science, vol. 478, no. 3. Elsevier, pp. 22–32, 2013.
View | Files available | DOI
 

2002 | Journal Article | IST-REx-ID: 4407
J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,” Theoretical Computer Science, vol. 274, no. 1–2. Elsevier, pp. 151–182, 2002.
View | DOI
 

1999 | Journal Article | IST-REx-ID: 4442
T. A. Henzinger and P. Kopke, “Discrete-time control for rectangular hybrid automata,” Theoretical Computer Science, vol. 221, no. 1–2. Elsevier, pp. 369–392, 1999.
View | DOI
 

1995 | Journal Article | IST-REx-ID: 4613
R. Alur et al., “The algorithmic analysis of hybrid systems,” Theoretical Computer Science, vol. 138, no. 1. Elsevier, pp. 3–34, 1995.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 4047 | OA
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” Theoretical Computer Science, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Journal Article | IST-REx-ID: 4052 | OA
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” Theoretical Computer Science, vol. 84, no. 1. Elsevier, pp. 77–105, 1991.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4084 | OA
H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” Theoretical Computer Science, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

1985 | Journal Article | IST-REx-ID: 4116 | OA
H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” Theoretical Computer Science, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.
[Published Version] View | DOI | Download Published Version (ext.)
 

1981 | Journal Article | IST-REx-ID: 4133 | OA
H. Edelsbrunner and H. Maurer, “A space-optimal solution of general region location,” Theoretical Computer Science, vol. 16, no. 3. Elsevier, pp. 329–336, 1981.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

issn=0304-3975

Search

Filter Publications