S. Arora,
B. Barak, and D. Steurer.
Subexponential
Algorithms
for Unique Games and Related problems
.
In Proc. of FOCS, 2010.
[ bib |
powerpoint
|
.pdf
]
S. Arora,
B. Barak, M. Brunnermeier,
and R. Ge.
Computational
Complexity
and Information Asymmetry in Financial Products
.
In Innovations in Computer Science (ICS) conference,
2010.
[ bib |
.pdf
]
B. Barak and M. Mahmoody-Ghidary.
Merkle Puzzles are
Optimal
- an O(n2)
attack on key exchange from a random
oracle .
In Proceedings of CRYPTO '09, 2009.
[ bib |
powerpoint
|
.pdf
]
B. Barak, A. Rao,
R. Shaltiel,
and A. Wigderson.
2-source dispersers for
sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson
construction .
In Proc. 38th Symposium on Theory of Computing (STOC),
pages
671-680. ACM, 2006.
[ bib |
.ps
]
B. Barak, R. Impagliazzo,
and A. Wigderson.
Extracting Randomness
Using Few Independent Sources .
SIAM Journal on Computing, 36(4):1095-1118,
2006.
Preliminary version in FOCS' 04.
[ bib |
powerpoint
|
.ps
|
.pdf
]
B. Barak and A. Sahai.
How to Play Almost Any
Mental Game Over the Net - Concurrent Composition Using
Super-Polynomial
Simulation .
In Proc. 46th FOCS. IEEE, 2005.
[ bib |
powerpoint
|
.ps
|
.pdf
]
B. Barak.
A Probabilistic-Time
Hierarchy Theorem for ``Slightly Non-Uniform''
Algorithms .
In Proc. of 6th Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM), 2002.
[ bib |
.ps
]
B. Barak.
Constant-Round
Coin-Tossing With a Man in the Middle or Realizing the Shared Random
String
Model .
In Proc. 43rd FOCS. IEEE, 2002.
[ bib |
powerpoint
|
.pdf
]
B. Barak.
How to go beyond the
black-box simulation barrier .
In Proc. 42nd FOCS, pages 106-115. IEEE, 2001.
[ bib |
powerpoint
|
.pdf
]
