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.
162 Publications
2021 | Published | Conference Paper | IST-REx-ID: 10049 | 
Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy (pp. 268–284). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp40001.2021.00035
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 9823 |
Alistarh, D.-A., Ellen, F., & Rybicki, J. (2021). Wait-free approximate agreement on graphs. In Structural Information and Communication Complexity (Vol. 12810, pp. 87–105). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_6
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 15271
Czumaj, A., Davies, P., & Parter, M. (2021). Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/20m1366502
View
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8191
Alistarh, D.-A., Brown, T. A., & Singhal, N. (2020). Memory tagging: Minimalist synchronization for scalable concurrent data structures. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 37–49). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400213
View
| DOI
| WoS
2020 | Conference Paper | IST-REx-ID: 9415 |
Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online.
[Published Version]
View
| Files available
2020 | Published | Conference Paper | IST-REx-ID: 15074 |
Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8725 |
Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8722 |
Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., & Hoefler, T. (2020). 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 (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374528
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7636 |
Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 15086 |
Faghri, F., Tabrizian, I., Markov, I., Alistarh, D.-A., Roy, D., & Ramezani-Kebrya, A. (2020). Adaptive gradient quantization for data-parallel SGD. In Advances in Neural Information Processing Systems (Vol. 33). Vancouver, Canada: Neural Information Processing Systems Foundation.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7802 |
Czumaj, A., Davies, P., & Parter, M. (2020). Graph sparsification for derandomizing massively parallel computation with low space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) (pp. 175–185). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400282
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7272 |
Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.
[Published Version]
View
| Download Published Version (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 9632 |
Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression (Vol. 33, pp. 18098–18109). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 9631 |
Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling (Vol. 33, pp. 22361–22372). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 7224 |
Rybicki, J., Abrego, N., & Ovaskainen, O. (2020). Habitat fragmentation and species diversity in competitive communities. Ecology Letters. Wiley. https://doi.org/10.1111/ele.13450
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2020 | Published | Conference Paper | IST-REx-ID: 7635 |
Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., & Tsitelov, D. (2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 423–424). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374503
[Published Version]
View
| DOI
| Download Published Version (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 8724 |
Konstantinov, N. H., Frantar, E., Alistarh, D.-A., & Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425). Online: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7213 |
Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2020). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 7605 |
Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 15077 |
Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7
[Published Version]
View
| Files available
| DOI
| arXiv