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.
104 Publications
2023 | Published | Conference Paper | IST-REx-ID: 14485 | 
V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement: BatchBoost: Universal batching for concurrent data structures,” in 37th International Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.
[Published Version]
View
| Files available
| DOI
2023 | Published | Conference Paper | IST-REx-ID: 14516 |
D. Beaver et al., “STROBE: Streaming Threshold Random Beacons,” in 5th Conference on Advances in Financial Technologies, Princeton, NJ, United States, 2023, vol. 282.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 | Published | Conference Paper | IST-REx-ID: 14083 |
Resch, Nicolas, Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. 50th International Colloquium on Automata, Languages, and Programming 261. 2023
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14405 |
Bartocci, Ezio, Hypernode automata. 34th International Conference on Concurrency Theory 279. 2023
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14084 |
Harris, David G., Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming 261. 2023
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14086 |
Henzinger, Monika H, Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming 261. 2023
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 12760 |
Henzinger, Monika H, Dynamic maintenance of monotone dynamic programs and applications. 40th International Symposium on Theoretical Aspects of Computer Science 254. 2023
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14085 |
G. Goranci and M. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11812 |
K. Hanauer, M. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12775 |
K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12508 |
T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 12509 |
Avni, Guy, An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science 241. 2022
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 11183 |
A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 11184 |
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12101 |
Chatterjee, Krishnendu, Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 12102 |
Ahmadi, Ali, Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 11428 |
E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “A cautionary tale: Burning the medial axis is unstable,” in 38th International Symposium on Computational Geometry, Berlin, Germany, 2022, vol. 224, p. 66:1-66:9.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 11814 |
H. Fichtenberger, M. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10629 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10218 |
D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast graphical population protocols,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.
[Published Version]
View
| Files available
| DOI
| arXiv