• Random input helps searching predecessors 

    Belazzougui, Djamal; Kaporis, Alexis C.; Spirakis, Paul G.
    In : (CEUR-WS.org, Athènes, 2018-06-17)
    A data structure problem consists of the finite sets: D of data, Q of queries, A of query answers, associated with a function f : D ×Q → A. The data structure of file X is “static” (“dynamic”) if we “do not” (“do”) require quick updates as X changes. An important goal is to compactly encode a file X ∈ D, such that ...