An optimal parallel minimax tree algorithm

An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms f...

Full description

Bibliographic Details

Published in:	Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 293 - 300
Main Authors:	Kirkpatrick, D.G., Przytycka, T.
Format:	Conference Proceeding
Language:	English
Published:	IEEE Comput. Soc. Press 1990
Subjects:	Acceleration Algorithm design and analysis Binary search trees Binary trees Computer science Cost function Filling Minimax techniques Parallel algorithms Phase change random access memory
ISBN:	0818620870, 9780818620874
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!