"A Decomposition Theorem and Bounds for Randomized Server Problems"

Avrim Blum et al. (1992)

> Home

Details and statistics

DOI: 10.1109/SFCS.1992.267772

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  authority control:
- export record
  dblp key:
  - conf/focs/BlumKRS92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BlumKRS92
Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks:
A Decomposition Theorem and Bounds for Randomized Server Problems. FOCS 1992: 197-207

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.