G. Goranci, M. H. 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.

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.

M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.

G. Goranci and M. H. 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.

D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.

N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.

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.

D. Beaver et al., “STROBE: Streaming Threshold Random Beacons,” in 5th Conference on Advances in Financial Technologies, Princeton, NJ, United States, 2023, vol. 282.

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.

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.

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.

K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.

A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.

K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.

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.

G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.

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.

I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.

K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.

D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol. 207.