De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., &; Rote, G. (2024). Removing popular faces in curve arrangements. In 31st International Symposium on Graph Drawing and Network Visualization (Vol. 14466, pp. 18–33). Isola delle Femmine, Palermo, Italy: Springer Nature.https://doi.org/10.1007/978-3-031-49275-4_2 
LibreCat: https://research-explorer.ista.ac.at/record/14888
DOI: 10.1007/978-3-031-49275-4_2
arXiv: 2202.12175

Chalupa, M., &; Richter, C. (2024). Bubaak-SpLit: Split what you cannot verify (Competition contribution). In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 353–358). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-031-57256-2_20 
LibreCat: https://research-explorer.ista.ac.at/record/15333
DOI: 10.1007/978-3-031-57256-2_20

Avni, G., Mallik, K., &; Sadhukhan, S. (2024). Auction-based scheduling. In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 153–172). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-031-57256-2_8 
LibreCat: https://research-explorer.ista.ac.at/record/15376
DOI: 10.1007/978-3-031-57256-2_8
arXiv: 2310.11798

Majumdar, R., Saflam, I., &; Thejaswini, K. S. (2024). Rabin games and colourful universal trees. In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 213–231). Springer Nature.https://doi.org/10.1007/978-3-031-57256-2_11 
LibreCat: https://research-explorer.ista.ac.at/record/15377
DOI: 10.1007/978-3-031-57256-2_11
arXiv: 2401.07548

Auerbach, B., Günther, C. U., &; Pietrzak, K. Z. (2024). Trapdoor memory-hard functions. In 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Vol. 14653, pp. 315–344). Zurich, Switzerland: Springer Nature.https://doi.org/10.1007/978-3-031-58734-4_11 
LibreCat: https://research-explorer.ista.ac.at/record/17051
DOI: 10.1007/978-3-031-58734-4_11

Tairi, E., &; Ünal, A. (2024). Lower bounds for lattice-based compact functional encryption. In Advances in Cryptology – EUROCRYPT 2024 (Vol. 14652, pp. 249–279). Zurich, Switzerland: Springer Nature.https://doi.org/10.1007/978-3-031-58723-8_9 
LibreCat: https://research-explorer.ista.ac.at/record/17126
DOI: 10.1007/978-3-031-58723-8_9

Chalupa, M., &; Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30820-8_32 
LibreCat: https://research-explorer.ista.ac.at/record/12854
DOI: 10.1007/978-3-031-30820-8_32

Chalupa, M., Mühlböck, F., Muroya Lei, S., &; Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30826-0_15 
LibreCat: https://research-explorer.ista.ac.at/record/12856
DOI: 10.1007/978-3-031-30826-0_15

Hoffmann, C., Hubádek, P., Kamath, C., &; Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-31368-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/13143
DOI: 10.1007/978-3-031-31368-4_19

Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 13993, pp. 3–25). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/13142
DOI: 10.1007/978-3-031-30823-9_1

Anand, A., Mallik, K., Nayak, S. P., &; Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30820-8_15 
LibreCat: https://research-explorer.ista.ac.at/record/13141
DOI: 10.1007/978-3-031-30820-8_15

Henzinger, T. A., Mazzocchi, N. A., &; Sarac, N. E. (2023). Quantitative safety and liveness. In 26th International Conference Foundations of Software Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30829-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/12467
DOI: 10.1007/978-3-031-30829-1_17
arXiv: 2301.11175

Henzinger, T. A., Karimi, M., Kueffner, K., &; Mallik, K. (2023). Monitoring algorithmic fairness. In Computer Aided Verification (Vol. 13965, pp. 358–382). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37703-7_17 
LibreCat: https://research-explorer.ista.ac.at/record/13310
DOI: 10.1007/978-3-031-37703-7_17
arXiv: 2305.15979

Kretinsky, J., Meggendorfer, T., Prokop, M., &; Rieder, S. (2023). Guessing winning policies in LTL synthesis by semantic learning. In 35th International Conference on Computer Aided Verification  (Vol. 13964, pp. 390–414). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37706-8_20 
LibreCat: https://research-explorer.ista.ac.at/record/14259
DOI: 10.1007/978-3-031-37706-8_20

Sun, Y., Fu, H., Chatterjee, K., &; Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_2 
LibreCat: https://research-explorer.ista.ac.at/record/14318
DOI: 10.1007/978-3-031-37709-9_2

Akshay, S., Chatterjee, K., Meggendorfer, T., &; Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_5 
LibreCat: https://research-explorer.ista.ac.at/record/14317
DOI: 10.1007/978-3-031-37709-9_5

Tomaszewska, P., &; Lampert, C. (2023). On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In International Workshop on Reproducible Research in Pattern Recognition (Vol. 14068, pp. 67–73). Montreal, Canada: Springer Nature.https://doi.org/10.1007/978-3-031-40773-4_6 
LibreCat: https://research-explorer.ista.ac.at/record/14410
DOI: 10.1007/978-3-031-40773-4_6

Dodis, Y., Ferguson, N., Goldin, E., Hall, P., &; Pietrzak, K. Z. (2023). Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In 43rd Annual International Cryptology Conference (Vol. 14082, pp. 514–546). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-38545-2_17 
LibreCat: https://research-explorer.ista.ac.at/record/14428
DOI: 10.1007/978-3-031-38545-2_17

Hoffmann, C., &; Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature.https://doi.org/10.1007/978-3-031-44469-2_11 
LibreCat: https://research-explorer.ista.ac.at/record/14457
DOI: 10.1007/978-3-031-44469-2_11

Henzinger, T. A., Kueffner, K., &; Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In 23rd International Conference on Runtime Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature.https://doi.org/10.1007/978-3-031-44267-4_15 
LibreCat: https://research-explorer.ista.ac.at/record/14454
DOI: 10.1007/978-3-031-44267-4_15
arXiv: 2308.00341