Efficient sequential and parallel algorithms for computing recovery points in trees and paths

Authors:
Marek Chrobak;David Eppstein;Giuseppe F. Italiano;Moti Yung
Affiliations:
Department of Computer Science, University of California, Riverside, CA;Xerox PARC, Palo Alto, CA and University of California, Irvine, CA and Columbia University, New York, NY;Department of Computer Science, Columbia University, New York, NY and Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', Roma, Italy;IBM Research Division, T.J. Watson Research Center, Yorktown, Heights, NY
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 11
Cited 0

On the optimum checkpoint selection problem

SIAM Journal on Computing
An End-to-End Approach to the Resequencing Problem

Journal of the ACM (JACM)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Algorithms of placing recovery points

Information Processing Letters
Deterministic parallel list ranking

VLSI Algorithms and Architectures
Optimal algorithms for approximate clustering

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A simple parallel tree contraction algorithm

Journal of Algorithms
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

Journal of the ACM (JACM)
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking

AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract