Almost tight bounds for reordering buffer management (Q5419131): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q590542 |
Created claim: DBLP publication ID (P1635): conf/stoc/AdamaszekCER11, #quickstatements; #temporary_batch_1731468600454 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Artur Czumaj / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/1993636.1993717 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2059878569 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: conf/stoc/AdamaszekCER11 / rank | |||
Normal rank |
Latest revision as of 05:28, 13 November 2024
scientific article; zbMATH DE number 6301185
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost tight bounds for reordering buffer management |
scientific article; zbMATH DE number 6301185 |
Statements
Almost tight bounds for reordering buffer management (English)
0 references
5 June 2014
0 references
online algorithms
0 references
reordering buffer
0 references
sorting buffer
0 references