28 search results - page 4 / 6 » An asymptotic Lower Bound for the Maximal Number of Runs in ... |
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
TCOM
2010
13 years 5 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
TIT
2008
13 years 5 months ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
TIT
2002
13 years 7 months ago
2002
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
SPAA
1995
ACM
13 years 11 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...