Travelled to:1 × Canada
1 × Czech Republic
1 × Germany
3 × USA
Collaborated with:D.Thérien ∅ R.Beigel S.Rudich N.Immerman C.Lautemann N.Schweikardt E.Allender A.Ambainis S.Datta H.LeThanh
Talks about:polynomi (2) bound (2) conjectur (1) structur (1) function (1) composit (1) automata (1) arithmet (1) uniform (1) program (1)
Person: David A. Mix Barrington
DBLP: Barrington:David_A=_Mix
Contributed to:
2001
1999
1992198719871986Wrote 6 papers:
- LICS-2001-BarringtonILST
- The Crane Beach Conjecture (DAMB, NI, CL, NS, DT), pp. 187–196.
- ICALP-1999-AllenderABDL #bound
- Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.
- STOC-1992-BarringtonBR #representation
- Representing Boolean Functions as Polynomials Modulo Composite Numbers (DAMB, RB, SR), pp. 455–461.
- ICALP-1987-BarringtonT #automaton
- Non-Uniform Automata Over Groups (DAMB, DT), pp. 163–173.
- STOC-1987-BarringtonT #finite #monad
- Finite Monoids and the Fine Structure of NC¹ (DAMB, DT), pp. 101–109.
- STOC-1986-Barrington #bound #branch #source code
- Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.