Donald B. Johnson

J. Comput. Syst. Sci., 1997

1996

Deterministic Leader Election on the Asynchronous QRQW PRAM.

[BibT_eX]

[DOI]

Chris Armen

Parallel Process. Lett., 1996

Toward Multimedia Conference Proceedings.

[BibT_eX]

[DOI]

Commun. ACM, 1996

Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Algorithmica, 1996

Minimizing Access Costs in Replicated Distributed Syste (Abstract).

[BibT_eX]

[DOI]

Michael Goldweber

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

A Tight Upper Bound on the Benefits of Replica Control Protocols.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

A Parallel Algorithm for Computing Minimum Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1995

1994

Complexity of Network Reliability and Optimal Resource Placement Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

1992

A Visualization System for Correctness Proofs of Graph Algorithms.

[BibT_eX]

[DOI]

Peter A. Gloor

Fillia Makedon

Comput. Sci. Educ., 1992

Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

Effects of Replication on Data Availability.

[BibT_eX]

Int. J. Comput. Simul., 1991

A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

Finding Optimal Quorum Assignments for Distributed Databases.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1991

Connected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Erratum: Generalized Selection and Ranking: Sorted Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

1987

Parallel algorithms for minimum cuts and maximum flows in planar networks.

[BibT_eX]

[DOI]

J. ACM, 1987

1986

A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

An O(n log<sup>2</sup> n) Algorithm for Maximum Flow in Undirected Planar Networks.

[BibT_eX]

[DOI]

Refael Hassin

SIAM J. Comput., 1985

1984

Generalized Selection and Ranking: Sorted Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

1983

Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1983

Partition of Planar Flow Networks (Preliminary Version)

[BibT_eX]

[DOI]

Shankar M. Venkatesan

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1982

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

Sorting Numbers in Linear Expected Time and Optimal Extra Space.

[BibT_eX]

[DOI]

Teofilo F. Gonzalez

Inf. Process. Lett., 1982

Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version)

[BibT_eX]

[DOI]

Shankar M. Venkatesan

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1980

A New Algorithm for Preemptive Scheduling of Trees.

[BibT_eX]

[DOI]

Teofilo F. Gonzalez

J. ACM, 1980

Generalized Selection and Ranking (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Generating and Searching Sets Induced by Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Reducibility Among Floating-Point Graphs.

[BibT_eX]

[DOI]

J. ACM, 1979

1978

Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m.

[BibT_eX]

[DOI]

Tetsuo Mizoguchi

SIAM J. Comput., 1978

Lower Bounds for Selection in X+Y and Other Multisets.

[BibT_eX]

[DOI]

Samuel D. Kashdan

J. ACM, 1978

1977

Efficient Algorithms for Shortest Paths in Sparse Networks.

[BibT_eX]

[DOI]

J. ACM, 1977

1975

Finding All the Elementary Circuits of a Directed Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

Priority Queues with Update and Finding Minimum Spanning Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

1973

A Note on Dijkstra's Shortest Path Algorithm.

[BibT_eX]

[DOI]