Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design Page: Title Page
The following text was automatically extracted from the image on this page using optical character recognition software:
EFFICIENT LINKED LIST RANKING ALGORITHMS AND
PARENTHESES MATCHING AS A NEW STRATEGY
FOR PARALLEL ALGORITHM DESIGN
Presented to the Graduate Council of the
University of North Texas in Partial
Fulfillment of the Requirements
For the Degree of
DOCTOR OF PHILOSOPHY
Ranette Hudson Halverson, B.S., M.S.
Here’s what’s next.
This dissertation can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Dissertation.
Halverson, Ranette Hudson. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design, dissertation, December 1993; Denton, Texas. (digital.library.unt.edu/ark:/67531/metadc278153/m1/2/: accessed February 18, 2019), University of North Texas Libraries, Digital Library, digital.library.unt.edu; .