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.
156 Publications
2021 | Published | Conference Paper | IST-REx-ID: 11452 |

Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10432 |

Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10049 |

Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 11458 |

Krumes, Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” 35th Conference on Neural Information Processing Systems, vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 8557–70.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 11463 |

Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” 35th Conference on Neural Information Processing Systems, vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 14873–86.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 11464 |

Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” 35th Conference on Neural Information Processing Systems, vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 7254–66.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 15271
Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.” SIAM Journal on Computing, vol. 50, no. 5, Society for Industrial and Applied Mathematics, 2021, pp. 1603–26, doi:10.1137/20m1366502.
View
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10219 |

Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10217 |

Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” 35th International Symposium on Distributed Computing, vol. 209, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.4.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10216 |

Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” 35th International Symposium on Distributed Computing, vol. 209, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.52.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Thesis | IST-REx-ID: 10429 |

Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
[Published Version]
View
| Files available
| DOI
2021 | Published | Journal Article | IST-REx-ID: 10180 |

Hoefler, Torsten, et al. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” Journal of Machine Learning Research, vol. 22, no. 241, ML Research Press, 2021, pp. 1–124.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 13147 |

Alimisis, Foivos, et al. “Communication-Efficient Distributed Optimization with Quantized Preconditioners.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 196–206.
[Published Version]
View
| Files available
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 8723 |

Li, Shigang, et al. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 7, 9271898, IEEE, 2021, doi:10.1109/TPDS.2020.3040606.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9543 |

Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” 9th International Conference on Learning Representations, 2021.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9571 |

Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43.
[Published Version]
View
| Files available
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9620 |

Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.
[Preprint]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:10.1145/3350755.3400213.
View
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8383
Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.
View
| DOI
2020 | Conference Paper | IST-REx-ID: 9415 |

Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.
[Published Version]
View
| Files available