Goranci G, Henzinger MH, Räcke H, Sachdeva S, Sricharan AR. 2024. Electrical flows for polylogarithmic competitive oblivious routing. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 287, 55.
LibreCat: https://research-explorer.ista.ac.at/record/15008
DOI: 10.4230/LIPIcs.ITCS.2024.55
arXiv: 2303.02491

Alpos O, Amores-Sesar I, Cachin C, Yeo MX. 2024. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 12.
LibreCat: https://research-explorer.ista.ac.at/record/15007
DOI: 10.4230/LIPIcs.OPODIS.2023.12
arXiv: 2307.02954

Henzinger MH, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of monotone dynamic programs and applications. 40th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 254, 36.
LibreCat: https://research-explorer.ista.ac.at/record/12760
DOI: 10.4230/LIPIcs.STACS.2023.36
arXiv: 2301.01744

Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69.
LibreCat: https://research-explorer.ista.ac.at/record/14085
DOI: 10.4230/LIPIcs.ICALP.2023.69

Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72.
LibreCat: https://research-explorer.ista.ac.at/record/14084
DOI: 10.4230/LIPIcs.ICALP.2023.72
arXiv: 2007.10824

Resch N, Yuan C, Zhang Y. 2023. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 99.
LibreCat: https://research-explorer.ista.ac.at/record/14083
DOI: 10.4230/LIPIcs.ICALP.2023.99
arXiv: 2210.07754

Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost: Universal batching for concurrent data structures. 37th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 281, 35.
LibreCat: https://research-explorer.ista.ac.at/record/14485
DOI: 10.4230/LIPIcs.DISC.2023.35

Beaver D, Kelkar M, Lewi K, Nikolaenko V, Sonnino A, Chalkias K, Kokoris Kogias E, Naurois LD, Roy A. 2023. STROBE: Streaming Threshold Random Beacons. 5th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 282, 7.
LibreCat: https://research-explorer.ista.ac.at/record/14516
DOI: 10.4230/LIPIcs.AFT.2023.7

Alistarh D-A, Gelashvili R, Rybicki J. 2022. Fast graphical population protocols. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 14.
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808

Nikabadi A, Korhonen J. 2022. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 15.
LibreCat: https://research-explorer.ista.ac.at/record/11183
DOI: 10.4230/LIPIcs.OPODIS.2021.15

Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. 2022. A cautionary tale: Burning the medial axis is unstable. 38th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLIPIcs vol. 224, 66:1-66:9.
LibreCat: https://research-explorer.ista.ac.at/record/11428
DOI: 10.4230/LIPIcs.SoCG.2022.66

Hanauer K, Henzinger MH, Hua QC. 2022. Fully dynamic four-vertex subgraph counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.
LibreCat: https://research-explorer.ista.ac.at/record/11812
DOI: 10.4230/LIPIcs.SAND.2022.18
arXiv: 2106.15524

Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.
LibreCat: https://research-explorer.ista.ac.at/record/12102
DOI: 10.4230/LIPIcs.FSTTCS.2022.29

Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.2022.11

Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21.
LibreCat: https://research-explorer.ista.ac.at/record/12508
DOI: 10.4230/LIPIcs.CONCUR.2022.14

Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.
LibreCat: https://research-explorer.ista.ac.at/record/12509
DOI: 10.4230/LIPIcs.MFCS.2022.3

Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.
LibreCat: https://research-explorer.ista.ac.at/record/10072
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
arXiv: 2008.05569