219 search results - page 1 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
OPODIS
2008
13 years 6 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...