The Noisy Oracle Problem. - Uriel Feige; Adi Shamir; Moshe Tennenholtz (CRYPTO, 1988)

Zero-Knowledge Proofs of Identity. - Uriel Feige; Amos Fiat; Adi Shamir (J. Cryptol., 1988)

Multi-Oracle Interactive Protocols with Space Bounded Verifiers. - Uriel Feige; Adi Shamir (SCT, 1989)

Zero Knowledge Proofs of Knowledge in Two Rounds. - Uriel Feige; Adi Shamir (CRYPTO, 1989)

On Expected Polynomial Time Simulation of Zero Knowledge Protocols. - Uriel Feige; Adi Shamir (Distributed Computing And Cryptography, 1989)

Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) - Uriel Feige; Dror Lapidot; Adi Shamir (FOCS, 1990)

Computing with Unreliable Information (Preliminary Version) - Uriel Feige; David Peleg; Prabhakar Raghavan; Eli Upfal (STOC, 1990)

Witness Indistinguishable and Witness Hiding Protocols - Uriel Feige; Adi Shamir (STOC, 1990)

Randomized Broadcast in Networks. - Uriel Feige; David Peleg; Prabhakar Raghavan; Eli Upfal (Random Struct. Algorithms, 1990)

On the Success Probability of the Two Provers in One-Round Proof Systems. - Uriel Feige (SCT, 1991)

Approximating Clique is Almost NP-Complete (Preliminary Version) - Uriel Feige; Shafi Goldwasser; László Lovász 001; Shmuel Safra; Mario Szegedy (FOCS, 1991)

Low Communication 2-Prover Zero-Knowledge Proofs for NP. - Cynthia Dwork; Uriel Feige; Joe Kilian; Moni Naor; Shmuel Safra (CRYPTO, 1992)

Exact Analysis of Hot-Potato Routing (Extended Abstract) - Uriel Feige; Prabhakar Raghavan (FOCS, 1992)

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) - Uriel Feige; Carsten Lund (STOC, 1992)

Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) - Uriel Feige; László Lovász 001 (STOC, 1992)

On the Complexity of Finite Random Functions. - Uriel Feige (Inf. Process. Lett., 1992)

Multi-Oracle Interactive Protocols with Constant Space Verifiers. - Uriel Feige; Adi Shamir (J. Comput. Syst. Sci., 1992)

On Message Proof Systems with Known Space Verifiers. - Yonatan Aumann; Uriel Feige (CRYPTO, 1993)

A Randomized Time-Space Tradeoff of ildeO(m ildeR) for USTCON - Uriel Feige (FOCS, 1993)

A minimal model for secure computation (extended abstract). - Uriel Feige; Joe Kilian; Moni Naor (STOC, 1994)

Computing with Noisy Information. - Uriel Feige; Prabhakar Raghavan; David Peleg; Eli Upfal (SIAM J. Comput., 1994)

On the Role of Shared Randomness in Two Prover Proof Systems. - Mihir Bellare; Uriel Feige; Joe Kilian (ISTCS, 1995)

Observations on Hot Potato Routing. - Uriel Feige (ISTCS, 1995)

Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. - Uriel Feige; Michel X. Goemans (ISTCS, 1995)

Randomized graph products, chromatic numbers, and Lovasz theta-function. - Uriel Feige (STOC, 1995)

Impossibility results for recycling random bits in two-prover proof systems. - Uriel Feige; Joe Kilian (STOC, 1995)

Derandomized Graph Products. - Noga Alon; Uriel Feige; Avi Wigderson; David Zuckerman (Comput. Complex., 1995)

A Tight Upper Bound on the Cover Time for Random Walks on Graphs. - Uriel Feige (Random Struct. Algorithms, 1995)

A Tight Lower Bound on the Cover Time for Random Walks on Graphs. - Uriel Feige (Random Struct. Algorithms, 1995)

Adaptively Secure Multi-Party Computation. - Ran Canetti; Uriel Feige; Oded Goldreich 001; Moni Naor (STOC, 1996)

