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.
121 Publications
2021 | Conference Paper | IST-REx-ID: 10218 |
Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10217 |
Alistarh D-A, Gelashvili R, Nadiradze G. 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. doi:10.4230/LIPIcs.DISC.2021.4
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10216 |
Chatterjee B, Peri S, Sa M. 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. doi:10.4230/LIPIcs.DISC.2021.52
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10219 |
Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 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. doi:10.4230/LIPIcs.DISC.2021.58
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10853 |
Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2021:208-220. doi:10.1145/3409964.3461810
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11436 |
Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press; 2021:8209-8216.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11452 |
Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11463 |
Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations of second-order information. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:14873-14886.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11464 |
Alistarh D-A, Korhonen J. Towards tight communication lower bounds for distributed optimisation. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:7254-7266.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9543 |
Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: 9th International Conference on Learning Representations. ; 2021.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9620 |
Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:3-12. doi:10.1007/978-3-030-79527-6_1
[Preprint]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9823 |
Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 11458 |
Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:8557-8570.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 13147 |
Alimisis F, Davies P, Alistarh D-A. Communication-efficient distributed optimization with quantized preconditioners. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:196-206.
[Published Version]
View
| Files available
| arXiv
2021 | Journal Article | IST-REx-ID: 8723 |
Li S, Tal Ben-Nun TB-N, Nadiradze G, et al. Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. 2021;32(7). doi:10.1109/TPDS.2020.3040606
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9827 |
Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 2021;886:27-48. doi:10.1016/j.tcs.2021.06.041
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 9951
Alistarh D-A, Töpfer M, Uznański P. Comparison dynamics in population protocols. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:55-65. doi:10.1145/3465084.3467915
View
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 9935 |
Czumaj A, Davies P, Parter M. Improved deterministic (Δ+1) coloring in low-space MPC. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:469–479. doi:10.1145/3465084.3467937
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 9933 |
Czumaj A, Davies P, Parter M. Component stability in low-space massively parallel computation. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:481–491. doi:10.1145/3465084.3467903
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10432 |
Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10049 |
Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Conference Paper | IST-REx-ID: 10854 |
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10855 |
Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Thesis | IST-REx-ID: 10429 |
Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10435 |
Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 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 | Journal Article | IST-REx-ID: 9541 |
Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 2021;17(2). doi:10.1145/3451992
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 9678 |
Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 8286 |
Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. Algorithmica. 2021. doi:10.1007/s00453-021-00905-9
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9571 |
Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 2021;22(114):1−43.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 7939 |
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. Distributed Computing. 2021;34:463-487. doi:10.1007/s00446-020-00380-5
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 15271
Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. 2021;50(5):1603-1626. doi:10.1137/20m1366502
View
| DOI
2021 | Journal Article | IST-REx-ID: 15267 |
Czumaj A, Davies P. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. 2021;68(2). doi:10.1145/3446383
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 15263 |
Alimisis F, Orvieto A, Becigneul G, Lucchi A. Momentum improves optimization on Riemannian manifolds. In: Proceedings of the 24th International Conference on Artificial Intelligence and Statistics. Vol 130. ML Research Press; 2021:1351-1359.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7272 |
Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.
[Published Version]
View
| Download Published Version (ext.)
2020 | Conference Paper | IST-REx-ID: 7605 |
Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 7803 |
Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751
[Submitted Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8725 |
Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: 34th International Symposium on Distributed Computing. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:10.4230/LIPIcs.DISC.2020.3
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 9632 |
Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9631 |
Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed scheduling. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:22361-22372.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9415 |
Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.
[Published Version]
View
| Files available
2020 | Journal Article | IST-REx-ID: 8268 |
Gurel NM, Kara K, Stojanov A, et al. Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. 2020;68:4268-4282. doi:10.1109/TSP.2020.3010355
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 8722 |
Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 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. Association for Computing Machinery; 2020:45-61. doi:10.1145/3332466.3374528
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Journal Article | IST-REx-ID: 7224 |
Rybicki J, Abrego N, Ovaskainen O. Habitat fragmentation and species diversity in competitive communities. Ecology Letters. 2020;23(3):506-517. doi:10.1111/ele.13450
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 8724 |
Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:5416-5425.
[Published Version]
View
| Files available
| arXiv
2020 | Conference Paper | IST-REx-ID: 7213 |
Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 7802 |
Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). Association for Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 7636 |
Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:276-291. doi:10.1145/3332466.3374542
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2020:37-49. doi:10.1145/3350755.3400213
View
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 7635
Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503
View
| DOI
2020 | Conference Paper | IST-REx-ID: 8383
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:54-56. doi:10.1145/3382734.3405743
View
| DOI