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.




47 Publications

2020 | Journal Article | IST-REx-ID: 7224 | OA
Habitat fragmentation and species diversity in competitive communities
J. Rybicki, N. Abrego, O. Ovaskainen, Ecology Letters 23 (2020) 506–517.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 7272 | OA
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 Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7605 | OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 423–424.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 7636
Non-blocking interpolation search trees with doubly-logarithmic running time
T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 276–291.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 7802 | OA
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing Machinery, n.d.
View | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7803
Simple, deterministic, constant-round coloring in the congested clique
A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020), Association for Computing Machinery, n.d.
View
 
2020 | Journal Article | IST-REx-ID: 7939 | OA
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing (2020).
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 5947 | OA
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 Preprint (ext.) | arXiv
 
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
 
2019 | Conference Paper | IST-REx-ID: 6673 | OA
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 | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6676 | OA
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 Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6759 | OA
On grounded L-graphs and their relatives
V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
View | Files available | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6931 | OA
Byzantine approximate agreement on graphs
T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6933 | OA
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 | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6935 | OA
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 Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6936 | OA
What can observational data reveal about metacommunity processes?
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6972 | OA
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
 
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
 
2019 | Conference Paper | IST-REx-ID: 7201 | OA
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 Preprint (ext.) | arXiv
 

Search

Filter Publications