scientific article

zbMath1231.68136MaRDI QIDQ3549704

Philipp Woelfel, Ragif Artiya, Danny Hendler

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Tight Bounds for Asynchronous Renaming ⋮ Recoverable mutual exclusion with abortability ⋮ RMR-efficient implementations of comparison primitives using read and write operations ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ Randomized mutual exclusion with sub-logarithmic RMR-complexity ⋮ Recoverable mutual exclusion ⋮ Unnamed Item ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms

This page was built for publication: