| 2025 | STOC | Share-Based Fairness for Arbitrary Entitlements. | Moshe Babaioff, Uriel Feige |
| 2021 | AAAI | Fair and Truthful Mechanisms for Dichotomous Valuations. | Moshe Babaioff, Tomer Ezra, Uriel Feige |
| 2020 | ICALP | How to Hide a Clique? | Uriel Feige, Vadim Grinberg |
| 2019 | SODA | A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. | Uriel Feige, Janardhan Kulkarni, Shi Li |
| 2018 | ALT | Robust Inference for Multiclass Classification. | Uriel Feige, Yishay Mansour, Robert E. Schapire |
| 2018 | ICALP | On the Probe Complexity of Local Computation Algorithms. | Uriel Feige, Boaz Patt-Shamir, Shai Vardi |
| 2017 | SODA | Random Walks with the Minimum Degree Local Rule Have | Roee David, Uriel Feige |
| 2017 | STOC | Approximate modularity revisited. | Uriel Feige, Michal Feldman, Inbal Talgam-Cohen |
| 2016 | STOC | On the effect of randomness on planted 3-coloring models. | Roee David, Uriel Feige |
| 2015 | AAAI | A Unifying Hierarchy of Valuations with Complements and Substitutes. | Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis |
| 2015 | COLT | Learning and inference in the presence of corrupted inputs. | Uriel Feige, Yishay Mansour, Robert E. Schapire |
| 2015 | SODA | Contagious Sets in Expanders. | Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman |
| 2014 | FOCS | Chasing Ghosts: Competing with Stateful Policies. | Uriel Feige, Tomer Koren, Moshe Tennenholtz |
| 2014 | ICALP | Demand Queries with Preprocessing. | Uriel Feige, Shlomo Jozeph |
| 2014 | IPCO | Short Tours through Large Linear Forests. | Uriel Feige, R. Ravi, Mohit Singh |
| 2013 | AAAI | The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. | Uriel Feige, Gil Kalai, Moshe Tennenholtz |
| 2013 | CIAC | A Greedy Approximation Algorithm for Minimum-Gap Scheduling. | Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor |
| 2012 | AAMAS | Mastering multi-player games. | Yossi Azar, Uriel Feige, Moshe Tennenholtz, Michal Feldman |
| 2012 | ICALP | Universal Factor Graphs. | Uriel Feige, Shlomo Jozeph |
| 2011 | FOCS | Min-max Graph Partitioning and Small Set Expansion. | Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz |
| 2011 | ICALP | Recoverable Values for Independent Sets. | Uriel Feige, Daniel Reichman |
| 2011 | STOC | Mechanism design with uncertain inputs: (to err is human, to forgive divine). | Uriel Feige, Moshe Tennenholtz |
| 2011 | WADS | An O(n log n) Algorithm for a Load Balancing Problem on Paths. | Nikhil R. Devanur, Uriel Feige |
| 2010 | STOC | Detecting high log-densities: an | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan |
| 2010 | SAGT | A Direct Reduction from | Uriel Feige, Inbal Talgam-Cohen |
| 2010 | SAGT | Responsive Lotteries. | Uriel Feige, Moshe Tennenholtz |
| 2009 | SODA | On the power of two, three and four probes. | Noga Alon, Uriel Feige |
| 2009 | SODA | On smoothed | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
| 2009 | SPAA | Buffer management for colored packets with deadlines. | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra |
| 2008 | ESA | Edge Coloring and Decompositions of Weighted Graphs. | Uriel Feige, Mohit Singh |
| 2008 | WWW | Trust-based recommendation systems: an axiomatic approach. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz |
| 2008 | WWW | A combinatorial allocation mechanism with penalties for banner advertising. | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh |
| 2008 | SODA | On allocations that maximize fairness. | Uriel Feige |
| 2007 | FOCS | Refuting Smoothed 3CNF Formulas. | Uriel Feige |
| 2007 | FOCS | Maximizing Non-Monotone Submodular Functions. | Uriel Feige, Vahab S. Mirrokni, Jan Vondrk |
| 2007 | IPCO | Robust Combinatorial Optimization with Exponential Scenarios. | Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni |
| 2006 | FOCS | Witnesses for non-satisfiability of dense random 3CNF formulas. | Uriel Feige, Jeong Han Kim, Eran Ofek |
| 2006 | FOCS | Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. | Uriel Feige, Jan Vondrk |
| 2006 | SODA | Combination can be hard: approximability of the unique coverage problem. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour |
| 2006 | STOC | On maximizing welfare when utility functions are subadditive. | Uriel Feige |
| 2006 | STOC | Finding small balanced separators. | Uriel Feige, Mohammad Mahdian |
| 2005 | SODA | Rigorous analysis of heuristics for NP-hard problems. | Uriel Feige |
| 2005 | STOC | Improved approximation algorithms for minimum-weight vertex separators. | Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee |
| 2004 | ICALP | Easily Refutable Subformulas of Large Random 3CNF Formulas. | Uriel Feige, Eran Ofek |
| 2004 | STOC | On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. | Uriel Feige |
| 2002 | FOCS | Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. | Uriel Feige, Michael Langberg, Gideon Schechtman |
| 2002 | STOC | Relations between average case complexity and approximation complexity. | Uriel Feige |
| 2001 | ICALP | The RPR | Uriel Feige, Michael Langberg |
| 2001 | STOC | On the integrality ratio of semidefinite relaxations of MAX CUT. | Uriel Feige, Gideon Schechtman |
| 2000 | FOCS | A polylogarithmic approximation of the minimum bisection. | Uriel Feige, Robert Krauthgamer |
| 2000 | SODA | Min-Wise versus linear independence (extended abstract). | Andrei Z. Broder, Uriel Feige |
| 2000 | STOC | Approximating the domatic number. | Uriel Feige, Magns M. Halldrsson, Guy Kortsarz |
| 2000 | STOC | Approximating the minimum bisection size (extended abstract). | Uriel Feige, Robert Krauthgamer, Kobbi Nissim |
| 1999 | FOCS | Noncryptographic Selection Protocols. | Uriel Feige |
| 1999 | STOC | Nonmonotonic Phenomena in Packet Routing. | Uriel Feige |
| 1998 | FOCS | Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. | Uriel Feige, Joe Kilian |
| 1998 | STOC | Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract). | Uriel Feige |
| 1998 | STOC | Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). | Uriel Feige, Christian Scheideler |
| 1997 | CIAC | On the Drift of Short Schedules. | Uriel Feige, Giora Rayzman |
| 1997 | STOC | Making Games Short (Extended Abstract). | Uriel Feige, Joe Kilian |
| 1996 | STOC | Adaptively Secure Multi-Party Computation. | Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor |
| 1996 | STOC | A Threshold of ln | Uriel Feige |
| 1995 | STOC | Randomized graph products, chromatic numbers, and Lovasz theta-function. | Uriel Feige |
| 1995 | STOC | Impossibility results for recycling random bits in two-prover proof systems. | Uriel Feige, Joe Kilian |
| 1994 | ICALP | On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. | Yonatan Aumann, Judit Bar-Ilan, Uriel Feige |
| 1994 | ICALP | A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. | Uriel Feige |
| 1994 | STOC | Two prover protocols: low error at affordable rates. | Uriel Feige, Joe Kilian |
| 1994 | STOC | A minimal model for secure computation (extended abstract). | Uriel Feige, Joe Kilian, Moni Naor |
| 1993 | CRYPTO | On Message Proof Systems with Known Space Verifiers. | Yonatan Aumann, Uriel Feige |
| 1993 | FOCS | A Randomized Time-Space Tradeoff of \tildeO(m\tildeR) for USTCON | Uriel Feige |
| 1993 | STOC | Short random walks on graphs. | Greg Barnes, Uriel Feige |
| 1992 | CRYPTO | Low Communication 2-Prover Zero-Knowledge Proofs for NP. | Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra |
| 1992 | FOCS | Exact Analysis of Hot-Potato Routing (Extended Abstract) | Uriel Feige, Prabhakar Raghavan |
| 1992 | STOC | On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) | Uriel Feige, Carsten Lund |
| 1992 | STOC | Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) | Uriel Feige, Lszl Lovsz |
| 1991 | FOCS | Approximating Clique is Almost NP-Complete (Preliminary Version) | Uriel Feige, Shafi Goldwasser, Lszl Lovsz, Shmuel Safra, Mario Szegedy |
| 1990 | FOCS | Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) | Uriel Feige, Dror Lapidot, Adi Shamir |
| 1990 | STOC | Computing with Unreliable Information (Preliminary Version) | Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal |
| 1990 | STOC | Witness Indistinguishable and Witness Hiding Protocols | Uriel Feige, Adi Shamir |
| 1989 | CRYPTO | Zero Knowledge Proofs of Knowledge in Two Rounds. | Uriel Feige, Adi Shamir |
| 1988 | CRYPTO | The Noisy Oracle Problem. | Uriel Feige, Adi Shamir, Moshe Tennenholtz |
| 1987 | STOC | Zero Knowledge Proofs of Identity | Uriel Feige, Amos Fiat, Adi Shamir |