What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (58.01%)
- Discrete mathematics (47.33%)
- Time complexity (18.86%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (58.01%)
- Discrete mathematics (47.33%)
- Time complexity (18.86%)
In recent papers he was focusing on the following fields of study:
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.
Between 2014 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
