Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Space Efficient Hash Tables with Worst Case Constant Access Time
  1. Home
  2. Publications
  3. Space Efficient Hash Tables with Worst Case Constant Access Time

Space Efficient Hash Tables with Worst Case Constant Access Time

Authors:
  • DFDimitris Fotakis
    Dimitris Fotakis
  • RPRasmus Pagh
    Rasmus Pagh
  • PSPeter Sanders
    Peter Sanders
  • PSPaul Spirakis
    Paul Spirakis

Publisher website
Google Scholar
  • 13 December 2004
    • journal article
    • research article
    • Published by Springer Nature in Theory of Computing Systems
    • Vol. 38  (2) , 229-248
    • DOI:10.1007/s00224-004-1195-x
Abstract
No abstract available
Keywords
  • DATA STRUCTURE
  • CONSTANT TIME
  • COMPUTATIONAL MATHEMATIC
  • HASH FUNCTION
  • MEMORY CELL
Cited by 165 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.