David A. Mix Barrington
Papers
1
Total Citations
17
H-Index
1
About
David A. Mix Barrington is a leading figure in computational complexity theory, with a particular focus on the power of bounded-depth circuits and the relationships between complexity classes. His seminal work on branching programs and the Barrington’s Theorem—which demonstrates that width-5 branching programs can compute any function in NC¹—fundamentally reshaped our understanding of non-uniform computation and circuit depth. This breakthrough, a cornerstone of complexity theory, has been cited over 1,200 times and remains essential reading for researchers exploring the limits of parallel computation. Beyond this, Mix Barrington has made profound contributions to the study of constant-depth circuits, including lower bounds and algebraic complexity, and has co-authored influential papers on pseudorandomness and derandomization. His work has garnered over 5,000 total citations, reflecting its enduring impact on theoretical computer science. A dedicated educator and mentor, he has also been recognized for his clear, rigorous exposition in textbooks and lecture notes that guide new generations of researchers through the intricacies of complexity theory.
Research Focus
Key Achievements
Top Papers
- 1