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.
122 Publications
2021 | Journal Article | IST-REx-ID: 7939 |
Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2021 | 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 & Applied Mathematics. https://doi.org/10.1137/20m1366502
View
| DOI
2021 | Journal Article | IST-REx-ID: 15267 |
Czumaj, A., & Davies, P. (2021). Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3446383
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 15263 |
Alimisis, F., Orvieto, A., Becigneul, G., & Lucchi, A. (2021). Momentum improves optimization on Riemannian manifolds. In Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (Vol. 130, pp. 1351–1359). San Diego, CA, United States; Virtual: ML Research Press.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 | 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.)