A Threshold of ln n for Approximating Set Cover (Preliminary Version). - Uriel Feige (STOC, 1996)

Interactive Proofs and the Hardness of Approximating Cliques. - Uriel Feige; Shafi Goldwasser; László Lovász 001; Shmuel Safra; Mario Szegedy (J. ACM, 1996)

Short Random Walks on Graphs. - Greg Barnes; Uriel Feige (SIAM J. Discret. Math., 1996)

Random Walks on Regular and Irregular Graphs. - Don Coppersmith; Uriel Feige; James B. Shearer (SIAM J. Discret. Math., 1996)

A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. - Uriel Feige (Theor. Comput. Sci., 1996)

Stereoscopic families of permutations, and their applications. - Uriel Feige; Robert Krauthgamer (ISTCS, 1997)

Making Games Short (Extended Abstract). - Uriel Feige; Joe Kilian (STOC, 1997)

Collecting Coupons on Trees, and the Cover Time of Random Walks. - Uriel Feige (Comput. Complex., 1997)

On the Hardness of Computing the Permanent of Random Matrices. - Uriel Feige; Carsten Lund (Comput. Complex., 1997)

On Limited versus Polynomial Nondeterminism. - Uriel Feige; Joe Kilian (Chic. J. Theor. Comput. Sci., 1997)

Randomized Graph Products, Chromatic Numbers, and the Lovász vartheta-Funktion. - Uriel Feige (Comb., 1997)

A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity. - Uriel Feige (J. Comput. Syst. Sci., 1997)

Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. - Uriel Feige; Joe Kilian (FOCS, 1998)

Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract). - Uriel Feige (STOC, 1998)

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). - Uriel Feige; Christian Scheideler (STOC, 1998)

A Threshold of ln n for Approximating Set Cover. - Uriel Feige (J. ACM, 1998)

Zero Knowledge and the Chromatic Number. - Uriel Feige; Joe Kilian (J. Comput. Syst. Sci., 1998)

Noncryptographic Selection Protocols. - Uriel Feige (FOCS, 1999)

Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example. - Uriel Feige (RANDOM-APPROX, 1999)

Nonmonotonic Phenomena in Packet Routing. - Uriel Feige (STOC, 1999)

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. - Uriel Feige; Dror Lapidot; Adi Shamir (SIAM J. Comput., 1999)

On the hardness of approximating N P witnesses. - Uriel Feige; Michael Langberg; Kobbi Nissim (APPROX, 2000)

Min-Wise versus linear independence (extended abstract). - Andrei Z. Broder; Uriel Feige (SODA, 2000)

Approximating the domatic number. - Uriel Feige; Magnús M. Halldórsson; Guy Kortsarz (STOC, 2000)

Approximating the minimum bisection size (extended abstract). - Uriel Feige; Robert Krauthgamer; Kobbi Nissim (STOC, 2000)

Coping with the NP-Hardness of the Graph Bandwidth Problem. - Uriel Feige (SWAT, 2000)

Networks on Which Hot-Potato Routing Does Not Livelock. - Uriel Feige; Robert Krauthgamer (Distributed Comput., 2000)

Improved Approximation of MAX-CUT on Graphs of Bounded Degree - Uriel Feige; Marek Karpinski; Michael Langberg (Electron. Colloquium Comput. Complex., 2000)

Finding OR in a noisy broadcast network. - Uriel Feige; Joe Kilian (Inf. Process. Lett., 2000)

Approximating the Bandwidth via Volume Respecting Embeddings. - Uriel Feige (J. Comput. Syst. Sci., 2000)

Finding and certifying a large hidden clique in a semirandom graph. - Uriel Feige; Robert Krauthgamer (Random Struct. Algorithms, 2000)

Two-Prover Protocols - Low Error at Affordable Rates. - Uriel Feige; Joe Kilian (SIAM J. Comput., 2000)

