Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”https://doi.org/10.4230/LIPICS.ICALP.2019.77__In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.77 .

Walter, Michael. “Sampling the Integers with Low Relative Error.”https://doi.org/10.1007/978-3-030-23696-0_9__In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019.https://doi.org/10.1007/978-3-030-23696-0_9 .

Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.”https://doi.org/10.1109/TSP.2019.2944738__IEEE Transactions on Signal Processing. IEEE, 2019.https://doi.org/10.1109/TSP.2019.2944738 .

Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”https://doi.org/10.37236/8096__Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019.https://doi.org/10.37236/8096 .

Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.”https://doi.org/10.1007/978-3-030-30806-3_1__In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019.https://doi.org/10.1007/978-3-030-30806-3_1 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”https://doi.org/10.4230/LIPICS.CONCUR.2019.7__In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.7 .

Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.”https://doi.org/10.1109/icra.2019.8793840__In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019.https://doi.org/10.1109/icra.2019.8793840 .

Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,”https://doi.org/10.4230/LIPICS.CONCUR.2019.20__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,”https://doi.org/10.4230/LIPICS.CONCUR.2019.27__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 .

Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,”https://doi.org/10.4230/LIPICS.CONCUR.2019.6__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.6 .

Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”https://doi.org/10.4230/LIPICS.DISC.2019.29__In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.DISC.2019.29 .

Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.”https://doi.org/10.1109/ijcnn.2019.8851954__In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019.https://doi.org/10.1109/ijcnn.2019.8851954 .

Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.”https://doi.org/10.3390/a12100218__Algorithms. MDPI, 2019.https://doi.org/10.3390/a12100218 .

Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”https://doi.org/10.4230/LIPICS.SOCG.2019.39__In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.39 .

Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikudionis. “Continuous-Time Models for System Design and Analysis.”https://doi.org/10.1007/978-3-319-91908-9_22__In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019.https://doi.org/10.1007/978-3-319-91908-9_22 .

Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications. Gakko Tosho, 2019.

Bialek, William, Thomas Gregor, and Gasper Tkadik. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579. ArXiv, n.d.

Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”https://doi.org/10.29007/m75b__In EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019.https://doi.org/10.29007/m75b .

Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 2019.