32 search results - page 2 / 7 » Randomized mutual exclusion in O(log N log log N) RMRs |
RANDOM
2001
Springer
13 years 10 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
STOC
1992
ACM
13 years 9 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
PODC
2011
ACM
12 years 8 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
13 years 7 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...