Applying parallel computation algorithms in the design of serial algorithms

Applying parallel computation algorithms in the design of serial algorithms (1983)

by Nimrod Megiddo

Venue:	J. ACM
Citations:	224 - 7 self

Datum	Value	Source
TITLE	Applying parallel computation algorithms in the design of serial algorithms	INFERENCE
AUTHOR NAME	Nimrod Megiddo	SVM HeaderParse 0.2
AUTHOR AFFIL	Tel Aviv University, Tel Aviv	SVM HeaderParse 0.2
AUTHOR ADDR	Israel	SVM HeaderParse 0.2
ABSTRACT	Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A d ~ eframework d for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in sorting, selection, minimum-spanning-tree, shortest route, max-flow, and matrix multiplication problems, as well as in scheduling and locational problems.	SVM HeaderParse 0.2
YEAR	1983	INFERENCE
VENUE	J. ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	852--865	INFERENCE
VOLUME	30	INFERENCE
CITATIONS	37 found	ParsCit 1.0