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
Parents
45
A parallel hashed Oct-Tree N-body algorithm
Michael S. Warren, John K. Salmon · 1993 · 463 citations · Full text
Ming-Ling Lo, Chinya V. Ravishankar · 1996 · 207 citations
File structures using hashing functions
E. G. Coffman, J. Eve · Communications of the ACM · 1970 · 107 citations · Full text
1–5 of 45
102
2
h-index
2
h-index
2
h-index
University of California, Riverside, United States
2 publications · 277 citations
2
h-index
2
h-index
1–5 of 102
72

Cornell University
Ithaca, United States
3 h-index
4 publications
135 citations

Carleton University
Ottawa, Canada
2 h-index
2 publications
51 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
5 publications
268 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
2 publications
81 citations
University of Technology Sydney
Sydney, Australia
2 h-index
4 publications
138 citations
University of Michigan
Ann Arbor, United States
2 h-index
4 publications
554 citations
The Ohio State University
Columbus, United States
1 h-index
2 publications
66 citations
National Tsing Hua University
Hsinchu, Taiwan
1 h-index
2 publications
22 citations
1–8 of 72
1 publications · 57 citations
1
h-index
1 publications · 107 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 49 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5