On the hardness of computing the permanent of random matrices
- Uriel Feige
- Carsten Lund
- 1992
- STOC 1992
Publications
Date
Featured collections
Popular topics
9 results for Uriel Feige
Two-prover one-round proof systems: Their power and their problems
- Uriel Feige
- László Lovász
- 1992
- STOC 1992
Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2011
- FOCS 2011
On the role of shared randomness in two prover proof systems
- Mihir Bellare
- U. Feige
- et al.
- 1995
- ISTCS 1995
Exact analysis of hot-potato routing
- Uriel Feige
- Prabhakar Raghavan
- 1992
- FOCS 1992
Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
A polylogarithmic approximation of the minimum bisection
- Uriel Feige
- Robert Krauthgamer
- 2006
- SIAM Review
Random walks on regular and irregular graphs
- Don Coppersmith
- Uriel Feige
- et al.
- 1996
- SIAM Journal on Discrete Mathematics
Randomized broadcast in networks
- Uriel Feige
- David Peleg
- et al.
- 1990
- Random Structures and Algorithms