Hash Table Implementations

Hash Table Implementations is a method in computer science that belongs to the class of symbol table implementations, distinguished by its use of a hash function to map keys to array indices, enabling efficient insertion, deletion, and lookup operations.

305

Publications

96.1K

Citations

821

Authors

314

Institutions

Publications per year

2017–2026

54

Authors

821

  1. MM
    Michael Mitzenmacher

    Harvard University Press, United States

    6 publications · 602 citations

    6

    h-index

  2. GA
    Gustavo Alonso

    ETH Zurich, Switzerland

    4 publications · 175 citations

    4

    h-index

  3. AK
    Adam Kirsch

    Harvard University, United States

    4 publications · 162 citations

    4

    h-index

  4. DA
    Dan A. Alcantara

    University of California, Davis, United States

    3 publications · 263 citations

    3

    h-index

  5. NA
    Nikolas Askitis

    The University of Melbourne, Australia

    3 publications · 98 citations

    3

    h-index

1–5 of 821

Venues

  1. Communications of the ACM

    9 publications · 736 citations

    9

    h-index

  2. Bioinformatics

    8 publications · 68.8K citations

    8

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 127 citations

    5

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 5 publications · 314 citations

    5

    h-index

  5. ICGA Journal

    3 publications · 241 citations

    3

    h-index

1–5