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.




121 Publications

2021 | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh, D.-A., & Davies, P. (2021). Collecting coupons is faster with friends. In Structural Information and Communication Complexity (Vol. 12810, pp. 3–12). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_1
[Preprint] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 9823 | OA
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.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 11458 | OA
Peste, E.-A., Iofinova, E. B., Vladu, A., & Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 8557–8570). Virtual, Online: Curran Associates.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 13147 | OA
Alimisis, F., Davies, P., & Alistarh, D.-A. (2021). Communication-efficient distributed optimization with quantized preconditioners. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 196–206). Virtual: ML Research Press.
[Published Version] View | Files available | arXiv
 
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, S., Tal Ben-Nun, T. B.-N., Nadiradze, G., Girolamo, S. D., Dryden, N., Alistarh, D.-A., & Hoefler, T. (2021). Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging. IEEE Transactions on Parallel and Distributed Systems. IEEE. https://doi.org/10.1109/TPDS.2020.3040606
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Journal Article | IST-REx-ID: 9827 | OA
Chatterjee, B., Walulya, I., & Tsigas, P. (2021). Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2021.06.041
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 9951
Alistarh, D.-A., Töpfer, M., & Uznański, P. (2021). Comparison dynamics in population protocols. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 55–65). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3465084.3467915
View | DOI | WoS
 
2021 | Conference Paper | IST-REx-ID: 9935 | OA
Czumaj, A., Davies, P., & Parter, M. (2021). Improved deterministic (Δ+1) coloring in low-space MPC. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 469–479). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3465084.3467937
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 9933 | OA
Czumaj, A., Davies, P., & Parter, M. (2021). Component stability in low-space massively parallel computation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 481–491). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3465084.3467903
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

Search

Filter Publications