All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Tight lower bounds for the online labeling problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10316299" target="_blank" >RIV/00216208:11320/15:10316299 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/130907653" target="_blank" >http://dx.doi.org/10.1137/130907653</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/130907653" target="_blank" >10.1137/130907653</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Tight lower bounds for the online labeling problem

  • Original language description

    We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1,..., r} are to be stored in an array of size m }= n. The items are presented sequentially in an arbitrary order, and must be stored in the array in sorted order (but not necessarily in consecutive locations in the array). Each new item must be stored in the array before the next item is received. If r < = m then we can simply store item j in location j but if r > m then we may haveto shift the location of stored items to make space for a newly arrived item. The algorithm is charged each time an item is stored in the array, or moved to a new location. The goal is to minimize the total number of moves the algorithm has to do. Thisproblem is nontrivial for n < = m < r. In the case that m = Cn for some C > 1, algorithms are known that solve the problem with cost O(n log(2)(n)) (independent of r). For the case m = n, algorithms with cost O(n log(3)(n)) were given. In

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    SIAM Journal on Computing

  • ISSN

    0097-5397

  • e-ISSN

  • Volume of the periodical

    44

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    33

  • Pages from-to

    1765-1797

  • UT code for WoS article

    000367020300008

  • EID of the result in the Scopus database