| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128598 | 2024-04-15 | Paper |
| Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion | 2024-03-26 | Paper |
| An Efficient Adaptive Partial Snapshot Implementation | 2024-03-26 | Paper |
| Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion | 2024-03-26 | Paper |
| Efficient Bounded Timestamping from Standard Synchronization Primitives | 2024-03-26 | Paper |
| Efficient randomized DCAS | 2023-11-14 | Paper |
| Allocate-On-Use Space Complexity of Shared-Memory Algorithms | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090913 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090474 | 2022-07-18 | Paper |
| Space lower bounds for the signal detection problem | 2021-08-05 | Paper |
| Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives | 2021-03-15 | Paper |
| Towards a Theory of Randomized Shared Memory Algorithms | 2021-01-20 | Paper |
| Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion | 2021-01-20 | Paper |
| Strongly Linearizable Implementations of Snapshots and Other Types | 2021-01-20 | Paper |
| An Improved Bound for Random Binary Search Trees with Concurrent Insertions | 2020-08-05 | Paper |
| Efficient randomized test-and-set implementations | 2019-11-27 | Paper |
| Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids | 2019-06-20 | Paper |
| Wait-freedom is harder than lock-freedom under strong linearizability | 2018-08-24 | Paper |
| Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model | 2017-10-11 | Paper |
| How Asynchrony Affects Rumor Spreading Time | 2017-09-29 | Paper |
| Are Shared Objects Composable under an Oblivious Adversary? | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365055 | 2017-09-29 | Paper |
| Trading Fences with RMRs and Separating Memory Models | 2016-03-23 | Paper |
| On the Time and Space Complexity of ABA Prevention and Detection | 2016-03-23 | Paper |
| The space complexity of long-lived and one-shot timestamp implementations | 2015-09-11 | Paper |
| Making objects writable | 2015-09-03 | Paper |
| Test-and-Set in Optimal Space | 2015-08-21 | Paper |
| An O (1) RMRs leader election algorithm | 2015-03-10 | Paper |
| Randomized loose renaming in o (log log n ) time | 2015-03-02 | Paper |
| Adaptive randomized mutual exclusion in sub-logarithmic expected time | 2015-03-02 | Paper |
| A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing | 2015-02-27 | Paper |
| Tight lower bounds for greedy routing in uniform small world rings | 2015-02-04 | Paper |
| Explicit and efficient hash families suffice for cuckoo hashing with a stash | 2015-01-19 | Paper |
| On the time and space complexity of randomized test-and-set | 2014-12-05 | Paper |
| Strongly linearizable implementations | 2014-12-05 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| The space complexity of long-lived and one-shot timestamp implementations | 2014-09-12 | Paper |
| Randomized mutual exclusion in O(log N / log log N) RMRs | 2014-07-23 | Paper |
| Linearizable implementations do not suffice for randomized distributed computation | 2014-06-05 | Paper |
| A tight RMR lower bound for randomized mutual exclusion | 2014-05-13 | Paper |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations | 2014-03-13 | Paper |
| Tight bounds for blind search on the integers | 2013-03-19 | Paper |
| Efficient Fetch-and-Increment | 2013-03-13 | Paper |
| RMR-Efficient Randomized Abortable Mutual Exclusion | 2013-03-13 | Paper |
| Tight Bounds for Blind Search on the Integers and the Reals | 2013-03-13 | Paper |
| RMR-efficient implementations of comparison primitives using read and write operations | 2013-02-04 | Paper |
| Explicit and efficient hash families suffice for cuckoo hashing with a stash | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904772 | 2012-08-23 | Paper |
| Independence of Tabulation-Based Hash Classes | 2012-06-29 | Paper |
| Randomized mutual exclusion with sub-logarithmic RMR-complexity | 2012-02-06 | Paper |
| Fully-adaptive algorithms for long-lived renaming | 2012-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002822 | 2011-05-24 | Paper |
| An $O(1)$ RMRs Leader Election Algorithm | 2011-04-04 | Paper |
| Precision, local search and unimodal functions | 2011-03-30 | Paper |
| Almost random graphs with simple hash functions | 2010-08-16 | Paper |
| Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions | 2010-08-16 | Paper |
| Asymmetric balanced allocation with simple hash functions | 2010-08-16 | Paper |
| Representation of graphs by OBDDs | 2009-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549704 | 2009-01-05 | Paper |
| Fully-Adaptive Algorithms for Long-Lived Renaming | 2008-09-09 | Paper |
| New results on the complexity of the middle bit of multiplication | 2008-03-05 | Paper |
| Symbolic topological sorting with OBDDs | 2008-01-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity | 2007-11-28 | Paper |
| Maintaining External Memory Efficient Hash Tables | 2007-08-28 | Paper |
| A construction method for optimally universal hash families and its consequences for the existence of RBIBDs | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication | 2006-10-20 | Paper |
| A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications | 2006-01-10 | Paper |
| Bounds on the OBDD-size of integer multiplication via universal hashing | 2005-12-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736860 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708564 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762533 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941908 | 2000-03-19 | Paper |
