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
Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM. https://doi.org/10.1145/3288599.3288617
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6673
Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3323165.3323201
View | DOI
 

2019 | 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. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633
View | DOI | Download (ext.) | arXiv
 

2019 | 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). https://doi.org/10.1145/3339471
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7122
Khirirat, S., Johansson, M., & Alistarh, D.-A. (2019). Gradient compression for communication-limited convex optimization. In 2018 IEEE Conference on Decision and Control. Miami Beach, FL, United States: IEEE. https://doi.org/10.1109/cdc.2018.8619625
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 7228
Koval, N., Alistarh, D.-A., & Elizarov, R. (2019). 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) (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-29400-7_23
View | DOI
 

2019 | Conference Poster | IST-REx-ID: 6485
Koval, N., Alistarh, D.-A., & Elizarov, R. (2019). Lock-free channels for programming via communicating sequential processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (pp. 417–418). Washington, NY, United States: ACM Press. https://doi.org/10.1145/3293883.3297000
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 6935   OA
Foerster, K.-T., Korhonen, J., Rybicki, J., & Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331581
View | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7224   OA
Rybicki, J., Abrego, N., & Ovaskainen, O. (2019). Habitat fragmentation and species diversity in competitive communities. Ecology Letters. https://doi.org/10.1111/ele.13450
View | DOI | Download (ext.)
 

2019 | Conference Paper | IST-REx-ID: 6676   OA
Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2019). Why extension-based proofs fail. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019 (pp. 986–996). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3313276.3316407
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6931   OA
Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29
View | Files available | DOI | arXiv
 

2019 | 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. https://doi.org/10.1111/ecog.04444
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 7213
Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2019). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3
View | DOI
 

2019 | 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. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. Denver, CO, Unites States: ACM. https://doi.org/10.1145/3295500.3356222
View | DOI | Download (ext.) | arXiv
 

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

2019 | Journal Article | IST-REx-ID: 7214   OA
Aganezov, S., Zban, I., Aksenov, V., Alexeev, N., & Schatz, M. C. (2019). Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics, 20. https://doi.org/10.1186/s12859-019-3208-4
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 5961
Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798
View | DOI
 

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

2018 | Conference Paper | IST-REx-ID: 6558   OA
Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine Stochastic Gradient Descent. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds.), Advances in Neural Information Processing Systems (Vol. Volume 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.
View | Download (ext.) | arXiv
 

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

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed