Analog Routing Algorithms

Analog Routing Algorithms is a systematic computational method designed to determine optimal physical interconnections in analog integrated circuits by considering electrical constraints and performance criteria distinct from those in digital routing.

26

Publications

1K

Citations

56

Authors

22

Institutions

Publications per year

2017–2026

4

Authors

56

  1. JM
    John M. Cohn

    Carnegie Mellon University, United States

    3 publications · 374 citations

    3

    h-index

  2. HY
    Hailong Yao

    Tsinghua University, China

    3 publications · 49 citations

    3

    h-index

  3. RA
    Rob A. Rutenbar

    Carnegie Mellon University, United States

    3 publications · 374 citations

    3

    h-index

  4. EM
    E. Malavasi

    University of California, Berkeley, United States

    3 publications · 121 citations

    3

    h-index

  5. QG
    Qiang Gao

    Tsinghua University, China

    3 publications · 49 citations

    3

    h-index

1–5 of 56

Venues

  1. IEEE Journal of Solid-State Circuits

    3 publications · 408 citations

    3

    h-index

  2. 2

    h-index

  3. 1

    h-index

  4. IRE Transactions on Communications Systems

    1 publications · 69 citations

    1

    h-index

  5. IEEE Access

    1 publications · 36 citations

    1

    h-index

1–5