S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.
LibreCat: https://research-explorer.ista.ac.at/record/7213
DOI: 10.1007/978-3-030-36687-2_3
WoS: 000843927300003

A. Czumaj, P. Davies, and M. Parter, “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), Virtual Event, United States, 2020, no. 7, pp. 175–185.
LibreCat: https://research-explorer.ista.ac.at/record/7802
DOI: 10.1145/3350755.3400282
WoS: 000744436200015
arXiv: 1912.05390

T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291.
LibreCat: https://research-explorer.ista.ac.at/record/7636
DOI: 10.1145/3332466.3374542
WoS: 000564476500020

D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.
LibreCat: https://research-explorer.ista.ac.at/record/8191
DOI: 10.1145/3350755.3400213
WoS: 000744436200004

N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
LibreCat: https://research-explorer.ista.ac.at/record/7635
DOI: 10.1145/3332466.3374503

D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.
LibreCat: https://research-explorer.ista.ac.at/record/8383
DOI: 10.1145/3382734.3405743

S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.
LibreCat: https://research-explorer.ista.ac.at/record/15074
DOI: 10.4230/LIPIcs.DISC.2020.40
arXiv: 2005.07761

F. Faghri, I. Tabrizian, I. Markov, D.-A. Alistarh, D. Roy, and A. Ramezani-Kebrya, “Adaptive gradient quantization for data-parallel SGD,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33.
LibreCat: https://research-explorer.ista.ac.at/record/15086
arXiv: 2010.12460

D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168.
LibreCat: https://research-explorer.ista.ac.at/record/15077
DOI: 10.4230/LIPIcs.ICALP.2020.7
arXiv: 2003.09297

V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148

T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.
LibreCat: https://research-explorer.ista.ac.at/record/6931
DOI: 10.4230/LIPICS.DISC.2019.29
arXiv: 1908.02743

B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
LibreCat: https://research-explorer.ista.ac.at/record/5947
DOI: 10.1145/3288599.3288617
WoS: 000484491600019
arXiv: 1809.00896

N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
LibreCat: https://research-explorer.ista.ac.at/record/6485
DOI: 10.1145/3293883.3297000
WoS: 000587604600044

O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal about metacommunity processes?,” Ecography, vol. 42, no. 11. Wiley, pp. 1877–1886, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6936
DOI: 10.1111/ecog.04444
WoS: 000486348700001

C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

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

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

S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, and M. C. Schatz, “Recovering rearranged cancer chromosomes from karyotype graphs,” BMC Bioinformatics, vol. 20. BMC, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7214
DOI: 10.1186/s12859-019-3208-4
WoS: 000511618800007

N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in 25th Anniversary of Euro-Par, Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
LibreCat: https://research-explorer.ista.ac.at/record/7228
DOI: 10.1007/978-3-030-29400-7_23
WoS: 000851061400023

C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.
LibreCat: https://research-explorer.ista.ac.at/record/7437
WoS: 000684034307036
arXiv: 1810.07766