Dan Alistarh

Available identifiers

zbMath Open alistarh.danMaRDI QIDQ693078

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6128573	2024-04-15	Paper
Comparison Dynamics in Population Protocols	2024-03-26	Paper
Near-Optimal Leader Election in Population Protocols on Graphs	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6061688	2023-12-08	Paper
Brief Announcement: Fast Graphical Population Protocols	2023-12-08	Paper
The splay-list: a distribution-adaptive concurrent skip-list	2023-09-11	Paper
Why Extension-Based Proofs Fail	2023-08-10	Paper
Wait-free approximate agreement on graphs	2023-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q5053261	2022-12-06	Paper
Collecting coupons is faster with friends	2022-03-22	Paper
Dynamic averaging load balancing on cycles	2022-03-22	Paper
Wait-free approximate agreement on graphs	2022-03-22	Paper
Communication-efficient randomized consensus	2022-02-15	Paper
Collecting Coupons is Faster with Friends	2021-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q4999087	2021-07-09	Paper
Brief Announcement: Why Extension-Based Proofs Fail	2021-03-15	Paper
Why extension-based proofs fail	2020-01-30	Paper
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory	2019-09-19	Paper
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms	2019-09-19	Paper
Brief Announcement	2019-09-19	Paper
A Brief Tutorial on Distributed and Concurrent Machine Learning	2019-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q4967197	2019-07-03	Paper
Dynamic Task Allocation in Asynchronous Shared Memory	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?	2018-08-02	Paper
Time-Space Trade-offs in Population Protocols	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4608038	2018-03-15	Paper
Robust detection in leak-prone population protocols	2018-02-02	Paper
The Power of Choice in Priority Scheduling	2017-10-11	Paper
Fast and Exact Majority in Population Protocols	2016-03-23	Paper
Lock-Free Algorithms under Stochastic Schedulers	2016-03-23	Paper
How To Elect a Leader Faster than a Tournament	2016-03-23	Paper
Polylogarithmic-Time Leader Election in Population Protocols	2015-11-04	Paper
Optimal-time adaptive strong renaming, with applications to counting	2015-09-11	Paper
Balls-into-leaves	2015-09-03	Paper
Are Lock-Free Concurrent Algorithms Practically Wait-Free?	2015-06-26	Paper
Randomized loose renaming in o (log log n ) time	2015-03-02	Paper
Tight Bounds for Asynchronous Renaming	2014-09-12	Paper
The Complexity of Renaming	2014-07-30	Paper
Generating fast indulgent algorithms	2012-12-07	Paper
Of choices, failures and asynchrony: the many faces of set agreement	2012-04-26	Paper
Sub-logarithmic Test-and-Set against a Weak Adversary	2011-10-28	Paper
Fast Randomized Test-and-Set and Renaming	2010-09-10	Paper
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)	2010-09-07	Paper
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement	2009-12-17	Paper
How to Solve Consensus in the Smallest Window of Synchrony	2008-11-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dan Alistarh