A Note on Dijkstra's Shortest Path Algorithm. - Donald B. Johnson 001 (J. ACM, 1973)

Algorithms for Shortest Paths. - Donald B. Johnson 001 (1973)

Priority Queues with Update and Finding Minimum Spanning Trees. - Donald B. Johnson 001 (Inf. Process. Lett., 1975)

Finding All the Elementary Circuits of a Directed Graph. - Donald B. Johnson 001 (SIAM J. Comput., 1975)

Efficient Algorithms for Shortest Paths in Sparse Networks. - Donald B. Johnson 001 (J. ACM, 1977)

Lower Bounds for Selection in X+Y and Other Multisets. - Donald B. Johnson 001; Samuel D. Kashdan (J. ACM, 1978)

Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m. - Donald B. Johnson 001; Tetsuo Mizoguchi (SIAM J. Comput., 1978)

Reducibility Among Floating-Point Graphs. - Donald B. Johnson 001; Webb Miller; Brian Minnihan; Celia Wrathall (J. ACM, 1979)

Generating and Searching Sets Induced by Networks. - Greg N. Frederickson; Donald B. Johnson 001 (ICALP, 1980)

Generalized Selection and Ranking (Preliminary Version) - Greg N. Frederickson; Donald B. Johnson 001 (STOC, 1980)

A New Algorithm for Preemptive Scheduling of Trees. - Teofilo F. Gonzalez; Donald B. Johnson 001 (J. ACM, 1980)

Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) - Donald B. Johnson 001; Shankar M. Venkatesan (FOCS, 1982)

Sorting Numbers in Linear Expected Time and Optimal Extra Space. - Teofilo F. Gonzalez; Donald B. Johnson 001 (Inf. Process. Lett., 1982)

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. - Greg N. Frederickson; Donald B. Johnson 001 (J. Comput. Syst. Sci., 1982)

A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time. - Donald B. Johnson 001 (Math. Syst. Theory, 1982)

Partition of Planar Flow Networks (Preliminary Version) - Donald B. Johnson 001; Shankar M. Venkatesan (FOCS, 1983)

Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. - Greg N. Frederickson; Donald B. Johnson 001 (J. Algorithms, 1983)

Generalized Selection and Ranking: Sorted Matrices. - Greg N. Frederickson; Donald B. Johnson 001 (SIAM J. Comput., 1984)

An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks. - Refael Hassin; Donald B. Johnson 001 (SIAM J. Comput., 1985)

A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons. - Donald B. Johnson 001 (Theor. Comput. Sci., 1986)

Parallel algorithms for minimum cuts and maximum flows in planar networks. - Donald B. Johnson 001 (J. ACM, 1987)

Erratum: Generalized Selection and Ranking: Sorted Matrices. - Greg N. Frederickson; Donald B. Johnson 001 (SIAM J. Comput., 1990)

Connected Components in O( lg^3/2 |V|) Parallel Time for the CREW PRAM - Donald B. Johnson 001; Panagiotis Takis Metaxas (FOCS, 1991)

Finding Optimal Quorum Assignments for Distributed Databases. - Donald B. Johnson 001; Larry Raab (ICPP (3), 1991)

A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols. - Donald B. Johnson 001; Larry Raab (PODS, 1991)

Effects of Replication on Data Availability. - Donald B. Johnson 001; Larry Raab (Int. J. Comput. Simul., 1991)

Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree. - Donald B. Johnson 001; Panagiotis Takis Metaxas (IPPS, 1992)

A Visualization System for Correctness Proofs of Graph Algorithms. - Peter A. Gloor; Donald B. Johnson 001; Fillia Makedon; Panagiotis Takis Metaxas (Comput. Sci. Educ., 1992)

Complexity of Network Reliability and Optimal Resource Placement Problems. - Donald B. Johnson 001; Larry Raab (SIAM J. Comput., 1994)

A Parallel Algorithm for Computing Minimum Spanning Trees. - Donald B. Johnson 001; Panagiotis Takis Metaxas (J. Algorithms, 1995)

A Tight Upper Bound on the Benefits of Replica Control Protocols. - Donald B. Johnson 001; Larry Raab (J. Comput. Syst. Sci., 1995)

Minimizing Access Costs in Replicated Distributed Syste (Abstract). - Michael Goldweber; Donald B. Johnson 001 (PODC, 1996)

Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree. - Donald B. Johnson 001; Panagiotis Takis Metaxas (Algorithmica, 1996)

Toward Multimedia Conference Proceedings. - Matthew Cheyney; Peter A. Gloor; Donald B. Johnson 001; Fillia Makedon; James Matthews; Panagiotis Takis Metaxas (Commun. ACM, 1996)

Deterministic Leader Election on the Asynchronous QRQW PRAM. - Chris Armen; Donald B. Johnson 001 (Parallel Process. Lett., 1996)

Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAM. - Donald B. Johnson 001; Panagiotis Takis Metaxas (J. Comput. Syst. Sci., 1997)