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.




32 Publications

2019 | Conference Paper | IST-REx-ID: 5947   OA
A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries
B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6673
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6933   OA
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.
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6972   OA
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019) 32.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7122
Gradient compression for communication-limited convex optimization
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019, p. 8619625.
View | DOI
 
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6935   OA
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.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6676   OA
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 986–996.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6931   OA
Byzantine approximate agreement on graphs
T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, p. 29:1--29:17.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6936   OA
What can observational data reveal about metacommunity processes?
O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6759   OA
On grounded L-graphs and their relatives
V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019) P3.17.
View | Files available | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5961
A brief tutorial on distributed and concurrent machine learning
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–488.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 5966   OA
The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–392.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6558   OA
Byzantine Stochastic Gradient Descent
D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, R. Garnett (Eds.), Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.
View | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6589   OA
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, 2018, pp. 5973–5983.
View | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 85   OA
Snapshot based synchronization: A fast replacement for Hand-over-Hand locking
E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 43   OA
Model of bacterial toxin-dependent pathogenesis explains infective dose
J. Rybicki, E. Kisdi, J. Anttila, PNAS 115 (2018) 10690–10695.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5962   OA
The convergence of stochastic gradient descent in asynchronous shared memory
D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–178.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 536   OA
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.
View | Files available | DOI
 
2018 | 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
 

Search

Filter Publications

Display / Sort

Export / Embed