David A. Mix Barrington

Publications

2.3K

Citations

H-Index

1986

Active since

Affiliations

University of Massachusetts Amherst(Current)

The Ohio State University

The Ohio State University Wexner Medical Center

McGill University

Boston College

David A. Mix Barrington is an author at University of Massachusetts Amherst specializing in engineering, computational complexity, and discrete mathematics.

ORCID

Top concepts

EngineeringDiscrete MathematicsComputational ComplexityMedicineComputer ScienceGynecology OncologyOncologyGynecologyCircuit ComplexitySyntax

Publications per year

1986–2022

Publications

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

David A. Mix Barrington · 1986 · 683 citations

Theory Of Computing, Tree Language, Programming Language Theory +13

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

David A. Mix Barrington · Journal of Computer and System Sciences · 1989 · 405 citations

Tree Language, Programming Language Theory, Engineering +9

Uniform constant-depth threshold circuits for division and iterated multiplication

William Hesse, Eric Allender, David A. Mix Barrington · Journal of Computer and System Sciences · 2002 · 185 citations

Circuit Complexity, Engineering, Circuit System +4

Finite monoids and the fine structure of NC 1

David A. Mix Barrington, Denis Thérien · Journal of the ACM · 1988 · 163 citations · Full text

Engineering, Nc 1, Formal Methods +11

Representing Boolean functions as polynomials modulo composite numbers

David A. Mix Barrington, Richard Beigel, Steven Rudich · Computational Complexity · 1994 · 105 citations

Circuit Complexity, Computational Number Theory, Boolean Function +2

Rows per page

1–5 of 36