Skip to main navigation Skip to search Skip to main content

Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

  • Djamal Bellazougui
  • , Paolo Boldi
  • , Rasmus Pagh
  • , Sebastiano Vigna

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

    Original languageEnglish
    Title of host publicationProceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms
    Number of pages10
    PublisherSociety for Industrial and Applied Mathematics
    Publication date2009
    Pages785-794
    Publication statusPublished - 2009
    EventSymposium on Discrete Algorithms - Austin, United States
    Duration: 17 Jan 201019 Jan 2010
    Conference number: 21
    https://dl.acm.org/doi/proceedings/10.5555/1873601

    Symposium

    SymposiumSymposium on Discrete Algorithms
    Number21
    Country/TerritoryUnited States
    CityAustin
    Period17/01/201019/01/2010
    Internet address

    Cite this