Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time (Q3694705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Searching Unindexed and Nonuniformly Generated Files in \log \log N Time |
scientific article; zbMATH DE number 3919832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time |
scientific article; zbMATH DE number 3919832 |
Statements
Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time (English)
0 references
1985
0 references
binary search
0 references
padded list
0 references
dense sequential file
0 references
fast trie
0 references
priority queue
0 references
stratified tree
0 references
Van Emde Boas tree
0 references
nonuniformly distributed ordered files
0 references
interpolation search
0 references
regula falsi
0 references
0.775467574596405
0 references
0.7575163245201111
0 references
0.7524849772453308
0 references
0.7518960237503052
0 references
0.74657142162323
0 references
