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

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
 
2019 | Conference Paper | IST-REx-ID: 7437 | OA
Distributed learning over unreliable networks
C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Powerset convolutional neural networks
C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6676 | OA
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6933 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 536 | OA
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.
[Published Version] View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 7116 | OA
Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study
D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.
[Published Version] View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 6001
ThreadScan: Automatic and scalable memory reclamation
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 7812 | OA
Model compression via distillation and quantization
A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.
[Published Version] View | Files available | arXiv
 

Search

Filter Publications