A tight lower bound for on-line monotonic list labeling (Q5056172): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Paul F. Dietz / rank
Normal rank
 
Property / author
 
Property / author: Paul F. Dietz / 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.1007/3-540-58218-5_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1624393875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast updating of well-balanced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for on-line monotonic list labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for monotonic list labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining order in a generalized linked list / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:07, 31 July 2024

scientific article; zbMATH DE number 7631692
Language Label Description Also known as
English
A tight lower bound for on-line monotonic list labeling
scientific article; zbMATH DE number 7631692

    Statements

    Identifiers