Auerbach, B., Hoffmann, C., &; Pascual Perez, G. (2023). Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing. In 21st International Conference on Theory of Cryptography (Vol. 14371, pp. 301–330). Springer Nature.https://doi.org/10.1007/978-3-031-48621-0_11 
LibreCat: https://research-explorer.ista.ac.at/record/14692
DOI: 10.1007/978-3-031-48621-0_11

Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). : Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature.https://doi.org/10.1007/978-3-031-47754-6_18 
LibreCat: https://research-explorer.ista.ac.at/record/14736
DOI: 10.1007/978-3-031-47754-6_18

Avarikioti, Z., Desjardins, A., Kokoris Kogias, E., &; Wattenhofer, R. (2023). Divide &; Scale: Formalization and roadmap to robust sharding. In 30th International Colloquium on Structural Information and Communication Complexity (Vol. 13892, pp. 199–245). Alcalá de Henares, Spain: Springer Nature.https://doi.org/10.1007/978-3-031-32733-9_10 
LibreCat: https://research-explorer.ista.ac.at/record/14744
DOI: 10.1007/978-3-031-32733-9_10

Kisan, J. M., &; Svoboda, J. (2023). Shortest dominating set reconfiguration under token sliding. In 24th International Symposium on Fundamentals of Computation Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-43587-4_24 
LibreCat: https://research-explorer.ista.ac.at/record/14456
DOI: 10.1007/978-3-031-43587-4_24
arXiv: 2307.10847

Cohen, S., Goren, G., Kokoris Kogias, E., Sonnino, A., &; Spiegelman, A. (2023). Proof of availability and retrieval in a modular blockchain architecture. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13951, pp. 36–53). Bol, Brac, Croatia: Springer Nature.https://doi.org/10.1007/978-3-031-47751-5_3 
LibreCat: https://research-explorer.ista.ac.at/record/14829
DOI: 10.1007/978-3-031-47751-5_3

Benes, N., Brim, L., Pastva, S., Safránek, D., &; Smijáková, E. (2023). Phenotype control of partially specified boolean networks. In 21st International Conference on Computational Methods in Systems Biology (Vol. 14137, pp. 18–35). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-031-42697-1_2 
LibreCat: https://research-explorer.ista.ac.at/record/14411
DOI: 10.1007/978-3-031-42697-1_2

Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In 35th International Conference on Computer Aided Verification (Vol. 13966, pp. 3–15). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/14758
DOI: 10.1007/978-3-031-37709-9_1

Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_25 
LibreCat: https://research-explorer.ista.ac.at/record/13139
DOI: 10.1007/978-3-031-30823-9_25
arXiv: 2301.08137

Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In 35th International Conference on Computer Aided Verification  (Vol. 13964, pp. 156–169). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37706-8_8 
LibreCat: https://research-explorer.ista.ac.at/record/14260
DOI: 10.1007/978-3-031-37706-8_8

Zheng, D. W., &; Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature.https://doi.org/10.1007/978-3-031-32726-1_32 
LibreCat: https://research-explorer.ista.ac.at/record/13236
DOI: 10.1007/978-3-031-32726-1_32
arXiv: 2301.09217

Karimipour, F., &; Storandt, S. (Eds.). (2022). Web and Wireless Geographical Information Systems (1st ed., Vol. 13238). Cham: Springer Nature.https://doi.org/10.1007/978-3-031-06245-2 
LibreCat: https://research-explorer.ista.ac.at/record/11429
DOI: 10.1007/978-3-031-06245-2

Garcia Soto, M., Henzinger, T. A., &; Schilling, C. (2022). Synthesis of parametric hybrid automata from time series. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 337–353). Virtual: Springer Nature.https://doi.org/10.1007/978-3-031-19992-9_22 
LibreCat: https://research-explorer.ista.ac.at/record/12171
DOI: 10.1007/978-3-031-19992-9_22
arXiv: 2208.06383

Henzinger, T. A. (2022). Quantitative monitoring of software. In Software Verification (Vol. 13124, pp. 3–6). New Haven, CT, United States: Springer Nature.https://doi.org/10.1007/978-3-030-95561-8_1 
LibreCat: https://research-explorer.ista.ac.at/record/10891
DOI: 10.1007/978-3-030-95561-8_1
WoS: 000771713200001

Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &; Da Costa, A. O. (2022). Information-flow interfaces. In Fundamental Approaches to Software Engineering (Vol. 13241, pp. 3–22). Munich, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-99429-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/11355
DOI: 10.1007/978-3-030-99429-7_1
WoS: 000782393600001

Alwen, J., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., Pietrzak, K. Z., &; Walter, M. (2022). CoCoA: Concurrent continuous group key agreement. In Advances in Cryptology – EUROCRYPT 2022 (Vol. 13276, pp. 815–844). Cham: Springer Nature.https://doi.org/10.1007/978-3-031-07085-3_28 
LibreCat: https://research-explorer.ista.ac.at/record/11476
DOI: 10.1007/978-3-031-07085-3_28
WoS: 000832305300028

Balliu, A., Hirvonen, J., Melnyk, D., Olivetti, D., Rybicki, J., &; Suomela, J. (2022). Local mending. In M. Parter (Ed.), International Colloquium on Structural Information and Communication Complexity (Vol. 13298, pp. 1–20). Paderborn, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-09993-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/11707
DOI: 10.1007/978-3-031-09993-9_1
WoS: 000876977400001
arXiv: 2102.08703

Bogdanov, A., Cueto Noval, M., Hoffmann, C., &; Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature.https://doi.org/10.1007/978-3-031-22365-5_20 
LibreCat: https://research-explorer.ista.ac.at/record/12516
DOI: 10.1007/978-3-031-22365-5_20
WoS: 000921318200020

Avarikioti, G., Pietrzak, K. Z., Salem, I., Schmid, S., Tiwari, S., &; Yeo, M. X. (2022). Hide &; Seek: Privacy-preserving rebalancing on payment channel networks. In Financial Cryptography and Data Security (Vol. 13411, pp. 358–373). Grenada: Springer Nature.https://doi.org/10.1007/978-3-031-18283-9_17 
LibreCat: https://research-explorer.ista.ac.at/record/12167
DOI: 10.1007/978-3-031-18283-9_17
arXiv: 2110.08848

Doveri, K., Ganty, P., &; Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature.https://doi.org/10.1007/978-3-031-13188-2_6 
LibreCat: https://research-explorer.ista.ac.at/record/12302
DOI: 10.1007/978-3-031-13188-2_6
WoS: 000870310500006
arXiv: 2207.13549

Hoffmann, C., Hubádek, P., Kamath, C., Klein, K., &; Pietrzak, K. Z. (2022). Practical statistically-sound proofs of exponentiation in any group. In Advances in Cryptology – CRYPTO 2022 (Vol. 13508, pp. 370–399). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-15979-4_13 
LibreCat: https://research-explorer.ista.ac.at/record/12176
DOI: 10.1007/978-3-031-15979-4_13
WoS: 000886792700013

Gelashvili, R., Kokoris Kogias, E., Sonnino, A., Spiegelman, A., &; Xiang, Z. (2022). Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In Financial Cryptography and Data Security (Vol. 13411, pp. 296–315). Radisson Grenada Beach Resort, Grenada: Springer Nature.https://doi.org/10.1007/978-3-031-18283-9_14 
LibreCat: https://research-explorer.ista.ac.at/record/12298
DOI: 10.1007/978-3-031-18283-9_14
arXiv: 2106.10362

Cohen, S., Gelashvili, R., Kokoris Kogias, E., Li, Z., Malkhi, D., Sonnino, A., &; Spiegelman, A. (2022). Be aware of your leaders. In International Conference on Financial Cryptography and Data Security (Vol. 13411, pp. 279–295). Grenada: Springer Nature.https://doi.org/10.1007/978-3-031-18283-9_13 
LibreCat: https://research-explorer.ista.ac.at/record/12168
DOI: 10.1007/978-3-031-18283-9_13
arXiv: 2110.00960

Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature.https://doi.org/10.1007/978-3-031-19992-9_20 
LibreCat: https://research-explorer.ista.ac.at/record/12170
DOI: 10.1007/978-3-031-19992-9_20

Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., &; Totzke, P. (2022). History-deterministic timed automata are not determinizable. In 16th International Conference on Reachability Problems (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-19135-0_5 
LibreCat: https://research-explorer.ista.ac.at/record/12175
DOI: 10.1007/978-3-031-19135-0_5

Arroyo Guevara, A. M., &; Felsner, S. (2022). Approximating the bundled crossing number. In WALCOM 2022: Algorithms and Computation (Vol. 13174, pp. 383–395). Jember, Indonesia: Springer Nature.https://doi.org/10.1007/978-3-030-96731-4_31 
LibreCat: https://research-explorer.ista.ac.at/record/11185
DOI: 10.1007/978-3-030-96731-4_31
arXiv: 2109.14892

Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &; Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer.https://doi.org/10.1007/978-3-031-13185-1_4 
LibreCat: https://research-explorer.ista.ac.at/record/12000
DOI: 10.1007/978-3-031-13185-1_4
WoS: 000870304500004

Henzinger, M. H., &; Wu, X. (2021). Upper and lower bounds for fully retroactive graph problems. In 17th International Symposium on Algorithms and Data Structures (Vol. 12808, pp. 471–484). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-83508-8_34 
LibreCat: https://research-explorer.ista.ac.at/record/11771
DOI: 10.1007/978-3-030-83508-8_34
arXiv: 1910.03332

Volhejn, V., &; Lampert, C. (2021). Does SGD implicitly optimize for smoothness? In 42nd German Conference on Pattern Recognition (Vol. 12544, pp. 246–259). Tübingen, Germany: Springer.https://doi.org/10.1007/978-3-030-71278-5_18 
LibreCat: https://research-explorer.ista.ac.at/record/9210
DOI: 10.1007/978-3-030-71278-5_18

Alistarh, D.-A., &; Davies, P. (2021). Collecting coupons is faster with friends. In Structural Information and Communication Complexity (Vol. 12810, pp. 3–12). Wrocaw, Poland: Springer Nature.https://doi.org/10.1007/978-3-030-79527-6_1 
LibreCat: https://research-explorer.ista.ac.at/record/9620
DOI: 10.1007/978-3-030-79527-6_1

Bansal, S., Chatterjee, K., &; Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-030-72016-2 
LibreCat: https://research-explorer.ista.ac.at/record/12767
DOI: 10.1007/978-3-030-72016-2
arXiv: 2101.02594

Blackshear, S., Chalkias, K., Chatzigiannis, P., Faizullabhoy, R., Khaburzaniya, I., Kokoris Kogias, E.,https://doi.org/10.1007/978-3-662-63958-0_34__Zakian, T. (2021). Reactive key-loss protection in blockchains. In FC 2021 Workshops (Vol. 12676, pp. 431–450). Virtual: Springer Nature.https://doi.org/10.1007/978-3-662-63958-0_34 
LibreCat: https://research-explorer.ista.ac.at/record/10076
DOI: 10.1007/978-3-662-63958-0_34
WoS: 000713005000034

Mühlböck, F., &; Henzinger, T. A. (2021). Differential monitoring. In International Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_12 
LibreCat: https://research-explorer.ista.ac.at/record/10108
DOI: 10.1007/978-3-030-88494-9_12
WoS: 000719383800012

Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez, P., Kiayias, A., &; Knottenbelt, W. J. (2021). SoK: Communication across distributed ledgers. In 25th International Conference on Financial Cryptography and Data Security (Vol. 12675, pp. 3–36). Virtual: Springer Nature.https://doi.org/10.1007/978-3-662-64331-0_1 
LibreCat: https://research-explorer.ista.ac.at/record/10325
DOI: 10.1007/978-3-662-64331-0_1
WoS: 000712016200001

Avarikioti, Z., Kokoris Kogias, E., Wattenhofer, R., &; Zindros, D. (2021). Brick: Asynchronous incentive-compatible payment channels. In 25th International Conference on Financial Cryptography and Data Security (Vol. 12675, pp. 209–230). Virtual: Springer Nature.https://doi.org/10.1007/978-3-662-64331-0_11 
LibreCat: https://research-explorer.ista.ac.at/record/10324
DOI: 10.1007/978-3-662-64331-0_11
WoS: 000712016200011
arXiv: 1905.11360

Chakraborty, S., Dziembowski, S., Gazka, M., Lizurej, T., Pietrzak, K. Z., &; Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp. 397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_14 
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G.,https://doi.org/10.1007/978-3-030-90456-2_8__Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90456-2_8 
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th International Conference (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

Chakraborty, S., Ganesh, C., Pancholi, M., &; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In 27th International Conference on the Theory and Application of Cryptology and Information Security (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature.https://doi.org/10.1007/978-3-030-92075-3_12 
LibreCat: https://research-explorer.ista.ac.at/record/10609
DOI: 10.1007/978-3-030-92075-3_12
WoS: 000927876200012

Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., &; Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification  (Vol. 12759, pp. 341–366). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-81685-8_16 
LibreCat: https://research-explorer.ista.ac.at/record/9987
DOI: 10.1007/978-3-030-81685-8_16
WoS: 000698732400016
arXiv: 2105.06424

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II  (Vol. 12826, pp. 486–515). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-84245-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10041
DOI: 10.1007/978-3-030-84245-1_17

Bloch-Hansen, A., Samei, N., &; Solis-Oba, R. (2021). Experimental evaluation of a local search approximation algorithm for the multiway cut problem. In Conference on Algorithms and Discrete Applied Mathematics (Vol. 12601, pp. 346–358). Rupnagar, India: Springer Nature.https://doi.org/10.1007/978-3-030-67899-9_28 
LibreCat: https://research-explorer.ista.ac.at/record/9227
DOI: 10.1007/978-3-030-67899-9_28

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th International Conference (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_19 
LibreCat: https://research-explorer.ista.ac.at/record/10410
DOI: 10.1007/978-3-030-90453-1_19
WoS: 000728364000019

Lukina, A., Schilling, C., &; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_3 
LibreCat: https://research-explorer.ista.ac.at/record/10206
DOI: 10.1007/978-3-030-88494-9_3
WoS: 000719383800003
arXiv: 2009.06429

Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., &; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-90870-6_33 
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

Pach, J., Tardos, G., &; Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature.https://doi.org/10.1007/978-3-030-68766-3_28 
LibreCat: https://research-explorer.ista.ac.at/record/9299
DOI: 10.1007/978-3-030-68766-3_28
arXiv: 2006.14908

Auerbach, B., Giacon, F., &; Kiltz, E. (2020). Everybody’s a target: Scalability in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol. 12107, pp. 475–506). Springer Nature.https://doi.org/10.1007/978-3-030-45727-3_16 
LibreCat: https://research-explorer.ista.ac.at/record/7966
DOI: 10.1007/978-3-030-45727-3_16
WoS: 000828688000016

Henzinger, T. A., &; Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-60508-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/8623
DOI: 10.1007/978-3-030-60508-7_1
WoS: 000728160600001

Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., &; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In Graph-Theoretic Concepts in Computer Science (Vol. 12301, pp. 325–338). Leeds, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-030-60440-0_26 
LibreCat: https://research-explorer.ista.ac.at/record/8732
DOI: 10.1007/978-3-030-60440-0_26

Chakraborty, S., Prabhakaran, M., &; Wichs, D. (2020). Witness maps and applications. In A. Kiayias (Ed.), Public-Key Cryptography (Vol. 12110, pp. 220–246). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-45374-9_8 
LibreCat: https://research-explorer.ista.ac.at/record/10865
DOI: 10.1007/978-3-030-45374-9_8

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature.https://doi.org/10.1007/978-3-030-53288-8_14 
LibreCat: https://research-explorer.ista.ac.at/record/8195
DOI: 10.1007/978-3-030-53288-8_14
WoS: 000695276000014

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., &; Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature.https://doi.org/10.1007/978-3-030-59152-6_14 
LibreCat: https://research-explorer.ista.ac.at/record/8728
DOI: 10.1007/978-3-030-59152-6_14
WoS: 000723555700014

Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &; Sezgin, A. (2019). Transient memory in gene regulation. In 17th International Conference on Computational Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature.https://doi.org/10.1007/978-3-030-31304-3_9 
LibreCat: https://research-explorer.ista.ac.at/record/7147
DOI: 10.1007/978-3-030-31304-3_9
WoS: 000557875100009

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2019). Scalable FIFO channels for programming via communicating sequential processes. In 25th Anniversary of Euro-Par (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-29400-7_23 
LibreCat: https://research-explorer.ista.ac.at/record/7228
DOI: 10.1007/978-3-030-29400-7_23
WoS: 000851061400023

Kong, H., Bartocci, E., Jiang, Y., &; Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_8 
LibreCat: https://research-explorer.ista.ac.at/record/7231
DOI: 10.1007/978-3-030-29662-9_8
WoS: 000611677700008
arXiv: 1907.11514

Arroyo Guevara, A. M., Derka, M., &; Parada, I. (2019). Extending simple drawings. In 27th International Symposium on Graph Drawing and Network Visualization (Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature.https://doi.org/10.1007/978-3-030-35802-0_18 
LibreCat: https://research-explorer.ista.ac.at/record/7230
DOI: 10.1007/978-3-030-35802-0_18
WoS: 000612918800018
arXiv: 1908.08129

Ferrere, T., Maler, O., &; Nickovic, D. (2019). Mixed-time signal temporal logic. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_4 
LibreCat: https://research-explorer.ista.ac.at/record/7232
DOI: 10.1007/978-3-030-29662-9_4
WoS: 000611677700004

Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing.https://doi.org/10.1007/978-3-030-17656-3_10 
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Sun, R., &; Lampert, C. (2019). KS(conf): A light-weight test if a ConvNet operates outside of Its specifications (Vol. 11269, pp. 244–259). Presented at the GCPR: Conference on Pattern Recognition, Stuttgart, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-12939-2_18 
LibreCat: https://research-explorer.ista.ac.at/record/6482
DOI: 10.1007/978-3-030-12939-2_18
arXiv: 1804.04171

Koshti, G., Biswas, R., Largeteau-Skapin, G., Zrour, R., Andres, E., &; Bhowmick, P. (2018). Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In 19th International Workshop (Vol. 11255, pp. 82–96). Cham: Springer.https://doi.org/10.1007/978-3-030-05288-1_7 
LibreCat: https://research-explorer.ista.ac.at/record/6164
DOI: 10.1007/978-3-030-05288-1_7

Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature.https://doi.org/10.1007/978-3-662-58387-6_26 
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Dwivedi, S., Gupta, A., Roy, S., Biswas, R., &; Bhowmick, P. (2017). Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In 20th IAPR International Conference (Vol. 10502, pp. 347–359). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-66272-5_28 
LibreCat: https://research-explorer.ista.ac.at/record/5801
DOI: 10.1007/978-3-319-66272-5_28

Andres, E., Biswas, R., &; Bhowmick, P. (2017). Digital primitives defined by weighted focal set. In 20th IAPR International Conference (Vol. 10502, pp. 388–398). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-66272-5_31 
LibreCat: https://research-explorer.ista.ac.at/record/5802
DOI: 10.1007/978-3-319-66272-5_31

Kretinsky, J., Meggendorfer, T., Waldmann, C., &; Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54577-5_26 
LibreCat: https://research-explorer.ista.ac.at/record/13160
DOI: 10.1007/978-3-662-54577-5_26
arXiv: 1701.05738

Sen, N., Biswas, R., &; Bhowmick, P. (2016). On some local topological properties of naive discrete sphere. In Computational Topology in Image Context (Vol. 9667, pp. 253–264). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-39441-1_23 
LibreCat: https://research-explorer.ista.ac.at/record/5805
DOI: 10.1007/978-3-319-39441-1_23

Biswas, R., Bhowmick, P., &; Brimkov, V. E. (2016). On the connectivity and smoothness of discrete spherical circles. In Combinatorial image analysis (Vol. 9448, pp. 86–100). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-26145-4_7 
LibreCat: https://research-explorer.ista.ac.at/record/5809
DOI: 10.1007/978-3-319-26145-4_7

Harada, H., &; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In High-Resolution Imaging of Cellular Proteins (Vol. 1474, pp. 203–216). Springer.https://doi.org/10.1007/978-1-4939-6352-2_12 
LibreCat: https://research-explorer.ista.ac.at/record/1094
DOI: 10.1007/978-1-4939-6352-2_12

Aminof, B., Jacobs, S., Khalimov, A., &; Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_15 
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Biedl, T., Huber, S., &; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature.https://doi.org/10.1007/978-3-319-13075-0_10 
LibreCat: https://research-explorer.ista.ac.at/record/10892
DOI: 10.1007/978-3-319-13075-0_10

Chatterjee, K., Doyen, L., Filiot, E., &; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_5 
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

Bauer, U., Kerber, M., Reininghaus, J., &; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In ICMS 2014: International Congress on Mathematical Software (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-662-44199-2_24 
LibreCat: https://research-explorer.ista.ac.at/record/10894
DOI: 10.1007/978-3-662-44199-2_24

Dragoi, C., Gupta, A., &; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-39799-8_11 
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Chatterjee, K., Chaubal, S., &; Rubin, S. (2013). How to travel between languages. In 7th International Conference on Language and Automata Theory and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-37064-9_20 
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

Edelsbrunner, H. (2013). Persistent homology in image processing. In Graph-Based Representations in Pattern Recognition (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-38221-5_19 
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

Bouajjani, A., Dragoi, C., Enea, C., &; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-33386-6_14 
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 10.1007/978-3-642-33386-6_14

Chatterjee, K., Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer.https://doi.org/10.1007/978-3-642-33090-2_27 
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &; B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-28756-5_46 
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-33386-6_10 
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

Artner, N. M., Ion, A., &; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &; A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-20844-7_22 
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

Blanc, R., Henzinger, T. A., Hottelier, T., &; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &; A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-17511-4_7 
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

Henzinger, M. H. (2004). Algorithmic aspects of web search engines. In 2th Annual European Symposium on Algorithms (Vol. 3221, p. 3). Bergen, Norway: Springer Nature.https://doi.org/10.1007/978-3-540-30140-0_2 
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

Henzinger, M. H. (2004). The past, present, and future of web search engines. In 31st International Colloquium on Automata, Languages and Programming (Vol. 3142, p. 3). Turku, Finland: Springer Nature.https://doi.org/10.1007/978-3-540-27836-8_2 
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 10.1007/978-3-540-27836-8_2

Henzinger, M. H. (2000). Web information retrieval - an algorithmic perspective. In 8th Annual European Symposium on Algorithms (Vol. 1879, pp. 1–8). Saarbrücken, Germany: Springer Nature.https://doi.org/10.1007/3-540-45253-2_1 
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

Henzinger, M. H., &; King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In 24th International Colloquium on Automata, Languages and Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature.https://doi.org/10.1007/3-540-63165-8_214 
LibreCat: https://research-explorer.ista.ac.at/record/11803
DOI: 10.1007/3-540-63165-8_214

Henzinger, M. H., &; Telle, J. A. (1996). Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In 5th Scandinavian Workshop on Algorithm Theory (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer Nature.https://doi.org/10.1007/3-540-61422-2_117 
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

Henzinger, M. H., &; Thorup, M. (1996). Improved sampling with applications to dynamic graph algorithms. In 23rd International Colloquium on Automata, Languages, and Programming (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer Nature.https://doi.org/10.1007/3-540-61440-0_136 
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In 22nd International Colloquium on Automata, Languages and Programming (Vol. 944, pp. 280–291). Szeged, Hungary: Springer Nature.https://doi.org/10.1007/3-540-60084-1_81 
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81

Henzinger, M. H., &; Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In 3rd Annual European Symposium on Algorithms (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature.https://doi.org/10.1007/3-540-60313-1_142 
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142