Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms

Ran Adler, Yossi Azar. Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. In SODA. pages 1-10, 1999. [doi]

@inproceedings{AdlerA99,
  title = {Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms},
  author = {Ran Adler and Yossi Azar},
  year = {1999},
  doi = {10.1145/314500.314512},
  url = {http://doi.acm.org/10.1145/314500.314512},
  researchr = {https://researchr.org/publication/AdlerA99},
  cites = {0},
  citedby = {0},
  pages = {1-10},
  booktitle = {SODA},
}