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.

121 Publications


2020 | Conference Paper | IST-REx-ID: 15074 | OA
Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 15086 | OA
Faghri, Fartash , Iman Tabrizian, Ilia Markov, Dan-Adrian Alistarh, Daniel Roy, and Ali Ramezani-Kebrya. “Adaptive Gradient Quantization for Data-Parallel SGD.” In Advances in Neural Information Processing Systems, Vol. 33. Neural Information Processing Systems Foundation, 2020.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6759 | OA
Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6931 | OA
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 5947 | OA
Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” In ACM International Conference Proceeding Series, 168–77. ACM, 2019. https://doi.org/10.1145/3288599.3288617.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Poster | IST-REx-ID: 6485
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. Lock-Free Channels for Programming via Communicating Sequential Processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. ACM Press, 2019. https://doi.org/10.1145/3293883.3297000.
View | DOI | WoS
 

2019 | Journal Article | IST-REx-ID: 6936 | OA
Ovaskainen, Otso, Joel Rybicki, and Nerea Abrego. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography. Wiley, 2019. https://doi.org/10.1111/ecog.04444.
[Published Version] View | Files available | DOI | WoS
 

2019 | Journal Article | IST-REx-ID: 6972 | OA
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3339471.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7122
Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In 2018 IEEE Conference on Decision and Control. IEEE, 2019. https://doi.org/10.1109/cdc.2018.8619625.
View | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 7201 | OA
Renggli, Cedric, Saleh Ashkboos, Mehdi Aghagolzadeh, Dan-Adrian Alistarh, and Torsten Hoefler. “SparCML: High-Performance Sparse Communication for Machine Learning.” In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM, 2019. https://doi.org/10.1145/3295500.3356222.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Journal Article | IST-REx-ID: 7214 | OA
Aganezov, Sergey, Ilya Zban, Vitalii Aksenov, Nikita Alexeev, and Michael C. Schatz. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” BMC Bioinformatics. BMC, 2019. https://doi.org/10.1186/s12859-019-3208-4.
[Published Version] View | Files available | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 7228
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” In 25th Anniversary of Euro-Par, 11725:317–33. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29400-7_23.
View | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 7437 | OA
Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512. IMLS, 2019.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7542 | OA
Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, Klaus-Tycho, Janne Korhonen, Joel Rybicki, and Stefan Schmid. “Does Preprocessing Help under Congestion?” In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 259–61. ACM, 2019. https://doi.org/10.1145/3293611.3331581.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, 74–83. ACM, 2019. https://doi.org/10.1145/3293611.3331633.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Journal Article | IST-REx-ID: 536 | OA
Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=DaAl

Search

Filter Publications