M. Sipser

Submitted by smcneil on Tue, 2013-03-12 15:10
Home Page: 
http://www-math.mit.edu/~sipser/

C. Papadimitriou

Submitted by smcneil on Tue, 2013-03-12 15:09
Home Page: 
http://www.cs.berkeley.edu/~christos/

Theory of Computing: A Scientific Perspective

Submitted by smcneil on Tue, 2013-03-12 14:44
Author: 
O. Goldreich
A. Wigderson
Publication: 
SIGACT News, vol 28, no. 3, pp 100-102, 1997.
Year: 
1997
Hide Files
File: 
Journal Version (pdf)

Do probabilistic algorithms outperform deterministic ones?

Submitted by smcneil on Tue, 2013-03-12 14:30
Author: 
A. Wigderson
Publication: 
International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1443, pp. 212-214, 1998.
Year: 
1998
Hide Files
File: 
Proceedings Version (pdf)

De-randomizing BPP: The State of the Art

Submitted by smcneil on Mon, 2013-03-11 16:29
Author: 
A. Wigderson
Publication: 
IEEE Conference on Computational Complexity, pp. 76-77, 1999.
Year: 
1999
Hide Files
File: 
Preceedings Version (pdf)

Expanders from Symmetric Codes

Submitted by smcneil on Mon, 2013-03-11 14:33
Author: 
R. Meshulam
A. Wigderson
Publication: 
IEEE Conference on Computational Complexity, p. 0016, 2002.
Year: 
2002
Hide Files
File: 
Proceedings Version (pdf)

Zigzag Products, Expander Construcitons, Connections, and Applications

Submitted by smcneil on Mon, 2013-03-11 14:23
Author: 
A. Wigderson
Publication: 
Foundations of Software Technology and Theoretical Computer Science, p. 443, 2003.
Hide Files
File: 
http://www.math.ias.edu/~avi/PUBLICATIONS/hrubesB0728.pdf

Depth Through Breadth, or Why Should We Attend Talks in Other Areas?

Submitted by smcneil on Mon, 2013-03-11 14:07
Author: 
A. Wigderson
Publication: 
Proceedings of Symposium on Theory of Computing (STOC) 2004, p. 579.
Year: 
2004
Hide Files
File: 
Proceedings Version (pdf)

Pages

Subscribe to Avi Wigderson RSS