Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.”https://doi.org/10.1007/978-3-030-90453-1_17__In 19th International Conference, 13043:486–517. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_17 .

Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar. “Reverse Firewalls for Adaptively Secure MPC without Setup.”https://doi.org/10.1007/978-3-030-92075-3_12__In 27th International Conference on the Theory and Application of Cryptology and Information Security, 13091:335–64. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-92075-3_12 .

Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.”https://doi.org/10.1007/978-3-030-81685-8_16__In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-81685-8_16 .

Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.”https://doi.org/10.1007/978-3-030-84245-1_17__In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-84245-1_17 .

Bloch-Hansen, Andrew, Nasim Samei, and Roberto Solis-Oba. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”https://doi.org/10.1007/978-3-030-67899-9_28__In Conference on Algorithms and Discrete Applied Mathematics, 12601:346–58. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-67899-9_28 .

Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.”https://doi.org/10.1007/978-3-030-90453-1_19__In 19th International Conference, 13043:550–81. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_19 .

Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.”https://doi.org/10.1007/978-3-030-88494-9_3__In 21st International Conference on Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-88494-9_3 .

Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jií Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”https://doi.org/10.1007/978-3-030-90870-6_33__In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90870-6_33 .

Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.”https://doi.org/10.1007/978-3-030-68766-3_28__In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-68766-3_28 .

Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target: Scalability in Public-Key Encryption.”https://doi.org/10.1007/978-3-030-45727-3_16__In Advances in Cryptology – EUROCRYPT 2020, 12107:475–506. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45727-3_16 .

Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.”https://doi.org/10.1007/978-3-030-60508-7_1__In Runtime Verification, 12399:3–18. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-60508-7_1 .

Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.”https://doi.org/10.1007/978-3-030-60440-0_26__In Graph-Theoretic Concepts in Computer Science, 12301:325–38. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-60440-0_26 .

Chakraborty, Suvradip, Manoj Prabhakaran, and Daniel Wichs. “Witness Maps and Applications.”https://doi.org/10.1007/978-3-030-45374-9_8__In Public-Key Cryptography, edited by A Kiayias, 12110:220–46. LNCS. Cham: Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45374-9_8 .

Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.”https://doi.org/10.1007/978-3-030-53288-8_14__In Computer Aided Verification, 12224:275–98. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-53288-8_14 .

Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”https://doi.org/10.1007/978-3-030-59152-6_14__In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-59152-6_14 .

Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.”https://doi.org/10.1007/978-3-030-14085-4_3__In 21st IAPR International Conference on Discrete Geometry for Computer Imagery, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019.https://doi.org/10.1007/978-3-030-14085-4_3 .

Walter, Michael. “Sampling the Integers with Low Relative Error.”https://doi.org/10.1007/978-3-030-23696-0_9__In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019.https://doi.org/10.1007/978-3-030-23696-0_9 .

Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.”https://doi.org/10.1007/978-3-030-30806-3_1__In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019.https://doi.org/10.1007/978-3-030-30806-3_1 .

Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.”https://doi.org/10.1007/978-3-030-25540-4_36__In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_36 .

Garcia Soto, Miriam, Thomas A Henzinger, Christian Schilling, and Luka Zeleznik. “Membership-Based Synthesis of Linear Hybrid Automata.”https://doi.org/10.1007/978-3-030-25540-4_16__In 31st International Conference on Computer-Aided Verification, 11561:297–314. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_16 .