Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
123 Publications
2020 |Published| Conference Paper | IST-REx-ID: 7635
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.
View
| DOI
2020 |Published| Conference Paper | IST-REx-ID: 15074 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 |Published| Conference Paper | IST-REx-ID: 15086 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2020 |Published| Conference Paper | IST-REx-ID: 15077 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6759 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6931 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 5947 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6936 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| WoS
2019 |Published| Journal Article | IST-REx-ID: 6972 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7201 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7214 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| WoS
2019 |Published| Conference Paper | IST-REx-ID: 7437 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6673 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7542 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.
[Published Version]
View
| Download Published Version (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6935 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6676 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv