scientific article; zbMATH DE number 2006640
From MaRDI portal
Publication:4436036
zbMATH Open1024.68902MaRDI QIDQ4436036FDOQ4436036
Authors: Yong-Jik Kim, James H. Anderson 
Publication date: 23 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800001.htm
Title of this publication is not available (Why is that?)
Recommendations
- A time complexity lower bound for adaptive mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Time bounds for mutual exclusion and related problems
- Adaptive and efficient mutual exclusion (extended abstract)
- Adaptive randomized mutual exclusion in sub-logarithmic expected time
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Cited In (16)
- Fast timing-based algorithms
- Nonatomic mutual exclusion with local spinning
- A time complexity lower bound for adaptive mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
- Randomized mutual exclusion with sub-logarithmic RMR-complexity
- A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
- Analysis of timing-based mutual exclusion with random times
- Time bounds for mutual exclusion and related problems
- Shared-memory mutual exclusion: major research trends since 1986
- An almost tight RMR lower bound for abortable test-and-set
- Adaptive mutual exclusion with local spinning
- Efficient adaptive collect using randomization
- On the Complexity of Reader-Writer Locks
- Adaptive and efficient mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436036)
