Alistarh, D.-A., Brown, T. A., Kopinsky, J., &; Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM Press.https://doi.org/10.1145/3212734.3212756 

Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., &; Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM Press.https://doi.org/10.1145/3210377.3210411 

Alistarh, D.-A., Haider, S. K., Kübler, R., &; Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM Press.https://doi.org/10.1145/3210377.3210406 

Aksenov, V., Alistarh, D.-A., &; Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press.https://doi.org/10.1145/3212734.3212785 

Stojanov, A., Smith, T. M., Alistarh, D.-A., &; Puschel, M. (2018). Fast quantized arithmetic on : Trading compute for data movement. In 2018 IEEE International Workshop on Signal Processing Systems (Vol. 2018–October). Cape Town, South Africa: IEEE.https://doi.org/10.1109/SiPS.2018.8598402 

Alistarh, D.-A., Aspnes, J., &; Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM.https://doi.org/10.1137/1.9781611975031.144 

Alistarh, D.-A., Allen-Zhu, Z., &; Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.

Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., &; Renggli, C. (2018). The convergence of sparsified gradient methods. In Advances in Neural Information Processing Systems 31 (Vol. Volume 2018, pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.

Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., &; Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM.https://doi.org/10.1145/3143361.3143367 

Alistarh, D.-A., Kopinsky, J., Li, J., &; Nadiradze, G. (2017). The power of choice in priority scheduling. In Proceedings of the ACM Symposium on Principles of Distributed Computing (Vol. Part 9314, pp. 283–292). Washington, WA, USA: ACM.https://doi.org/10.1145/3087801.3087810 

Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., &; Vojnovi, M. (2017). QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol. 2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States: Neural Information Processing Systems Foundation.

Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., &; Zhang, C. (2017). ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In Proceedings of Machine Learning Research (Vol. 70, pp. 4035–4043). Sydney, Australia: ML Research Press.