Journal of the ACM Bibliography
Harold N. Gabow. An almost-linear
algorithm for two-processor scheduling. Journal of the ACM,
29(3):766-780, July 1982.
[BibTeX entry]
Selected papers that cite this one
- A. K. Amoura. A
note scheduling multiprocessor tasks with precedence constraints on
parallel processors. Information Processing Letters,
63(3):119-122, 14 August 1997.
- Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil
Maheshwari, Jörg-Rüdiger Sack, and Jorge Urrutia. Planar stage
graphs: Characterizations and applications. Theoretical
Computer Science, 175(2):239-255, 10 April 1997.
- Bonnie Berger and Lenore Cowen. Scheduling with
concurrency-based constraints. Journal of Algorithms,
18(1):98-123, January 1995.
- Bertrand Braschi and Denis Trystram. A new insight into
the Coffman-Graham algorithm. SIAM Journal on
Computing, 23(3):662-669, June 1994.
- Sivaprakasam Sunder and Xin He. Scheduling interval
ordered tasks in parallel. Journal of Algorithms,
26(1):34-47, January 1998.
Shortcuts: