Trie Structures

Trie Structures is a tree-based data structure that organizes keys in a hierarchical manner, distinguishing itself by representing each node as a common prefix of its associated keys, thereby enabling efficient prefix-based search and retrieval operations.

139

Publications

7.1K

Citations

338

Authors

147

Institutions

Publications per year

2017–2026

8

Authors

338

  1. JA
    Jun‐ichi Aoe

    Tokushima University, Japan

    6 publications · 171 citations

    6

    h-index

  2. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 246 citations

    4

    h-index

  3. HL
    Hyesook Lim

    Ewha Womans University, South Korea

    4 publications · 117 citations

    4

    h-index

  4. VK
    Viktor K. Prasanna

    University of Southern California, United States

    3 publications · 63 citations

    3

    h-index

  5. GL
    Guoliang Li

    Tsinghua University, China

    3 publications · 203 citations

    3

    h-index

1–5 of 338

Venues

  1. Software Practice and Experience

    8 publications · 273 citations

    8

    h-index

  2. ACM Transactions on Database Systems

    TODS · 5 publications · 133 citations

    5

    h-index

  3. IEEE Transactions on Computers

    4 publications · 127 citations

    4

    h-index

  4. Communications of the ACM

    3 publications · 267 citations

    3

    h-index

  5. IEEE Communications Letters

    3 publications · 128 citations

    3

    h-index

1–5