Walter, Michael. “Sampling the Integers with Low Relative Error.”10.1007/978-3-030-23696-0_9__Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi: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, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.”10.1109/TSP.2019.2944738__IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi: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, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”10.37236/8096__Electronic Journal of Combinatorics, vol. 26, no. 3, .17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148

Avni, Guy, et al. “Bidding Games on Markov Decision Processes.”10.1007/978-3-030-30806-3_1__10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi: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, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”10.4230/LIPICS.CONCUR.2019.7__Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 10.4230/LIPICS.CONCUR.2019.7

Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.”10.1109/icra.2019.8793840__Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.
LibreCat: https://research-explorer.ista.ac.at/record/6888
DOI: 10.1109/icra.2019.8793840

Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi: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, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 10.4230/LIPICS.CONCUR.2019.27

Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 10.4230/LIPICS.CONCUR.2019.6

Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”10.4230/LIPICS.DISC.2019.29__33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi: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