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 | 
Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6931 |
Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 5947 |
Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
View
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 6936 |
Ovaskainen O, Rybicki J, Abrego N. What can observational data reveal about metacommunity processes? Ecography. 2019;42(11):1877-1886. doi:10.1111/ecog.04444
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Journal Article | IST-REx-ID: 6972 |
Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 2019;66(5). doi:10.1145/3339471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7122
Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: 2018 IEEE Conference on Decision and Control. IEEE; 2019. doi:10.1109/cdc.2018.8619625
View
| DOI
| WoS
2019 | Conference Paper | IST-REx-ID: 7201 |
Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. SparCML: High-performance sparse communication for machine learning. In: International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM; 2019. doi:10.1145/3295500.3356222
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7214 |
Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics. 2019;20. doi:10.1186/s12859-019-3208-4
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: 25th Anniversary of Euro-Par. Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23
View
| DOI
| WoS
2019 | Conference Paper | IST-REx-ID: 7437 |
Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June. IMLS; 2019:12481-12512.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6673 |
Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7542 |
Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.
[Published Version]
View
| Download Published Version (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6935 |
Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6676 |
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Why extension-based proofs fail. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM Press; 2019:986-996. doi:10.1145/3313276.3316407
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6933 |
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 536 |
Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 7116 |
Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14
[Published Version]
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 6001
Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4). doi:10.1145/3201897
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 7812 |
Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.
[Published Version]
View
| Files available
| arXiv