49 search results - page 6 / 10 » An Omega (n log n) lower bound on the cost of mutual exclusi... |
ALGORITHMICA
2002
13 years 7 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
FOCS
2003
IEEE
14 years 25 days ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
JPDC
2006
13 years 7 months ago
2006
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...