"A Decomposition Theorem for Task Systems and Bounds for Randomized Server ..."

Avrim Blum et al. (2000)

> Home

Details and statistics

DOI: 10.1137/S0097539799351882

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BlumKRS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BlumKRS00
Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks:
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM J. Comput. 30(5): 1624-1661 (2000)

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.