Back to search

University of North Texas

Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design

Abstract

dc:description

The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner. In this regard, there is a need to categorize strategies in order to solve broad classes of problems with similar structures and requirements. In this dissertation, two parallel algorithm design strategies are considered: linked list ranking and parentheses matching.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1993

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Halverson, Ranette Hudson
Contributors dc:contributor
  • Das, Sajal K.
  • Jacob, Roy Thomas
  • Brand, Neal E.
  • Yang, Cui-Qing, 1944-

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Halverson, Ranette Hudson
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81d no.3839
local-cont-no: 1002721481-halverson
untcat: b1778214
ark: ark:/67531/metadc278153

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Halverson, Ranette Hudson. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc278153/