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.




118 Publications

2021 | Conference Paper | IST-REx-ID: 9620 | OA
Collecting coupons is faster with friends
D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.
[Preprint] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Wait-free approximate agreement on graphs
D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 11458 | OA
AC/DC: Alternating Compressed/DeCompressed training of deep neural networks
E.-A. Peste, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 8557–8570.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 13147 | OA
Communication-efficient distributed optimization with quantized preconditioners
F. Alimisis, P. Davies, D.-A. Alistarh, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 196–206.
[Published Version] View | Files available | arXiv
 
2021 | Journal Article | IST-REx-ID: 8723 | OA
Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging
S. Li, T.B.-N. Tal Ben-Nun, G. Nadiradze, S.D. Girolamo, N. Dryden, D.-A. Alistarh, T. Hoefler, IEEE Transactions on Parallel and Distributed Systems 32 (2021).
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 9827 | OA
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science 886 (2021) 27–48.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 9951
Comparison dynamics in population protocols
D.-A. Alistarh, M. Töpfer, P. Uznański, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 55–65.
View | DOI | WoS
 
2021 | Conference Paper | IST-REx-ID: 9935 | OA
Improved deterministic (Δ+1) coloring in low-space MPC
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 469–479.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 9933 | OA
Component stability in low-space massively parallel computation
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 481–491.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Elastic consistency: A practical consistency model for distributed stochastic gradient descent
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2021 | Conference Paper | IST-REx-ID: 10854 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 10855 | OA
Input-dynamic distributed algorithms for communication networks
K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Thesis | IST-REx-ID: 10429 | OA
On achieving scalability through relaxation
G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Asynchronous decentralized SGD with quantized and local updates
G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, 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 | OA
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9678 | OA
Efficient load-balancing through distributed token dropping
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 8286 | OA
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 9571 | OA
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Journal Article | IST-REx-ID: 7939 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 15271
Simple, deterministic, constant-round coloring in congested clique and MPC
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Getting to the root of concurrent binary search tree performance
M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
[Published Version] View | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7605 | OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7803 | OA
Simple, deterministic, constant-round coloring in the congested clique
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.
[Submitted Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8725 | OA
The splay-list: A distribution-adaptive concurrent skip-list
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9632 | OA
WoodFisher: Efficient second-order approximation for neural network compression
S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Scalable belief propagation via relaxed scheduling
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9415 | OA
Inducing and exploiting activation sparsity for fast neural network inference
M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.
[Published Version] View | Files available
 
2020 | Journal Article | IST-REx-ID: 8268 | OA
Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications
N.M. Gurel, K. Kara, A. Stojanov, T. Smith, T. Lemmin, D.-A. Alistarh, M. Puschel, C. Zhang, IEEE Transactions on Signal Processing 68 (2020) 4268–4282.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8722 | OA
Taming unbalanced training workloads in deep learning with partial collective operations
S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Journal Article | IST-REx-ID: 7224 | OA
Habitat fragmentation and species diversity in competitive communities
J. Rybicki, N. Abrego, O. Ovaskainen, Ecology Letters 23 (2020) 506–517.
[Published Version] View | Files available | DOI | WoS
 
2020 | Conference Paper | IST-REx-ID: 8724 | OA
On the sample complexity of adversarial multi-source PAC learning
N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.
[Published Version] View | Files available | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7213 | OA
A persistent homology perspective to the link prediction problem
S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2020, pp. 27–39.
[Submitted Version] View | Files available | DOI | WoS
 
2020 | Conference Paper | IST-REx-ID: 7802 | OA
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing Machinery, 2020, pp. 175–185.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7636 | OA
Non-blocking interpolation search trees with doubly-logarithmic running time
T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
2020 | Conference Paper | IST-REx-ID: 8191
Memory tagging: Minimalist synchronization for scalable concurrent data structures
D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2020, pp. 37–49.
View | DOI | WoS
 
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–424.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 8383
Brief Announcement: Why Extension-Based Proofs Fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 15074 | OA
Brief announcement: Efficient load-balancing through distributed token dropping
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6759 | OA
On grounded L-graphs and their relatives
V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
[Published Version] View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6931 | OA
Byzantine approximate agreement on graphs
T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 5947 | OA
A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries
B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI | WoS
 
2019 | Journal Article | IST-REx-ID: 6936 | OA
What can observational data reveal about metacommunity processes?
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
[Published Version] View | Files available | DOI | WoS
 
2019 | Journal Article | IST-REx-ID: 6972 | OA
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7122
Gradient compression for communication-limited convex optimization
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.
View | DOI | WoS
 
2019 | Conference Paper | IST-REx-ID: 7201 | OA
SparCML: High-performance sparse communication for machine learning
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 7214 | OA
Recovering rearranged cancer chromosomes from karyotype graphs
S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics 20 (2019).
[Published Version] View | Files available | DOI | WoS
 
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, 25th Anniversary of Euro-Par, Springer Nature, 2019, pp. 317–333.
View | DOI | WoS
 

Search

Filter Publications