Cut-based Mapping
Cut-Based Mapping is a lookup table optimization technique that partitions a network or circuit into logical cuts to map each cut to a precomputed value in a table, thereby reducing computational complexity by exploiting structural regularity and redundancy.
19
Publications
1.1K
Citations
2.3K
Authors
240
Institutions
Publications per year
2017–2026
6
Parents
19
1–5 of 19
2.3K
5
h-index
5
h-index
3
h-index
3
h-index
2
h-index
1–5 of 2.3K
240
University of California, Berkeley
Berkeley, United States
6 h-index
16 publications
1.2K citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
16 publications
1.4K citations
Seoul National University
Seoul, South Korea
2 h-index
17 publications
1.3K citations
Intel (United States)
Santa Clara, United States
2 h-index
4 publications
260 citations
National Tsing Hua University
Hsinchu, Taiwan
2 h-index
5 publications
131 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
36 publications
2.7K citations
University of Florida
Gainesville, United States
2 h-index
27 publications
2K citations
Instituto de Física de Cantabria
Santander, Spain
1 h-index
20 publications
1.5K citations
1–8 of 240
3 publications · 253 citations
3
h-index
2 publications · 83 citations
2
h-index
1 publications · 39 citations
1
h-index
Conference · 1 publications · 32 citations
1
h-index
Repository · 1 publications · 39 citations
1
h-index
1–5