AAAAAA

   
Results: 1-14 |
Results: 14
OPTIMAL CONSTRUCTION OF EDGE-DISJOINT PATHS IN RANDOM GRAPHS
Authors: BRODER AZ FRIEZE AM SUEN S UPFAL E
Citation: Az. Broder et al., OPTIMAL CONSTRUCTION OF EDGE-DISJOINT PATHS IN RANDOM GRAPHS, SIAM journal on computing (Print), 28(2), 1999, pp. 542-574
STOCHASTIC CONTENTION RESOLUTION WITH SHORT DELAYS
Authors: RAGHAVAN P UPFAL E
Citation: P. Raghavan et E. Upfal, STOCHASTIC CONTENTION RESOLUTION WITH SHORT DELAYS, SIAM journal on computing (Print), 28(2), 1999, pp. 709-719
A STEADY-STATE ANALYSIS OF DIFFRACTING TREES
Authors: SHAVIT N UPFAL E ZEMACH A
Citation: N. Shavit et al., A STEADY-STATE ANALYSIS OF DIFFRACTING TREES, theory of computing systems, 31(4), 1998, pp. 403-423
EFFICIENT ALGORITHMS FOR ALL-TO-ALL COMMUNICATIONS IN MULTIPORT MESSAGE-PASSING SYSTEMS
Authors: BRUCK J HO CT KIPNIS S UPFAL E WEATHERSBY D
Citation: J. Bruck et al., EFFICIENT ALGORITHMS FOR ALL-TO-ALL COMMUNICATIONS IN MULTIPORT MESSAGE-PASSING SYSTEMS, IEEE transactions on parallel and distributed systems, 8(11), 1997, pp. 1143-1156
HOW MUCH CAN HARDWARE HELP ROUTING
Authors: BORODIN A RAGHAVAN P SCHIEBER B UPFAL E
Citation: A. Borodin et al., HOW MUCH CAN HARDWARE HELP ROUTING, JOURNAL OF THE ACM, 44(5), 1997, pp. 726-741
RANDOMIZED ROUTING WITH SHORTER PATHS
Authors: UPFAL E FELPERIN S SNIR M
Citation: E. Upfal et al., RANDOMIZED ROUTING WITH SHORTER PATHS, IEEE transactions on parallel and distributed systems, 7(4), 1996, pp. 356-362
A THEORY OF WORMHOLE ROUTING IN PARALLEL COMPUTERS
Authors: FELPERIN S RAGHAVAN P UPFAL E
Citation: S. Felperin et al., A THEORY OF WORMHOLE ROUTING IN PARALLEL COMPUTERS, I.E.E.E. transactions on computers, 45(6), 1996, pp. 704-713
23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD
Authors: HALPERN J AWERBUCH B BENOR M CHANDRA A FEIGENBAUM J VONZURGATHEN J GUIBAS L PITT L SAKS M SHMOYS D SLEATOR D UPFAL E VAZIRANI U YAO A
Citation: J. Halpern et al., 23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD, Journal of computer and system sciences, 50(2), 1995, pp. 189-189
THE WORST-CASE RUNNING TIME OF THE RANDOM SIMPLEX ALGORITHM IS EXPONENTIAL IN THE HEIGHT
Authors: BRODER AZ DYER ME FRIEZE AM RAGHAVAN P UPFAL E
Citation: Az. Broder et al., THE WORST-CASE RUNNING TIME OF THE RANDOM SIMPLEX ALGORITHM IS EXPONENTIAL IN THE HEIGHT, Information processing letters, 56(2), 1995, pp. 79-81
NEAR-PERFECT TOKEN DISTRIBUTION
Authors: BRODER AZ FRIEZE AM SHAMIR E UPFAL E
Citation: Az. Broder et al., NEAR-PERFECT TOKEN DISTRIBUTION, Random structures & algorithms, 5(4), 1994, pp. 559-572
TOLERATING A LINEAR NUMBER OF FAULTS IN NETWORKS OF BOUNDED DEGREE
Authors: UPFAL E
Citation: E. Upfal, TOLERATING A LINEAR NUMBER OF FAULTS IN NETWORKS OF BOUNDED DEGREE, Information and computation, 115(2), 1994, pp. 312-320
EXISTENCE AND CONSTRUCTION OF EDGE-DISJOINT PATHS ON EXPANDER GRAPHS
Authors: BRODER AZ FRIEZE AM UPFAL E
Citation: Az. Broder et al., EXISTENCE AND CONSTRUCTION OF EDGE-DISJOINT PATHS ON EXPANDER GRAPHS, SIAM journal on computing, 23(5), 1994, pp. 976-989
COMPUTING WITH NOISY INFORMATION
Authors: FEIGE U RAGHAVAN P PELEG D UPFAL E
Citation: U. Feige et al., COMPUTING WITH NOISY INFORMATION, SIAM journal on computing, 23(5), 1994, pp. 1001-1018
TRADING SPACE FOR TIME IN UNDIRECTED S-T CONNECTIVITY
Authors: BRODER AZ KARLIN AR RAGHAVAN P UPFAL E
Citation: Az. Broder et al., TRADING SPACE FOR TIME IN UNDIRECTED S-T CONNECTIVITY, SIAM journal on computing, 23(2), 1994, pp. 324-334
Risultati: 1-14 |