Emanuele Viola Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Bit-probe lower bounds for succinct data structures. STOC 2009: 475-482
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola: Bounded Independence Fools Halfspaces CoRR abs/0902.3757: (2009)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Cell-Probe Lower Bounds for Prefix Sums CoRR abs/0906.1370: (2009)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola: A Computational View of Market Efficiency CoRR abs/0908.4580: (2009)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: The Sum of D Small-Bias Generators Fools Polynomials of Degree D. Computational Complexity 18(2): 209-217 (2009)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Guest Column: correlation bounds for polynomials over {0 1}. SIGACT News 40(1): 27-44 (2009)
2008
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Toniann Pitassi, Emanuele Viola: Improved Separations between Nondeterministic and Randomized Multiparty Communication. APPROX-RANDOM 2008: 371-384
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: The Sum of d Small-Bias Generators Fools Polynomials of Degree d. IEEE Conference on Computational Complexity 2008: 124-127
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. STOC 2008: 589-598
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola, Avi Wigderson: Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. Theory of Computing 4(1): 137-168 (2008)
2007
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrej Bogdanov, Emanuele Viola: Pseudorandom Bits for Polynomials. FOCS 2007: 41-51
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola, Avi Wigderson: One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. FOCS 2007: 427-437
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola, Avi Wigderson: Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. IEEE Conference on Computational Complexity 2007: 141-154
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: On Approximate Majority and Probabilistic Time. IEEE Conference on Computational Complexity 2007: 155-168
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola, Avi Wigderson: One-way multi-party communication lower bound for pointer jumping with applications. Electronic Colloquium on Computational Complexity (ECCC) 14(079): (2007)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrej Bogdanov, Emanuele Viola: Pseudorandom bits for polynomials. Electronic Colloquium on Computational Complexity (ECCC) 14(081): (2007)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Selected Results in Additive Combinatorics: An Exposition. Electronic Colloquium on Computational Complexity (ECCC) 14(103): (2007)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. Electronic Colloquium on Computational Complexity (ECCC) 14(130): (2007)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: The sum of d small-bias generators fools polynomials of degree d. Electronic Colloquium on Computational Complexity (ECCC) 14(132): (2007)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates. SIAM J. Comput. 36(5): 1387-1403 (2007)
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: On Probabilistic Time versus Alternating Time. Complexity of Boolean Functions 2006
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Healy, Emanuele Viola: Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. STACS 2006: 672-683
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: New correlation bounds for GF(2) polynomials using Gowers uniformity. Electronic Colloquium on Computational Complexity (ECCC) 13(097): (2006)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Healy, Salil P. Vadhan, Emanuele Viola: Using Nondeterminism to Amplify Hardness. SIAM J. Comput. 35(4): 903-931 (2006)
2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: On Constructing Parallel Pseudorandom Generators from One-Way Functions. IEEE Conference on Computational Complexity 2005: 183-197
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. IEEE Conference on Computational Complexity 2005: 198-209
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: The complexity of constructing pseudorandom generators from hard functions. Computational Complexity 13(3-4): 147-188 (2005)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates Electronic Colloquium on Computational Complexity (ECCC)(043): (2005)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Healy, Emanuele Viola: Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two Electronic Colloquium on Computational Complexity (ECCC)(087): (2005)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: On Probabilistic Time versus Alternating Time Electronic Colloquium on Computational Complexity (ECCC)(137): (2005)
2004
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Gutfreund, Emanuele Viola: Fooling Parity Tests with Parity Gates. APPROX-RANDOM 2004: 381-392
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Healy, Salil P. Vadhan, Emanuele Viola: Using nondeterminism to amplify hardness. STOC 2004: 192-201
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: The Complexity of Constructing Pseudorandom Generators from Hard Functions Electronic Colloquium on Computational Complexity (ECCC)(020): (2004)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: On Parallel Pseudorandom Generators Electronic Colloquium on Computational Complexity (ECCC)(074): (2004)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Healy, Salil P. Vadhan, Emanuele Viola: Using Nondeterminism to Amplify Hardness Electronic Colloquium on Computational Complexity (ECCC)(087): (2004)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola, Dan Gutfreund: Fooling Parity Tests with Parity Gates Electronic Colloquium on Computational Complexity (ECCC)(088): (2004)
2003
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: Hardness vs. Randomness within Alternating Time. IEEE Conference on Computational Complexity 2003: 53-
2001
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmanuele Viola: E-unifiability via Narrowing. ICTCS 2001: 426-438

Coauthor Index

1Andrej Bogdanov [23] [28]
2Matei David [32]
3Ilias Diakonikolas [37]
4Parikshit Gopalan [37]
5Dan Gutfreund (Danny Gutfreund) [3] [8]
6Jasmina Hasanhodzic [35]
7Alexander Healy [4] [7] [10] [15] [17]
8Ragesh Jaiswal [37]
9Andrew W. Lo [35]
10Toniann Pitassi [32]
11Rocco A. Servedio [37]
12Ronen Shaltiel [21] [30]
13Salil P. Vadhan [4] [7] [15]
14Avi Wigderson [24] [26] [27] [29]

Colors in the list of coauthors

Copyright © Tue Nov 24 16:13:34 2009 by Michael Ley (ley@uni-trier.de)