"Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time ..."

Klaus Jansen (2002)

Details and statistics

DOI: 10.1007/3-540-45749-6_50

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics