Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.”10.18653/v1/2021.acl-tutorials.6__59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts, Association for Computational Linguistics, 2021, pp. 29–30, doi:10.18653/v1/2021.acl-tutorials.6.

Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343, Springer Nature, 2021, doi:10.1007/978-3-030-86872-7.

Bodova, Katarina, et al. “Dynamic Maximum Entropy Provides Accurate Approximation of Structured Population Dynamics.”10.1371/journal.pcbi.1009661__PLoS Computational Biology, vol. 17, no. 12, e1009661, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1009661.

Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” 38th International Conference on Machine Learning, 2021.

Nguyen, Quynh, et al. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” Proceedings of the 38th International Conference on Machine Learning, edited by Marina Meila and Tong Zhang, vol. 139, ML Research Press, 2021, pp. 8119–29.

Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.”10.1109/IEEECONF53345.2021.9723394__Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, vol. 2021–October, Institute of Electrical and Electronics Engineers, 2021, pp. 943–47, doi:10.1109/IEEECONF53345.2021.9723394.

Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium Fluctuations of Interacting Particle Systems.” Markov Processes And Related Fields, vol. 27, no. 3, Polymat Publishing, 2021, pp. 339–80.

Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.

Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.”10.24072/pcjournal.69__Peer Community Journal, vol. 1, e68, Centre Mersennef; Peer Community In, 2021, doi:10.24072/pcjournal.69.

Simbierowicz, Slawomir, et al. Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System. Bluefors Oy, 2021.

Lake, Russell, et al. The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System. Bluefors Oy, 2021.

Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.

Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.

Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 478–89.

Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021.

Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.”10.34727/2021/isbn.978-3-85448-046-4_23__Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:10.34727/2021/isbn.978-3-85448-046-4_23.

Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.”10.1137/1.9781611976465.38__Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.

Tomásek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.”10.24963/ijcai.2021/575__30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.

Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.”10.1145/3409964.3461810__Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–20, doi:10.1145/3409964.3461810.