Efficient searching using partial ordering (Q1151264): 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.1016/0020-0190(81)90005-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045807935 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time bounds for selection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the median / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implicit data structures for fast search and update / rank | |||
Normal rank | |||
Latest revision as of 10:59, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient searching using partial ordering |
scientific article |
Statements
Efficient searching using partial ordering (English)
0 references
1981
0 references
