Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: 25th Anniversary of Euro-Par. Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23

Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In: 17th International Conference on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature; 2019:123-141. doi:10.1007/978-3-030-29662-9_8

Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: 27th International Symposium on Graph Drawing and Network Visualization. Vol 11904. Springer Nature; 2019:230-243. doi:10.1007/978-3-030-35802-0_18

Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: 17th International Conference on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature; 2019:59-75. doi:10.1007/978-3-030-29662-9_4

Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019. Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10

Sun R, Lampert C. KS(conf): A light-weight test if a ConvNet operates outside of Its specifications. In: Vol 11269. Springer Nature; 2019:244-259. doi:10.1007/978-3-030-12939-2_18

Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In: 19th International Workshop. Vol 11255. Cham: Springer; 2018:82-96. doi:10.1007/978-3-030-05288-1_7

Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. Channels: Horizontal scaling and confidentiality on permissioned blockchains. In: Computer Security. Vol 11098. Springer Nature; 2018:111-131. doi:10.1007/978-3-319-99073-6_6

Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26

Henzinger MH. The state of the art in dynamic graph algorithms. In: 44th International Conference on Current Trends in Theory and Practice of Computer Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3

Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: 19th International Conference on Integer Programming and Combinatorial Optimization. Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8

Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In: 20th IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:347-359. doi:10.1007/978-3-319-66272-5_28

Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8

Andres E, Biswas R, Bhowmick P. Digital primitives defined by weighted focal set. In: 20th IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:388-398. doi:10.1007/978-3-319-66272-5_31

Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18

Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8

Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26

Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere with application to circle drawing. In: Discrete Geometry for Computer Imagery. Vol 9647. Cham: Springer Nature; 2016:256-267. doi:10.1007/978-3-319-32360-2_20

Sen N, Biswas R, Bhowmick P. On some local topological properties of naive discrete sphere. In: Computational Topology in Image Context. Vol 9667. Cham: Springer Nature; 2016:253-264. doi:10.1007/978-3-319-39441-1_23

Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete spherical circles. In: Combinatorial Image Analysis. Vol 9448. Cham: Springer Nature; 2016:86-100. doi:10.1007/978-3-319-26145-4_7

Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Vol 1474. Springer; 2016:203-216. doi:10.1007/978-1-4939-6352-2_12

Cheung YK, Henzinger MH, Hoefer M, Starnberger M. Combinatorial auctions with conflict-based externalities. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:230–243. doi:10.1007/978-3-662-48995-6_17

Ben-Zwi O, Henzinger MH, Loitzenbauer V. Ad exchange: Envy-free auctions with mediators. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:104–117. doi:10.1007/978-3-662-48995-6_8

Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental single-source reachability on directed graphs. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736. doi:10.1007/978-3-662-47672-7_59

Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly connected components in quadratic time. In: 2nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724. doi:10.1007/978-3-662-47672-7_58

Dvoák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th International Workshop of Approximation and Online Algorithms. Vol 8952. Springer Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14

Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via primal-dual method. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17

Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. In: 35th Annual Cryptology Conference. Vol 9216. Springer; 2015:585-605. doi:10.1007/978-3-662-48000-7_29

Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15

Charikar M, Henzinger MH, Nguyên HL. Online bipartite matching with decomposable weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22

Cigler L, Dvoák W, Henzinger MH, Starnberger M. Limiting price discrimination when selling products with positive network externalities. In: 10th International Conference of Web and Internet Economics. Vol 8877. Springer Nature; 2014:44-57. doi:10.1007/978-3-319-13129-0_4

Fulek R, Kyndl J, Malinovi I, Pálvölgyi D. Clustered planarity testing revisited. In: International Symposium on Graph Drawing. Vol 8871. Cham: Springer Nature; 2014:428-436. doi:10.1007/978-3-662-45803-7_36

Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10

Biswas R, Bhowmick P. On Finding Spherical Geodesic Paths and Circles in 3. 2014;8668:396-409. doi:10.1007/978-3-319-09955-2_33

Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5

Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: ICMS 2014: International Congress on Mathematical Software. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:10.1007/978-3-662-44199-2_24

Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11

Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th International Conference on Language and Automata Theory and Applications. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20

Edelsbrunner H. Persistent homology in image processing. In: Graph-Based Representations in Pattern Recognition. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:10.1007/978-3-642-38221-5_19

Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. On multiple keyword sponsored search auctions with budgets. In: 39th International Colloquium on Automata, Languages, and Programming. Vol 7392. Springer Nature; 2012:1–12. doi:10.1007/978-3-642-31585-5_1

Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. CONCUR 2012 - Concurrency Theory. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:10.1007/978-3-642-32940-1_10

Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:10.1007/978-3-642-33386-6_14

Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: Algorithms – ESA 2012. Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27

Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46

Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10

Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. Graph-Based Representations in Pattern Recognition. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:10.1007/978-3-642-20844-7_22

Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7

Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:1-17. doi:10.1007/978-3-642-13675-7_1

Henzinger MH. Algorithmic aspects of web search engines. In: 2th Annual European Symposium on Algorithms. Vol 3221. Springer Nature; 2004:3. doi:10.1007/978-3-540-30140-0_2

Henzinger MH. The past, present, and future of web search engines. In: 31st International Colloquium on Automata, Languages and Programming. Vol 3142. Springer Nature; 2004:3. doi:10.1007/978-3-540-27836-8_2

Henzinger MH. Web information retrieval - an algorithmic perspective. In: 8th Annual European Symposium on Algorithms. Vol 1879. Springer Nature; 2000:1–8. doi:10.1007/3-540-45253-2_1

Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: 24th International Colloquium on Automata, Languages and Programming. Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214

Henzinger MH, Telle JA. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In: 5th Scandinavian Workshop on Algorithm Theory. Vol 1097. Springer Nature; 1996:16–27. doi:10.1007/3-540-61422-2_117

Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph algorithms. In: 23rd International Colloquium on Automata, Languages, and Programming. Vol 1099. Springer Nature; 1996:290-299. doi:10.1007/3-540-61440-0_136

Alur R, Henzinger TA, Sontag ED, eds. Hybrid Systems III: Verification and Control. Vol 1066. Berlinf; Heidelberg: Springer; 1996. doi:10.1007/BFb0020931

Henzinger MH. Approximating minimum cuts under insertions. In: 22nd International Colloquium on Automata, Languages and Programming. Vol 944. Springer Nature; 1995:280–291. doi:10.1007/3-540-60084-1_81

Henzinger MH, Poutré H. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In: 3rd Annual European Symposium on Algorithms. Vol 979. Springer Nature; 1995:171–184. doi:10.1007/3-540-60313-1_142