The following pages link to Faith Ellen (Q324623):
Displayed 39 items.
- The space complexity of unbounded timestamps (Q352241) (← links)
- Tight bounds for adopt-commit objects (Q487260) (← links)
- Fully-adaptive algorithms for long-lived renaming (Q661054) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract) (Q1664131) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Space lower bounds for the signal detection problem (Q2048203) (← links)
- Limitations of Highly-Available Eventually-Consistent Data Stores (Q2796275) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Bounds for Scheduling Jobs on Grid Processors (Q2848963) (← links)
- On the Inherent Sequentiality of Concurrent Objects (Q2910851) (← links)
- Faster than optimal snapshots (for a while) (Q2933814) (← links)
- The amortized complexity of non-blocking binary search trees (Q2943634) (← links)
- The Space Complexity of Unbounded Timestamps (Q3523210) (← links)
- Fully-Adaptive Algorithms for Long-Lived Renaming (Q3524322) (← links)
- Time lower bounds for implementations of multi-writer snapshots (Q3546353) (← links)
- Impossibility Results for Distributed Computing (Q4568311) (← links)
- Erratum (Q4625659) (← links)
- Efficient Fetch-and-Increment (Q4909399) (← links)
- (Q5090474) (← links)
- Pragmatic primitives for non-blocking data structures (Q5176078) (← links)
- Revisionist Simulations (Q5197668) (← links)
- Why extension-based proofs fail (Q5212839) (← links)
- Deterministic Objects (Q5361923) (← links)
- A Complexity-Based Hierarchy for Multiprocessor Synchronization (Q5361947) (← links)
- (Q5363808) (← links)
- Tight Bounds for Restricted Grid Scheduling (Q5384122) (← links)
- SNZI (Q5401388) (← links)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (Q5501949) (← links)
- (Q5743425) (← links)
- Brief Announcement: Why Extension-Based Proofs Fail (Q5855206) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5890930) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5891977) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- (Q6083407) (← links)
- Why Extension-Based Proofs Fail (Q6115415) (← links)
- Reductions and Extension-Based Proofs (Q6201978) (← links)