Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M.,  Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online.

Gurel, N. M., Kara, K., Stojanov, A., Smith, T., Lemmin, T., Alistarh, D.-A.,https://doi.org/10.1109/TSP.2020.3010355__Zhang, C. (2020). Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. IEEE.https://doi.org/10.1109/TSP.2020.3010355 

Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., &; Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3332466.3374528 

Rybicki, J., Abrego, N., &; Ovaskainen, O. (2020). Habitat fragmentation and species diversity in competitive communities. Ecology Letters. Wiley.https://doi.org/10.1111/ele.13450 

Konstantinov, N. H., Frantar, E., Alistarh, D.-A., &; Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425). Online: ML Research Press.

Bhatia, S., Chatterjee, B., Nathani, D., &; Kaul, M. (2020). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature.https://doi.org/10.1007/978-3-030-36687-2_3 

Czumaj, A., Davies, P., &; Parter, M. (2020). Graph sparsification for derandomizing massively parallel computation with low space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) (pp. 175–185). Virtual Event, United States: Association for Computing Machinery.https://doi.org/10.1145/3350755.3400282 

Brown, T. A., Prokopec, A., &; Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3332466.3374542 

Alistarh, D.-A., Brown, T. A., &; Singhal, N. (2020). Memory tagging: Minimalist synchronization for scalable concurrent data structures. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 37–49). Virtual Event, United States: Association for Computing Machinery.https://doi.org/10.1145/3350755.3400213 

Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., &; Tsitelov, D. (2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (pp. 423–424). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3332466.3374503 

Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &; Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual, Italy: Association for Computing Machinery.https://doi.org/10.1145/3382734.3405743 

Brandt, S., Keller, B., Rybicki, J., Suomela, J., &; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2020.40 

Faghri, F., Tabrizian, I., Markov, I., Alistarh, D.-A., Roy, D., &; Ramezani-Kebrya, A. (2020). Adaptive gradient quantization for data-parallel SGD. In Advances in Neural Information Processing Systems (Vol. 33). Vancouver, Canada: Neural Information Processing Systems Foundation.

Alistarh, D.-A., Nadiradze, G., &; Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2020.7 

Jelínek, V., &; Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.https://doi.org/10.37236/8096 

Nowak, T., &; Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.DISC.2019.29 

Chatterjee, B., Peri, S., Sa, M., &; Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM.https://doi.org/10.1145/3288599.3288617 

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2019). Lock-free channels for programming via communicating sequential processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (pp. 417–418). Washington, NY, United States: ACM Press.https://doi.org/10.1145/3293883.3297000 

Ovaskainen, O., Rybicki, J., &; Abrego, N. (2019). What can observational data reveal about metacommunity processes? Ecography. Wiley.https://doi.org/10.1111/ecog.04444 

Lenzen, C., &; Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. ACM.https://doi.org/10.1145/3339471