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

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

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

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

Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”10.4230/LIPICS.DISC.2019.29__33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi: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, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.”10.1145/3288599.3288617__ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
LibreCat: https://research-explorer.ista.ac.at/record/5947
DOI: 10.1145/3288599.3288617
WoS: 000484491600019
arXiv: 1809.00896

Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating Sequential Processes.”10.1145/3293883.3297000__Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, ACM Press, 2019, pp. 417–18, doi:10.1145/3293883.3297000.
LibreCat: https://research-explorer.ista.ac.at/record/6485
DOI: 10.1145/3293883.3297000
WoS: 000587604600044

Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?”10.1111/ecog.04444__Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
LibreCat: https://research-explorer.ista.ac.at/record/6936
DOI: 10.1111/ecog.04444
WoS: 000486348700001

Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.”10.1145/3339471__Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.”10.1109/cdc.2018.8619625__2018 IEEE Conference on Decision and Control, 8619625, IEEE, 2019, doi:10.1109/cdc.2018.8619625.
LibreCat: https://research-explorer.ista.ac.at/record/7122
DOI: 10.1109/cdc.2018.8619625
WoS: 000458114800023

Renggli, Cedric, et al. “SparCML: High-Performance Sparse Communication for Machine Learning.”10.1145/3295500.3356222__International Conference for High Performance Computing, Networking, Storage and Analysis, SC, , ACM, 2019, doi:10.1145/3295500.3356222.
LibreCat: https://research-explorer.ista.ac.at/record/7201
DOI: 10.1145/3295500.3356222
WoS: 000545976800011
arXiv: 1802.08021

Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.”10.1186/s12859-019-3208-4__BMC Bioinformatics, vol. 20, 641, BMC, 2019, doi: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, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.”10.1007/978-3-030-29400-7_23__25th Anniversary of Euro-Par, vol. 11725, Springer Nature, 2019, pp. 317–33, doi: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, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, ICML 2019, vol. 2019–June, IMLS, 2019, pp. 12481–512.
LibreCat: https://research-explorer.ista.ac.at/record/7437
WoS: 000684034307036
arXiv: 1810.07766

Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.”10.1145/3323165.3323201__31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
LibreCat: https://research-explorer.ista.ac.at/record/6673
DOI: 10.1145/3323165.3323201
WoS: 000507618500018
arXiv: 2003.09363

Wendler, Chris, et al. Powerset Convolutional Neural Networks. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.
LibreCat: https://research-explorer.ista.ac.at/record/7542
WoS: 000534424300084
arXiv: 1909.02253

Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?”10.1145/3293611.3331581__Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
LibreCat: https://research-explorer.ista.ac.at/record/6935
DOI: 10.1145/3293611.3331581
WoS: 000570442000037
arXiv: 1905.03012

Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.”10.1145/3313276.3316407__Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–96, doi: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, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.”10.1145/3293611.3331633__Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
LibreCat: https://research-explorer.ista.ac.at/record/6933
DOI: 10.1145/3293611.3331633
WoS: 000570442000011
arXiv: 1903.05956

Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.”10.1007/s00446-017-0315-1__Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.
LibreCat: https://research-explorer.ista.ac.at/record/536
DOI: 10.1007/s00446-017-0315-1

Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.”10.5441/002/EDBT.2018.14__Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.
LibreCat: https://research-explorer.ista.ac.at/record/7116
DOI: 10.5441/002/EDBT.2018.14

Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”10.1145/3201897__ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:10.1145/3201897.
LibreCat: https://research-explorer.ista.ac.at/record/6001
DOI: 10.1145/3201897

Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/7812
arXiv: 1802.05668

Arbel Raviv, Maya, and Trevor A. Brown. Harnessing Epoch-Based Reclamation for Efficient Range Queries. Vol. 53, no. 1, ACM, 2018, pp. 14–27, doi:10.1145/3178487.3178489.
LibreCat: https://research-explorer.ista.ac.at/record/397
DOI: 10.1145/3178487.3178489
WoS: 000446161100002

Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.”10.1073/pnas.1721061115__PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.
LibreCat: https://research-explorer.ista.ac.at/record/43
DOI: 10.1073/pnas.1721061115
WoS: 000447491300057

Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.”10.1007/s00446-018-0342-6__Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.
LibreCat: https://research-explorer.ista.ac.at/record/76
DOI: 10.1007/s00446-018-0342-6
WoS: 000475627800005

Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.
LibreCat: https://research-explorer.ista.ac.at/record/85
DOI: 10.1007/978-3-319-96983-1_33
WoS: 000851042300031

Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.”10.1145/3212734.3212763__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.
LibreCat: https://research-explorer.ista.ac.at/record/5962
DOI: 10.1145/3212734.3212763
WoS: 000458186900022
arXiv: 1803.08841

Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.”10.1145/3212734.3212798__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.
LibreCat: https://research-explorer.ista.ac.at/record/5961
DOI: 10.1145/3212734.3212798
WoS: 000458186900063

Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.”10.1145/3212734.3212756__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.
LibreCat: https://research-explorer.ista.ac.at/record/5963
DOI: 10.1145/3212734.3212756
WoS: 000458186900048
arXiv: 1808.04155

Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.”10.1145/3210377.3210411__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.
LibreCat: https://research-explorer.ista.ac.at/record/5965
DOI: 10.1145/3210377.3210411
WoS: 000545269600016
arXiv: 1804.01018

Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.”10.1145/3210377.3210406__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.
LibreCat: https://research-explorer.ista.ac.at/record/5966
DOI: 10.1145/3210377.3210406
WoS: 000545269600046
arXiv: 1804.00947

Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.”10.1145/3212734.3212785__Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.
LibreCat: https://research-explorer.ista.ac.at/record/5964
DOI: 10.1145/3212734.3212785
WoS: 000458186900052

Stojanov, Alen, et al. “Fast Quantized Arithmetic on : Trading Compute for Data Movement.”10.1109/SiPS.2018.8598402__2018 IEEE International Workshop on Signal Processing Systems, vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402.
LibreCat: https://research-explorer.ista.ac.at/record/6031
DOI: 10.1109/SiPS.2018.8598402
WoS: 000465106800060

Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.”10.1137/1.9781611975031.144__Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.
LibreCat: https://research-explorer.ista.ac.at/record/7123
DOI: 10.1137/1.9781611975031.144
WoS: 000483921200145
arXiv: 1704.04947

Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.
LibreCat: https://research-explorer.ista.ac.at/record/6558
WoS: 000461823304061
arXiv: 1803.08917

Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” Advances in Neural Information Processing Systems 31, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.
LibreCat: https://research-explorer.ista.ac.at/record/6589
WoS: 000461852000047
arXiv: 1809.10505

Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.”10.1145/3143361.3143367__Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.
LibreCat: https://research-explorer.ista.ac.at/record/487
DOI: 10.1145/3143361.3143367

Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.”10.1145/3087801.3087810__Proceedings of the ACM Symposium on Principles of Distributed Computing, vol. Part 9314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.
LibreCat: https://research-explorer.ista.ac.at/record/791
DOI: 10.1145/3087801.3087810
WoS: 000462995000035

Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding. Vol. 2017, Neural Information Processing Systems Foundation, 2017, pp. 1710–21.
LibreCat: https://research-explorer.ista.ac.at/record/431
arXiv: 1610.02132

Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning Research, vol. 70, ML Research Press, 2017, pp. 4035–43.
LibreCat: https://research-explorer.ista.ac.at/record/432