Sotabase

Career

· Professor, Northeastern University2021–
· Associate Professor, Northeastern University2014–2021
· Assistant Professor, Northeastern University2008–2014
· Postdoctoral Researcher, Columbia University2007–
· PhD in Computer Science, Harvard University2006–
· Postdoctoral Researcher, Princeton University2006–2007
· BS in Computer Science, La Sapienza University

Publications (116)

Bounded Independence Fools Halfspaces
2009 50th Annual IEEE Symposium on Foundations of Computer Science · 2009
134
cited
The Sum of D Small-Bias Generators Fools Polynomials of Degree D
2008 23rd Annual IEEE Conference on Computational Complexity · 2008
128
cited
Hardness amplification proofs require majority
SIAM journal on computing (Print) · 2008
105
cited
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity · 2005
94
cited
Using nondeterminism to amplify hardness
Symposium on the Theory of Computing · 2004
84
cited
The communication complexity of addition
Combinatorica · 2013
81
cited
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Theory of Computing · 2008
80
cited
Extractors for Circuit Sources
IEEE Annual Symposium on Foundations of Computer Science · 2011
73
cited
On the Complexity of Information Spreading in Dynamic Networks
ACM-SIAM Symposium on Discrete Algorithms · 2013
73
cited
Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates
Cybersecurity and Cyberforensics Conference · 2005
65
cited
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science · 2009
62
cited
The Complexity of Distributions
IEEE Annual Symposium on Foundations of Computer Science · 2010
62
cited
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
Cybersecurity and Cyberforensics Conference · 2007
61
cited
Short PCPs with Projection Queries
International Colloquium on Automata, Languages and Programming · 2014
60
cited
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
Journal of the ACM · 2012
60
cited
On Approximate Majority and Probabilistic Time
Cybersecurity and Cyberforensics Conference · 2007
59
cited
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
Symposium on Theoretical Aspects of Computer Science · 2006
58
cited
Cell-probe lower bounds for succinct partial sums
ACM-SIAM Symposium on Discrete Algorithms · 2010
56
cited
On beating the hybrid argument
Information Technology Convergence and Services · 2012
51
cited
On constructing parallel pseudorandom generators from one-way functions
Cybersecurity and Cyberforensics Conference · 2005
51
cited
Sotabase