On randomized online labeling with polynomially many labels

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00395301" target="_blank" >RIV/67985840:_____/13:00395301 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-39206-1_25" target="_blank" >http://dx.doi.org/10.1007/978-3-642-39206-1_25</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-39206-1_25" target="_blank" >10.1007/978-3-642-39206-1_25</a>

Result language
angličtina
Original language name
On randomized online labeling with polynomially many labels
Original language description
We prove an optimal lower bound on the complexity of randomized algorithms for the online labeling problem with polynomially many labels. All previous work on this problem (both upper and lower bounds) only applied to deterministic algorithms, so this isthe first paper addressing the (im)possibility of faster randomized algorithms. Our lower bound ?(n log(n)) matches the complexity of a known deterministic algorithm for this setting of parameters so it is asymptotically optimal.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)