Goranci, Gramoz, Monika H Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.”https://doi.org/10.4230/LIPIcs.ITCS.2024.55__In 15th Innovations in Theoretical Computer Science Conference, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.ITCS.2024.55 .

Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.”https://doi.org/10.4230/LIPIcs.OPODIS.2023.12__In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.OPODIS.2023.12 .

Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.”https://doi.org/10.4230/LIPIcs.STACS.2023.36__In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.STACS.2023.36 .

Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.”https://doi.org/10.4230/LIPIcs.ICALP.2023.69__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.69 .

Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.”https://doi.org/10.4230/LIPIcs.ICALP.2023.72__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.72 .

Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.”https://doi.org/10.4230/LIPIcs.ICALP.2023.99__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.99 .

Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.”https://doi.org/10.4230/LIPIcs.DISC.2023.35__In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.DISC.2023.35 .

Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.”https://doi.org/10.4230/LIPIcs.AFT.2023.7__In 5th Conference on Advances in Financial Technologies, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.AFT.2023.7 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.14__In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.OPODIS.2021.14 .

Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.15__In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.OPODIS.2021.15 .

Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “A Cautionary Tale: Burning the Medial Axis Is Unstable.”https://doi.org/10.4230/LIPIcs.SoCG.2022.66__In 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, 224:66:1-66:9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SoCG.2022.66 .

Hanauer, Kathrin, Monika H Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.”https://doi.org/10.4230/LIPIcs.SAND.2022.18__In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SAND.2022.18 .

Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 .

Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.14__In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.14 .

Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2022.3__In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 .

Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.11__In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 .

Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2021.18__In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 .

Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”https://doi.org/10.4230/LIPIcs.ICALP.2021.124__In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 .

Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31__In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31 .