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 .

Androulaki, Elli, Christian Cachin, Angelo De Caro, and Eleftherios Kokoris Kogias. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.”https://doi.org/10.1007/978-3-319-99073-6_6__In Computer Security, 11098:111–31. Springer Nature, 2018.https://doi.org/10.1007/978-3-319-99073-6_6 .

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 .

Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.”https://doi.org/10.1007/978-3-319-73117-9_3__In 44th International Conference on Current Trends in Theory and Practice of Computer Science, 10706:40–44. Springer Nature, 2017.https://doi.org/10.1007/978-3-319-73117-9_3 .

Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.”https://doi.org/10.1007/978-3-319-59250-3_8__In 19th International Conference on Integer Programming and Combinatorial Optimization, 10328:86–98. Springer Nature, 2017.https://doi.org/10.1007/978-3-319-59250-3_8 .

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 .

Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.”https://doi.org/10.1007/978-3-319-59108-7_8__In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017.https://doi.org/10.1007/978-3-319-59108-7_8 .

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 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.”https://doi.org/10.1007/978-3-319-63121-9_18__In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017.https://doi.org/10.1007/978-3-319-63121-9_18 .

Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017.https://doi.org/10.1007/978-3-319-54292-8 .

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 .

Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.”https://doi.org/10.1007/978-3-319-32360-2_20__In Discrete Geometry for Computer Imagery, 9647:256–67. Cham: Springer Nature, 2016.https://doi.org/10.1007/978-3-319-32360-2_20 .

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 .

Cheung, Yun Kuen, Monika H Henzinger, Martin Hoefer, and Martin Starnberger. “Combinatorial Auctions with Conflict-Based Externalities.”https://doi.org/10.1007/978-3-662-48995-6_17__In 11th International Conference on Web and Internet Economics, 9470:230–243. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-48995-6_17 .

Ben-Zwi, Oren, Monika H Henzinger, and Veronika Loitzenbauer. “Ad Exchange: Envy-Free Auctions with Mediators.”https://doi.org/10.1007/978-3-662-48995-6_8__In 11th International Conference on Web and Internet Economics, 9470:104–117. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-48995-6_8 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.”https://doi.org/10.1007/978-3-662-47672-7_59__In 42nd International Colloquium on Automata, Languages and Programming, 9134:725–36. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47672-7_59 .

Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.”https://doi.org/10.1007/978-3-662-47672-7_58__In 2nd International Colloquium on Automata, Languages and Programming, 9134:713–24. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47672-7_58 .

Dvoák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an Ad Exchange.”https://doi.org/10.1007/978-3-319-18263-6_14__In 12th International Workshop of Approximation and Online Algorithms, 8952:156–167. Springer Nature, 2015.https://doi.org/10.1007/978-3-319-18263-6_14 .

Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design of Dynamic Algorithms via Primal-Dual Method.”https://doi.org/10.1007/978-3-662-47672-7_17__In 42nd International Colloquium on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47672-7_17 .

Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.”https://doi.org/10.1007/978-3-662-48000-7_29__In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_29 .

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 .

Charikar, Moses, Monika H Henzinger, and Huy L. Nguyên. “Online Bipartite Matching with Decomposable Weights.”https://doi.org/10.1007/978-3-662-44777-2_22__In 22nd Annual European Symposium on Algorithms, 8737:260–71. Springer Nature, 2014.https://doi.org/10.1007/978-3-662-44777-2_22 .

Cigler, Ludbk, Wolfgang Dvoák, Monika H Henzinger, and Martin Starnberger. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.”https://doi.org/10.1007/978-3-319-13129-0_4__In 10th International Conference of Web and Internet Economics, 8877:44–57. Springer Nature, 2014.https://doi.org/10.1007/978-3-319-13129-0_4 .

Fulek, Radoslav, Jan Kyndl, Igor Malinovi, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.”https://doi.org/10.1007/978-3-662-45803-7_36__In International Symposium on Graph Drawing, 8871:428–36. Cham: Springer Nature, 2014.https://doi.org/10.1007/978-3-662-45803-7_36 .

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 .

Biswas, Ranita, and Partha Bhowmick. “On Finding Spherical Geodesic Paths and Circles in 3.”https://doi.org/10.1007/978-3-319-09955-2_33__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014.https://doi.org/10.1007/978-3-319-09955-2_33 .

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 .

Colini-Baldeschi, Riccardo, Monika H Henzinger, Stefano Leonardi, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.”https://doi.org/10.1007/978-3-642-31585-5_1__In 39th International Colloquium on Automata, Languages, and Programming, 7392:1–12. Springer Nature, 2012.https://doi.org/10.1007/978-3-642-31585-5_1 .

Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”https://doi.org/10.1007/978-3-642-32940-1_10__In CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-32940-1_10 .

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 .

Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery behind Frozen Programs.”https://doi.org/10.1007/978-3-642-13675-7_1__In Applications and Theory of Petri Nets, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13675-7_1 .

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 .

Alur, Rajeev, Thomas A Henzinger, and Eduardo D Sontag, eds. Hybrid Systems III: Verification and Control. Vol. 1066. Lecture Notes in Computer Science. Berlinf; Heidelberg: Springer, 1996.https://doi.org/10.1007/BFb0020931 .

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 .