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, et al. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.” SIAM Journal on Computing, vol. 50, no. 5, Society for Industrial & Applied Mathematics, 2021, pp. 1603–26, doi: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, vol. 68, no. 2, 13, Association for Computing Machinery, 2021, doi:10.1145/3446383.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 15263 |
Alimisis, Foivos, et al. “Momentum Improves Optimization on Riemannian Manifolds.” Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, vol. 130, ML Research Press, 2021, pp. 1351–59.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7272 |
Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
[Published Version]
View
| Download Published Version (ext.)
2020 | Conference Paper | IST-REx-ID: 7605 |
Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 7803 |
Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.
[Submitted Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8725 |
Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” 34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi: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.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9631 |
Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 9415 |
Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.
[Published Version]
View
| Files available