Amanote Research
Register
Sign In
Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
doi 10.1145/1400751.1400843
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2008
Authors
Hagit Attiya
Danny Hendler
Philipp Woelfel
Publisher
ACM Press
Related search
A Time Complexity Lower Bound for Adaptive Mutual Exclusion
Distributed Computing
Computer Networks
Hardware
Communications
Architecture
Computational Theory
Mathematics
Theoretical Computer Science
Tail Mutual Exclusivity and Tail-VaR Lower Bounds
SSRN Electronic Journal
Calculating Lower Bounds for Caching Problems
Computing (Vienna/New York)
Numerical Analysis
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Theoretical Computer Science
Software
Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Tight Upper and Lower Bounds on the Path Length of Binary Trees
SIAM Journal on Computing
Mathematics
Computer Science
Quantum Lower Bounds for the Collision and the Element Distinctness Problems
Journal of the ACM
Control
Systems Engineering
Information Systems
Hardware
Architecture
Artificial Intelligence
Software
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
SIAM Journal on Computing
Mathematics
Computer Science
