Tree Hashing

Tree Hashing is a hash function construction method that organizes input data into a tree structure, where each non-leaf node is the hash of its children, enabling parallel computation and efficient processing of large or streaming data.

45

Publications

2K

Citations

102

Authors

72

Institutions

Publications per year

2017–2026

9

Authors

102

  1. ML
    Ming-Ling Lo

    University of Michigan, United States

    2 publications · 277 citations

    2

    h-index

  2. EO
    Ekow Otoo

    Lawrence Berkeley National Laboratory, United States

    2 publications · 51 citations

    2

    h-index

  3. PL
    Ping Li

    Zhejiang University, China

    2 publications · 81 citations

    2

    h-index

  4. CV
    Chinya V. Ravishankar

    University of California, Riverside, United States

    2 publications · 277 citations

    2

    h-index

  5. AS
    Anshumali Shrivastava

    Rice University, United States

    2 publications · 81 citations

    2

    h-index

1–5 of 102

Venues

  1. Expert Systems with Applications

    1 publications · 57 citations

    1

    h-index

  2. Communications of the ACM

    1 publications · 107 citations

    1

    h-index

  3. Discrete Mathematics

    1 publications · 13 citations

    1

    h-index

  4. Software Practice and Experience

    1 publications · 49 citations

    1

    h-index

  5. Cryptologia

    1 publications · 12 citations

    1

    h-index

1–5