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, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” Theoretical Computer Science, vol. 989, 114353, Elsevier, 2024, doi:10.1016/j.tcs.2023.114353.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2023 | Journal Article | IST-REx-ID: 12566 |
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science, vol. 948, no. 2, 113733, Elsevier, 2023, doi:10.1016/j.tcs.2023.113733.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 14362 |
Castellano, Ilaria, et al. “Weakly Weighted Generalised Quasi-Metric Spaces and Semilattices.” Theoretical Computer Science, vol. 977, 114129, Elsevier, 2023, doi:10.1016/j.tcs.2023.114129.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9647 |
Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 9827 |
Chatterjee, Bapi, et al. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science, vol. 886, Elsevier, 2021, pp. 27–48, doi:10.1016/j.tcs.2021.06.041.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2019 | Journal Article | IST-REx-ID: 11898 |
Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi: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, vol. 573, Elsevier, 2015, pp. 1–15, doi: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, vol. 624, no. 4, Elsevier, 2015, pp. 56–72, doi: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, vol. 605, no. 11, Elsevier, 2015, pp. 146–63, doi:10.1016/j.tcs.2015.09.003.
View
| DOI
2013 | Journal Article | IST-REx-ID: 11902
Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” Theoretical Computer Science, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:10.1016/j.tcs.2013.01.030.
View
| Files available
| DOI
2002 | Journal Article | IST-REx-ID: 4407
Raskin, Jean, et al. “Axioms for Real-Time Logics.” Theoretical Computer Science, vol. 274, no. 1–2, Elsevier, 2002, pp. 151–82, doi: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, vol. 221, no. 1–2, Elsevier, 1999, pp. 369–92, doi:10.1016/S0304-3975(99)00038-9.
View
| DOI
1995 | Journal Article | IST-REx-ID: 4613
Alur, Rajeev, et al. “The Algorithmic Analysis of Hybrid Systems.” Theoretical Computer Science, vol. 138, no. 1, Elsevier, 1995, pp. 3–34, doi:10.1016/0304-3975(94)00202-T.
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4047 |
Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:10.1016/0304-3975(92)90319-B.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4052 |
Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi:10.1016/0304-3975(91)90261-Y.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi: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, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi: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, vol. 16, no. 3, Elsevier, 1981, pp. 329–36, doi:10.1016/0304-3975(81)90103-1.
[Published Version]
View
| DOI
| Download Published Version (ext.)