111 search results - page 20 / 23 » Errors in Computational Complexity Proofs for Protocols |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
SERVICES
2008
13 years 9 months ago
2008
Scientific workflows in Life Sciences are usually complex, and use many online databases, analysis tools, publication repositories and customized computation intensive desktop sof...
INFOCOM
2003
IEEE
14 years 22 days ago
2003
IEEE
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
CASCON
2001
13 years 8 months ago
2001
Integration and management of applications play key roles in today's computing. MQSeries is an asynchronous, assured application-to-application communication protocol designe...
JUCS
2010
13 years 2 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...