On randomized online labeling with polynomially many labels

DOI10.1007/978-3-642-39206-1_25MaRDI QIDQ5326569zbMATH OpenOpenAlexFDO

Authors Jan Bulánek, Michal Koucký, Michael Saks

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_25

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online labeling: algorithms, lower bounds and open questions
• On Online Labeling with Polynomially Many Labels
• On online labeling with large label set
• Tight lower bounds for the online labeling problem
• Tight lower bounds for the online labeling problem

Cited in

(7)

• Online labeling: algorithms, lower bounds and open questions
• On Online Labeling with Polynomially Many Labels
• Tight lower bounds for the online labeling problem
• On online labeling with large label set
• Tight lower bounds for the online labeling problem
• Improved online sorting
• Online list labeling: breaking the ^2n barrier

This page was built for publication: On randomized online labeling with polynomially many labels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326569)