AAAAAA
Results:
1-7
|
Results: 7
Authors:
DUBHASHI D
GRABLE DA
PANCONESI A
Citation: D. Dubhashi et al., NEAR-OPTIMAL, DISTRIBUTED EDGE-COLORING VIA THE NIBBLE METHOD, Theoretical computer science, 203(2), 1998, pp. 225-251
Authors:
GRABLE DA
PANCONESI A
Citation: Da. Grable et A. Panconesi, NEARLY OPTIMAL DISTRIBUTED EDGE-COLORING IN O(LOG LOG-N) ROUNDS, Random structures & algorithms, 10(3), 1997, pp. 385-405
Authors:
ANGLESIO J
BECKWITH D
BINZ JC
BOWRON M
CALLAN D
CHAPMAN RJ
CHU W
DEIERMANN P
EKHAD SB
FUKUTA J
GRABLE DA
GRANT CP
GRIFFIN P
VANHAERINGEN H
HOLZSAGER R
JEONG WK
KARPARVAR AM
KLAMKIN MS
KLEIN BG
KOMANDA N
KOSTER DW
KOTLARSKI II
LESLIE RA
LOSSER OP
MOCSY M
NEMES I
PERERA K
PRANESACHAR CR
RANALDI P
RICHARDS RW
RICHBERG R
ROBERTSON JB
SCHMIDT F
STEELMAN JH
STUBBS HL
VERDESTAR L
VOWE M
WILF HS
Citation: J. Anglesio et al., WORLD SERIES, 1994, The American mathematical monthly, 104(1), 1997, pp. 70-71
Authors:
EATON N
GRABLE DA
Citation: N. Eaton et Da. Grable, SET INTERSECTION REPRESENTATIONS FOR ALMOST-ALL GRAPHS, Journal of graph theory, 23(3), 1996, pp. 309-320
Authors:
GRABLE DA
Citation: Da. Grable, NEARLY-PERFECT HYPERGRAPH PACKING IS IN NC, Information processing letters, 60(6), 1996, pp. 295-299
Authors:
GRABLE DA
Citation: Da. Grable, THE DIAMETER OF A RANDOM GRAPH WITH BOUNDED DIAMETER, Random structures & algorithms, 6(2-3), 1995, pp. 193-199
Authors:
GRABLE DA
Citation: Da. Grable, ALMOST-ALL LINEAR-SPACES AND PARTIAL T-DESIGNS HAVE TRIVIAL AUTOMORPHISM-GROUPS, J COMB TH A, 68(1), 1994, pp. 1-32
Risultati:
1-7
|