Journal of the ACM Bibliography
M.
R. Garey and D. S.
Johnson. Scheduling tasks with nonuniform deadlines on two
processors. Journal of the ACM, 23(3):461-467, July 1976.
[BibTeX entry]
Selected papers that cite this one
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario
Szegedy. Proof
verification and the hardness of approximation problems.
Journal of the ACM, 45(3):501-555, May 1998.
- Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs,
and nonapproximability -- towards tight results. SIAM Journal
on Computing, 27(3):804-915, June 1998.
- Uriel Feige and Joe Kilian. Zero knowledge and the
chromatic number. Journal of Computer and System
Sciences, 57(2):187-199, October 1998.
- Sivaprakasam Sunder and Xin He. Scheduling interval
ordered tasks in parallel. Journal of Algorithms,
26(1):34-47, January 1998.
Shortcuts: