Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00366-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161273472 / rank | |||
Normal rank | |||
Latest revision as of 08:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kinetic heap-ordered trees: Tight analysis and improved algorithms |
scientific article |
Statements
Kinetic heap-ordered trees: Tight analysis and improved algorithms (English)
0 references
22 January 2003
0 references
kinetic data structures
0 references
heaps
0 references
computational geometry
0 references
data structures
0 references
