Follow
Uriel Feige
Uriel Feige
Professor of Computer Science, Weizmann Institute of Science
Verified email at weizmann.ac.il
Title
Cited by
Cited by
Year
A threshold of ln n for approximating set cover
U Feige
Journal of the ACM (JACM) 45 (4), 634-652, 1998
36341998
Zero knowledge proofs of identity
U Fiege, A Fiat, A Shamir
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
18681987
Maximizing non-monotone submodular functions
U Feige, VS Mirrokni, J Vondrák
SIAM Journal on Computing 40 (4), 1133-1153, 2011
7782011
Witness indistinguishable and witness hiding protocols
U Feige, A Shamir
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
7651990
The Dense k -Subgraph Problem
U Feige, D Peleg, G Kortsarz
Algorithmica 29, 410-421, 2001
7282001
Adaptively secure multi-party computation
R Canetti, U Feige, O Goldreich, M Naor
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996
6951996
Approximating clique is almost NP-complete
U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991
6101991
Zero knowledge and the chromatic number
U Feige, J Kilian
Journal of Computer and System Sciences 57 (2), 187-199, 1998
5791998
Interactive proofs and the hardness of approximating cliques
U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy
Journal of the ACM (JACM) 43 (2), 268-292, 1996
5521996
A threshold of ln n for approximating set cover (preliminary version)
U Feige
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996
5361996
Relations between average case complexity and approximation complexity
U Feige
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
4692002
Approximating the value of two power proof systems, with applications to max 2sat and max dicut
U Feige, M Goemans
Proceedings Third Israel Symposium on the Theory of Computing and Systems …, 1995
4611995
Improved approximation algorithms for minimum-weight vertex separators
U Feige, MT Hajiaghayi, JR Lee
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
4162005
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
A Bhaskara, M Charikar, E Chlamtac, U Feige, A Vijayaraghavan
Proceedings of the forty-second ACM symposium on Theory of computing, 201-210, 2010
3942010
Multiple noninteractive zero knowledge proofs under general assumptions
U Feige, D Lapidot, A Shamir
SIAM Journal on computing 29 (1), 1-28, 1999
3791999
Multiple non-interactive zero knowledge proofs based on a single random string
U Feige, D Lapidot, A Shamir
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
3731990
A minimal model for secure computation
U Feige, J Killian, M Naor
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
3651994
Zero knowledge proofs of knowledge in two rounds
U Feige, A Shamir
Conference on the Theory and Application of Cryptology, 526-544, 1989
3551989
On maximizing welfare when utility functions are subadditive
U Feige
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
3352006
Computing with noisy information
U Feige, P Raghavan, D Peleg, E Upfal
SIAM Journal on Computing 23 (5), 1001-1018, 1994
3341994
The system can't perform the operation now. Try again later.
Articles 1–20