Uriel Feige

Uriel Feige is an Israeli computer scientist noted for foundational results in theoretical computer science, especially in probabilistically checkable proofs, approximation algorithms, and complexity theory. He has held faculty and research positions at Tel Aviv University, the Weizmann Institute of Science, and industrial research labs such as IBM Research. Feige's work intersects with major developments involving the P versus NP problem, the PCP theorem, and the theory of NP-completeness.

Early life and education

Feige completed undergraduate and graduate studies in Israel, receiving degrees from the Hebrew University of Jerusalem and the Weizmann Institute of Science, where he studied under advisor Moni Naor. During his formative years he engaged with research communities centered at institutions like Tel Aviv University and international conferences such as the STOC and FOCS symposia. His early education placed him in contact with contemporaries from groups associated with Microsoft Research, Bell Labs, and the Institute for Advanced Study.

Academic career

Feige held positions at major research centers including the Weizmann Institute of Science and later became a professor at Tel Aviv University. He collaborated with scholars from institutions such as MIT, Stanford University, Princeton University, and ETH Zurich, and presented at venues like the ICALP and SODA conferences. His career includes interactions with projects at Microsoft Research Redmond, exchanges with the Clay Mathematics Institute community, and participation in workshops organized by Simons Foundation-funded programs.

Research contributions

Feige's research has advanced understanding of the PCP theorem, the structure of NP problems, and hardness of approximation results related to the Unique Games Conjecture. He is known for influential results on approximation algorithms for combinatorial optimization problems such as variants of the set cover problem, the vertex cover problem, and problems tied to label cover. Feige contributed to the development of probabilistic techniques used in the analysis of randomized algorithms, drawing on methods popularized in works associated with Richard Karp, Leslie Valiant, and Ravi Kannan. His results connect to major complexity-theoretic milestones like the work of Sanjeev Arora, Subhash Khot, and Mihalis Yannakakis on hardness and approximation, and tie into algorithmic paradigms explored at institutions such as Carnegie Mellon University and University of California, Berkeley.

Feige's papers often address gaps between algorithmic upper bounds and inapproximability lower bounds, influencing follow-up research by authors from Columbia University, University of Toronto, and University of Washington. His approaches employ tools from probabilistic method traditions linked to Paul Erdős and combinatorial optimization lines related to Jack Edmonds and Michael Sipser. Feige's work also has implications for cryptographic constructs developed by researchers at RSA Security and in theoretical frameworks advanced at IBM Research and Google Research.

Awards and honors

Feige's contributions have been recognized through invitations to major conferences such as STOC and FOCS and by citations in seminal surveys by scholars at Princeton University and Harvard University. He has been a visiting researcher at centers like the Institute for Advanced Study and has collaborated with prize-winning scientists associated with the Turing Award community. His influence is reflected in the adoption of his techniques across groups at Microsoft Research, Google Research, and multiple university departments worldwide.

Selected publications

- Feige, U.; joint work presented at STOC and FOCS on probabilistically checkable proofs and hardness of approximation. - Feige, U.; papers on approximation algorithms for set cover and vertex cover problems published in proceedings of SODA and ICALP. - Feige, U.; collaborations with Moni Naor and other theorists on interactive proofs and randomized reductions appearing in leading journals and conference proceedings associated with ACM and IEEE.

Category:Theoretical computer scientists Category:Israeli computer scientists