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

brightness
contrast
saturation
exposure
gamma
Applying filters

Upcoming Pages

Here’s what’s next.

upcoming item: 3 3 of 129
upcoming item: 4 4 of 129
upcoming item: 5 5 of 129
upcoming item: 6 6 of 129

Show all pages in this dissertation.

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 December 13, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; .

International Image Interoperability Framework (This Page)