Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.”10.1145/3332466.3374503__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.

Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.”10.1145/3382734.3405743__Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.

Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.”10.4230/LIPIcs.DISC.2020.40__34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.

Faghri, Fartash, et al. “Adaptive Gradient Quantization for Data-Parallel SGD.” Advances in Neural Information Processing Systems, vol. 33, Neural Information Processing Systems Foundation, 2020.

Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”10.4230/LIPIcs.ICALP.2020.7__47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.

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.

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.

Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.”10.1145/3288599.3288617__ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.

Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating Sequential Processes.”10.1145/3293883.3297000__Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, ACM Press, 2019, pp. 417–18, doi:10.1145/3293883.3297000.

Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?”10.1111/ecog.04444__Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.

Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.”10.1145/3339471__Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.

Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.”10.1109/cdc.2018.8619625__2018 IEEE Conference on Decision and Control, 8619625, IEEE, 2019, doi:10.1109/cdc.2018.8619625.

Renggli, Cedric, et al. “SparCML: High-Performance Sparse Communication for Machine Learning.”10.1145/3295500.3356222__International Conference for High Performance Computing, Networking, Storage and Analysis, SC, , ACM, 2019, doi:10.1145/3295500.3356222.

Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.”10.1186/s12859-019-3208-4__BMC Bioinformatics, vol. 20, 641, BMC, 2019, doi:10.1186/s12859-019-3208-4.

Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.”10.1007/978-3-030-29400-7_23__25th Anniversary of Euro-Par, vol. 11725, Springer Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.

Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, ICML 2019, vol. 2019–June, IMLS, 2019, pp. 12481–512.

Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.”10.1145/3323165.3323201__31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.

Wendler, Chris, et al. Powerset Convolutional Neural Networks. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.

Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?”10.1145/3293611.3331581__Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.

Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.”10.1145/3313276.3316407__Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–96, doi:10.1145/3313276.3316407.