论文信息 - Maximum Finding on a Multiple Access Broadcast Network - 字舞流文

Maximum Finding on a Multiple Access Broadcast Network

Charles U. Martel | C. Martel

[1] Shiva Prasad Chaudhuri. Lower bounds in parallel computation , 1992 .

[2] Charles U. Martel,et al. Optimal Prioritized Conflict Resolution on a Multiple Access Channel , 1991, IEEE Trans. Computers.

[3] Bogdan S. Chlebus,et al. Parallel Quicksort , 1991, J. Parallel Distributed Comput..

[4] Charles U. Martel,et al. A Fast Parallel Quicksort Algorithm , 1989, Inf. Process. Lett..

[5] Dan E. Willard,et al. Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[6] Leonard Kleinrock,et al. Broadcast Communications and Distributed Algorithms , 1986, IEEE Transactions on Computers.

[7] Benjamin W. Wah,et al. Resource scheduling for local computer systems with a multiaccess network , 1985, IEEE Transactions on Computers.

[8] Faith Ellen,et al. Relations between concurrent-write models of parallel computation , 1984, PODC '84.

[9] Albert G. Greenberg. On the time complexity of broadcast communication schemes (Preliminary Version) , 1982, STOC '82.

[10] Steven P. Levitan,et al. Finding an extremum in a network , 1982, ISCA '82.

[11] Steven P. Levitan,et al. Algorithms for a Broadcast Protocol Multiprocessor , 1982, IEEE International Conference on Distributed Computing Systems.

[12] Robert Metcalfe,et al. Ethernet: distributed packet switching for local computer networks , 1988, CACM.