The following pages link to Danny Hendler (Q661044):
Displaying 42 items.
- Randomized mutual exclusion with sub-logarithmic RMR-complexity (Q661045) (← links)
- A scalable lock-free stack algorithm (Q666004) (← links)
- Upper bounds for multi-level multi-server paging (Q1628694) (← links)
- Lower bound on the step complexity of anonymous binary consensus (Q1660942) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- A dynamic-sized nonblocking work stealing deque (Q1953649) (← links)
- On the inherent weakness of conditional primitives (Q2375295) (← links)
- Solo-valency and the cost of coordination (Q2377250) (← links)
- Bounded-wait combining: constructing robust and high-throughput shared objects (Q2377268) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Trading Fences with RMRs and Separating Memory Models (Q2796254) (← links)
- The Price of being Adaptive (Q2796255) (← links)
- Lower Bounds for Restricted-Use Objects (Q2812146) (← links)
- On the Inherent Sequentiality of Concurrent Objects (Q2910851) (← links)
- Complexity tradeoffs for read and update operations (Q2943622) (← links)
- Operation-valency and the cost of coordination (Q2943748) (← links)
- The complexity of obstruction-free implementations (Q3452220) (← links)
- Constructing Shared Objects That Are Both Robust and High-Throughput (Q3524323) (← links)
- (Q3549704) (← links)
- On the complexity of global computation in the presence of link failures: the general case (Q5136985) (← links)
- Randomized mutual exclusion in O(log N / log log N) RMRs (Q5170298) (← links)
- Non-blocking steal-half work queues (Q5170888) (← links)
- An O(1)-barriers optimal RMRs mutual exclusion algorithm (Q5176098) (← links)
- Adaptive randomized mutual exclusion in sub-logarithmic expected time (Q5176194) (← links)
- An <i>O</i> (1) RMRs leader election algorithm (Q5177285) (← links)
- Synchronizing without locks is inherently expensive (Q5177292) (← links)
- Nesting-Safe Recoverable Linearizability (Q5197661) (← links)
- Recoverable Mutual Exclusion Under System-Wide Failures (Q5197662) (← links)
- Separating Lock-Freedom from Wait-Freedom (Q5197665) (← links)
- Space-Efficient TCAM-Based Classification Using Gray Coding (Q5277675) (← links)
- On the Complexity of Reader-Writer Locks (Q5361950) (← links)
- (Q5363822) (← links)
- Recoverable Mutual Exclusion in Sub-logarithmic Time (Q5368966) (← links)
- An $O(1)$ RMRs Leader Election Algorithm (Q5390576) (← links)
- Distributed Computing (Q5395146) (← links)
- Constant-RMR implementations of CAS and other synchronization primitives using read and write operations (Q5401387) (← links)
- Laws of order (Q5408568) (← links)
- On the inherent weakness of conditional synchronization primitives (Q5501485) (← links)
- Upper and Lower Bounds on the Space Complexity of Detectable Objects (Q5855201) (← links)
- Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity (Q5855203) (← links)
- (Q6128600) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q6487520) (← links)
