![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 2 | Ran Adler, Yossi Azar: Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. J. Scheduling 6(2): 113-129 (2003) | |
| 1 | Ran Adler, Yossi Azar: Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. SODA 1999: 1-10 |
Selection of 2 from 2 records - Ran Adler has 1 coauthors
Last update 2012-02-16 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page