Please note that IST 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.

37 Publications


2019 | 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.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6673
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
View | DOI
 

2019 | 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.
View | DOI | Download (ext.) | arXiv
 

2019 | 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, 2019.
View | Files available | DOI | arXiv
 

2019 | 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
 

2019 | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI
 

2019 | 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
 

2019 | 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.
View | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7224   OA
J. Rybicki, N. Abrego, and O. Ovaskainen, “Habitat fragmentation and species diversity in competitive communities,” Ecology Letters, 2019.
View | DOI | Download (ext.)
 

2019 | 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  - STOC 2019, Phoenix, AZ, United States, 2019, pp. 986–996.
View | DOI | Download (ext.) | arXiv
 

2019 | 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.
View | Files available | DOI | arXiv
 

2019 | 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, pp. 1877–1886, 2019.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 7213
S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, 2019, vol. 881, pp. 27–39.
View | DOI
 

2019 | 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.
View | DOI | Download (ext.) | arXiv
 

2019 | 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, 2019.
View | Files available | arXiv
 

2019 | 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, 2019.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 5961
D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 5966   OA
D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
View | DOI | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6558   OA
D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine Stochastic Gradient Descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. Volume 2018, pp. 4613–4623.
View | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6589   OA
D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.
View | Download (ext.) | arXiv
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed