1. An efficient approximation algorithm for minimizing makespan on uniformly related machines;Chekuri,1998
2. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds;Chudak,1997
3. Matrix multiplication via arithmetic progressions;Coppersmith;J. Symbolic Comput.,1990
4. Bounds for certain multiprocessor anomalies;Graham;Bell System Tech. J.,1966
5. A level algorithm for preemptive scheduling;Horvath;J. Assoc. Comput. Mach.,1977