Structural Hashing
Structural Hashing is a logic synthesis optimization technique that belongs to the class of structural methods, distinguished by its use of hash functions to identify and eliminate redundant circuit structures during technology-independent minimization.
18
Publications
795
Citations
48
Authors
34
Institutions
Publications per year
2017–2026
9
Parents
18
SAT sweeping with local observability don't-cares
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann et al. · 2006 · 90 citations
Discrete Multi-graph Hashing for Large-Scale Visual Search
Lingyun Xiang, Xiaobo Shen, Jiaohua Qin et al. · Neural Processing Letters · 2018 · 72 citations
1–5 of 18
48
Cadence Design Systems (United States), United States
3 publications · 135 citations
3
h-index
University of California, Berkeley, United States
2 publications · 121 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 48
34
University of California, Berkeley
Berkeley, United States
4 h-index
11 publications
451 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
3 h-index
3 publications
135 citations
Cadence Design Systems (United States)
San Jose, United States
3 h-index
3 publications
135 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
4 publications
111 citations
Tsinghua University
Beijing, China
2 h-index
4 publications
213 citations

University of Shanghai for Science and Technology
Shanghai, China
2 h-index
3 publications
209 citations

Peking University
Beijing, China
2 h-index
3 publications
94 citations
Central South University of Forestry and Technology
Changsha, China
1 h-index
1 publications
72 citations
1–8 of 34
2 publications · 45 citations
2
h-index
JIS · 1 publications · 10 citations
1
h-index
1 publications · 17 citations
1
h-index
JCD · 1 publications · 89 citations
1
h-index
Conference · 1 publications · 32 citations
1
h-index
1–5