Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.”10.4230/LIPIcs.OPODIS.2019.15__23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.
LibreCat: https://research-explorer.ista.ac.at/record/7605
DOI: 10.4230/LIPIcs.OPODIS.2019.15
arXiv: 1911.06347

Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.”10.1145/3382734.3405751__Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.
LibreCat: https://research-explorer.ista.ac.at/record/7803
DOI: 10.1145/3382734.3405751
arXiv: 2009.06043

Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”10.4230/LIPIcs.DISC.2020.3__34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.
LibreCat: https://research-explorer.ista.ac.at/record/8725
DOI: 10.4230/LIPIcs.DISC.2020.3
arXiv: 2008.01009

Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.
LibreCat: https://research-explorer.ista.ac.at/record/9632
arXiv: 2004.14340

Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.
LibreCat: https://research-explorer.ista.ac.at/record/9631
arXiv: 2002.11505

Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.
LibreCat: https://research-explorer.ista.ac.at/record/9415

Gurel, Nezihe Merve, et al. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.”10.1109/TSP.2020.3010355__IEEE Transactions on Signal Processing, vol. 68, IEEE, 2020, pp. 4268–82, doi:10.1109/TSP.2020.3010355.
LibreCat: https://research-explorer.ista.ac.at/record/8268
DOI: 10.1109/TSP.2020.3010355
WoS: 000562044500001
arXiv: 1802.04907

Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.”10.1145/3332466.3374528__Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61, doi:10.1145/3332466.3374528.
LibreCat: https://research-explorer.ista.ac.at/record/8722
DOI: 10.1145/3332466.3374528
WoS: 000564476500004
arXiv: 1908.04207

Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.”10.1111/ele.13450__Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 506–17, doi:10.1111/ele.13450.
LibreCat: https://research-explorer.ista.ac.at/record/7224
DOI: 10.1111/ele.13450
WoS: 000503625200001

Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.
LibreCat: https://research-explorer.ista.ac.at/record/8724
arXiv: 2002.10384

Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.”10.1007/978-3-030-36687-2_3__Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.
LibreCat: https://research-explorer.ista.ac.at/record/7213
DOI: 10.1007/978-3-030-36687-2_3
WoS: 000843927300003

Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.”10.1145/3350755.3400282__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282.
LibreCat: https://research-explorer.ista.ac.at/record/7802
DOI: 10.1145/3350755.3400282
WoS: 000744436200015
arXiv: 1912.05390

Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.”10.1145/3332466.3374542__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542.
LibreCat: https://research-explorer.ista.ac.at/record/7636
DOI: 10.1145/3332466.3374542
WoS: 000564476500020

Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.”10.1145/3350755.3400213__Annual ACM Symposium on Parallelism in Algorithms and Architectures, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:10.1145/3350755.3400213.
LibreCat: https://research-explorer.ista.ac.at/record/8191
DOI: 10.1145/3350755.3400213
WoS: 000744436200004

Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.”10.1145/3332466.3374503__Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.
LibreCat: https://research-explorer.ista.ac.at/record/7635
DOI: 10.1145/3332466.3374503

Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.”10.1145/3382734.3405743__Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.
LibreCat: https://research-explorer.ista.ac.at/record/8383
DOI: 10.1145/3382734.3405743

Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.”10.4230/LIPIcs.DISC.2020.40__34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi: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, Fartash, et al. “Adaptive Gradient Quantization for Data-Parallel SGD.” Advances in Neural Information Processing Systems, vol. 33, Neural Information Processing Systems Foundation, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/15086
arXiv: 2010.12460

Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”10.4230/LIPIcs.ICALP.2020.7__47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi: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, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”10.37236/8096__Electronic Journal of Combinatorics, vol. 26, no. 3, .17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.
LibreCat: https://research-explorer.ista.ac.at/record/6759
DOI: 10.37236/8096
arXiv: 1808.04148