A generalization of binary search (Q5060095): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_232 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1537300939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Optimality of Huffman Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for finding all the jumps of a monotone step-function / rank | |||
Normal rank | |||
Latest revision as of 07:46, 31 July 2024
scientific article; zbMATH DE number 7643369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of binary search |
scientific article; zbMATH DE number 7643369 |
Statements
A generalization of binary search (English)
0 references
18 January 2023
0 references
