2924 search results - page 228 / 585 » Lower Bounds in Distributed Computing |
129
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
109
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
136
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diï...
118
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
112
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...