z-logo
open-access-imgOpen Access
The nearly optimal n-ary search tree
Author(s) -
Dominic J. Catalano
Publication year - 2016
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.17760/d20253673
Subject(s) - computer science , tree (set theory) , data mining , search tree , variance (accounting) , search engine indexing , key (lock) , search algorithm , information retrieval , algorithm , mathematics , mathematical analysis , business , accounting , computer security

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom