default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

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

Ran Adler, Yossi Azar (1999)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/AdlerA99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/AdlerA99
Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. SODA 1999: 1-10

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.