Depth Reduction

Depth Reduction is a theoretical framework in computational complexity that characterizes the transformation of circuits or algorithms into equivalent forms with fewer sequential layers of operations, thereby enabling faster parallel computation.

211

Publications

11K

Citations

565

Authors

282

Institutions

Publications per year

2017–2026

44

Authors

565

  1. AP
    A.R. Pradeep

    Government Dental College & Research Institute, India

    4 publications · 182 citations

    4

    h-index

  2. CC
    Chip-Hong Chang

    Nanyang Technological University, Singapore

    4 publications · 115 citations

    4

    h-index

  3. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    4 publications · 114 citations

    4

    h-index

  4. JC
    Jason Cong

    University of California, Los Angeles, United States

    4 publications · 142 citations

    4

    h-index

  5. YH
    Yean-Yow Hwang

    University of California, Los Angeles, United States

    4 publications · 170 citations

    4

    h-index

1–5 of 565

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 2.1K citations

    10

    h-index

  2. Journal of Periodontology

    10 publications · 802 citations

    10

    h-index

  3. SIAM Journal on Computing

    8 publications · 300 citations

    8

    h-index

  4. PubMed

    Repository · 7 publications · 182 citations

    7

    h-index

  5. Journal Of Clinical Periodontology

    6 publications · 545 citations

    6

    h-index

1–5