| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128600 | 2024-04-15 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity | 2023-03-14 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity | 2023-02-03 | Paper |
| Upper and Lower Bounds on the Space Complexity of Detectable Objects | 2021-03-15 | Paper |
| Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity | 2021-03-15 | Paper |
| On the complexity of global computation in the presence of link failures: the general case | 2020-11-30 | Paper |
| Recoverable mutual exclusion under system-wide failures | 2019-09-19 | Paper |
| Nesting-safe recoverable linearizability: modular constructions for non-volatile memory | 2019-09-19 | Paper |
| Separating Lock-Freedom from Wait-Freedom | 2019-09-19 | Paper |
| Upper bounds for multi-level multi-server paging | 2018-12-05 | Paper |
| Lower bound on the step complexity of anonymous binary consensus | 2018-08-16 | Paper |
| Recoverable mutual exclusion in sub-logarithmic time | 2017-10-11 | Paper |
| Nontrivial and universal helping for wait-free queues and stacks | 2017-09-29 | Paper |
| On the Complexity of Reader-Writer Locks | 2017-09-29 | Paper |
| Space-Efficient TCAM-Based Classification Using Gray Coding | 2017-07-12 | Paper |
| Lower bounds for restricted-use objects | 2016-06-16 | Paper |
| Trading fences with RMRs and separating memory models | 2016-03-23 | Paper |
| The price of being adaptive | 2016-03-23 | Paper |
| The complexity of obstruction-free implementations | 2015-11-11 | Paper |
| Operation-valency and the cost of coordination | 2015-09-04 | Paper |
| Complexity tradeoffs for read and update operations | 2015-09-03 | Paper |
| On the inherent weakness of conditional synchronization primitives | 2015-08-03 | Paper |
| Synchronizing without locks is inherently expensive | 2015-03-10 | Paper |
| An \(O(1)\) RMRs leader election algorithm | 2015-03-10 | Paper |
| Adaptive randomized mutual exclusion in sub-logarithmic expected time | 2015-03-02 | Paper |
| An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract) | 2015-03-02 | Paper |
| Non-blocking steal-half work queues | 2014-07-25 | Paper |
| Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs | 2014-07-23 | Paper |
| Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated | 2014-04-10 | Paper |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations | 2014-03-13 | Paper |
| Bounded-wait combining: constructing robust and high-throughput shared objects | 2013-06-28 | Paper |
| Solo-valency and the cost of coordination | 2013-06-28 | Paper |
| On the inherent weakness of conditional primitives | 2013-06-13 | Paper |
| A dynamic-sized nonblocking work stealing deque | 2013-06-07 | Paper |
| RMR-efficient implementations of comparison primitives using read and write operations | 2013-02-04 | Paper |
| On the inherent sequentiality of concurrent objects | 2012-09-12 | Paper |
| A scalable lock-free stack algorithm | 2012-03-07 | Paper |
| Randomized mutual exclusion with sub-logarithmic RMR-complexity | 2012-02-06 | Paper |
| An \(O(1)\) RMRs leader election algorithm | 2011-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549704 | 2009-01-05 | Paper |
| Constructing Shared Objects That Are Both Robust and High-Throughput | 2008-09-09 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
