Johnson, Donald B.; Metaxas, Panagiotis Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM. (English) Zbl 0877.68088 J. Comput. Syst. Sci. 54, No. 2, 227-242 (1997). MSC: 68R10 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{P. Metaxas}, J. Comput. Syst. Sci. 54, No. 2, 227--242 (1997; Zbl 0877.68088) Full Text: DOI
Johnson, D. B.; Metaxas, P. Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree. (English) Zbl 0860.68053 Algorithmica 16, No. 6, 633-648 (1996). MSC: 68W10 68R10 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{P. Metaxas}, Algorithmica 16, No. 6, 633--648 (1996; Zbl 0860.68053) Full Text: DOI
Johnson, Donald B.; Metaxas, Panagiotis A parallel algorithm for computing minimum spanning trees. (English) Zbl 0836.68083 J. Algorithms 19, No. 3, 383-401 (1995). MSC: 68R10 68W15 68Q25 68Q05 05C40 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{P. Metaxas}, J. Algorithms 19, No. 3, 383--401 (1995; Zbl 0836.68083) Full Text: DOI
Johnson, D. B.; Matyas, S. M.; Le, A. V.; Wilkins, J. D. The commercial data masking facility (CDMF) data privacy algorithm. (English) Zbl 0939.68622 IBM J. Res. Dev. 38, No. 2, 217-226 (1994). MSC: 68P25 94A60 PDF BibTeX XML Cite \textit{D. B. Johnson} et al., IBM J. Res. Dev. 38, No. 2, 217--226 (1994; Zbl 0939.68622) Full Text: DOI
Johnson, Donald B.; Raab, Larry Complexity of network reliability and optimal resource placement problems. (English) Zbl 0813.68116 SIAM J. Comput. 23, No. 3, 510-519 (1994). Reviewer: Du Ding-Zhu (Minneapolis) MSC: 68Q25 68P15 68M15 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{L. Raab}, SIAM J. Comput. 23, No. 3, 510--519 (1994; Zbl 0813.68116) Full Text: DOI
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
Hassin, Refael; Johnson, Donald B. An O(n \(\log ^ 2n)\) algorithm for maximum flow in undirected planar networks. (English) Zbl 0565.90018 SIAM J. Comput. 14, 612-624 (1985). MSC: 90B10 05C35 68Q25 90C35 65K05 PDF BibTeX XML Cite \textit{R. Hassin} and \textit{D. B. Johnson}, SIAM J. Comput. 14, 612--624 (1985; Zbl 0565.90018) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Generalized selection and ranking: sorted matrices. (English) Zbl 0537.68059 SIAM J. Comput. 13, 14-30 (1984). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, SIAM J. Comput. 13, 14--30 (1984; Zbl 0537.68059) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Finding kth paths and p-centers by generating and searching good data structures. (English) Zbl 0509.68057 J. Algorithms 4, 61-80 (1983). MSC: 68R10 05C05 68P10 68P05 68W99 PDF BibTeX XML Cite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, J. Algorithms 4, 61--80 (1983; Zbl 0509.68057) 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
Gonzalez, Teofilo F.; Johnson, Donald B. Sorting numbers in linear expected time and optimal extra space. (English) Zbl 0491.68058 Inf. Process. Lett. 15, 119-124 (1982). MSC: 68P10 PDF BibTeX XML Cite \textit{T. F. Gonzalez} and \textit{D. B. Johnson}, Inf. Process. Lett. 15, 119--124 (1982; Zbl 0491.68058) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. The complexity of selection and ranking in X+Y and matrices with sorted columns. (English) Zbl 0478.68062 J. Comput. Syst. Sci. 24, 197-208 (1982). MSC: 68P10 PDF BibTeX XML Cite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, J. Comput. Syst. Sci. 24, 197--208 (1982; Zbl 0478.68062) Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Generating and searching sets induced by networks (preliminary version). (English) Zbl 0453.68034 Automata, languages and programming, 7th Colloq., Noordwijkerhout/ Netherlands 1980, Lect. Notes Comput. Sci. 85, 221-233 (1980). MSC: 68R10 05C05 68Q25 68P10 PDF BibTeX XML
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
Coffman, E. G. jun.; Johnson, Donald B.; Leung, Joseph Y.-T. An efficient algorithm for allocating paged, drum-like storage. (English) Zbl 0379.68022 BIT, Nord. Tidskr. Inf.-behandl. 18, 52-66 (1978). MSC: 68W99 68Q25 68N01 PDF BibTeX XML Cite \textit{E. G. Coffman jun.} et al., BIT, Nord. Tidskr. Inf.-behandl. 18, 52--66 (1978; Zbl 0379.68022) Full Text: DOI
Johnson, Donald B.; Mizoguchi, Tetsuo Selecting the \(k\)th element in \(X+Y\) and \(X_1+X_2+\dots +X_m\). (English) Zbl 0375.68022 SIAM J. Comput. 7, 147-153 (1978). MSC: 68W99 68Q25 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{T. Mizoguchi}, SIAM J. Comput. 7, 147--153 (1978; Zbl 0375.68022) Full Text: DOI
Coffman, E. G. jun.; Cody, R. A.; Johnson, D. B. Analysis of a bin-packing algorithm for reducing access times on drum- like storage devices. (English) Zbl 0363.68061 Found. Control Eng. 2, 119-130 (1977). MSC: 68W99 68Q45 PDF BibTeX XML Cite \textit{E. G. Coffman jun.} et al., Found. Control Eng. 2, 119--130 (1977; Zbl 0363.68061)
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.; Sethi, Ravi A characterization of LL(1) grammars. (English) Zbl 0341.68053 BIT, Nord. Tidskr. Inf.-behandl. 16, 275-280 (1976). MSC: 68Q45 68N01 PDF BibTeX XML Cite \textit{D. B. Johnson} and \textit{R. Sethi}, BIT, Nord. Tidskr. Inf.-behandl. 16, 275--280 (1976; Zbl 0341.68053) Full Text: DOI
Bruno, J.; Coffman, E. G. jun.; Johnson, D. B. On batch scheduling of jobs with stochastic service times and cost structures on a single server. (English) Zbl 0329.60072 J. Comput. Syst. Sci. 12, 319-335 (1976). MSC: 60K25 PDF BibTeX XML Cite \textit{J. Bruno} et al., J. Comput. Syst. Sci. 12, 319--335 (1976; Zbl 0329.60072) 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
Wall, Charles R.; Crews, Phillip L.; Johnson, Donald B. Density bounds for the sum of divisors function. (English) Zbl 0258.10025 Math. Comput. 26, 773-777 (1972). MSC: 11N60 11B83 PDF BibTeX XML Cite \textit{C. R. Wall} et al., Math. Comput. 26, 773--777 (1972; Zbl 0258.10025) Full Text: DOI