| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7832769 (Why is no real title available?)
| 2024-04-15 | Paper |
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
An Efficient Adaptive Partial Snapshot Implementation
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Efficient Bounded Timestamping from Standard Synchronization Primitives
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Efficient randomized DCAS
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Allocate-on-use space complexity of shared-memory algorithms
| 2022-07-21 | Paper |
An almost tight RMR lower bound for abortable test-and-set
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559135 (Why is no real title available?)
| 2022-07-18 | Paper |
Space lower bounds for the signal detection problem
Theory of Computing Systems | 2021-08-05 | Paper |
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Towards a Theory of Randomized Shared Memory Algorithms
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Strongly Linearizable Implementations of Snapshots and Other Types
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 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
Distributed Computing | 2019-11-27 | Paper |
Tight lower bounds for greedy routing in higher-dimensional small-world grids
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
scientific article; zbMATH DE number 6783407 (Why is no real title available?)
| 2017-09-29 | Paper |
How asynchrony affects rumor spreading time
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Are shared objects composable under an oblivious adversary?
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Trading fences with RMRs and separating memory models
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
On the time and space complexity of ABA prevention and detection
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Making objects writable
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Test-and-set in optimal space
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
An \(O(1)\) RMRs leader election algorithm
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | 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 |
A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Tight lower bounds for greedy routing in uniform small world rings
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Algorithmica | 2015-01-19 | Paper |
Brief announcement, a tight RMR lower bound for randomized mutual exclusion
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Strongly linearizable implementations, possibilities and impossibilities
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
On the time and space complexity of randomized test-and-set
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
The space complexity of long-lived and one-shot timestamp implementations
Journal of the ACM | 2014-09-12 | Paper |
Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A tight RMR lower bound for randomized mutual exclusion
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Tight bounds for blind search on the integers
| 2013-03-19 | Paper |
RMR-efficient randomized abortable mutual exclusion (extended abstract)
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Tight bounds for blind search on the integers and the reals
Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Efficient fetch-and-increment
Lecture Notes in Computer Science | 2013-03-13 | Paper |
RMR-efficient implementations of comparison primitives using read and write operations
Distributed Computing | 2013-02-04 | Paper |
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Low randomness rumor spreading via hashing
| 2012-08-23 | Paper |
Independence of tabulation-based hash classes
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Randomized mutual exclusion with sub-logarithmic RMR-complexity
Distributed Computing | 2012-02-06 | Paper |
Fully-adaptive algorithms for long-lived renaming
Distributed Computing | 2012-02-06 | Paper |
Separating deterministic from randomized multiparty communication complexity
Theory of Computing | 2011-05-24 | Paper |
An \(O(1)\) RMRs leader election algorithm
SIAM Journal on Computing | 2011-04-04 | Paper |
Precision, local search and unimodal functions
Algorithmica | 2011-03-30 | Paper |
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Asymmetric balanced allocation with simple hash functions
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Representation of graphs by OBDDs
Discrete Applied Mathematics | 2009-03-04 | Paper |
scientific article; zbMATH DE number 5485533 (Why is no real title available?)
| 2009-01-05 | Paper |
Fully-Adaptive Algorithms for Long-Lived Renaming
Lecture Notes in Computer Science | 2008-09-09 | Paper |
New results on the complexity of the middle bit of multiplication
Computational Complexity | 2008-03-05 | Paper |
Symbolic topological sorting with OBDDs
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
Maintaining External Memory Efficient Hash Tables
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Theoretical Computer Science | 2006-10-20 | Paper |
A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
Theory of Computing Systems | 2006-01-10 | Paper |
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences | 2005-12-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
scientific article; zbMATH DE number 2086405 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1929932 (Why is no real title available?)
| 2003-06-18 | Paper |
scientific article; zbMATH DE number 1688393 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 1418345 (Why is no real title available?)
| 2000-03-19 | Paper |
