dblp.uni-trier.dewww.uni-trier.de

Donald B. Johnson Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Chris Armen [31]
2Doug A. Bowman [36] [37]
3Matthew Cheyney [32]
4Greg N. Frederickson [9] [10] [12] [15] [17] [21]
5Peter A. Gloor [32]
6Michael Goldweber [34]
7Teofilo F. Gonzalez [8] [13]
8Refael Hassin [18]
9Larry F. Hodges [36] [37]
10Samuel D. Kashdan [6]
11Fillia Makedon [32]
12James Matthews [32]
13Panagiotis Takis Metaxas [25] [26] [27] [30] [32] [33] [35]
14Webb Miller [7]
15Brian Minnihan [7]
16Tetsuo Mizoguchi [5]
17Larry Raab [22] [23] [24] [28] [29]
18Shankar M. Venkatesan [14] [16]
19Celia Wrathall [7]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)