Klaus Jansen, Lorant Porkolab. Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 398-409, Springer, 2000. [doi]
@inproceedings{JansenP00:0, title = {Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time}, author = {Klaus Jansen and Lorant Porkolab}, year = {2000}, url = {http://link.springer.de/link/service/series/0558/bibs/1969/19690398.htm}, researchr = {https://researchr.org/publication/JansenP00%3A0}, cites = {0}, citedby = {0}, pages = {398-409}, booktitle = {Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings}, editor = {D. T. Lee and Shang-Hua Teng}, volume = {1969}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-41255-7}, }