Back to search
University of North Texas
Efficient Parallel Algorithms and Data Structures Related to Trees
Abstract
dc:descriptionThe main contribution of this dissertation proposes a new paradigm, called the parentheses matching paradigm. It claims that this paradigm is well suited for designing efficient parallel algorithms for a broad class of nonnumeric problems. To demonstrate its applicability, we present three cost-optimal parallel algorithms for breadth-first traversal of general trees, sorting a special class of integers, and coloring an interval graph with the minimum number of colors.
Degree
thesis:*- Grantor dc:publisher
- University of North Texas
- Year dc:date
- 1991
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chen, Calvin Ching-Yuen
- Contributors dc:contributor
-
- Das, Sajal K.
- Fisher, Paul
- Yang, C. C.
- Jacob, Roy T.
- Brand, Neal E.
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- Public
- Chen, Calvin Ching-Yuen
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
local-cont-no: 1002718260-Chen
call-no: 379 N81d no.3444
oclc: 26951473
untcat: b1641626
ark: ark:/67531/metadc332626