en
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.
39 Publications
2020 | Conference Paper | IST-REx-ID: 7272 
Getting to the root of concurrent binary search tree performance
M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX ATC 2018, USENIX Association, 2020, pp. 295–306.
View
| Download (ext.)
M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX ATC 2018, USENIX Association, 2020, pp. 295–306.
2020 | Journal Article | IST-REx-ID: 7224
Habitat fragmentation and species diversity in competitive communities
J. Rybicki, N. Abrego, O. Ovaskainen, Ecology Letters 23 (2020) 506–517.
View
| Files available
| DOI
J. Rybicki, N. Abrego, O. Ovaskainen, Ecology Letters 23 (2020) 506–517.
2019 | Conference Paper | IST-REx-ID: 5947
A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries
B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177.
View
| DOI
| Download (ext.)
| arXiv
B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177.
2019 | Conference Paper | IST-REx-ID: 6673
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View
| DOI
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
2019 | Conference Paper | IST-REx-ID: 6933
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
View
| DOI
| Download (ext.)
| arXiv
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
2019 | Journal Article | IST-REx-ID: 6972
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
View
| Files available
| DOI
| arXiv
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
2019 | Conference Paper | IST-REx-ID: 7122
Gradient compression for communication-limited convex optimization
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.
View
| DOI
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
View
| DOI
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
2019 | Conference Paper | IST-REx-ID: 7437
Distributed learning over unreliable networks
C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.
View
| Download (ext.)
| arXiv
C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View
| DOI
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
2019 | Conference Paper | IST-REx-ID: 6935
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
View
| DOI
| Download (ext.)
| arXiv
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
2019 | Conference Paper | IST-REx-ID: 6931
Byzantine approximate agreement on graphs
T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, p. 29:1--29:17.
View
| Files available
| DOI
| arXiv
T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, p. 29:1--29:17.
2019 | Journal Article | IST-REx-ID: 6936
What can observational data reveal about metacommunity processes?
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
View
| Files available
| DOI
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
2019 | Conference Paper | IST-REx-ID: 7213
A persistent homology perspective to the link prediction problem
S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2019, pp. 27–39.
View
| DOI
S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2019, pp. 27–39.
2019 | Conference Paper | IST-REx-ID: 7201
SparCML: High-performance sparse communication for machine learning
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.
View
| DOI
| Download (ext.)
| arXiv
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.
2019 | Conference Paper | IST-REx-ID: 6676
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.
View
| DOI
| Download (ext.)
| arXiv
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.
2019 | Journal Article | IST-REx-ID: 6759
On grounded L-graphs and their relatives
V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
View
| Files available
| arXiv
V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
2019 | Journal Article | IST-REx-ID: 7214
Recovering rearranged cancer chromosomes from karyotype graphs
S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics 20 (2019).
View
| Files available
| DOI
S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics 20 (2019).
2018 | Conference Paper | IST-REx-ID: 5961
A brief tutorial on distributed and concurrent machine learning
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.
View
| DOI
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.
2018 | Conference Paper | IST-REx-ID: 5966
The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–392.
View
| DOI
| Download (ext.)
| arXiv
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–392.