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.
152 Publications
2022 | Published | Conference Paper | IST-REx-ID: 11180 | 
Postnikova, Anastasiia, et al. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 353–67, doi:10.1145/3503221.3508432.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Research Data Reference | IST-REx-ID: 13076 |
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 | Conference Paper | IST-REx-ID: 17087 |
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: 17059 |
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: 11184 |
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: 12299 |
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 | Conference Paper | IST-REx-ID: 12780 |
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 | Published | Conference Paper | IST-REx-ID: 11844 |
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 | Journal Article | IST-REx-ID: 8286 |
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 | Journal Article | IST-REx-ID: 11420 |
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 | Conference Paper | IST-REx-ID: 10853 |
Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–20, doi:10.1145/3409964.3461810.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 15263 |
Alimisis, Foivos, et al. “Momentum Improves Optimization on Riemannian Manifolds.” Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, vol. 130, ML Research Press, 2021, pp. 1351–59.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 15267 |
Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.” Journal of the ACM, vol. 68, no. 2, 13, Association for Computing Machinery, 2021, doi:10.1145/3446383.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9823 |
Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:10.1007/978-3-030-79527-6_6.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9827 |
Chatterjee, Bapi, et al. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” Theoretical Computer Science, vol. 886, Elsevier, 2021, pp. 27–48, doi:10.1016/j.tcs.2021.06.041.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 9951
Alistarh, Dan-Adrian, et al. “Comparison Dynamics in Population Protocols.” Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 55–65, doi:10.1145/3465084.3467915.
View
| DOI
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10218 |
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: 9678 |
Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10854 |
Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 10855 |
Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:10.1145/3447384.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv