Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
121 Publications
2021 | Journal Article | IST-REx-ID: 15271
Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2021. https://doi.org/10.1137/20m1366502.
View
| DOI
2021 | Journal Article | IST-REx-ID: 15267 | 
Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.” Journal of the ACM. Association for Computing Machinery, 2021. https://doi.org/10.1145/3446383.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 15263 |
Alimisis, Foivos, Antonio Orvieto, Gary Becigneul, and Aurelien Lucchi. “Momentum Improves Optimization on Riemannian Manifolds.” In Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 130:1351–59. ML Research Press, 2021.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7272 |
Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020.
[Published Version]
View
| Download Published Version (ext.)
2020 | Conference Paper | IST-REx-ID: 7605 |
Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 7803 |
Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751.
[Submitted Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8725 |
Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 9632 |
Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9631 |
Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9415 |
Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020.
[Published Version]
View
| Files available