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

Authors

2.3K

  1. SC
    Satrajit Chatterjee

    University of California, Berkeley, United States

    5 publications · 398 citations

    5

    h-index

  2. RK
    Robert K. Brayton

    University of California, Berkeley, United States

    5 publications · 398 citations

    5

    h-index

  3. AM
    Alan Mishchenko

    University of California, Berkeley, United States

    3 publications · 303 citations

    3

    h-index

  4. TK
    Timothy Kam

    Intel (United States), United States

    3 publications · 177 citations

    3

    h-index

  5. AM
    A. Mishchenko

    University of California, Berkeley, United States

    2 publications · 95 citations

    2

    h-index

1–5 of 2.3K

Venues

  1. 3

    h-index

  2. Reliability Engineering & System Safety

    2 publications · 83 citations

    2

    h-index

  3. Algorithmica

    1 publications · 39 citations

    1

    h-index

  4. 1

    h-index

  5. Oxford University Research Archive (ORA) (University of Oxford)

    Repository · 1 publications · 39 citations

    1

    h-index

1–5