Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

DC
2002

favoriteEmaildiscussreport

93views Internet Technology» more DC 2002»

An improved lower bound for the time complexity of mutual exclusion

13 years 10 months ago

An improved lower bound for the time complexity of mutual exclusion

Download www.cs.unc.edu

James H. Anderson, Yong-Jik Kim

Real-time Traffic

DC 2001 | DC 2002 |

claim paper

Related Content

» A tight bound on remote reference time complexity of mutual exclusion in the readmodifywri...

» Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

» On the Performance of Beauquier and Debas Selfstabilizing Algorithm for Mutual Exclusion

» Randomized mutual exclusion in Olog N log log N RMRs

» Constant RMR solutions to reader writer synchronization

» Explicit Exclusive Set Systems with Applications to Broadcast Encryption

» Time and Space Lower Bounds for Implementations Using kCAS

» Orthogonal range reporting query lower bounds optimal structures in 3d and higherdimension...

» On the inherent weakness of conditional primitives

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DC
Authors	James H. Anderson, Yong-Jik Kim

Comments (0)