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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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.

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 

Fulek, R., &; Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.39 

Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &; Mikudionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &; G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature.https://doi.org/10.1007/978-3-319-91908-9_22 

Portinale, L., &; Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. Gakko Tosho.

Bialek, W., Gregor, T., &; Tkadik, G. (n.d.). Action at a distance in transcriptional regulation. arXiv:1912.08579. ArXiv.

Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M.,https://doi.org/10.29007/m75b__Schilling, C. (2019). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications.https://doi.org/10.29007/m75b 

Betea, D., Bouttier, J., Nejjar, P., &; Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.