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.




121 Publications

2020 | Conference Paper | IST-REx-ID: 15074 | OA
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 | Conference Paper | IST-REx-ID: 15077 | OA
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
 
2020 | Conference Paper | IST-REx-ID: 15086 | OA
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
 
2019 | Journal Article | IST-REx-ID: 6759 | OA
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 | Conference Paper | IST-REx-ID: 6931 | OA
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 | Conference Paper | IST-REx-ID: 5947 | OA
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 | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI | WoS
 
2019 | Journal Article | IST-REx-ID: 6936 | OA
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 | Journal Article | IST-REx-ID: 6972 | OA
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 | Conference Paper | IST-REx-ID: 7122
S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in 2018 IEEE Conference on Decision and Control, Miami Beach, FL, United States, 2019.
View | DOI | WoS
 

Search

Filter Publications