Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.”https://doi.org/10.1007/978-3-031-49272-3_23__In 31st International Symposium on Graph Drawing and Network Visualization, 14465:339–46. Springer Nature, 2024.https://doi.org/10.1007/978-3-031-49272-3_23 .

Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Flavors of Sequential Information Flow.”https://doi.org/10.1007/978-3-030-94583-1_1__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13182:1–19. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-94583-1_1 .

Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.”https://doi.org/10.1007/978-3-030-68211-8_18__In 15th International Conference on Algorithms and Computation, 12635:221–33. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-68211-8_18 .

Walter, Michael. “The Convergence of Slide-Type Reductions.”https://doi.org/10.1007/978-3-030-75245-3_3__In Public-Key Cryptography – PKC 2021, 12710:45–67. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75245-3_3 .

Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.”https://doi.org/10.1007/978-3-030-75539-3_17__In Topics in Cryptology – CT-RSA 2021, 12704:399–421. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75539-3_17 .

Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).”https://doi.org/10.1007/978-3-030-75539-3_20__In Topics in Cryptology – CT-RSA 2021, 12704:478–502. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75539-3_20 .

Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.”https://doi.org/10.1007/978-3-030-79527-6_6__In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-79527-6_6 .

comi, Lidija, Rita Zrour, Gaëlle Largeteau-Skapin, Ranita Biswas, and Eric Andres. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.”https://doi.org/10.1007/978-3-030-76657-3_10__In Discrete Geometry and Mathematical Morphology, 12708:152–63. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-76657-3_10 .

Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.”https://doi.org/10.1007/978-3-030-56880-1_26__In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-56880-1_26 .

Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.”https://doi.org/10.1007/978-3-030-45374-9_21__In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45374-9_21 .

Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?”https://doi.org/10.1007/978-3-030-45237-7_5__In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45237-7_5 .

Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamari. “An SMT Theory of Fixed-Point Arithmetic.”https://doi.org/10.1007/978-3-030-51074-9_2__In Automated Reasoning, 12166:13–31. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-51074-9_2 .

Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.”https://doi.org/10.1007/978-3-030-65277-7_1__In Progress in Cryptology, 12578:3–15. LNCS. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-65277-7_1 .

Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”https://doi.org/10.1007/978-3-030-53291-8_21__In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-53291-8_21 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.”https://doi.org/10.1007/978-3-030-44914-8_5__In European Symposium on Programming, 12075:112–40. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-44914-8_5 .

Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”https://doi.org/10.1007/978-3-030-31784-3_27__In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-31784-3_27 .

Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z Pietrzak. “Adaptively Secure Proxy Re-Encryption,”https://doi.org/10.1007/978-3-030-17259-6_11__11443:317–46. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-17259-6_11 .

Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,”https://doi.org/10.1007/978-3-030-04612-5_2__11316:21–36. Springer, 2018.https://doi.org/10.1007/978-3-030-04612-5_2 .

Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1007/978-3-030-02768-1_11__edited by Sukyoung Ryu, 11275:181–201. Springer, 2018.https://doi.org/10.1007/978-3-030-02768-1_11 .

Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,”https://doi.org/10.1007/978-3-319-96983-1_33__11014:465–79. Springer, 2018.https://doi.org/10.1007/978-3-319-96983-1_33 .