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 
LibreCat: https://research-explorer.ista.ac.at/record/8383
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/15074
DOI: 10.4230/LIPIcs.DISC.2020.40
arXiv: 2005.07761

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.
LibreCat: https://research-explorer.ista.ac.at/record/15086
arXiv: 2010.12460

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 
LibreCat: https://research-explorer.ista.ac.at/record/15077
DOI: 10.4230/LIPIcs.ICALP.2020.7
arXiv: 2003.09297

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 
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148

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 
LibreCat: https://research-explorer.ista.ac.at/record/6931
DOI: 10.4230/LIPICS.DISC.2019.29
arXiv: 1908.02743

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 
LibreCat: https://research-explorer.ista.ac.at/record/5947
DOI: 10.1145/3288599.3288617
WoS: 000484491600019
arXiv: 1809.00896

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 
LibreCat: https://research-explorer.ista.ac.at/record/6485
DOI: 10.1145/3293883.3297000
WoS: 000587604600044

Ovaskainen, O., Rybicki, J., &; Abrego, N. (2019). What can observational data reveal about metacommunity processes? Ecography. Wiley.https://doi.org/10.1111/ecog.04444 
LibreCat: https://research-explorer.ista.ac.at/record/6936
DOI: 10.1111/ecog.04444
WoS: 000486348700001

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 
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

Khirirat, S., Johansson, M., &; Alistarh, D.-A. (2019). Gradient compression for communication-limited convex optimization. In 2018 IEEE Conference on Decision and Control. Miami Beach, FL, United States: IEEE.https://doi.org/10.1109/cdc.2018.8619625 
LibreCat: https://research-explorer.ista.ac.at/record/7122
DOI: 10.1109/cdc.2018.8619625
WoS: 000458114800023

Renggli, C., Ashkboos, S., Aghagolzadeh, M., Alistarh, D.-A., &; Hoefler, T. (2019). SparCML: High-performance sparse communication for machine learning. In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. Denver, CO, Unites States: ACM.https://doi.org/10.1145/3295500.3356222 
LibreCat: https://research-explorer.ista.ac.at/record/7201
DOI: 10.1145/3295500.3356222
WoS: 000545976800011
arXiv: 1802.08021

Aganezov, S., Zban, I., Aksenov, V., Alexeev, N., &; Schatz, M. C. (2019). Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics. BMC.https://doi.org/10.1186/s12859-019-3208-4 
LibreCat: https://research-explorer.ista.ac.at/record/7214
DOI: 10.1186/s12859-019-3208-4
WoS: 000511618800007

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2019). Scalable FIFO channels for programming via communicating sequential processes. In 25th Anniversary of Euro-Par (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-29400-7_23 
LibreCat: https://research-explorer.ista.ac.at/record/7228
DOI: 10.1007/978-3-030-29400-7_23
WoS: 000851061400023

Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A.,  Liu, J. (2019). Distributed learning over unreliable networks. In 36th International Conference on Machine Learning, ICML 2019 (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.
LibreCat: https://research-explorer.ista.ac.at/record/7437
WoS: 000684034307036
arXiv: 1810.07766

Alistarh, D.-A., Nadiradze, G., &; Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM Press.https://doi.org/10.1145/3323165.3323201 
LibreCat: https://research-explorer.ista.ac.at/record/6673
DOI: 10.1145/3323165.3323201
WoS: 000507618500018
arXiv: 2003.09363

Wendler, C., Alistarh, D.-A., &; Püschel, M. (2019). Powerset convolutional neural networks (Vol. 32, pp. 927–938). Presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.
LibreCat: https://research-explorer.ista.ac.at/record/7542
WoS: 000534424300084
arXiv: 1909.02253

Foerster, K.-T., Korhonen, J., Rybicki, J., &; Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM.https://doi.org/10.1145/3293611.3331581 
LibreCat: https://research-explorer.ista.ac.at/record/6935
DOI: 10.1145/3293611.3331581
WoS: 000570442000037
arXiv: 1905.03012

Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &; Zhu, L. (2019). Why extension-based proofs fail. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 986–996). Phoenix, AZ, United States: ACM Press.https://doi.org/10.1145/3313276.3316407 
LibreCat: https://research-explorer.ista.ac.at/record/6676
DOI: 10.1145/3313276.3316407
WoS: 000523199100089
arXiv: 1811.01421

Censor-Hillel, K., Dory, M., Korhonen, J., &; Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM.https://doi.org/10.1145/3293611.3331633 
LibreCat: https://research-explorer.ista.ac.at/record/6933
DOI: 10.1145/3293611.3331633
WoS: 000570442000011
arXiv: 1903.05956