K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6565
DOI: 10.1109/INDIANCC.2019.8715598

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

H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.
LibreCat: https://research-explorer.ista.ac.at/record/6648
DOI: 10.4230/LIPICS.SOCG.2019.31
arXiv: 1903.08510

N. Zenmyo et al., “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, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6659
DOI: 10.1246/bcsj.20190034

V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

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

S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6750
DOI: 10.1109/TSP.2019.2944738
arXiv: 1903.09203

V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148

G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in  Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
LibreCat: https://research-explorer.ista.ac.at/record/6822
DOI: 10.1007/978-3-030-30806-3_1

K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 10.4230/LIPICS.CONCUR.2019.7

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

M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
LibreCat: https://research-explorer.ista.ac.at/record/6886
DOI: 10.4230/LIPICS.CONCUR.2019.20
arXiv: 1905.03588

K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 10.4230/LIPICS.CONCUR.2019.27

K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 10.4230/LIPICS.CONCUR.2019.6

T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
LibreCat: https://research-explorer.ista.ac.at/record/6931
DOI: 10.4230/LIPICS.DISC.2019.29
arXiv: 1908.02743

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

M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7007
DOI: 10.3390/a12100218
arXiv: 1801.03153

G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.
LibreCat: https://research-explorer.ista.ac.at/record/7035

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