Search the dblp DataBase
Donald B. Johnson :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Donald B. Johnson Finding All the Elementary Circuits of a Directed Graph. [Citation Graph (4, 0)][DBLP ] SIAM J. Comput., 1975, v:4, n:1, pp:77-84 [Journal ] Donald B. Johnson , Larry Raab A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols. [Citation Graph (1, 15)][DBLP ] PODS, 1991, pp:75-81 [Conf ] Donald B. Johnson A Note on Dijkstra's Shortest Path Algorithm. [Citation Graph (1, 0)][DBLP ] J. ACM, 1973, v:20, n:3, pp:385-388 [Journal ] Donald B. Johnson Efficient Algorithms for Shortest Paths in Sparse Networks. [Citation Graph (1, 0)][DBLP ] J. ACM, 1977, v:24, n:1, pp:1-13 [Journal ] Greg N. Frederickson , Donald B. Johnson The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1982, v:24, n:2, pp:197-208 [Journal ] Greg N. Frederickson , Donald B. Johnson Generalized Selection and Ranking: Sorted Matrices. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:1, pp:14-30 [Journal ] Donald B. Johnson , Panagiotis Takis Metaxas Connected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:688-697 [Conf ] Donald B. Johnson , Shankar M. Venkatesan Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1982, pp:244-254 [Conf ] Donald B. Johnson , Shankar M. Venkatesan Partition of Planar Flow Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1983, pp:259-263 [Conf ] Greg N. Frederickson , Donald B. Johnson Generating and Searching Sets Induced by Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 1980, pp:221-233 [Conf ] Donald B. Johnson , Larry Raab Finding Optimal Quorum Assignments for Distributed Databases. [Citation Graph (0, 0)][DBLP ] ICPP (3), 1991, pp:214-218 [Conf ] Donald B. Johnson , Panagiotis Takis Metaxas Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP ] IPPS, 1992, pp:306-314 [Conf ] Michael Goldweber , Donald B. Johnson Minimizing Access Costs in Replicated Distributed Syste (Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:56- [Conf ] Donald B. Johnson , Panagiotis Takis Metaxas A Parallel Algorithm for Computing Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] SPAA, 1992, pp:363-372 [Conf ] Greg N. Frederickson , Donald B. Johnson Generalized Selection and Ranking (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:420-428 [Conf ] Doug A. Bowman , Donald B. Johnson , Larry F. Hodges Testbed evaluation of virtual environment interaction techniques. [Citation Graph (0, 0)][DBLP ] VRST, 1999, pp:26-33 [Conf ] Donald B. Johnson , Panagiotis Takis Metaxas Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:16, n:6, pp:633-648 [Journal ] Matthew Cheyney , Peter A. Gloor , Donald B. Johnson , Fillia Makedon , James Matthews , Panagiotis Takis Metaxas Toward Multimedia Conference Proceedings. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1996, v:39, n:1, pp:50-59 [Journal ] Donald B. Johnson , George M. Dolan Transaction Security System Extensions to the Common Cryptographic Architecture. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 1991, v:30, n:2, pp:230-243 [Journal ] Donald B. Johnson , George M. Dolan , Michael J. Kelly , An V. Le , Stephen M. Matyas Common Cryptographic Architecture Cryptographic Application Programming Interface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 1991, v:30, n:2, pp:130-150 [Journal ] An V. Le , Stephen M. Matyas , Donald B. Johnson , John D. Wilkins A Public Key Extension to the Common Cryptographic Architecture. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 1993, v:32, n:3, pp:461-485 [Journal ] Donald B. Johnson , Larry Raab Effects of Replication on Data Availability. [Citation Graph (0, 0)][DBLP ] International Journal in Computer Simulation, 1991, v:1, n:4, pp:- [Journal ] Teofilo F. Gonzalez , Donald B. Johnson Sorting Numbers in Linear Expected Time and Optimal Extra Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:3, pp:119-124 [Journal ] Donald B. Johnson Priority Queues with Update and Finding Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1975, v:4, n:3, pp:53-57 [Journal ] Teofilo F. Gonzalez , Donald B. Johnson A New Algorithm for Preemptive Scheduling of Trees. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:287-312 [Journal ] Donald B. Johnson Parallel algorithms for minimum cuts and maximum flows in planar networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1987, v:34, n:4, pp:950-967 [Journal ] Donald B. Johnson , Samuel D. Kashdan Lower Bounds for Selection in X+Y and Other Multisets. [Citation Graph (0, 0)][DBLP ] J. ACM, 1978, v:25, n:4, pp:556-570 [Journal ] Donald B. Johnson , Webb Miller , Brian Minnihan , Celia Wrathall Reducibility Among Floating-Point Graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 1979, v:26, n:4, pp:739-760 [Journal ] Greg N. Frederickson , Donald B. Johnson Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1983, v:4, n:1, pp:61-80 [Journal ] Donald B. Johnson , Panagiotis Takis Metaxas A Parallel Algorithm for Computing Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:19, n:3, pp:383-401 [Journal ] Donald B. Johnson , Panagiotis Takis Metaxas Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAM. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:227-242 [Journal ] Donald B. Johnson , Larry Raab A Tight Upper Bound on the Benefits of Replica Control Protocols. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:51, n:2, pp:168-176 [Journal ] Donald B. Johnson A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1982, v:15, n:4, pp:295-309 [Journal ] Doug A. Bowman , Donald B. Johnson , Larry F. Hodges Testbed Evaluation of Virtual Environment Interaction Techniques. [Citation Graph (0, 0)][DBLP ] Presence, 2001, v:10, n:1, pp:75-95 [Journal ] Greg N. Frederickson , Donald B. Johnson Erratum: Generalized Selection and Ranking: Sorted Matrices. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:1, pp:205-206 [Journal ] Refael Hassin , Donald B. Johnson An O(n log² n) Algorithm for Maximum Flow in Undirected Planar Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:3, pp:612-624 [Journal ] Donald B. Johnson , Tetsuo Mizoguchi Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1978, v:7, n:2, pp:147-153 [Journal ] Donald B. Johnson , Larry Raab Complexity of Network Reliability and Optimal Resource Placement Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:3, pp:510-519 [Journal ] Donald B. Johnson A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1986, v:43, n:, pp:345-350 [Journal ] Search in 0.004secs, Finished in 0.005secs