On the cost of recomputing: Tight bounds on pebbling with faults. - Yonatan Aumann; Judit Bar-Ilan; Uriel Feige (Theor. Comput. Sci., 2000)

On the integrality ratio of semidefinite relaxations of MAX CUT. - Uriel Feige; Gideon Schechtman (STOC, 2001)

The Dense k-Subgraph Problem. - Uriel Feige; Guy Kortsarz; David Peleg (Algorithmica, 2001)

A note on approximating Max-Bisection on regular graphs. - Uriel Feige; Marek Karpinski; Michael Langberg (Inf. Process. Lett., 2001)

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. - Uriel Feige; Michael Langberg (J. Algorithms, 2001)

Heuristics for Semirandom Graph Problems. - Uriel Feige; Joe Kilian (J. Comput. Syst. Sci., 2001)

Approximating Maximum Edge Coloring in Multigraphs. - Uriel Feige; Eran Ofek; Udi Wieder (APPROX, 2002)

Relations between average case complexity and approximation complexity. - Uriel Feige (STOC, 2002)

Improved Bounds for Acyclic Job Shop Scheduling. - Uriel Feige; Christian Scheideler (Comb., 2002)

Error Reduction by Parallel Repetition - A Negative Result. - Uriel Feige; Oleg Verbitsky 001 (Comb., 2002)

On the optimality of the random hyperplane rounding technique for MAX CUT. - Uriel Feige; Gideon Schechtman (Random Struct. Algorithms, 2002)

Approximating the Domatic Number. - Uriel Feige; Magnús M. Halldórsson; Guy Kortsarz; Aravind Srinivasan (SIAM J. Comput., 2002)

A Polylogarithmic Approximation of the Minimum Bisection. - Uriel Feige; Robert Krauthgamer (SIAM J. Comput., 2002)

On the drift of short schedules. - Uriel Feige; Giora Rayzman (Theor. Comput. Sci., 2002)

Approximation thresholds for combinatorial optimization problems - Uriel Feige (CoRR, 2003)

On Cutting a Few Vertices from a Graph. - Uriel Feige; Robert Krauthgamer; Kobbi Nissim (Discret. Appl. Math., 2003)

On the complexity of finding balanced oneway cuts. - Uriel Feige; Orly Yahalom (Inf. Process. Lett., 2003)

Deterministic approximation of the cover time. - Uriel Feige; Yuri Rabinovich (Random Struct. Algorithms, 2003)

The Probable Value of the Lovász–Schrijver Relaxations for Maximum Independent Set. - Uriel Feige; Robert Krauthgamer (SIAM J. Comput., 2003)

On Systems of Linear Equations with Two Variables per Equation. - Uriel Feige; Daniel Reichman 001 (APPROX-RANDOM, 2004)

Approximating Min Sum Set Cover. - Uriel Feige; László Lovász 001; Prasad Tetali (Algorithmica, 2004)

The inapproximability of lattice and coding problems with preprocessing. - Uriel Feige; Daniele Micciancio (J. Comput. Syst. Sci., 2004)

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. - Uriel Feige; Michael Langberg; Gideon Schechtman (SIAM J. Comput., 2004)

Approximating Maximum Clique by Removing Subgraphs. - Uriel Feige (SIAM J. Discret. Math., 2004)

Rigorous analysis of heuristics for NP-hard problems. - Uriel Feige (SODA, 2005)

On the Competitive Ratio of the Random Sampling Auction. - Uriel Feige; Abraham Flaxman; Jason D. Hartline; Robert D. Kleinberg (WINE, 2005)

Finding a Maximum Independent Set in a Sparse Random Graph - Uriel Feige; Eran Ofek (Electron. Colloquium Comput. Complex., 2005)

Genomic Variability within an Organism Exposes Its Cell Lineage Tree. - Dan Frumkin; Adam Wasserstrom; Shai Kaplan; Uriel Feige; Ehud Shapiro (PLoS Comput. Biol., 2005)

Spectral techniques applied to sparse random graphs. - Uriel Feige; Eran Ofek (Random Struct. Algorithms, 2005)

