"Tight Bounds on the Complexity of Parallel Sorting"

Frank Thomson Leighton (1984)

Details and statistics

DOI: 10.1145/800057.808667

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics