Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

117 Publications


2019 | Published | Conference Paper | IST-REx-ID: 6676 | OA
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6759 | OA
V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6931 | OA
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6936 | OA
O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal about metacommunity processes?,” Ecography, vol. 42, no. 11. Wiley, pp. 1877–1886, 2019.
[Published Version] View | Files available | DOI | WoS
 

2019 | Published | Journal Article | IST-REx-ID: 6972 | OA
C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 7122
S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in 2018 IEEE Conference on Decision and Control, Miami Beach, FL, United States, 2019.
View | DOI | WoS
 

2019 | Published | Conference Paper | IST-REx-ID: 7201 | OA
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, and T. Hoefler, “SparCML: High-performance sparse communication for machine learning,” in International Conference for High Performance Computing, Networking, Storage and Analysis, SC, Denver, CO, Unites States, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 7214 | OA
S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, and M. C. Schatz, “Recovering rearranged cancer chromosomes from karyotype graphs,” BMC Bioinformatics, vol. 20. BMC, 2019.
[Published Version] View | Files available | DOI | WoS
 

2019 | Published | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in 25th Anniversary of Euro-Par, Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI | WoS
 

2019 | Published | Conference Paper | IST-REx-ID: 7437 | OA
C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 7542 | OA
C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 5947 | OA
B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 7812 | OA
A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.
[Published Version] View | Files available | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 85 | OA
E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.
[Preprint] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 7116 | OA
D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “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, Vienna, Austria, 2018, pp. 145–156.
[Published Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 7123 | OA
D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 76 | OA
C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.
[Published Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed