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.

115 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22617 | OA
L. J. Brice, T. A. Henzinger, and K. S. Thejaswini, “Dicey games: Shared sources of randomness in distributed systems,” in 41st Annual Symposium on Logic in Computer Science, Lisbon, Portugal, 2026, vol. 380.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 21412 | OA
K. Chatterjee, J. M. Křišťan, S. Schmid, J. Svoboda, and M. X. Yeo, “Boosting payment channel network liquidity with topology optimization and transaction selection,” in 39th International Symposium on Distributed Computing, Berlin, Germany, 2025, vol. 356.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 19281 | OA
N. Resch, C. Yuan, and Y. Zhang, “Tight bounds on list-decodable and list-recoverable zero-rate codes,” in 16th Innovations in Theoretical Computer Science Conference, New York, NY, United States, 2025, vol. 325.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
A. El-Hayek, K. Hanauer, and M. Henzinger, “On b-matching and fully-dynamic maximum k-edge coloring,” in 4th Symposium on Algorithmic Foundations of Dynamic Networks, Liverpool, United Kingdom, 2025, vol. 330.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20253 | OA
T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in 36th International Conference on Concurrency Theory, Aarhus, Denmark, 2025, vol. 348.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
M. Henzinger and R. Safavi Hemami, “Securing dynamic data: A primer on differentially private data structures,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version] View | Files available | DOI
 

2025 | Published | Conference Paper | IST-REx-ID: 20534 | OA
M. Henzinger, E. Kosinas, R. Münk, and H. Räcke, “Efficient contractions of dynamic graphs - with applications,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20535 | OA
L. Dhulipala, M. Henzinger, G. Z. Li, Q. C. Liu, A. R. Sricharan, and L. Zhu, “Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20536 | OA
R. Safavi Hemami and M. P. Seybold, “B-Treaps revised: Write efficient randomized block search trees with high load,” in 19th International Symposium on Algorithms and Data Structures, Toronto, Canada, 2025, vol. 349.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20587 | OA
M. A. Baig, C. U. Günther, and K. Z. Pietrzak, “Nakamoto consensus from multiple resources,” in 7th Conference on Advances in Financial Technologies, Pittsburgh, PA, United States, 2025, vol. 354.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15006 | OA
J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15007 | OA
O. Alpos, I. Amores-Sesar, C. Cachin, and M. X. Yeo, “Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15008 | OA
G. Goranci, M. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17099 | OA
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and J. Svoboda, “Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms,” in 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Gujarat, India, 2024, vol. 323.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17144 | OA
H. Kourimska, A. Lieutier, and M. Wintraecken, “The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17145 | OA
G. Rote, M. Rüber, and M. Saghafian, “Grid peeling of parabolas,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18556 | OA
S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “The Euclidean MST-ratio for bi-colored lattices,” in 32nd International Symposium on Graph Drawing and Network Visualization, Vienna, Austria, 2024, vol. 320.
[Published Version] View | Files available | DOI | WoS | arXiv
 

earlier version | 2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” in 19th International Symposium on Parameterized and Exact Computation, Egham, United Kingdom, 2024, vol. 321.
[Published Version] View | Files available | DOI | WoS | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed