论文信息 - The Token Distribution Problem (Preliminary Version) - 字舞流文

The Token Distribution Problem (Preliminary Version)

Eli Upfal | David Peleg | E. Upfal | D. Peleg

[1] Noga Alon,et al. Expanders, sorting in rounds and superconcentrators of limited depth , 1985, STOC '85.

[2] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[3] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.

[4] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.

[5] Debasis Mitra,et al. Randomized Parallel Communications , 1986, ICPP.

[6] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[7] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.

[8] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.