Publisher: Athabasca University Press (parent print book).
Cited passages: Open Data Structures, section 5.1, the array of lists and the find/remove operations.
Cited passages: Open Data Structures, section 11.1.4, Theorem 11.5: deterministic comparison-tree lower bound.
Cited passages: Open Data Structures, section 11.2.1: associated data, backwards placement, Theorem 11.7 and stability; Open Data Structures, section 11.2.2: least-significant-digit passes, stability argument, and Theorem 11.8.
Cited passages: Pat Morin, Open Data Structures, chapter 6: roots, left and right children; Pat Morin, Open Data Structures, section 6.2.1: exact-match searching; Pat Morin, Open Data Structures, section 6.2: the binary search tree property.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version