Improved approximation of the minimum cover time. - Eden Chlamtac; Uriel Feige (Theor. Comput. Sci., 2005)

Witnesses for non-satisfiability of dense random 3CNF formulas. - Uriel Feige; Jeong Han Kim; Eran Ofek (FOCS, 2006)

Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. - Uriel Feige; Jan Vondrák (FOCS, 2006)

Finding small balanced separators. - Uriel Feige; Mohammad Mahdian (STOC, 2006)

Random 3CNF formulas elude the Lovasz theta function. - Eran Ofek; Uriel Feige (Electron. Colloquium Comput. Complex., 2006)

On the hardness of approximating Max-Satisfy. - Uriel Feige; Daniel Reichman 001 (Inf. Process. Lett., 2006)

The RPR2 rounding technique for semidefinite programs. - Uriel Feige; Michael Langberg (J. Algorithms, 2006)

On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph. - Uriel Feige (SIAM J. Comput., 2006)

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. - Uriel Feige; Mohit Singh (APPROX-RANDOM, 2007)

Refuting Smoothed 3CNF Formulas. - Uriel Feige (FOCS, 2007)

Robust Combinatorial Optimization with Exponential Scenarios. - Uriel Feige; Kamal Jain; Mohammad Mahdian; Vahab S. Mirrokni (IPCO, 2007)

Understanding Parallel Repetition Requires Understanding Foams. - Uriel Feige; Guy Kindler; Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2007)

An improved approximation ratio for the minimum linear arrangement problem. - Uriel Feige; James R. Lee (Inf. Process. Lett., 2007)

Easily refutable subformulas of large random 3CNF formulas. - Uriel Feige; Eran Ofek (Theory Comput., 2007)

Edge Coloring and Decompositions of Weighted Graphs. - Uriel Feige; Mohit Singh (ESA, 2008)

On Estimation Algorithms vs Approximation Algorithms. - Uriel Feige (FSTTCS, 2008)

On allocations that maximize fairness. - Uriel Feige (SODA, 2008)

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 (WWW, 2008)

A combinatorial allocation mechanism with penalties for banner advertising. - Uriel Feige; Nicole Immorlica; Vahab S. Mirrokni; Hamid Nazerzadeh (WWW, 2008)

Combination Can Be Hard: Approximability of the Unique Coverage Problem. - Erik D. Demaine; Uriel Feige; MohammadTaghi Hajiaghayi; Mohammad R. Salavatipour (SIAM J. Comput., 2008)

Improved Approximation Algorithms for Minimum Weight Vertex Separators. - Uriel Feige; MohammadTaghi Hajiaghayi; James R. Lee (SIAM J. Comput., 2008)

PASS Approximation. - Uriel Feige; Nicole Immorlica; Vahab S. Mirrokni; Hamid Nazerzadeh (APPROX-RANDOM, 2009)

On the power of two, three and four probes. - Noga Alon; Uriel Feige (SODA, 2009)

On smoothed k-CNF formulas and the Walksat algorithm. - Amin Coja-Oghlan; Uriel Feige; Alan M. Frieze; Michael Krivelevich; Dan Vilenchik (SODA, 2009)

Approximating the Bandwidth of Caterpillars. - Uriel Feige; Kunal Talwar (Algorithmica, 2009)

Interchanging distance and capacity in probabilistic mappings - Reid Andersen; Uriel Feige (CoRR, 2009)

Deterministic approximation for the cover time of trees - Uriel Feige; Ofer Zeitouni (CoRR, 2009)

Faster FAST(Feedback Arc Set in Tournaments) - Uriel Feige (CoRR, 2009)

On Maximizing Welfare When Utility Functions Are Subadditive. - Uriel Feige (SIAM J. Comput., 2009)

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. - Uriel Feige; Inbal Talgam-Cohen (SAGT, 2010)

