1855 search results - page 10 / 371 » A coding theorem for distributed computation |
USM
2000
14 years 2 months ago
2000
CONCUR
2008
Springer
14 years 20 days ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
TIT
2002
13 years 10 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
ICPP
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
FOCS
2000
IEEE
14 years 3 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...