Dan Alistarh
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| scientific article; zbMATH DE number 7832755 (Why is no real title available?) | 2024-04-15 | Paper |
| Comparison Dynamics in Population Protocols Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Near-Optimal Leader Election in Population Protocols on Graphs Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774255 (Why is no real title available?) (available as arXiv preprint) | 2023-12-08 | Paper |
| Brief Announcement: Fast Graphical Population Protocols (available as arXiv preprint) | 2023-12-08 | Paper |
| The splay-list: a distribution-adaptive concurrent skip-list | 2023-11-02 | Paper |
| The splay-list: a distribution-adaptive concurrent skip-list Distributed Computing | 2023-09-11 | Paper |
| Why Extension-Based Proofs Fail SIAM Journal on Computing | 2023-08-10 | Paper |
| Wait-free approximate agreement on graphs Theoretical Computer Science | 2023-02-13 | Paper |
| scientific article; zbMATH DE number 7626756 (Why is no real title available?) (available as arXiv preprint) | 2022-12-06 | Paper |
| scientific article; zbMATH DE number 7626756 (Why is no real title available?) | 2022-12-06 | Paper |
| Dynamic averaging load balancing on cycles Algorithmica | 2022-03-22 | Paper |
| Collecting coupons is faster with friends (available as arXiv preprint) | 2022-03-22 | Paper |
| Wait-free approximate agreement on graphs Structural Information and Communication Complexity | 2022-03-22 | Paper |
| Communication-efficient randomized consensus Distributed Computing | 2022-02-15 | Paper |
| Collecting Coupons is Faster with Friends (available as arXiv preprint) | 2021-12-10 | Paper |
| scientific article; zbMATH DE number 7370631 (Why is no real title available?) (available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370631 (Why is no real title available?) | 2021-07-09 | Paper |
| Brief Announcement: Why Extension-Based Proofs Fail Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Why extension-based proofs fail Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Relaxed schedulers can efficiently parallelize iterative algorithms Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Brief announcement: Performance prediction for coarse-grained locking Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| A brief tutorial on distributed and concurrent machine learning Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| The renaming problem: recent developments and open questions | 2019-07-03 | Paper |
| Dynamic Task Allocation in Asynchronous Shared Memory Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees | 2019-05-28 | Paper |
| Are lock-free concurrent algorithms practically wait-free? Journal of the ACM | 2018-08-02 | Paper |
| Time-space trade-offs in population protocols Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6850453 (Why is no real title available?) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850453 (Why is no real title available?) (available as arXiv preprint) | 2018-03-15 | Paper |
| Robust detection in leak-prone population protocols (available as arXiv preprint) | 2018-02-02 | Paper |
| The power of choice in priority scheduling Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Fast and exact majority in population protocols Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| Lock-free algorithms under stochastic schedulers Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| How to elect a leader faster than a tournament Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| Polylogarithmic-time leader election in population protocols Automata, Languages, and Programming | 2015-11-04 | Paper |
| Optimal-time adaptive strong renaming, with applications to counting Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Balls-into-leaves Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| Are lock-free concurrent algorithms practically wait-free? Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Randomized loose renaming in \(O(\log \log n)\) time Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Tight bounds for asynchronous renaming Journal of the ACM | 2014-09-12 | Paper |
| The Complexity of Renaming 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| Generating fast indulgent algorithms Theory of Computing Systems | 2012-12-07 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement Algorithmica | 2012-04-26 | Paper |
| Sublogarithmic test-and-set against a weak adversary Lecture Notes in Computer Science | 2011-10-28 | Paper |
| Fast randomized test-and-set and renaming Lecture Notes in Computer Science | 2010-09-10 | Paper |
| How efficient can gossip be? (On the cost of resilient information exchange) Automata, Languages and Programming | 2010-09-07 | Paper |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement Algorithms and Computation | 2009-12-17 | Paper |
| How to Solve Consensus in the Smallest Window of Synchrony Lecture Notes in Computer Science | 2008-11-20 | Paper |
Research outcomes over time
This page was built for person: Dan Alistarh
