Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.60 
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

Kundu, A., Garcia Soto, M., &; Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE.https://doi.org/10.1109/INDIANCC.2019.8715598 
LibreCat: https://research-explorer.ista.ac.at/record/6565
DOI: 10.1109/INDIANCC.2019.8715598

Vegter, G., &; Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.
LibreCat: https://research-explorer.ista.ac.at/record/6628

Edelsbrunner, H., Virk, Z., &; Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.31 
LibreCat: https://research-explorer.ista.ac.at/record/6648
DOI: 10.4230/LIPICS.SOCG.2019.31
arXiv: 1903.08510

Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I.,https://doi.org/10.1246/bcsj.20190034__Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan.https://doi.org/10.1246/bcsj.20190034 
LibreCat: https://research-explorer.ista.ac.at/record/6659
DOI: 10.1246/bcsj.20190034

Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ICALP.2019.77 
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, &; T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-23696-0_9 
LibreCat: https://research-explorer.ista.ac.at/record/6726
DOI: 10.1007/978-3-030-23696-0_9

Hashemi, S. A., Condo, C., Mondelli, M., &; Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE.https://doi.org/10.1109/TSP.2019.2944738 
LibreCat: https://research-explorer.ista.ac.at/record/6750
DOI: 10.1109/TSP.2019.2944738
arXiv: 1903.09203

Jelínek, V., &; Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.https://doi.org/10.37236/8096 
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148

Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &; Novotny, P. (2019). Bidding games on Markov decision processes. In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer.https://doi.org/10.1007/978-3-030-30806-3_1 
LibreCat: https://research-explorer.ista.ac.at/record/6822
DOI: 10.1007/978-3-030-30806-3_1

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.7 
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 10.4230/LIPICS.CONCUR.2019.7

Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., &; Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE.https://doi.org/10.1109/icra.2019.8793840 
LibreCat: https://research-explorer.ista.ac.at/record/6888
DOI: 10.1109/icra.2019.8793840

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 
LibreCat: https://research-explorer.ista.ac.at/record/6886
DOI: 10.4230/LIPICS.CONCUR.2019.20
arXiv: 1905.03588

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 10.4230/LIPICS.CONCUR.2019.27

Chatterjee, K., &; Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.6 
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 10.4230/LIPICS.CONCUR.2019.6

Nowak, T., &; Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.DISC.2019.29 
LibreCat: https://research-explorer.ista.ac.at/record/6931
DOI: 10.4230/LIPICS.DISC.2019.29
arXiv: 1908.02743

Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., &; Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE.https://doi.org/10.1109/ijcnn.2019.8851954 
LibreCat: https://research-explorer.ista.ac.at/record/6985
DOI: 10.1109/ijcnn.2019.8851954
arXiv: 1809.03864

Mondelli, M., Hassani, S. H., &; Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI.https://doi.org/10.3390/a12100218 
LibreCat: https://research-explorer.ista.ac.at/record/7007
DOI: 10.3390/a12100218
arXiv: 1801.03153

Geher, G. P., Titkos, T., &; Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.
LibreCat: https://research-explorer.ista.ac.at/record/7035

Kersting, K., Lampert, C., &; Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature.https://doi.org/10.1007/978-3-658-26763-6 
LibreCat: https://research-explorer.ista.ac.at/record/7171
DOI: 10.1007/978-3-658-26763-6