Travelled to:
1 × Canada
1 × Denmark
1 × Japan
5 × USA
Collaborated with:
E.Miles T.Gowers E.Ben-Sasson ∅ R.Shaltiel H.Jahanjou A.Healy S.P.Vadhan A.Gál K.A.Hansen M.Koucký P.Pudlák
Talks about:
bound (3) circuit (2) group (2) hard (2) nondetermin (1) interleav (1) arbitrari (1) succinct (1) structur (1) communic (1)
Person: Emanuele Viola
DBLP: Viola:Emanuele
Contributed to:
Wrote 8 papers:
- ICALP-v1-2015-JahanjouMV #reduction
- Local Reductions (HJ, EM, EV), pp. 749–760.
- STOC-2015-GowersV #communication #complexity
- The communication complexity of interleaved group products (TG, EV), pp. 351–360.
- ICALP-v1-2014-Ben-SassonV #query
- Short PCPs with Projection Queries (EBS, EV), pp. 163–173.
- STOC-2013-MilesV
- Shielding circuits with groups (EM, EV), pp. 251–260.
- STOC-2012-GalHKPV #bound
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (AG, KAH, MK, PP, EV), pp. 479–494.
- STOC-2009-Viola #bound #data type
- Bit-probe lower bounds for succinct data structures (EV), pp. 475–482.
- STOC-2008-ShaltielV #proving
- Hardness amplification proofs require majority (RS, EV), pp. 589–598.
- STOC-2004-HealyVV #nondeterminism #using
- Using nondeterminism to amplify hardness (AH, SPV, EV), pp. 192–201.