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.




156 Publications

2019 | Published | Conference Paper | IST-REx-ID: 7122
Khirirat S, Johansson M, Alistarh D-A. 2019. Gradient compression for communication-limited convex optimization. 2018 IEEE Conference on Decision and Control. CDC: Conference on Decision and Control, 8619625.
View | DOI | WoS
 
2019 | Published | Journal Article | IST-REx-ID: 7214 | OA
Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. 2019. Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics. 20, 641.
[Published Version] View | Files available | DOI | WoS
 
2019 | Published | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. 2019. Scalable FIFO channels for programming via communicating sequential processes. 25th Anniversary of Euro-Par. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11725, 317–333.
View | DOI | WoS
 
2019 | Published | Conference Poster | IST-REx-ID: 6485
Koval N, Alistarh D-A, Elizarov R. 2019. Lock-free channels for programming via communicating sequential processes, ACM,p.
View | DOI | WoS
 
2019 | Published | Conference Paper | IST-REx-ID: 7542 | OA
Wendler C, Alistarh D-A, Püschel M. 2019. Powerset convolutional neural networks. NIPS: Conference on Neural Information Processing Systems vol. 32, 927–938.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 6972 | OA
Lenzen C, Rybicki J. 2019. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 66(5), 32.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen O, Rybicki J, Abrego N. 2019. What can observational data reveal about metacommunity processes? Ecography. 42(11), 1877–1886.
[Published Version] View | Files available | DOI | WoS
 
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
Foerster K-T, Korhonen J, Rybicki J, Schmid S. 2019. Does preprocessing help under congestion? Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2019. Why extension-based proofs fail. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 986–996.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 6759 | OA
Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6931 | OA
Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 7201 | OA
Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. 2019. SparCML: High-performance sparse communication for machine learning. International Conference for High Performance Computing, Networking, Storage and Analysis, SC. SC: Conference for High Performance Computing, Networking, Storage and Analysis, a11.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Journal Article | IST-REx-ID: 6001
Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.
View | Files available | DOI
 
2018 | Published | Conference Paper | IST-REx-ID: 6031
Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.
View | DOI | WoS
 
2018 | Published | Conference Paper | IST-REx-ID: 6558 | OA
Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 7116 | OA
Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.
[Published Version] View | Files available | DOI
 
2018 | Published | Conference Paper | IST-REx-ID: 7123 | OA
Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 397
Arbel Raviv M, Brown TA. 2018. Harnessing epoch-based reclamation for efficient range queries. PPoPP: Principles and Practice of Parallel Programming, PPoPP, vol. 53, 14–27.
View | DOI | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed