| Publication | Date of Publication | Type |
|---|
| Revisionist simulations: a new approach to proving space lower bounds | 2024-08-06 | Paper |
| Reductions and Extension-Based Proofs | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083407 | 2023-12-08 | 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/Q5090474 | 2022-07-18 | Paper |
| Wait-free approximate agreement on graphs | 2022-03-22 | Paper |
| Space lower bounds for the signal detection problem | 2021-08-05 | Paper |
| Brief Announcement: Why Extension-Based Proofs Fail | 2021-03-15 | Paper |
| Randomized distributed online algorithms against adaptive offline adversaries | 2020-08-04 | Paper |
| A complexity-based classification for multiprocessor synchronization | 2020-04-23 | Paper |
| Why extension-based proofs fail | 2020-01-30 | Paper |
| Revisionist simulations: a new approach to proving space lower bounds | 2019-09-19 | Paper |
| Tight bounds for restricted grid scheduling | 2019-06-21 | Paper |
| A little advice can be very helpful | 2019-05-10 | Paper |
| Erratum to: ``Limited-use atomic snapshots with polylogarithmic step complexity | 2019-02-25 | Paper |
| Simulating a shared register in an asynchronous system that never stops changing (extended abstract) | 2018-08-24 | Paper |
| Impossibility results for distributed computing | 2018-06-19 | Paper |
| Deterministic objects: life beyond consensus | 2017-09-29 | Paper |
| A complexity-based hierarchy for multiprocessor synchronization (extended abstract) | 2017-09-29 | Paper |
| Atomic snapshots from small registers | 2017-09-29 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom | 2016-10-17 | Paper |
| Upper and lower bounds on the power of advice | 2016-08-26 | Paper |
| Limitations of highly-available eventually-consistent data stores | 2016-03-23 | Paper |
| The amortized complexity of non-blocking binary search trees | 2015-09-03 | Paper |
| Limited-use atomic snapshots with polylogarithmic step complexity | 2015-08-14 | Paper |
| Pragmatic primitives for non-blocking data structures | 2015-03-02 | Paper |
| Tight bounds for adopt-commit objects | 2015-01-19 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom | 2014-12-05 | Paper |
| Faster than optimal snapshots (for a while), preliminary version | 2014-12-05 | Paper |
| SNZI, scalable nonzero indicators | 2014-03-13 | Paper |
| Bounds for scheduling jobs on grid processors | 2013-09-13 | Paper |
| The space complexity of unbounded timestamps | 2013-07-04 | Paper |
| Efficient fetch-and-increment | 2013-03-13 | Paper |
| On the inherent sequentiality of concurrent objects | 2012-09-12 | Paper |
| The complexity of updating snapshot objects | 2012-02-14 | Paper |
| Fully-adaptive algorithms for long-lived renaming | 2012-02-06 | Paper |
| Time lower bounds for implementations of multi-writer snapshots | 2008-12-21 | Paper |
| Fully-Adaptive Algorithms for Long-Lived Renaming | 2008-09-09 | Paper |
| The Space Complexity of Unbounded Timestamps | 2008-09-02 | Paper |