Responsive Lotteries. - Uriel Feige; Moshe Tennenholtz (SAGT, 2010)

Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. - Aditya Bhaskara; Moses Charikar; Eden Chlamtac; Uriel Feige; Aravindan Vijayaraghavan (STOC, 2010)

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. - Yossi Azar; Uriel Feige; Daniel Glasner (Algorithmica, 2010)

Detecting High Log-Densities – an O(n^1/4) Approximation for Densest k-Subgraph - Aditya Bhaskara; Moses Charikar; Eden Chlamtac; Uriel Feige; Aravindan Vijayaraghavan (CoRR, 2010)

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium - Uriel Feige; Inbal Talgam-Cohen (CoRR, 2010)

Balanced coloring of bipartite graphs. - Uriel Feige; Shimon Kogan (J. Graph Theory, 2010)

On Optimal Strategies for a Hat Game on Graphs. - Uriel Feige (SIAM J. Discret. Math., 2010)

The Submodular Welfare Problem with Demand Queries. - Uriel Feige; Jan Vondrák (Theory Comput., 2010)

Mechanism design with uncertain inputs: (to err is human, to forgive divine). - Uriel Feige; Moshe Tennenholtz (STOC, 2011)

An O(n log n) Algorithm for a Load Balancing Problem on Paths. - Nikhil R. Devanur; Uriel Feige (WADS, 2011)

Oblivious Collaboration. - Yehuda Afek; Yakov Babichenko; Uriel Feige; Eli Gafni; Nati Linial; Benny Sudakov (DISC, 2011)

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). - Martin E. Dyer; Uriel Feige; Alan M. Frieze; Marek Karpinski (Dagstuhl Reports, 2011)

Hardness results for approximating the bandwidth. - Chandan K. Dubey; Uriel Feige; Walter Unger (J. Comput. Syst. Sci., 2011)

Buffer Management for Colored Packets with Deadlines. - Yossi Azar; Uriel Feige; Iftah Gamzu; Thomas Moscibroda; Prasad Raghavendra (Theory Comput. Syst., 2011)

Maximizing Non-monotone Submodular Functions. - Uriel Feige; Vahab S. Mirrokni; Jan Vondrák (SIAM J. Comput., 2011)

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. - Uriel Feige; Abraham D. Flaxman; Dan Vilenchik (SIAM J. Discret. Math., 2011)

Mastering multi-player games. - Yossi Azar; Uriel Feige; Moshe Tennenholtz; Michal Feldman (AAMAS, 2012)

Universal Factor Graphs. - Uriel Feige; Shlomo Jozeph (ICALP (1), 2012)

Santa claus meets hypergraph matchings. - Arash Asadpour; Uriel Feige; Amin Saberi (ACM Trans. Algorithms, 2012)

The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. - Uriel Feige; Gil Kalai; Moshe Tennenholtz (AAAI, 2013)

Connectivity of Random High Dimensional Geometric Graphs. - Roee David; Uriel Feige (APPROX-RANDOM, 2013)

Competition among asymmetric sellers with fixed supply. - Uriel Feige; Ron Lavi; Moshe Tennenholtz (EC, 2013)

PASS Approximation: A Framework for Analyzing and Designing Heuristics. - Uriel Feige; Nicole Immorlica; Vahab S. Mirrokni; Hamid Nazerzadeh (Algorithmica, 2013)

Welfare Maximization and the Supermodular Degree. - Uriel Feige; Rani Izsak (Electron. Colloquium Comput. Complex., 2013)

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. - Uriel Feige; Elchanan Mossel; Dan Vilenchik (Theory Comput., 2013)

Demand Queries with Preprocessing. - Uriel Feige; Shlomo Jozeph (ICALP (1), 2014)

Sequential decision making with vector outcomes. - Yossi Azar; Uriel Feige; Michal Feldman; Moshe Tennenholtz (ITCS, 2014)

Invitation games and the price of stability. - Uriel Feige; Moshe Tennenholtz (ITCS, 2014)

Short Tours through Large Linear Forests. - Uriel Feige; R. Ravi 001; Mohit Singh (IPCO, 2014)

On robustly asymmetric graphs. - Uriel Feige (CoRR, 2014)

NP-hardness of hypercube 2-segmentation. - Uriel Feige (CoRR, 2014)

A Unifying Hierarchy of Valuations with Complements and Substitutes. - Uriel Feige; Michal Feldman; Nicole Immorlica; Rani Izsak; Brendan Lucier; Vasilis Syrgkanis (Electron. Colloquium Comput. Complex., 2014)

Separation between Estimation and Approximation. - Uriel Feige; Shlomo Jozeph (Electron. Colloquium Comput. Complex., 2014)

On fair division of a homogeneous good. - Uriel Feige; Moshe Tennenholtz (Games Econ. Behav., 2014)

Min-Max Graph Partitioning and Small Set Expansion. - Nikhil Bansal 001; Uriel Feige; Robert Krauthgamer; Konstantin Makarychev; Viswanath Nagarajan; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2014)

Musical Chairs. - Yehuda Afek; Yakov Babichenko; Uriel Feige; Eli Gafni; Nati Linial; Benny Sudakov (SIAM J. Discret. Math., 2014)

Learning and inference in the presence of corrupted inputs. - Uriel Feige; Yishay Mansour; Robert E. Schapire (COLT, 2015)

Why are Images Smooth? - Uriel Feige (ITCS, 2015)

Contagious Sets in Expanders. - Amin Coja-Oghlan; Uriel Feige; Michael Krivelevich; Daniel Reichman 001 (SODA, 2015)

Oblivious Algorithms for the Maximum Directed Cut Problem. - Uriel Feige; Shlomo Jozeph (Algorithmica, 2015)

Recoverable values for independent sets. - Uriel Feige; Daniel Reichman 001 (Random Struct. Algorithms, 2015)

Oblivious Rounding and the Integrality Gap. - Uriel Feige; Michal Feldman; Inbal Talgam-Cohen (APPROX-RANDOM, 2016)

On the effect of randomness on planted 3-coloring models. - Roee David; Uriel Feige (STOC, 2016)

Random walks with the minimum degree local rule have $O(n^2)$ cover time. - Roee David; Uriel Feige (CoRR, 2016)

On giant components and treewidth in the layers model. - Uriel Feige; Jonathan Hermon; Daniel Reichman 001 (Random Struct. Algorithms, 2016)

Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time. - Roee David; Uriel Feige (SODA, 2017)

Optimization with Uniform Size Queries. - Uriel Feige; Moshe Tennenholtz (Algorithmica, 2017)

A greedy approximation algorithm for minimum-gap scheduling. - Marek Chrobak; Uriel Feige; Mohammad Taghi Hajiaghayi; Sanjeev Khanna; Fei Li 001; Seffi Naor (J. Sched., 2017)

Chasing Ghosts: Competing with Stateful Policies. - Uriel Feige; Tomer Koren; Moshe Tennenholtz (SIAM J. Comput., 2017)

Robust Inference for Multiclass Classification. - Uriel Feige; Yishay Mansour; Robert E. Schapire (ALT, 2018)

On the Probe Complexity of Local Computation Algorithms. - Uriel Feige; Boaz Patt-Shamir; Shai Vardi (ICALP, 2018)

The Ordered Covering Problem. - Uriel Feige; Yael Hitron (Algorithmica, 2018)

Tighter bounds for online bipartite matching. - Uriel Feige (CoRR, 2018)

Random Walks with the Minimum Degree Local Rule Have O(n2) Cover Time. - Roee David; Uriel Feige (SIAM J. Comput., 2018)

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. - Uriel Feige; Janardhan Kulkarni; Shi Li 001 (SODA, 2019)

A New Approach to Fair Distribution of Welfare. - Moshe Babaioff; Uriel Feige (WINE, 2019)

A randomized strategy in the mirror game. - Uriel Feige (CoRR, 2019)

Introduction to Semirandom Models. - Uriel Feige (Beyond the Worst-Case Analysis of Algorithms, 2020)

