Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.”10.1145/3382734.3405751__Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.

Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”10.4230/LIPIcs.DISC.2020.3__34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.

Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.

Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.

Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.

Gurel, Nezihe Merve, et al. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.”10.1109/TSP.2020.3010355__IEEE Transactions on Signal Processing, vol. 68, IEEE, 2020, pp. 4268–82, doi:10.1109/TSP.2020.3010355.

Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.”10.1145/3332466.3374528__Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61, doi:10.1145/3332466.3374528.

Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.”10.1111/ele.13450__Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 506–17, doi:10.1111/ele.13450.

Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.

Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.”10.1007/978-3-030-36687-2_3__Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.

Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.”10.1145/3350755.3400282__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282.

Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.”10.1145/3332466.3374542__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542.

Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.”10.1145/3350755.3400213__Annual ACM Symposium on Parallelism in Algorithms and Architectures, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:10.1145/3350755.3400213.

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.

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.

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.

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.

Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.”10.1145/3293611.3331633__Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.

Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.”10.1007/s00446-017-0315-1__Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.

Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.”10.5441/002/EDBT.2018.14__Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.

Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”10.1145/3201897__ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:10.1145/3201897.

Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018.

Arbel Raviv, Maya, and Trevor A. Brown. Harnessing Epoch-Based Reclamation for Efficient Range Queries. Vol. 53, no. 1, ACM, 2018, pp. 14–27, doi:10.1145/3178487.3178489.

Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.”10.1073/pnas.1721061115__PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.

Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.”10.1007/s00446-018-0342-6__Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.

Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.

Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.”10.1145/3212734.3212763__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.

Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.”10.1145/3212734.3212798__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.

Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.”10.1145/3212734.3212756__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.

Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.”10.1145/3210377.3210411__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.

Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.”10.1145/3210377.3210406__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.

Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.”10.1145/3212734.3212785__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.

Stojanov, Alen, et al. “Fast Quantized Arithmetic on : Trading Compute for Data Movement.”10.1109/SiPS.2018.8598402__2018 IEEE International Workshop on Signal Processing Systems, vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402.

Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.”10.1137/1.9781611975031.144__Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.

Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.

Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” Advances in Neural Information Processing Systems 31, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.

Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.”10.1145/3143361.3143367__Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.

Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.”10.1145/3087801.3087810__Proceedings of the ACM Symposium on Principles of Distributed Computing, vol. Part 9314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.

Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding. Vol. 2017, Neural Information Processing Systems Foundation, 2017, pp. 1710–21.

Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning Research, vol. 70, ML Research Press, 2017, pp. 4035–43.