Please note that IST 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.

37 Publications


2019 | Conference Paper | IST-REx-ID: 5947   OA
Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
View | DOI | Download (ext.) | arXiv
 

2019 | 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.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 6933   OA
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.
View | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6972   OA
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.
View | Files available | DOI | arXiv
 

2019 | 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
 

2019 | Conference Paper | IST-REx-ID: 7228
Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11725, Springer Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.
View | DOI
 

2019 | 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
 

2019 | Conference Paper | IST-REx-ID: 6935   OA
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.
View | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7224   OA
Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters, Wiley, 2019, doi:10.1111/ele.13450.
View | DOI | Download (ext.)
 

2019 | Conference Paper | IST-REx-ID: 6676   OA
Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 986–96, doi:10.1145/3313276.3316407.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6931   OA
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
View | Files available | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 6936   OA
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.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 7213
Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2019, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 7201   OA
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.
View | DOI | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6759   OA
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.
View | Files available | arXiv
 

2019 | Journal Article | IST-REx-ID: 7214   OA
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.
View | Files available | DOI
 

2018 | 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
 

2018 | Conference Paper | IST-REx-ID: 5966   OA
Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” 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.
View | DOI | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6558   OA
Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, edited by S. Bengio et al., vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.
View | Download (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6589   OA
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, 2018, pp. 5973–83.
View | Download (ext.) | arXiv
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed