scientific article; zbMATH DE number 2006640
From MaRDI portal
Publication:4436036
zbMath1024.68902MaRDI QIDQ4436036
James H. Anderson, Yong-Jik Kim
Publication date: 23 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (9)
An improved lower bound for the time complexity of mutual exclusion ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Efficient adaptive collect using randomization ⋮ Nonatomic mutual exclusion with local spinning ⋮ Adaptive mutual exclusion with local spinning ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ Randomized mutual exclusion with sub-logarithmic RMR-complexity ⋮ Unnamed Item
This page was built for publication:
