Travelled to:1 × Czech Republic
1 × Italy
1 × Switzerland
2 × France
4 × USA
Collaborated with:∅ I.Mertz F.Wang J.Jiao L.A.Hemachandra L.Friedman W.I.Gasarch R.Beals M.Ogihara A.Ambainis D.A.M.Barrington S.Datta H.LeThanh M.Agrawal R.Impagliazzo T.Pitassi S.Rudich
Talks about:complex (3) arithmet (2) circuit (2) reduct (2) power (2) limit (2) depth (2) bound (2) pseudorandom (1) precomput (1)
Person: Eric Allender
DBLP: Allender:Eric
Contributed to:
2015
20111999
199719961993198919871986Wrote 11 papers:
- LATA-2015-AllenderM #complexity
- Complexity of Regular Functions (EA, IM), pp. 449–460.
- ICALP-v1-2011-AllenderFG #power of #random #string
- Limits on the Computational Power of Random Strings (EA, LF, WIG), pp. 293–304.
- ICALP-v1-2011-AllenderW #algebra #branch #on the #power of #source code
- On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.
- ICALP-1999-AllenderABDL #bound
- Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.
- STOC-1997-AgrawalAIPR #complexity #reduction
- Reducing the Complexity of Reductions (MA, EA, RI, TP, SR), pp. 730–738.
- STOC-1996-AllenderBO #complexity #equation #linear #matrix #rank
- The Complexity of Matrix Rank and Feasible Systems of Linear Equations (EA, RB, MO), pp. 161–167.
- STOC-1993-AllenderJ #commutative #reduction
- Depth reduction for noncommutative arithmetic circuits (EA, JJ), pp. 515–522.
- ICALP-1989-Allender
- Limitations of the Upward Separation Technique (EA), pp. 18–30.
- ICALP-1989-AllenderH #bound
- Lower Bounds for the Low Hierarchy (EA, LAH), pp. 31–45.
- STOC-1987-Allender #generative #pseudo
- Some Consequences of the Existence of Pseudorandom Generators (EA), pp. 151–159.
- ICALP-1986-Allender
- Characterizations on PUNC and Precomputation (EA), pp. 1–10.