Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.

Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.”10.4230/LIPIcs.OPODIS.2019.15__23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.

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.

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.