Selected papers that cite this one
- S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600-625, June 1996.
- David S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 2(4):393-405, December 1981.
- T. H. Romer and L. E. Rosier. An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling. Algorithmica, 17(1):1-10, January 1997.
- D. F. Shallcross, V. Y. Pan, and Y. Lin-Kriz. Planar integer linear programming is NC equivalent to Euclidean GCD. SIAM Journal on Computing, 27(4):960-971, August 1998.