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

Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.”10.1007/978-3-031-37706-8_8__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 156–69, doi:10.1007/978-3-031-37706-8_8.

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

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

Garcia Soto, Miriam, et al. “Synthesis of Parametric Hybrid Automata from Time Series.”10.1007/978-3-031-19992-9_22__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 337–53, doi:10.1007/978-3-031-19992-9_22.

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

Bartocci, Ezio, et al. “Information-Flow Interfaces.”10.1007/978-3-030-99429-7_1__Fundamental Approaches to Software Engineering, vol. 13241, Springer Nature, 2022, pp. 3–22, doi:10.1007/978-3-030-99429-7_1.

Alwen, Joël, et al. “CoCoA: Concurrent Continuous Group Key Agreement.”10.1007/978-3-031-07085-3_28__Advances in Cryptology – EUROCRYPT 2022, vol. 13276, Springer Nature, 2022, pp. 815–844, doi:10.1007/978-3-031-07085-3_28.

Balliu, Alkida, et al. “Local Mending.”10.1007/978-3-031-09993-9_1__International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, vol. 13298, Springer Nature, 2022, pp. 1–20, doi:10.1007/978-3-031-09993-9_1.

Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.”10.1007/978-3-031-22365-5_20__Theory of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.

Avarikioti, Georgia, et al. “Hide &; Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.”10.1007/978-3-031-18283-9_17__Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 358–73, doi:10.1007/978-3-031-18283-9_17.

Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.”10.1007/978-3-031-13188-2_6__Computer Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6.

Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.”10.1007/978-3-031-15979-4_13__Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.

Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.”10.1007/978-3-031-18283-9_14__Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 296–315, doi:10.1007/978-3-031-18283-9_14.

Cohen, Shir, et al. “Be Aware of Your Leaders.”10.1007/978-3-031-18283-9_13__International Conference on Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 279–95, doi:10.1007/978-3-031-18283-9_13.

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

Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.”10.1007/978-3-031-19135-0_5__16th International Conference on Reachability Problems, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:10.1007/978-3-031-19135-0_5.

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

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.

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

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

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

Bansal, Suguman, et al. “On Satisficing in Quantitative Games.”10.1007/978-3-030-72016-2__27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.

Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.”10.1007/978-3-662-63958-0_34__FC 2021 Workshops, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:10.1007/978-3-662-63958-0_34.

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

Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”10.1007/978-3-662-64331-0_1__25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 3–36, doi:10.1007/978-3-662-64331-0_1.

Avarikioti, Zeta, et al. “Brick: Asynchronous Incentive-Compatible Payment Channels.”10.1007/978-3-662-64331-0_11__25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 209–30, doi:10.1007/978-3-662-64331-0_11.

Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.

Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.”10.1007/978-3-030-90456-2_8__19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.

Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”10.1007/978-3-030-90453-1_17__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.

Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.”10.1007/978-3-030-92075-3_12__27th International Conference on the Theory and Application of Cryptology and Information Security, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:10.1007/978-3-030-92075-3_12.

Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.”10.1007/978-3-030-81685-8_16__33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.

Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”10.1007/978-3-030-84245-1_17__41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.

Bloch-Hansen, Andrew, et al. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”10.1007/978-3-030-67899-9_28__Conference on Algorithms and Discrete Applied Mathematics, vol. 12601, Springer Nature, 2021, pp. 346–58, doi:10.1007/978-3-030-67899-9_28.

Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.”10.1007/978-3-030-90453-1_19__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.

Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”10.1007/978-3-030-88494-9_3__21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1007/978-3-030-90870-6_33__24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.

Pach, János, et al. “Crossings between Non-Homotopic Edges.”10.1007/978-3-030-68766-3_28__28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.

Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key Encryption.”10.1007/978-3-030-45727-3_16__Advances in Cryptology – EUROCRYPT 2020, vol. 12107, Springer Nature, 2020, pp. 475–506, doi:10.1007/978-3-030-45727-3_16.

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

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/978-3-030-60440-0_26__Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.

Chakraborty, Suvradip, et al. “Witness Maps and Applications.”10.1007/978-3-030-45374-9_8__Public-Key Cryptography, edited by A Kiayias, vol. 12110, Springer Nature, 2020, pp. 220–46, doi:10.1007/978-3-030-45374-9_8.

Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.”10.1007/978-3-030-53288-8_14__Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.

Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”10.1007/978-3-030-59152-6_14__Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.

Guet, Calin C., et al. “Transient Memory in Gene Regulation.”10.1007/978-3-030-31304-3_9__17th International Conference on Computational Methods in Systems Biology, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.

Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.”10.1007/978-3-030-29400-7_23__25th Anniversary of Euro-Par, vol. 11725, Springer Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.

Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”10.1007/978-3-030-29662-9_8__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.

Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.”10.1007/978-3-030-35802-0_18__27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.

Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.”10.1007/978-3-030-29662-9_4__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.

Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.”10.1007/978-3-030-17656-3_10__Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi: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. Vol. 11269, Springer Nature, 2019, pp. 244–59, doi:10.1007/978-3-030-12939-2_18.

Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.”10.1007/978-3-030-05288-1_7__19th International Workshop, vol. 11255, Springer, 2018, pp. 82–96, doi:10.1007/978-3-030-05288-1_7.

Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”10.1007/978-3-662-58387-6_26__22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.

Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.”10.1007/978-3-319-66272-5_28__20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 347–59, doi:10.1007/978-3-319-66272-5_28.

Andres, Eric, et al. “Digital Primitives Defined by Weighted Focal Set.”10.1007/978-3-319-66272-5_31__20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 388–98, doi:10.1007/978-3-319-66272-5_31.

Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”10.1007/978-3-662-54577-5_26__Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.

Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete Sphere.”10.1007/978-3-319-39441-1_23__Computational Topology in Image Context, vol. 9667, Springer Nature, 2016, pp. 253–64, doi:10.1007/978-3-319-39441-1_23.

Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical Circles.”10.1007/978-3-319-26145-4_7__Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016, pp. 86–100, doi:10.1007/978-3-319-26145-4_7.

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

Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”10.1007/978-3-642-54013-4_15__Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.

Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”10.1007/978-3-319-13075-0_10__25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.

Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”10.1007/978-3-642-54013-4_5__VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.

Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.”10.1007/978-3-662-44199-2_24__ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.

Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”10.1007/978-3-642-39799-8_11__Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.

Chatterjee, Krishnendu, et al. “How to Travel between Languages.”10.1007/978-3-642-37064-9_20__7th International Conference on Language and Automata Theory and Applications, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.

Edelsbrunner, Herbert. “Persistent Homology in Image Processing.”10.1007/978-3-642-38221-5_19__Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.

Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”10.1007/978-3-642-33386-6_14__Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.

Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”10.1007/978-3-642-33090-2_27__Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.

Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.”10.1007/978-3-642-28756-5_46__Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46.

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

Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.”10.1007/978-3-642-20844-7_22__Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.

Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.”10.1007/978-3-642-17511-4_7__Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.

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

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

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

Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”10.1007/3-540-63165-8_214__24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi: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.”10.1007/3-540-61422-2_117__5th Scandinavian Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:10.1007/3-540-61422-2_117.

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

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

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