Donald B. Johnson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2001

Testbed Evaluation of Virtual Environment Interaction TechniquesDoug A. Bowman, Donald B. Johnson, Larry F. Hodges. presence, 10(1):75-95, 2001.

1999

Testbed evaluation of virtual environment interaction techniquesDoug A. Bowman, Donald B. Johnson, Larry F. Hodges. vrst 1999: 26-33 [doi]

1997

Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAMDonald B. Johnson, Panagiotis Takis Metaxas. jcss, 54(2):227-242, 1997.

1996

1995

A Tight Upper Bound on the Benefits of Replica Control ProtocolsDonald B. Johnson, Larry Raab. jcss, 51(2):168-176, 1995.

A Parallel Algorithm for Computing Minimum Spanning TreesDonald B. Johnson, Panagiotis Takis Metaxas. jal, 19(3):383-401, 1995.

1994

Complexity of Network Reliability and Optimal Resource Placement ProblemsDonald B. Johnson, Larry Raab. SICOMP, 23(3):510-519, 1994.

1992

A Visualization System for Correctness Proofs of Graph AlgorithmsPeter A. Gloor, Donald B. Johnson, Fillia Makedon, Panagiotis Takis Metaxas. csedu, 3(3):315-333, 1992. [doi]

Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning TreeDonald B. Johnson, Panagiotis Takis Metaxas. ipps 1992: 306-314

A Parallel Algorithm for Computing Minimum Spanning TreesDonald B. Johnson, Panagiotis Takis Metaxas. spaa 1992: 363-372 [doi]

1991

A Tight Upper Bound on the Benefits of Replication and Consistency Control ProtocolsDonald B. Johnson, Larry Raab. PODS 1991: 75-81 [doi]

Finding Optimal Quorum Assignments for Distributed DatabasesDonald B. Johnson, Larry Raab. icpp 1991: 214-218

Effects of Replication on Data AvailabilityDonald B. Johnson, Larry Raab. ijcs, 1(4), 1991.

Connected Components in O(/lg^3/2 |V|) Parallel Time for the CREW PRAMDonald B. Johnson, Panagiotis Takis Metaxas. focs 1991: 688-697

1990

Erratum: Generalized Selection and Ranking: Sorted MatricesGreg N. Frederickson, Donald B. Johnson. SICOMP, 19(1):205-206, 1990.

1987

Parallel algorithms for minimum cuts and maximum flows in planar networksDonald B. Johnson. JACM, 34(4):950-967, 1987. [doi]

1986

A Simple Proof of a Time-Space Trade-Off for Sorting with Linear ComparisonsDonald B. Johnson. TCS, 43:345-350, 1986.

1985

An O(n log² n) Algorithm for Maximum Flow in Undirected Planar NetworksRefael Hassin, Donald B. Johnson. SICOMP, 14(3):612-624, 1985.

1984

Generalized Selection and Ranking: Sorted MatricesGreg N. Frederickson, Donald B. Johnson. SICOMP, 13(1):14-30, 1984.

1983

Finding k-th Paths and p-Centers by Generating and Searching Good Data StructuresGreg N. Frederickson, Donald B. Johnson. jal, 4(1):61-80, 1983.

Partition of Planar Flow Networks (Preliminary Version)Donald B. Johnson, Shankar M. Venkatesan. focs 1983: 259-263

1982

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted ColumnsGreg N. Frederickson, Donald B. Johnson. jcss, 24(2):197-208, 1982.

Sorting Numbers in Linear Expected Time and Optimal Extra SpaceTeofilo F. Gonzalez, Donald B. Johnson. ipl, 15(3):119-124, 1982.

Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version)Donald B. Johnson, Shankar M. Venkatesan. focs 1982: 244-254

A Priority Queue in Which Initialization and Queue Operations Take O(log log D) TimeDonald B. Johnson. mst, 15(4):295-309, 1982.

1980

Generalized Selection and Ranking (Preliminary Version)Greg N. Frederickson, Donald B. Johnson. stoc 1980: 420-428

Generating and Searching Sets Induced by NetworksGreg N. Frederickson, Donald B. Johnson. icalp 1980: 221-233

A New Algorithm for Preemptive Scheduling of TreesTeofilo F. Gonzalez, Donald B. Johnson. JACM, 27(2):287-312, 1980. [doi]

1979

Reducibility Among Floating-Point GraphsDonald B. Johnson, Webb Miller, Brian Minnihan, Celia Wrathall. JACM, 26(4):739-760, 1979. [doi]

1978

Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_mDonald B. Johnson, Tetsuo Mizoguchi. SICOMP, 7(2):147-153, 1978.

Lower Bounds for Selection in X+Y and Other MultisetsDonald B. Johnson, Samuel D. Kashdan. JACM, 25(4):556-570, 1978. [doi]

1977

Efficient Algorithms for Shortest Paths in Sparse NetworksDonald B. Johnson. JACM, 24(1):1-13, 1977. [doi]

1975

Priority Queues with Update and Finding Minimum Spanning TreesDonald B. Johnson. ipl, 4(3):53-57, 1975.

Finding All the Elementary Circuits of a Directed GraphDonald B. Johnson. SICOMP, 4(1):77-84, 1975.

1973

A Note on Dijkstra s Shortest Path AlgorithmDonald B. Johnson. JACM, 20(3):385-388, 1973. [doi]

Algorithms for Shortest PathsDonald B. Johnson. PhD thesis, Cornell University, USA, 1973.

Sign in or sign up to see more results.

runs on WebDSL