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.
148 Publications
2019 | Published | Conference Paper | IST-REx-ID: 6933 | 
Fast approximate shortest paths in the congested clique
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.
2019 | Published | Conference Paper | IST-REx-ID: 6931 |
Byzantine approximate agreement on graphs
Nowak, Thomas, Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing 146. 2019
[Published Version]
View
| Files available
| DOI
| arXiv
Nowak, Thomas, Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing 146. 2019
2019 | Published | Journal Article | IST-REx-ID: 6972 |
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).
2019 | Published | Journal Article | IST-REx-ID: 6936 |
What can observational data reveal about metacommunity processes?
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
[Published Version]
View
| Files available
| DOI
| WoS
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
2019 | Published | Conference Paper | IST-REx-ID: 6935 |
Does preprocessing help under congestion?
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
2019 | Published | Conference Paper | IST-REx-ID: 7201 |
SparCML: High-performance sparse communication for machine learning
Renggli, Cedric, SparCML: High-performance sparse communication for machine learning. International Conference for High Performance Computing, Networking, Storage and Analysis, SC. 2019
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Renggli, Cedric, SparCML: High-performance sparse communication for machine learning. International Conference for High Performance Computing, Networking, Storage and Analysis, SC. 2019
2018 | Published | Journal Article | IST-REx-ID: 6001
ThreadScan: Automatic and scalable memory reclamation
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).
View
| Files available
| DOI
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).
2018 | Published | Conference Paper | IST-REx-ID: 6031
Fast quantized arithmetic on x86: Trading compute for data movement
A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.
View
| DOI
| WoS
A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.
2018 | Published | Conference Paper | IST-REx-ID: 7812 |
Model compression via distillation and quantization
A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.
[Published Version]
View
| Files available
| arXiv
A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.
2018 | Published | Conference Paper | IST-REx-ID: 6558 |
Byzantine stochastic gradient descent
D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.
[Published Version]
View
| Download Published Version (ext.)
| WoS
| arXiv
D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.
2018 | Published | Conference Paper | IST-REx-ID: 7116 |
Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study
D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.
[Published Version]
View
| Files available
| DOI
D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.
2018 | Published | Conference Paper | IST-REx-ID: 7123 |
Space-optimal majority in population protocols
D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
2018 | Published | Conference Paper | IST-REx-ID: 397
Harnessing epoch-based reclamation for efficient range queries
M. Arbel Raviv, T.A. Brown, in:, ACM, 2018, pp. 14–27.
View
| DOI
| WoS
M. Arbel Raviv, T.A. Brown, in:, ACM, 2018, pp. 14–27.
2018 | Published | Conference Paper | IST-REx-ID: 5963 |
Relaxed schedulers can efficiently parallelize iterative algorithms
Alistarh, Dan-Adrian, Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Alistarh, Dan-Adrian, Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 5962 |
The convergence of stochastic gradient descent in asynchronous shared memory
Alistarh, Dan-Adrian, The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Alistarh, Dan-Adrian, The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 5961
A brief tutorial on distributed and concurrent machine learning
Alistarh, Dan-Adrian, A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
View
| DOI
| WoS
Alistarh, Dan-Adrian, A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 5964 |
Brief Announcement: Performance prediction for coarse-grained locking
Aksenov, Vitaly, Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
Aksenov, Vitaly, Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 5966 |
The transactional conflict problem
Alistarh, Dan-Adrian, The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18. 2018
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Alistarh, Dan-Adrian, The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 5965 |
Distributionally linearizable data structures
Alistarh, Dan-Adrian, Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18. 2018
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Alistarh, Dan-Adrian, Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18. 2018
2018 | Published | Conference Paper | IST-REx-ID: 6589 |
The convergence of sparsified gradient methods
D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.