Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.”https://doi.org/10.4230/LIPIcs.OPODIS.2019.15__In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 .

Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.”https://doi.org/10.4230/LIPIcs.SoCG.2020.12__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.12 .

Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.”https://doi.org/10.4230/LIPIcs.SoCG.2020.61__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.61 .

Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.”https://doi.org/10.4230/LIPIcs.SoCG.2020.62__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.62 .

Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.”https://doi.org/10.4230/LIPIcs.SoCG.2020.9__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.9 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”https://doi.org/10.4230/LIPIcs.CONCUR.2020.23__In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 .

Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.”https://doi.org/10.4230/LIPIcs.CONCUR.2020.2__In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.”https://doi.org/10.4230/LIPIcs.MFCS.2020.22__In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 .

Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”https://doi.org/10.4230/LIPIcs.MFCS.2020.51__In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.MFCS.2020.51 .

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).”https://doi.org/10.4230/LIPIcs.SoCG.2020.67__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.67 .

Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.”https://doi.org/10.4230/LIPIcs.ESA.2020.75__In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.ESA.2020.75 .

Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds,”https://doi.org/10.4230/LIPIcs.SoCG.2018.46__Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.SoCG.2018.46 .

Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,”https://doi.org/10.4230/LIPIcs.CONCUR.2018.21__Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.CONCUR.2018.21 .

Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.”https://doi.org/10.4230/LIPIcs.ITCS.2017.38__edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 .

Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,”https://doi.org/10.4230/LIPIcs.SoCG.2017.39__77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 .

Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against Pseudoentropy,”https://doi.org/10.4230/LIPIcs.ICALP.2017.39__Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.ICALP.2017.39 .

Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,”https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20__Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.5__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 .

Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,”https://doi.org/10.4230/LIPIcs.MFCS.2017.37__Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.37 .

Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,”https://doi.org/10.4230/LIPIcs.STACS.2017.57__Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.STACS.2017.57 .