Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
Pairwise Independence and Derandomization
Submitted by
smcneil
on Fri, 2013-03-08 16:20
Author:
M. Luby
A. Wigderson
Publication:
Foundations and Trends in Theoretical Computer Science (FTTCS), vol. 1, no. 4, pp. 239-301, 2005.
Year:
2005
Hide
Files
File:
Journal Version (pdf)
Read more
about Pairwise Independence and Derandomization
The Power and Weakness of Randomness in Computation
Submitted by
smcneil
on Fri, 2013-03-08 16:00
Author:
A. Wigderson
Publication:
Latin, pp. 28-29, 2006.
Year:
2006
Hide
Files
File:
Journal Version (pdf)
Read more
about The Power and Weakness of Randomness in Computation
Applications of the Sum-Product Theorem in Finite Fields
Submitted by
smcneil
on Fri, 2013-03-08 14:53
Author:
A. Wigderson
Publication:
IEEE Conference on Computational Complexity, p. 111, 2006.
Year:
2006
Hide
Files
File:
Proceedings Version (pdf)
Read more
about Applications of the Sum-Product Theorem in Finite Fields
The Randomized Communication Complexity of Set Disjointness
Submitted by
smcneil
on Thu, 2013-03-07 16:36
Author:
J. Hastad
A. Wigderson
Publication:
Theory of Computing, vol. 3, no. 1, pp. 211-219, 2007.
Year:
2007
Hide
Files
File:
Journal Version (pdf)
Read more
about The Randomized Communication Complexity of Set Disjointness
Randomness - A Computational Complexity Perspective
Submitted by
smcneil
on Thu, 2013-03-07 16:29
Author:
A. Wigderson
Publication:
Computer Science – Theory and Applications, vol. 5010, pp. 1-2, 2008.
Year:
2008
Hide
Files
File:
Jouranal Version (pdf)
Read more
about Randomness - A Computational Complexity Perspective
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
Submitted by
smcneil
on Thu, 2013-03-07 15:27
Author:
A. Wigderson
D. Xiao
Publication:
Theory of Computing, vol. 4, no. 1, pp. 53-76, 2008.
Year:
2008
Hide
Files
File:
Joural Version (pdf)
Read more
about Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
The Work of Leslie Valiant
Submitted by
smcneil
on Wed, 2013-03-06 16:36
Author:
A. Wigderson
Publication:
Proceedings of Symposium on Theory of Computing (STOC), pp. 1-2, 2009.
Year:
2009
Hide
Files
File:
Proceedings Version (pdf)
Read more
about The Work of Leslie Valiant
Randomness extractors - applications and constructions
Submitted by
smcneil
on Wed, 2013-03-06 16:17
Author:
A. Wigderson
Publication:
Foundations of Software Technology and Theoretical Computer Science FSTTCS), pp. 471-473, 2009.
Year:
2009
Hide
Files
File:
Journal Version (pdf)
Read more
about Randomness extractors - applications and constructions
Simplified Derandomization of BPP Using a Hitting Set Generator
Submitted by
smcneil
on Wed, 2013-03-06 15:48
Author:
O. Goldreich
S. Vadhan
A. Wigderson
Publication:
Studies in Complexity and Cryptography, vol. 6650, pp. 59-67, 2011.
Electronic Colloquium on Computational Complexity, Volume 7, 2000.
Year:
2011
Hide
Files
File:
Journal Version (pdf)
Read more
about Simplified Derandomization of BPP Using a Hitting Set Generator
Spherical Cubes: Optimal Foams from Computational Hardness Amplification
Submitted by
smcneil
on Tue, 2013-03-05 14:59
Author:
G. Kindler
A. Rao
Ryan O'Donnell
A. Wigderson
Publication:
Communications of the ACM, vol. 55, no. 10, pp. 90-97, 2012.
Year:
2012
Hide
Files
File:
Journal version (pdf)
Read more
about Spherical Cubes: Optimal Foams from Computational Hardness Amplification
Pages
« first
‹ previous
…
24
25
26
27
28
29
30
31
32
…
next ›
last »
