Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-11
|
Results: 11
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
COUNTING MINIMUM WEIGHT SPANNING-TREES
Authors:
BRODER AZ MAYR EW
Citation:
Az. Broder et Ew. Mayr, COUNTING MINIMUM WEIGHT SPANNING-TREES, Journal of algorithms, 24(1), 1997, pp. 171-176
SYNTACTIC CLUSTERING OF THE WEB
Authors:
BRODER AZ GLASSMAN SC MANASSE MS ZWEIG G
Citation:
Az. Broder et al., SYNTACTIC CLUSTERING OF THE WEB, Computer networks and ISDN systems, 29(8-13), 1997, pp. 1157-1166
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
BALANCED ALLOCATIONS FOR TREE-LIKE INPUTS
Authors:
BRODER AZ FRIEZE A LUND C PHILLIPS S REINGOLD N
Citation:
Az. Broder et al., BALANCED ALLOCATIONS FOR TREE-LIKE INPUTS, Information processing letters, 55(6), 1995, pp. 329-332
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
FINDING HIDDEN HAMILTONIAN CYCLES
Authors:
BRODER AZ FRIEZE AM SHAMIR E
Citation:
Az. Broder et al., FINDING HIDDEN HAMILTONIAN CYCLES, Random structures & algorithms, 5(3), 1994, pp. 395-410
ONLINE LOAD BALANCING
Authors:
AZAR Y BRODER AZ KARLIN AR
Citation:
Y. Azar et al., ONLINE LOAD BALANCING, Theoretical computer science, 130(1), 1994, pp. 73-84
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
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
ON THE PROBLEM OF APPROXIMATING THE NUMBER OF BASES OF A MATROID
Authors:
AZAR Y BRODER AZ FRIEZE AM
Citation:
Y. Azar et al., ON THE PROBLEM OF APPROXIMATING THE NUMBER OF BASES OF A MATROID, Information processing letters, 50(1), 1994, pp. 9-11
Risultati:
1-11
|