Quantitative Group Testing and the rank of random matrices. - Uriel Feige; Amir Lellouche (CoRR, 2020)

Finding cliques using few probes. - Uriel Feige; David Gamarnik; Joe Neeman; Miklós Z. Rácz; Prasad Tetali (Random Struct. Algorithms, 2020)

Approximate Modularity Revisited. - Uriel Feige; Michal Feldman; Inbal Talgam-Cohen (SIAM J. Comput., 2020)

On the Profile of Multiplicities of Complete Subgraphs. - Uriel Feige; Anne Kenyon; Shimon Kogan (SIAM J. Discret. Math., 2020)

Shotgun assembly of random jigsaw puzzles. - Charles Bordenave; Uriel Feige; Elchanan Mossel (Random Struct. Algorithms, 2020)

Fair and Truthful Mechanisms for Dichotomous Valuations. - Moshe Babaioff; Tomer Ezra; Uriel Feige (AAAI, 2021)

Are Gross Substitutes a Substitute for Submodular Valuations? - Shahar Dobzinski; Uriel Feige; Michal Feldman (EC, 2021)

A Tight Negative Example for MMS Fair Allocations. - Uriel Feige; Ariel Sapir; Laliv Tauber (WINE, 2021)

A tight bound for the clique query problem in two rounds. - Uriel Feige; Tom Ferster (CoRR, 2021)

Target set selection for conservative populations. - Uriel Feige; Shimon Kogan (Discret. Appl. Math., 2021)

Navigating in Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2021)

Fair Allocations for Smoothed Utilities. - Yushi Bai; Uriel Feige; Paul Gölz; Ariel D. Procaccia (EC, 2022)

On Best-of-Both-Worlds Fair-Share Allocations. - Moshe Babaioff; Tomer Ezra; Uriel Feige (WINE, 2022)

On allocations that give intersecting groups their fair share. - Uriel Feige; Yehonatan Tahan (CoRR, 2022)

Improved maximin fair allocation of indivisible items to three agents. - Uriel Feige; Alexey Norkin (CoRR, 2022)

On the path partition number of 6-regular graphs. - Uriel Feige; Ella Fuchs (J. Graph Theory, 2022)

Max-Min Greedy Matching. - Alon Eden; Uriel Feige; Michal Feldman (Adv. Math. Commun., 2022)

On picking sequences for chores. - Uriel Feige; Xin Huang (EC, 2023)

On Fair Allocation of Indivisible Goods to Submodular Agents. - Gilad Ben Uziahu; Uriel Feige (CoRR, 2023)

The inversion paradox, and classification of fairness notions. - Uriel Feige (CoRR, 2023)

Fair-Share Allocations for Agents with Arbitrary Entitlements. - Moshe Babaioff; Tomer Ezra; Uriel Feige (Math. Oper. Res., 2024)

How to Hide a Clique? - Uriel Feige; Vadim Grinberg (Theory Comput. Syst., 2024)

Low communication protocols for fair allocation of indivisible goods. - Uriel Feige (EC, 2025)

Fair allocations with subadditive and XOS valuations. - Uriel Feige; Vadim Grinberg (EC, 2025)

Share-Based Fairness for Arbitrary Entitlements. - Moshe Babaioff; Uriel Feige (STOC, 2025)

Fair Shares: Feasibility, Domination, and Incentives. - Moshe Babaioff; Uriel Feige (Math. Oper. Res., 2025)

The Query Complexity of Searching Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2025)

Concentration and maximin fair allocations for subadditive valuations. - Uriel Feige; Shengyu Huang (CoRR, 2025)

The Surprising Power of Spectral Refutation. - Uriel Feige (Commun. ACM, 2025)

The residual maximin share. - Uriel Feige (CoRR, 2025)

Upper bounds on the theta function of random graphs. - Uriel Feige; Vadim Grinberg (CoRR, 2025)

From multi-allocations to allocations, with subadditive valuations. - Uriel Feige (CoRR, 2025)