Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"cell-probe model"”.

  1. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

    … are divided in two groups: lower bounds in the cell probe model and lower bounds in the indexing model. The cell probe model is the most natural and widely accepted framework for studying data structures. In this model, we are concerned with the total space used by a data structure and the total …

    waterloo Repository record for Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures (opens in a new tab)

  2. Optimal Oblivious RAM and Its Extensions

    … any program in the Random-Access Machine (RAM) model into a functionally equivalent RAM program whose memory accesses are provably ``unintelligible''. That is, for any ORAM-compiled program, the sequence of accesses must be either computationally indistinguishable or identically distributed; …

    cornell Repository record for Optimal Oblivious RAM and Its Extensions (opens in a new tab)

  3. Succinct Representation of Trees and Graphs

    … lower order terms. We prove a lower bound in the cell probe model that it is impossible to achieve the information theoretic lower bound to within lower order terms unless the graph is too sparse (namely, $m=o(n^\delta)$ for any constant \delta > 0) or too dense (namely m = …

    waterloo Repository record for Succinct Representation of Trees and Graphs (opens in a new tab)

  4. Data Structures for Strings in the Internal and Dynamic Settings

    … is ruled out due to a lower bound in the cell-probe model of computation [Charalampopoulos et al., ICALP 2020]. We also show more efficient solutions for the case where one of the two strings is static.</p><p class="MsoNormal">- STRING ALIGNMENT: We consider the problem of dynamically …

    kings Repository record for Data Structures for Strings in the Internal and Dynamic Settings (opens in a new tab) Download PDF for Data Structures for Strings in the Internal and Dynamic Settings (opens in a new tab)

  5. Data structures for strings in the internal and dynamic settings

    … is ruled out due to a lower bound in the cell-probe model of computation [Charalampopoulos et al., ICALP 2020]. We also show more efficient solutions for the case where one of the two strings is static. String Alignment: We consider the problem of dynamically maintaining an optimal …

    greece Repository record for Data structures for strings in the internal and dynamic settings (opens in a new tab)