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.

Dan Alistarh

Jiale Chen

Vage Egiazarian

Eldar Kurtic

Ionut-Vlad Modoranu

Mahdi Nikdan

Andrei Panferov

Sergei Pankratov

Ileana Rugina

Erik Schultheis

Soroush Tabesh

Alexandra Volkova

Filipp Zmushko

Sharareh Alipour

Vitalii Aksenov

Trevor Brown

Bapi Chatterjee

Elvir Crncevic

Peter Davies

Alexander Fedorov

Elias Frantar

Janne Korhonen

Roberto Lopez Castro

Ilia Markov

Giorgi Nadiradze

Alexandra Krumes

Joel Rybicki

Mher Safaryan

Sidak Singh

Martin Töpfer

Sokolova, Mariia



170 Publications

2020 | Published | Conference Paper | IST-REx-ID: 8383
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.
View | DOI | WoS
 
2020 | Published | Conference Paper | IST-REx-ID: 8722 | OA
S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 45–61.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 8724 | OA
N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.
[Published Version] View | Files available | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 8725 | OA
V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in 34th International Symposium on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 9631 | OA
V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 9632 | OA
S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2020 | Published | Conference Paper | IST-REx-ID: 7213 | OA
S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
[Submitted Version] View | Files available | DOI | WoS
 
2020 | Published | Journal Article | IST-REx-ID: 7224 | OA
J. Rybicki, N. Abrego, and O. Ovaskainen, “Habitat fragmentation and species diversity in competitive communities,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 506–517, 2020.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2020 | Published | Conference Paper | IST-REx-ID: 7272 | OA
M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306.
[Published Version] View | Download Published Version (ext.)
 
earlier version | 2020 | Published | Conference Paper | IST-REx-ID: 15074 | OA
S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 9415 | OA
M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5533–5543.
[Published Version] View | Files available
 
2020 | Published | Conference Paper | IST-REx-ID: 9198 | OA
A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in Proceedings of the 37th International Conference on Machine Learning, 2020, vol. 119, pp. 8773–8784.
[Published Version] View | Files available | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 5947 | OA
B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM, 2019, pp. 417–418.
View | DOI | WoS
 
2019 | Published | Conference Paper | IST-REx-ID: 6673 | OA
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
earlier version | 2019 | Published | Conference Paper | IST-REx-ID: 6676 | OA
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 6759 | OA
V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6931 | OA
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
[Published Version] View | Files available | DOI | arXiv
 
earlier version | 2019 | Published | Conference Paper | IST-REx-ID: 6933 | OA
K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 6935 | OA
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed