More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (Q3204043)
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: More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case |
scientific article |
Statements
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case (English)
0 references
1991
0 references
unbounded search
0 references
optimal algorithms
0 references
Kraft's inequality
0 references
Ackermann's function
0 references
prefix-free
0 references
