- Home
- Best Scientists - Computer Science
- Uriel Feige

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
68
Citations
22,998
219
World Ranking
1281
National Ranking
23

- Algorithm
- Algebra
- Combinatorics

Uriel Feige mainly focuses on Discrete mathematics, Combinatorics, Approximation algorithm, Graph and Random graph. Uriel Feige is studying Time complexity, which is a component of Discrete mathematics. His studies link Greedy algorithm with Combinatorics.

His study in Approximation algorithm is interdisciplinary in nature, drawing from both Induced subgraph isomorphism problem, Semidefinite programming, Planar graph, Submodular set function and Vertex. The study incorporates disciplines such as Binary logarithm, Multiplicative function and Upper and lower bounds in addition to Graph. His PCP theorem research includes themes of NEXPTIME and Hardness of approximation.

- A threshold of ln n for approximating set cover (2587 citations)
- Zero-knowledge proofs of identity (906 citations)
- The Dense k -Subgraph Problem (496 citations)

His main research concerns Combinatorics, Discrete mathematics, Time complexity, Approximation algorithm and Graph. His research on Combinatorics frequently links to adjacent areas such as Upper and lower bounds. Within one scientific family, he focuses on topics pertaining to Gas meter prover under Discrete mathematics, and may sometimes address concerns connected to Zero-knowledge proof.

Uriel Feige combines subjects such as Graph theory, Greedy algorithm, Degree and Graph partition with his study of Approximation algorithm. His Independent set research is multidisciplinary, incorporating elements of Chromatic scale and Maximal independent set. His Vertex research incorporates themes from Disjoint sets and Matching, Algorithm, Randomized algorithm.

- Combinatorics (58.01%)
- Discrete mathematics (47.33%)
- Time complexity (18.86%)

- Combinatorics (58.01%)
- Discrete mathematics (47.33%)
- Time complexity (18.86%)

Uriel Feige focuses on Combinatorics, Discrete mathematics, Time complexity, Vertex and Graph. His Combinatorics research is multidisciplinary, incorporating perspectives in Matching and Upper and lower bounds. In his study, Uriel Feige carries out multidisciplinary Discrete mathematics and Value research.

The concepts of his Time complexity study are interwoven with issues in Open problem, Square and Integer. Uriel Feige has included themes like Approximation algorithm, Degree, Bounded function, Randomized algorithm and Connected component in his Vertex study. As a part of the same scientific study, Uriel Feige usually deals with the Graph, concentrating on Randomness and frequently concerns with Eigenvalues and eigenvectors.

- Contagious sets in expanders (36 citations)
- A unifying hierarchy of valuations with complements and substitutes (33 citations)
- Learning and inference in the presence of corrupted inputs (27 citations)

- Algorithm
- Algebra
- Combinatorics

Combinatorics, Discrete mathematics, Vertex, Bipartite graph and Time complexity are his primary areas of study. His Upper and lower bounds research extends to the thematically linked field of Combinatorics. His Discrete mathematics research is multidisciplinary, incorporating elements of Linear programming, Submodular set function and Spectral gap.

In his research, Word error rate is intimately related to Algorithm, which falls under the overarching field of Vertex. His work deals with themes such as Theoretical computer science, Matching, Blossom algorithm, Cardinality and Online algorithm, which intersect with Bipartite graph. His Time complexity study combines topics from a wide range of disciplines, such as Transformation, Open problem, Job shop scheduling and Conjecture.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

A threshold of ln n for approximating set cover

Uriel Feige.

Journal of the ACM **(1998)**

3378 Citations

Zero-knowledge proofs of identity

U. Feige;A. Fiat;A. Shamir.

Journal of Cryptology **(1988)**

1711 Citations

Zero Knowledge and the Chromatic Number

Uriel Feige;Joe Kilian.

Journal of Computer and System Sciences **(1998)**

731 Citations

Witness indistinguishable and witness hiding protocols

U. Feige;A. Shamir.

symposium on the theory of computing **(1990)**

727 Citations

Maximizing Non-monotone Submodular Functions

Uriel Feige;Vahab S. Mirrokni;Jan Vondrák.

SIAM Journal on Computing **(2011)**

705 Citations

The Dense k -Subgraph Problem

Uriel Feige;Guy Kortsarz;David Peleg.

Algorithmica **(2001)**

672 Citations

Approximating clique is almost NP-complete

U. Feige;S. Goldwasser;L. Lovasz;S. Safra.

foundations of computer science **(1991)**

581 Citations

On Maximizing Welfare When Utility Functions Are Subadditive

Uriel Feige.

SIAM Journal on Computing **(2009)**

551 Citations

A threshold of ln n for approximating set cover (preliminary version)

Uriel Feige.

symposium on the theory of computing **(1996)**

520 Citations

Interactive proofs and the hardness of approximating cliques

Uriel Feige;Shafi Goldwasser;Laszlo Lovász;Shmuel Safra.

Journal of the ACM **(1996)**

519 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Technion – Israel Institute of Technology

Weizmann Institute of Science

University at Buffalo, State University of New York

Weizmann Institute of Science

Microsoft (United States)

Microsoft (United States)

University of California, Berkeley

Google (United States)

Google (United States)

Google (United States)

Kiel University

University of St. Gallen

McGill University

Donghua University

Heidelberg University

National University of Singapore

Nara Institute of Science and Technology

University of Gothenburg

Ruhr University Bochum

Robert Koch Institute

University of Calgary

Oregon State University

University of Miami

University of Murcia

Juntendo University

University of Copenhagen

Something went wrong. Please try again later.