AAAAAA
Results:
1-10
|
Results: 10
Authors:
BLELLOCH GE
LEISERSON CE
MAGGS BM
PLAXTON CG
SMITH SJ
ZAGHA M
Citation: Ge. Blelloch et al., AN EXPERIMENTAL-ANALYSIS OF PARALLEL SORTING ALGORITHMS, theory of computing systems, 31(2), 1998, pp. 135-167
Authors:
MACKENZIE PD
PLAXTON CG
RAJARAMAN R
Citation: Pd. Mackenzie et al., ON CONTENTION RESOLUTION PROTOCOLS AND ASSOCIATED PROBABILISTIC PHENOMENA, JOURNAL OF THE ACM, 45(2), 1998, pp. 324-378
Authors:
LEIGHTON T
PLAXTON CG
Citation: T. Leighton et Cg. Plaxton, HYPERCUBIC SORTING NETWORKS, SIAM journal on computing, 27(1), 1998, pp. 1-46
Authors:
PLAXTON CG
SUEL T
Citation: Cg. Plaxton et T. Suel, LOWER BOUNDS FOR SHELLSORT, Journal of algorithms, 23(2), 1997, pp. 221-240
Authors:
LEIGHTON T
MA Y
PLAXTON CG
Citation: T. Leighton et al., BREAKING THE THETA(NLOG(2)N) BARRIER FOR SORTING WITH FAULTS, Journal of computer and system sciences, 54(2), 1997, pp. 265-304
Authors:
BARUAH SK
GEHRK JE
PLAXTON CG
STOICA I
ABDELWAHAB H
JEFFAY K
Citation: Sk. Baruah et al., FAIR ONLINE SCHEDULING OF A DYNAMIC SET OF TASKS ON A SINGLE RESOURCE, Information processing letters, 64(1), 1997, pp. 43-51
Authors:
KRAVETS D
PLAXTON CG
Citation: D. Kravets et Cg. Plaxton, ALL NEAREST SMALLER VALUES ON THE HYPERCUBE, IEEE transactions on parallel and distributed systems, 7(5), 1996, pp. 456-462
Authors:
BLELLOCH GE
LEISERSON CE
PLAXTON CG
Citation: Ge. Blelloch et al., 1994 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES - JUNE 27-29, 1994 - FOREWORD, Journal of computer and system sciences, 53(3), 1996, pp. 315-315
Authors:
PLAXTON CG
SUEL T
Citation: Cg. Plaxton et T. Suel, A LOWER-BOUND FOR SORTING NETWORKS BASED ON THE SHUFFLE PERMUTATION, Mathematical systems theory, 27(5), 1994, pp. 491-508
Authors:
CYPHER R
PLAXTON CG
Citation: R. Cypher et Cg. Plaxton, DETERMINISTIC SORTING IN NEARLY LOGARITHMIC TIME ON THE HYPERCUBE ANDRELATED COMPUTERS, Journal of computer and system sciences, 47(3), 1993, pp. 501-548
Risultati:
1-10
|