"Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths ..."

Ran Adler, Yossi Azar (2003)

> Home

Details and statistics

DOI: 10.1023/A:1022933824889

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/AdlerA03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/AdlerA03
Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. J. Sched. 6(2): 113-129 (2003)

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.