Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




68 Publications

2021 | Journal Article | IST-REx-ID: 9541 | OA
Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” ACM Transactions on Algorithms. ACM, 2021. https://doi.org/10.1145/3451992.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 9571 | OA
Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
View | Files available | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9678 | OA
Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 129–39, 2021. https://doi.org/10.1145/3409964.3461785.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In Structural Information and Communication Complexity, 12810:3–12. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_1.
View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 9543 | OA
Davies, Peter, Vijaykrishna Gurunanthan, Niusha Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In 9th International Conference on Learning Representations, 2021.
View | Download Published Version (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 9827
Chatterjee, Bapi, Ivan Walulya, and Philippas Tsigas. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science. Elsevier, n.d. https://doi.org/10.1016/j.tcs.2021.06.041.
View | DOI | Download None (ext.)
 
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_6.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Giorgi Nadiradze, Salvatore Di Girolamo, Nikoli Dryden, Dan-Adrian Alistarh, and Torsten Hoefler. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2021. https://doi.org/10.1109/TPDS.2020.3040606.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9933 | OA
Czumaj, Artur, Peter Davies, and Merav Parter. “Component Stability in Low-Space Massively Parallel Computation.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 481–491. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467903.
View | DOI | Download Submitted Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9935 | OA
Czumaj, Artur, Peter Davies, and Merav Parter. “Improved Deterministic (Δ+1) Coloring in Low-Space MPC.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 469–479. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467937.
View | DOI | Download Submitted Version (ext.)
 
2021 | Conference Paper | IST-REx-ID: 9951
Alistarh, Dan-Adrian, Martin Töpfer, and Przemysław Uznański. “Comparison Dynamics in Population Protocols.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 55–65. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467915.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. ACM, 2020. https://doi.org/10.1145/3350755.3400213.
View | DOI
 
2020 | Journal Article | IST-REx-ID: 8268 | OA
Gurel, Nezihe Merve, Kaan Kara, Alen Stojanov, Tyler Smith, Thomas Lemmin, Dan-Adrian Alistarh, Markus Puschel, and Ce Zhang. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.” IEEE Transactions on Signal Processing. IEEE, 2020. https://doi.org/10.1109/TSP.2020.3010355.
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8383
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. ACM, 2020. https://doi.org/10.1145/3382734.3405743.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 8722 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 45–61. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374528.
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Journal Article | IST-REx-ID: 7224 | OA
Rybicki, Joel, Nerea Abrego, and Otso Ovaskainen. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters. Wiley, 2020. https://doi.org/10.1111/ele.13450.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020.
View | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7635
Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh, and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 423–24. ACM, 2020. https://doi.org/10.1145/3332466.3374503.
View | DOI
 

Search

Filter Publications