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.

38 Publications


2020 | Conference Paper | IST-REx-ID: 7272   OA
Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, USENIX ATC 2018, 295–306. USENIX Association, 2020.
View | Download (ext.)
 

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

2019 | Conference Paper | IST-REx-ID: 6673
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.
View | DOI
 

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

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 66, no. 5 (2019). https://doi.org/10.1145/3339471.
View | Files available | DOI | 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
 

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 Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11725:317–33. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29400-7_23.
View | DOI
 

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
 

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

2019 | Journal Article | IST-REx-ID: 7224   OA
Rybicki, Joel, Nerea Abrego, and Otso Ovaskainen. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters, 2019. https://doi.org/10.1111/ele.13450.
View | DOI | Download (ext.)
 

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  - STOC 2019, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.
View | DOI | Download (ext.) | 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 fuer Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.
View | Files available | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 6936   OA
Ovaskainen, Otso, Joel Rybicki, and Nerea Abrego. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography 42, no. 11 (2019): 1877–86. https://doi.org/10.1111/ecog.04444.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 7213
Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-36687-2_3.
View | DOI
 

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.
View | DOI | Download (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 26, no. 3 (2019).
View | Files available | 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 20 (2019). https://doi.org/10.1186/s12859-019-3208-4.
View | Files available | DOI
 

2018 | 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 Press, 2018. https://doi.org/10.1145/3212734.3212798.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 5966   OA
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 Press, 2018. https://doi.org/10.1145/3210377.3210406.
View | DOI | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6558   OA
Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, edited by S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Volume 2018:4613–23. Neural Information Processing Systems Foundation, 2018.
View | Download (ext.) | arXiv
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed