ScholarLens Back to search
1984•Journal of Computer and System SciencesOpen access

New trie data structures which support very fast search operations

Dan E. Willard

Open full text 94 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 94 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Trie, Data structure, Set (abstract data type), Computer science, Combinatorics, Binary search tree, Space (punctuation), Mathematics

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
New trie data structures which support very fast search operations — Research Paper | ScholarLens