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