OpenAlex
PricingAboutJobs
Log inGet started
Work

A characterization of digital search trees from the successful search viewpoint

HTML PDF

Year: 1991
Type: article
Source: Theoretical Computer Science
DOI: 10.1016/0304-3975(91)90050-c
Author: Wojciech Szpankowski
Institution: Purdue University West Lafayette
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: digital search trees, average-case analysis, variance, skewness, entropy (information theory), Patricia trie, tries, balanced trees, insertion cost

Open Access status: bronze

Funders: National Science Foundation, U.S. National Library of Medicine, Air Force Office of Scientific Research
Awards: Algorithmic and Combintorial Problems On Words, US-Austria Cooperative Research: Analysis of Data Structures for Digital Search, G7994075383
OpenAlex ID: W2016274785
FWCI: 1.12
Cites: 25
Cited by: 36
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security