Uriel Feige
Impact in
- Computational Theory and Mathematics top 0.05%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 108
- Advanced Graph Theory Research 61
-
- Computational Geometry and Mesh Generation 19
- Co-authors
- Adi ShamirJoe KilianLászló LovászDavid PelegAmos FiatRobert KrauthgamerGuy KortsarzVahab Mirrokni
- Journals
- SIAM Journal on Computing (15 papers)Random Structures and Algorithms (9 papers)Journal of Computer and System Sciences (7 papers)Algorithmica (6 papers)SIAM Journal on Discrete Mathematics (6 papers)
- Partner nations
- IsraelUnited StatesUnited Kingdom
In The Last Decade
Uriel Feige
174 papers receiving 7.4k citations
Hit Papers
Peers
Comparison fields: 5 of 133
- Computational Theory and Mathematics 4.3k
- Computer Graphics and Computer-Aided Design 713
- Computer Networks and Communications 3.0k
- Discrete Mathematics and Combinatorics 316
- Artificial Intelligence 2.9k
Countries citing papers authored by Uriel Feige
This map shows the geographic impact of Uriel Feige's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Uriel Feige with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Uriel Feige more than expected).
Fields of papers citing papers by Uriel Feige
This network shows the impact of papers produced by Uriel Feige. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Uriel Feige. The network helps show where Uriel Feige may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Uriel Feige, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2022 | 3 | |
| 2 | 2019 | 1 | |
| 3 | Robust Inference for Multiclass Classification. | 2018 | 1 |
| 4 | 2017 | 1 | |
| 5 | 2015 | 12 | |
| 6 | Learning and inference in the presence of corrupted inputs | 2015 | 5 |
| 7 | Separation between Estimation and Approximation. | 2014 | 1 |
| 8 | 2013 | 2 | |
| 9 | 2010 | 2 | |
| 10 | 2010 | 1 | |
| 11 | 2010 | 33 | |
| 12 | 2009 | 9 | |
| 13 | 2009 | 8 | |
| 14 | 2007 | 12 | |
| 15 | 2006 | 25 | |
| 16 | 2006 | 40 | |
| 17 | 2005 | 73 | |
| 18 | On Limited versus Polynomial Nondeterminism | 1997 | 21 |
| 19 | Two-prover one-round proof systems: Their power and their problems | 1992 | 111 |
| 20 | Computing with Unreliable Information (Preliminary Version) | 1990 | 1 |
About Uriel Feige
Uriel Feige is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Artificial Intelligence, having authored 180 papers that have together received 8.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (108 papers), Advanced Graph Theory Research (61 papers), Optimization and Search Problems (39 papers), Cryptography and Data Security (28 papers), Machine Learning and Algorithms (23 papers), Auction Theory and Applications (19 papers), Computational Geometry and Mesh Generation (19 papers) and Game Theory and Voting Systems (18 papers). The work is most often cited by research in Computational Theory and Mathematics (4.3k citations), Computer Graphics and Computer-Aided Design (713 citations), Computer Networks and Communications (3.0k citations), Discrete Mathematics and Combinatorics (316 citations) and Artificial Intelligence (2.9k citations). Uriel Feige has collaborated with scholars based in Israel, United States and United Kingdom. Frequent co-authors include Adi Shamir, Joe Kilian, László Lovász, David Peleg, Amos Fiat, Robert Krauthgamer, Guy Kortsarz, Vahab Mirrokni, Prabhakar Raghavan and J. Vondrák. Their work appears in journals such as SIAM Journal on Computing, Random Structures and Algorithms, Journal of Computer and System Sciences, Algorithmica and SIAM Journal on Discrete Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.