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.

Sergei Pankratov

Dan Alistarh

Mahdi Nikdan

Soroush Tabesh

Ionut-Vlad Modoranu

Jiale Chen

Andrei Panferov

Alexandra Volkova

Eldar Kurtic

Vage Egiazarian

Erik Schultheis

Sidak Singh

Joel Rybicki

Alexander Fedorov

Peter Davies

Roberto Lopez Castro

Sokolova, Mariia

Martin Töpfer

Mher Safaryan

Janne Korhonen

Elvir Crncevic

Ilia Markov

Trevor Brown

Vitalii Aksenov

Bapi Chatterjee

Elias Frantar

Sharareh Alipour

Alexandra Krumes

Giorgi Nadiradze



168 Publications

2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
Scalable belief propagation via relaxed scheduling
V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Neural Information Processing Systems Foundation, 2020, pp. 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 9632 | OA
WoodFisher: Efficient second-order approximation for neural network compression
S.P. Singh, D.-A. Alistarh, in:, Neural Information Processing Systems Foundation, 2020, pp. 18098–18109.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 7213 | OA
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, 2020, pp. 27–39.
[Submitted Version] View | Files available | DOI | WoS
 
2020 | Published | 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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2020 | Published | 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 Association, 2020, pp. 295–306.
[Published Version] View | Download Published Version (ext.)
 
2020 | Published | Conference Paper | IST-REx-ID: 7605 | OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 7635 | OA
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, Association for Computing Machinery, 2020, pp. 423–424.
[Published Version] View | DOI | Download Published Version (ext.)
 
2020 | Published | Conference Paper | IST-REx-ID: 7636 | OA
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, Association for Computing Machinery, 2020, pp. 276–291.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
2020 | Published | Conference Paper | IST-REx-ID: 8724 | OA
On the sample complexity of adversarial multi-source PAC learning
N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.
[Published Version] View | Files available | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 9198 | OA
Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks
A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.
[Published Version] View | Files available | arXiv
 
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | 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, 2019.
View | DOI | WoS
 
2019 | Published | 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, 2019, pp. 986–996.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | 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).
[Published Version] View | Files available | DOI | arXiv
 
2019 | Published | 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.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Published | 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | 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.
[Published Version] View | Files available | DOI | WoS
 
2019 | Published | 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).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2019 | Published | 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 | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed