Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.”https://doi.org/10.3233/JCS-181131__Journal of Computer Security. IOS Press, 2019.https://doi.org/10.3233/JCS-181131 .

Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.”https://doi.org/10.20382/jocg.v10i1a9__Journal of Computational Geometry . Carleton University, 2019.https://doi.org/10.20382/jocg.v10i1a9 .

Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.”https://doi.org/10.4230/LIPICS.ITCS.2019.60__In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ITCS.2019.60 .

Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.”https://doi.org/10.1109/INDIANCC.2019.8715598__In 5th Indian Control Conference Proceedings. IEEE, 2019.https://doi.org/10.1109/INDIANCC.2019.8715598 .

Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019.

Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.”https://doi.org/10.4230/LIPICS.SOCG.2019.31__In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.31 .

Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.”https://doi.org/10.1246/bcsj.20190034__Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019.https://doi.org/10.1246/bcsj.20190034 .

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 .