Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
117 Publications
2021 | Published | Journal Article | IST-REx-ID: 9571 | 
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.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9620 |
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.
[Preprint]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 9678 |
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.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9823 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | 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, 2021. https://doi.org/10.1016/j.tcs.2021.06.041.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 9933 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9935 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | 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
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10049 |
Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Journal Article | IST-REx-ID: 10180 |
Hoefler, Torsten, Dan-Adrian Alistarh, Tal Ben-Nun, Nikoli Dryden, and Elena-Alexandra Peste. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10216 |
Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.52.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10217 |
Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.4.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10218 |
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.43.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10219 |
Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.58.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Thesis | IST-REx-ID: 10429 |
Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10432 |
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10435 |
Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation, 2021.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10853 |
Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10854 |
Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 71–72. Association for Computing Machinery, 2021. https://doi.org/10.1145/3410220.3453923.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 10855 |
Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery, 2021. https://doi.org/10.1145/3447384.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv