2924 search results - page 328 / 585 » Lower Bounds in Distributed Computing |
136
Voted
HPDC
1995
IEEE
15 years 8 months ago
1995
IEEE
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
132
click to vote
ICPP
1995
IEEE
15 years 8 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
197
click to vote
CMA
2011
14 years 8 months ago
2011
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is prove...
128
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
142
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...