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.




51 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, 2020, pp. 175–185.
View | DOI | Download Preprint (ext.) | arXiv
 
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
 
2020 | Conference Paper | IST-REx-ID: 8191
Memory tagging: Minimalist synchronization for scalable concurrent data structures
D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2020, pp. 37–49.
View | DOI
 
2020 | Journal Article | IST-REx-ID: 8268 | OA
Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications
N.M. Gurel, K. Kara, A. Stojanov, T. Smith, T. Lemmin, D.-A. Alistarh, M. Puschel, C. Zhang, IEEE Transactions on Signal Processing (2020).
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8286 | OA
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8383
Brief Announcement: Why Extension-Based Proofs Fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, ACM, 2020, pp. 54–56.
View | DOI
 
2020 | Conference Paper | IST-REx-ID: 7803 | OA
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, Association for Computing Machinery, 2020, pp. 309–318.
View | Files available | DOI | arXiv
 
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
 
2019 | Journal Article | IST-REx-ID: 7214 | OA
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
 
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
 
2019 | Conference Paper | IST-REx-ID: 7437 | OA
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 Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Powerset convolutional neural networks
C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.
View | Download Preprint (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
 

Search

Display / Sort

Export / Embed