Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
117 Publications
2019 | Published | Conference Poster | IST-REx-ID: 6485
Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating Sequential Processes.” Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, ACM Press, 2019, pp. 417–18, doi:10.1145/3293883.3297000.
View
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 6673 | 
Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6676 |
Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–96, doi:10.1145/3313276.3316407.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6759 |
Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6931 |
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6933 |
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6935 |
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6936 |
Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Published | Journal Article | IST-REx-ID: 6972 |
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7122
Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.” 2018 IEEE Conference on Decision and Control, 8619625, IEEE, 2019, doi:10.1109/cdc.2018.8619625.
View
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 7201 |
Renggli, Cedric, et al. “SparCML: High-Performance Sparse Communication for Machine Learning.” International Conference for High Performance Computing, Networking, Storage and Analysis, SC, a11, ACM, 2019, doi:10.1145/3295500.3356222.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7214 |
Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” BMC Bioinformatics, vol. 20, 641, BMC, 2019, doi:10.1186/s12859-019-3208-4.
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 7228
Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” 25th Anniversary of Euro-Par, vol. 11725, Springer Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.
View
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 7437 |
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.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7542 |
Wendler, Chris, et al. Powerset Convolutional Neural Networks. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.
[Published Version]
View
| Download Published Version (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 397
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.
View
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 43 |
Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” PNAS, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:10.1073/pnas.1721061115.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 536 |
Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 5961
Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.
View
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 5962 |
Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv