Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

94

Voted

FOCS
1999
IEEE

68views Theoretical Computer Science» more FOCS 1999»

Weak Adversaries for the k-Server Problem

15 years 7 months ago

Weak Adversaries for the k-Server Problem

Download cgi.di.uoa.gr

Elias Koutsoupias

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» Lower Bounds for Randomized kServer and Motion Planning Algorithms

» Optimal Online Prediction in Adversarial Environments

» The Quantum Adversary Method and Classical Formula Size Lower Bounds

» Key agreement from weak bit agreement

» Subspace LWE

» Secure Authentication from a Weak Key Without Leaking Information

» Symbolic Bisimulations for Probabilistic Systems

» Authenticating Pervasive Devices with Human Protocols

» On the Impossibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security ...

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Elias Koutsoupias

Comments (0)