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.
174 Publications
2019 |
Published |
Conference Paper |
IST-REx-ID: 6931 |
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
earlier version | 2019 |
Published |
Conference Paper |
IST-REx-ID: 6933 |
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
2019 |
Published |
Conference Paper |
IST-REx-ID: 6935 |
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 |
Published |
Journal Article |
IST-REx-ID: 6936 |
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 |
Published |
Journal Article |
IST-REx-ID: 6972 |
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 |
Published |
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 |
Published |
Conference Paper |
IST-REx-ID: 7201 |
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 |
Published |
Journal Article |
IST-REx-ID: 7214 |
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 |
Published |
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 |
Published |
Conference Paper |
IST-REx-ID: 7542 |
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 |
Published |
Conference Paper |
IST-REx-ID: 7437 |
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, 2019–June:12481–512. IMLS, 2019.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 5947 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 536 |
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
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 5961
Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM, 2018. https://doi.org/10.1145/3212734.3212798.
View
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 5962 |
Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM, 2018. https://doi.org/10.1145/3212734.3212763.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 5963 |
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM, 2018. https://doi.org/10.1145/3212734.3212756.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 5964 |
Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM, 2018. https://doi.org/10.1145/3212734.3212785.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 5965 |
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM, 2018. https://doi.org/10.1145/3210377.3210411.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 5966 |
Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM, 2018. https://doi.org/10.1145/3210377.3210406.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 6001
Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.
View
| Files available
| DOI