Gonzalez, Teofilo F.; Johnson, Donald B. A new algorithm for preemptive scheduling of trees. (English) Zbl 0446.68026 J. Assoc. Comput. Mach. 27, 287-312 (1980). MSC: 68M20 68Q25 PDF BibTeX XML Cite \textit{T. F. Gonzalez} and \textit{D. B. Johnson}, J. Assoc. Comput. Mach. 27, 287--312 (1980; Zbl 0446.68026) Full Text: DOI
Johnson, Donald B.; Miller, Webb; Minnihan, Brian; Wrathall, Celia Reducibility among floating-point graphs. (English) Zbl 0441.65034 J. Assoc. Comput. Mach. 26, 739-760 (1979). MSC: 65G50 05C50 65F30 68R10 65F05 PDF BibTeX XML Cite \textit{D. B. Johnson} et al., J. Assoc. Comput. Mach. 26, 739--760 (1979; Zbl 0441.65034) Full Text: DOI
Johnson, Donald B.; Kashdan, Samuel D. Lower bounds for selection in X+Y and other multisets. (English) Zbl 0388.68057 J. Assoc. Comput. Mach. 25, 556-570 (1978). MSC: 68Q25 68R99 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{S. D. Kashdan}, J. Assoc. Comput. Mach. 25, 556--570 (1978; Zbl 0388.68057) Full Text: DOI
Johnson, Donald B. Efficient algorithms for shortest paths in sparse networks. (English) Zbl 0343.68028 J. Assoc. Comput. Mach. 24, 1-13 (1977). MSC: 68Q25 68W99 68N01 05C20 PDF BibTeX XML Cite \textit{D. B. Johnson}, J. Assoc. Comput. Mach. 24, 1--13 (1977; Zbl 0343.68028) Full Text: DOI
Johnson, Donald B. A note on Dijkstra’s shortest path algorithm. (English) Zbl 0265.68026 J. Assoc. Comput. Mach. 20, 385-388 (1973). MSC: 68N01 68W99 PDF BibTeX XML Cite \textit{D. B. Johnson}, J. Assoc. Comput. Mach. 20, 385--388 (1973; Zbl 0265.68026) Full Text: DOI