806 search results - page 138 / 162 » Lower Bounds on Correction Networks |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
ETT
2002
13 years 10 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
ISORC
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by ...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...