Johnson, Donald B. A simple proof of a time-space trade-off for sorting with linear comparisons. (English) Zbl 0597.68052 Theor. Comput. Sci. 43, 345-350 (1986). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{D. B. Johnson}, Theor. Comput. Sci. 43, 345--350 (1986; Zbl 0597.68052) Full Text: DOI
Johnson, Donald B. A priority queue in which initialization and queue operations take 0(log log D) time. (English) Zbl 0522.68039 Math. Syst. Theory 15, 295-309 (1982). MSC: 68M20 60K25 68P05 68R10 PDF BibTeX XML Cite \textit{D. B. Johnson}, Math. Syst. Theory 15, 295--309 (1982; Zbl 0522.68039) 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. Priority queues with update and finding minimum spanning trees. (English) Zbl 0318.68032 Inf. Process. Lett. 4, 53-57 (1975). MSC: 68W99 68W30 68Q25 68N01 68Q45 05C05 PDF BibTeX XML Cite \textit{D. B. Johnson}, Inf. Process. Lett. 4, 53--57 (1975; Zbl 0318.68032) Full Text: DOI
Johnson, Donald B. Finding all the elementary circuits of a directed graph. (English) Zbl 0275.05112 SIAM J. Comput. 4, 77-84 (1975). MSC: 05-04 05C35 05C20 PDF BibTeX XML Cite \textit{D. B. Johnson}, SIAM J. Comput. 4, 77--84 (1975; Zbl 0275.05112) 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