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.

144 Publications


2022 | Published | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.” 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11707 | OA
Balliu, Alkida, et al. “Local Mending.” International Colloquium on Structural Information and Communication Complexity, edited by Merav Parter, vol. 13298, Springer Nature, 2022, pp. 1–20, doi:10.1007/978-3-031-09993-9_1.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 17059 | OA
Frantar, Elias, and Dan-Adrian Alistarh. “SPDY: Accurate Pruning with Speedup Guarantees.” 39th International Conference on Machine Learning, vol. 162, ML Research Press, 2022, pp. 6726–43.
[Published Version] View | Files available | WoS
 

2022 | Published | Conference Paper | IST-REx-ID: 17087 | OA
Frantar, Elias, et al. “Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning.” 36th Conference on Neural Information Processing Systems, vol. 35, ML Research Press, 2022.
[Submitted Version] View | Files available | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 17088 | OA
Kurtic, Eldar, et al. “The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models.” Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, 2022, pp. 4163–81, doi:10.18653/v1/2022.emnlp-main.279.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 12182 | OA
Pacut, Maciej, et al. “Brief Announcement: Temporal Locality in Online Algorithms.” 36th International Symposium on Distributed Computing, vol. 246, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.DISC.2022.52.
[Published Version] View | Files available | DOI
 

2022 | Published | Conference Paper | IST-REx-ID: 12780 | OA
Markov, Ilia, et al. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–54, doi:10.1145/3528535.3565248.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova, Anastasiia, et al. Multi-Queues Can Be State-of-the-Art Priority Schedulers. Zenodo, 2022, doi:10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2022 | Published | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 12299 | OA
Iofinova, Eugenia B., et al. “How Well Do Sparse ImageNet Models Transfer?” 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Institute of Electrical and Electronics Engineers, 2022, pp. 12256–66, doi:10.1109/cvpr52688.2022.01195.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Published | Journal Article | IST-REx-ID: 11420 | OA
Shevchenko, Alexander, et al. “Mean-Field Analysis of Piecewise Linear Solutions for Wide ReLU Networks.” Journal of Machine Learning Research, vol. 23, no. 130, Journal of Machine Learning Research, 2022, pp. 1–55.
[Published Version] View | Files available | arXiv
 

2021 | Published | Thesis | IST-REx-ID: 10429 | OA
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 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
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 | Journal Article | IST-REx-ID: 10180 | OA
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, Journal of Machine Learning Research, 2021, pp. 1–124.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
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 | Conference Paper | IST-REx-ID: 10217 | OA
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: 10218 | OA
Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.” 35th International Symposium on Distributed Computing, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.43.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
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
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed