De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve Arrangements.”https://doi.org/10.1007/978-3-031-49275-4_2__In 31st International Symposium on Graph Drawing and Network Visualization, 14466:18–33. Springer Nature, 2024.https://doi.org/10.1007/978-3-031-49275-4_2 .

Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).”https://doi.org/10.1007/978-3-031-57256-2_20__In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 14572:353–358. Springer Nature, 2024.https://doi.org/10.1007/978-3-031-57256-2_20 .

Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.”https://doi.org/10.1007/978-3-031-30820-8_32__In Tools and Algorithms for the Construction and Analysis of Systems, 13994:535–40. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30820-8_32 .

Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”https://doi.org/10.1007/978-3-031-30826-0_15__In Fundamental Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30826-0_15 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.”https://doi.org/10.1007/978-3-031-31368-4_19__In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-31368-4_19 .

Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”https://doi.org/10.1007/978-3-031-30823-9_1__In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30823-9_1 .

Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.”https://doi.org/10.1007/978-3-031-30820-8_15__In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30820-8_15 .

Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.”https://doi.org/10.1007/978-3-031-30829-1_17__In 26th International Conference Foundations of Software Science and Computation Structures, 13992:349–70. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30829-1_17 .

Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.”https://doi.org/10.1007/978-3-031-37703-7_17__In Computer Aided Verification, 13965:358–382. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37703-7_17 .

Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.”https://doi.org/10.1007/978-3-031-37706-8_20__In 35th International Conference on Computer Aided Verification , 13964:390–414. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37706-8_20 .

Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.”https://doi.org/10.1007/978-3-031-37709-9_2__In Computer Aided Verification, 13966:16–39. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_2 .

Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.”https://doi.org/10.1007/978-3-031-37709-9_5__In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_5 .

Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.”https://doi.org/10.1007/978-3-031-40773-4_6__In International Workshop on Reproducible Research in Pattern Recognition, 14068:67–73. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-40773-4_6 .

Dodis, Yevgeniy, Niels Ferguson, Eli Goldin, Peter Hall, and Krzysztof Z Pietrzak. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.”https://doi.org/10.1007/978-3-031-38545-2_17__In 43rd Annual International Cryptology Conference, 14082:514–46. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-38545-2_17 .

Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.”https://doi.org/10.1007/978-3-031-44469-2_11__In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-44469-2_11 .

Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.”https://doi.org/10.1007/978-3-031-44267-4_15__In 23rd International Conference on Runtime Verification, 14245:291–311. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-44267-4_15 .

Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”https://doi.org/10.1007/978-3-031-45329-8_17__In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-45329-8_17 .

Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”https://doi.org/10.1007/978-3-031-32733-9_26__In SIROCCO 2023: Structural Information and Communication Complexity , 13892:576–94. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-32733-9_26 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, and Tomás Krák. “(Verifiable) Delay Functions from Lucas Sequences.”https://doi.org/10.1007/978-3-031-48624-1_13__In 21st International Conference on Theory of Cryptography, 14372:336–62. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48624-1_13 .

Auerbach, Benedikt, Miguel Cueto Noval, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement.”https://doi.org/10.1007/978-3-031-48621-0_10__In 21st International Conference on Theory of Cryptography, 14371:271–300. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48621-0_10 .

Auerbach, Benedikt, Charlotte Hoffmann, and Guillermo Pascual Perez. “Generic-Group Lower Bounds via Reductions between Geometric-Search Problems: With and without Preprocessing.”https://doi.org/10.1007/978-3-031-48621-0_11__In 21st International Conference on Theory of Cryptography, 14371:301–30. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48621-0_11 .

Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”https://doi.org/10.1007/978-3-031-47754-6_18__In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-47754-6_18 .

Avarikioti, Zeta, Antoine Desjardins, Eleftherios Kokoris Kogias, and Roger Wattenhofer. “Divide &; Scale: Formalization and Roadmap to Robust Sharding.”https://doi.org/10.1007/978-3-031-32733-9_10__In 30th International Colloquium on Structural Information and Communication Complexity, 13892:199–245. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-32733-9_10 .

Kisan, Jan Matyás, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.”https://doi.org/10.1007/978-3-031-43587-4_24__In 24th International Symposium on Fundamentals of Computation Theory, 14292:333–47. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-43587-4_24 .

Cohen, Shir, Guy Goren, Eleftherios Kokoris Kogias, Alberto Sonnino, and Alexander Spiegelman. “Proof of Availability and Retrieval in a Modular Blockchain Architecture.”https://doi.org/10.1007/978-3-031-47751-5_3__In 27th International Conference on Financial Cryptography and Data Security, 13951:36–53. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-47751-5_3 .

Benes, Nikola, Lubos Brim, Samuel Pastva, David Safránek, and Eva Smijáková. “Phenotype Control of Partially Specified Boolean Networks.”https://doi.org/10.1007/978-3-031-42697-1_2__In 21st International Conference on Computational Methods in Systems Biology, 14137:18–35. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-42697-1_2 .

Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.”https://doi.org/10.1007/978-3-031-37709-9_1__In 35th International Conference on Computer Aided Verification, 13966:3–15. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_1 .

Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.”https://doi.org/10.1007/978-3-031-30823-9_25__In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13993:489–507. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30823-9_25 .

Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.”https://doi.org/10.1007/978-3-031-37706-8_8__In 35th International Conference on Computer Aided Verification , 13964:156–69. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37706-8_8 .

Zheng, Da Wei, and Monika H Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.”https://doi.org/10.1007/978-3-031-32726-1_32__In International Conference on Integer Programming and Combinatorial Optimization, 13904:453–65. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-32726-1_32 .

Karimipour, Farid, and Sabine Storandt, eds. Web and Wireless Geographical Information Systems. 1st ed. Vol. 13238. Cham: Springer Nature, 2022.https://doi.org/10.1007/978-3-031-06245-2 .

Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Parametric Hybrid Automata from Time Series.”https://doi.org/10.1007/978-3-031-19992-9_22__In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:337–53. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19992-9_22 .

Henzinger, Thomas A. “Quantitative Monitoring of Software.”https://doi.org/10.1007/978-3-030-95561-8_1__In Software Verification, 13124:3–6. LNCS. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-95561-8_1 .

Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Information-Flow Interfaces.”https://doi.org/10.1007/978-3-030-99429-7_1__In Fundamental Approaches to Software Engineering, 13241:3–22. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-99429-7_1 .

Alwen, Joël, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “CoCoA: Concurrent Continuous Group Key Agreement.”https://doi.org/10.1007/978-3-031-07085-3_28__In Advances in Cryptology – EUROCRYPT 2022, 13276:815–844. Cham: Springer Nature, 2022.https://doi.org/10.1007/978-3-031-07085-3_28 .

Balliu, Alkida, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, and Jukka Suomela. “Local Mending.”https://doi.org/10.1007/978-3-031-09993-9_1__In International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, 13298:1–20. LNCS. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-09993-9_1 .

Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.”https://doi.org/10.1007/978-3-031-22365-5_20__In Theory of Cryptography, 13748:565–92. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-22365-5_20 .

Avarikioti, Georgia, Krzysztof Z Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, and Michelle X Yeo. “Hide &; Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.”https://doi.org/10.1007/978-3-031-18283-9_17__In Financial Cryptography and Data Security, 13411:358–73. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-18283-9_17 .

Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.”https://doi.org/10.1007/978-3-031-13188-2_6__In Computer Aided Verification, 13372:109–29. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-13188-2_6 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, Karen Klein, and Krzysztof Z Pietrzak. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.”https://doi.org/10.1007/978-3-031-15979-4_13__In Advances in Cryptology – CRYPTO 2022, 13508:370–99. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-15979-4_13 .

Gelashvili, Rati, Eleftherios Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.”https://doi.org/10.1007/978-3-031-18283-9_14__In Financial Cryptography and Data Security, 13411:296–315. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-18283-9_14 .

Cohen, Shir, Rati Gelashvili, Eleftherios Kokoris Kogias, Zekun Li, Dahlia Malkhi, Alberto Sonnino, and Alexander Spiegelman. “Be Aware of Your Leaders.”https://doi.org/10.1007/978-3-031-18283-9_13__In International Conference on Financial Cryptography and Data Security, 13411:279–95. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-18283-9_13 .

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”https://doi.org/10.1007/978-3-031-19992-9_20__In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:320–26. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19992-9_20 .

Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.”https://doi.org/10.1007/978-3-031-19135-0_5__In 16th International Conference on Reachability Problems, 13608:67–76. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19135-0_5 .

Arroyo Guevara, Alan M, and Stefan Felsner. “Approximating the Bundled Crossing Number.”https://doi.org/10.1007/978-3-030-96731-4_31__In WALCOM 2022: Algorithms and Computation, 13174:383–95. LNCS. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-96731-4_31 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”https://doi.org/10.1007/978-3-031-13185-1_4__In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022.https://doi.org/10.1007/978-3-031-13185-1_4 .

Henzinger, Monika H, and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive Graph Problems.”https://doi.org/10.1007/978-3-030-83508-8_34__In 17th International Symposium on Algorithms and Data Structures, 12808:471–484. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-83508-8_34 .

Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?”https://doi.org/10.1007/978-3-030-71278-5_18__In 42nd German Conference on Pattern Recognition, 12544:246–59. LNCS. Springer, 2021.https://doi.org/10.1007/978-3-030-71278-5_18 .

Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.”https://doi.org/10.1007/978-3-030-79527-6_1__In Structural Information and Communication Complexity, 12810:3–12. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-79527-6_1 .

Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.”https://doi.org/10.1007/978-3-030-72016-2__In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-72016-2 .

Blackshear, Sam, Konstantinos Chalkias, Panagiotis Chatzigiannis, Riyaz Faizullabhoy, Irakliy Khaburzaniya, Eleftherios Kokoris Kogias, Joshua Lind, David Wong, and Tim Zakian. “Reactive Key-Loss Protection in Blockchains.”https://doi.org/10.1007/978-3-662-63958-0_34__In FC 2021 Workshops, 12676:431–50. Springer Nature, 2021.https://doi.org/10.1007/978-3-662-63958-0_34 .

Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.”https://doi.org/10.1007/978-3-030-88494-9_12__In International Conference on Runtime Verification, 12974:231–43. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-88494-9_12 .

Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK: Communication across Distributed Ledgers.”https://doi.org/10.1007/978-3-662-64331-0_1__In 25th International Conference on Financial Cryptography and Data Security, 12675:3–36. Springer Nature, 2021.https://doi.org/10.1007/978-3-662-64331-0_1 .

Avarikioti, Zeta, Eleftherios Kokoris Kogias, Roger Wattenhofer, and Dionysis Zindros. “Brick: Asynchronous Incentive-Compatible Payment Channels.”https://doi.org/10.1007/978-3-662-64331-0_11__In 25th International Conference on Financial Cryptography and Data Security, 12675:209–30. Springer Nature, 2021.https://doi.org/10.1007/978-3-662-64331-0_11 .

Chakraborty, Suvradip, Stefan Dziembowski, Magorzata Gazka, Tomasz Lizurej, Krzysztof Z Pietrzak, and Michelle X Yeo. “Trojan-Resilience without Cryptography,”https://doi.org/10.1007/978-3-030-90453-1_14__13043:397–428. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_14 .

Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.”https://doi.org/10.1007/978-3-030-90456-2_8__In 19th International Conference, 13044:222–53. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90456-2_8 .

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 .

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 .

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 .

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 .

Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.”https://doi.org/10.1007/978-3-030-31304-3_9__In 17th International Conference on Computational Methods in Systems Biology, 11773:155–87. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-31304-3_9 .

Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.”https://doi.org/10.1007/978-3-030-29400-7_23__In 25th Anniversary of Euro-Par, 11725:317–33. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-29400-7_23 .

Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”https://doi.org/10.1007/978-3-030-29662-9_8__In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:123–41. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-29662-9_8 .

Arroyo Guevara, Alan M, Martin Derka, and Irene Parada. “Extending Simple Drawings.”https://doi.org/10.1007/978-3-030-35802-0_18__In 27th International Symposium on Graph Drawing and Network Visualization, 11904:230–43. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-35802-0_18 .

Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal Logic.”https://doi.org/10.1007/978-3-030-29662-9_4__In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:59–75. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-29662-9_4 .

Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.”https://doi.org/10.1007/978-3-030-17656-3_10__In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019.https://doi.org/10.1007/978-3-030-17656-3_10 .

Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a ConvNet Operates Outside of Its Specifications,”https://doi.org/10.1007/978-3-030-12939-2_18__11269:244–59. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-12939-2_18 .

Koshti, Girish, Ranita Biswas, Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres, and Partha Bhowmick. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.”https://doi.org/10.1007/978-3-030-05288-1_7__In 19th International Workshop, 11255:82–96. Cham: Springer, 2018.https://doi.org/10.1007/978-3-030-05288-1_7 .

Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”https://doi.org/10.1007/978-3-662-58387-6_26__In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018.https://doi.org/10.1007/978-3-662-58387-6_26 .

Dwivedi, Shivam, Aniket Gupta, Siddhant Roy, Ranita Biswas, and Partha Bhowmick. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.”https://doi.org/10.1007/978-3-319-66272-5_28__In 20th IAPR International Conference, 10502:347–59. Cham: Springer Nature, 2017.https://doi.org/10.1007/978-3-319-66272-5_28 .

Andres, Eric, Ranita Biswas, and Partha Bhowmick. “Digital Primitives Defined by Weighted Focal Set.”https://doi.org/10.1007/978-3-319-66272-5_31__In 20th IAPR International Conference, 10502:388–98. Cham: Springer Nature, 2017.https://doi.org/10.1007/978-3-319-66272-5_31 .

Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”https://doi.org/10.1007/978-3-662-54577-5_26__In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017.https://doi.org/10.1007/978-3-662-54577-5_26 .

Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological Properties of Naive Discrete Sphere.”https://doi.org/10.1007/978-3-319-39441-1_23__In Computational Topology in Image Context, 9667:253–64. Cham: Springer Nature, 2016.https://doi.org/10.1007/978-3-319-39441-1_23 .

Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity and Smoothness of Discrete Spherical Circles.”https://doi.org/10.1007/978-3-319-26145-4_7__In Combinatorial Image Analysis, 9448:86–100. Cham: Springer Nature, 2016.https://doi.org/10.1007/978-3-319-26145-4_7 .

Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.”https://doi.org/10.1007/978-1-4939-6352-2_12__In High-Resolution Imaging of Cellular Proteins, 1474:203–16. Springer, 2016.https://doi.org/10.1007/978-1-4939-6352-2_12 .

Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.”https://doi.org/10.1007/978-3-642-54013-4_15__In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_15 .

Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.”https://doi.org/10.1007/978-3-319-13075-0_10__In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014.https://doi.org/10.1007/978-3-319-13075-0_10 .

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1007/978-3-642-54013-4_5__In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_5 .

Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.”https://doi.org/10.1007/978-3-662-44199-2_24__In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.https://doi.org/10.1007/978-3-662-44199-2_24 .

Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”https://doi.org/10.1007/978-3-642-39799-8_11__In Computer Aided Verification, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.https://doi.org/10.1007/978-3-642-39799-8_11 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.”https://doi.org/10.1007/978-3-642-37064-9_20__In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/10.1007/978-3-642-37064-9_20 .

Edelsbrunner, Herbert. “Persistent Homology in Image Processing.”https://doi.org/10.1007/978-3-642-38221-5_19__In Graph-Based Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/10.1007/978-3-642-38221-5_19 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”https://doi.org/10.1007/978-3-642-33386-6_14__In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_14 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/978-3-642-33090-2_27__In Algorithms – ESA 2012, 7501:301–12. Springer, 2012.https://doi.org/10.1007/978-3-642-33090-2_27 .

Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.”https://doi.org/10.1007/978-3-642-28756-5_46__In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-28756-5_46 .

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”https://doi.org/10.1007/978-3-642-33386-6_10__In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.https://doi.org/10.1007/978-3-642-33386-6_10 .

Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.”https://doi.org/10.1007/978-3-642-20844-7_22__In Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011.https://doi.org/10.1007/978-3-642-20844-7_22 .

Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.”https://doi.org/10.1007/978-3-642-17511-4_7__In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010.https://doi.org/10.1007/978-3-642-17511-4_7 .

Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.”https://doi.org/10.1007/978-3-540-30140-0_2__In 2th Annual European Symposium on Algorithms, 3221:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-30140-0_2 .

Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.”https://doi.org/10.1007/978-3-540-27836-8_2__In 31st International Colloquium on Automata, Languages and Programming, 3142:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-27836-8_2 .

Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”https://doi.org/10.1007/3-540-45253-2_1__In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature, 2000.https://doi.org/10.1007/3-540-45253-2_1 .

Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”https://doi.org/10.1007/3-540-63165-8_214__In 24th International Colloquium on Automata, Languages and Programming, 1256:594–604. Springer Nature, 1997.https://doi.org/10.1007/3-540-63165-8_214 .

Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.”https://doi.org/10.1007/3-540-61422-2_117__In 5th Scandinavian Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996.https://doi.org/10.1007/3-540-61422-2_117 .

Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.”https://doi.org/10.1007/3-540-61440-0_136__In 23rd International Colloquium on Automata, Languages, and Programming, 1099:290–99. Springer Nature, 1996.https://doi.org/10.1007/3-540-61440-0_136 .

Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.”https://doi.org/10.1007/3-540-60084-1_81__In 22nd International Colloquium on Automata, Languages and Programming, 944:280–291. Springer Nature, 1995.https://doi.org/10.1007/3-540-60084-1_81 .

Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”https://doi.org/10.1007/3-540-60313-1_142__In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995.https://doi.org/10.1007/3-540-60313-1_142 .