And-inverter Graph Optimization

And-Inverter Graph Optimization is a logic synthesis technique that refines Boolean logic representations by restructuring and minimizing And-Inverter Graphs through node rewriting, resubstitution, and technology mapping to achieve area, delay, or power improvements in digital circuit design.

16

Publications

1.2K

Citations

42

Authors

17

Institutions

Publications per year

2017–2026

5

Authors

42

  1. PG
    Pierre‐Emmanuel Gaillardon

    École Polytechnique Fédérale de Lausanne, Switzerland

    6 publications · 399 citations

    6

    h-index

  2. LA
    Luca Amarù

    École Polytechnique Fédérale de Lausanne, Switzerland

    5 publications · 330 citations

    5

    h-index

  3. MS
    Mathias Soeken

    École Polytechnique Fédérale de Lausanne, Switzerland

    4 publications · 137 citations

    4

    h-index

  4. GD
    Giovanni De Micheli

    École Polytechnique Fédérale de Lausanne, Switzerland

    4 publications · 281 citations

    4

    h-index

  5. SC
    Satrajit Chatterjee

    University of California, Berkeley, United States

    2 publications · 569 citations

    2

    h-index

1–5 of 42

Venues

  1. 2

    h-index

  2. 2

    h-index

  3. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 1 publications · 13 citations

    1

    h-index

  4. IEEE Transactions on Emerging Topics in Computing

    ITETBT · 1 publications · 23 citations

    1

    h-index

  5. Optics Express

    1 publications · 34 citations

    1

    h-index

1–5