default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUriel Feige
Person information
- affiliation: Weizmann Institute of Science, Israel
- award (2001): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2025
[j92]Uriel Feige:
The Surprising Power of Spectral Refutation. Commun. ACM 68(3): 82 (2025)- 2024
- [j91]Moshe Babaioff
, Tomer Ezra, Uriel Feige:
Fair-Share Allocations for Agents with Arbitrary Entitlements. Math. Oper. Res. 49(4): 2180-2211 (2024) - [j90]Uriel Feige, Vadim Grinberg:
How to Hide a Clique? Theory Comput. Syst. 68(4): 773-813 (2024) - 2022
- [j89]Uriel Feige, Ella Fuchs:
On the path partition number of 6-regular graphs. J. Graph Theory 101(3): 345-378 (2022) - [j88]Alon Eden, Uriel Feige, Michal Feldman:
Max-Min Greedy Matching. Adv. Math. Commun. 18: 1-33 (2022) - 2021
- [j87]Uriel Feige, Shimon Kogan:
Target set selection for conservative populations. Discret. Appl. Math. 305: 119-132 (2021) - [j86]Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
Navigating in Trees with Permanently Noisy Advice. ACM Trans. Algorithms 17(2): 15:1-15:27 (2021) - 2020
- [j85]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - [j84]Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun assembly of random jigsaw puzzles. Random Struct. Algorithms 56(4): 998-1015 (2020) - [j83]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate Modularity Revisited. SIAM J. Comput. 49(1): 67-97 (2020) - [j82]Uriel Feige, Anne Kenyon, Shimon Kogan:
On the Profile of Multiplicities of Complete Subgraphs. SIAM J. Discret. Math. 34(1): 950-971 (2020) - 2018
- [j81]Uriel Feige, Yael Hitron:
The Ordered Covering Problem. Algorithmica 80(10): 2874-2908 (2018) - [j80]Roee David, Uriel Feige:
Random Walks with the Minimum Degree Local Rule Have O(n2) Cover Time. SIAM J. Comput. 47(3): 755-768 (2018) - 2017
- [j79]Uriel Feige, Moshe Tennenholtz:
Optimization with Uniform Size Queries. Algorithmica 78(1): 255-273 (2017) - [j78]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j77]Uriel Feige, Tomer Koren, Moshe Tennenholtz:
Chasing Ghosts: Competing with Stateful Policies. SIAM J. Comput. 46(1): 190-223 (2017) - 2016
- [j76]Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. Random Struct. Algorithms 48(3): 524-545 (2016) - 2015
- [j75]Uriel Feige, Shlomo Jozeph:
Oblivious Algorithms for the Maximum Directed Cut Problem. Algorithmica 71(2): 409-428 (2015) - [j74]Uriel Feige, Daniel Reichman:
Recoverable values for independent sets. Random Struct. Algorithms 46(1): 142-159 (2015) - 2014
- [j73]Uriel Feige, Moshe Tennenholtz:
On fair division of a homogeneous good. Games Econ. Behav. 87: 305-321 (2014) - [j72]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [j71]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical Chairs. SIAM J. Discret. Math. 28(3): 1578-1600 (2014) - 2013
- [j70]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation: A Framework for Analyzing and Designing Heuristics. Algorithmica 66(2): 450-478 (2013) - [j69]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9: 617-651 (2013) - 2012
- [j68]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8(3): 24:1-24:9 (2012) - 2011
- [j67]Chandan K. Dubey, Uriel Feige, Walter Unger:
Hardness results for approximating the bandwidth. J. Comput. Syst. Sci. 77(1): 62-90 (2011) - [j66]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer Management for Colored Packets with Deadlines. Theory Comput. Syst. 49(4): 738-756 (2011) - [j65]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-monotone Submodular Functions. SIAM J. Comput. 40(4): 1133-1153 (2011) - [j64]Uriel Feige, Abraham D. Flaxman, Dan Vilenchik:
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. SIAM J. Discret. Math. 25(2): 736-749 (2011) - 2010
- [j63]Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Algorithmica 57(3): 517-537 (2010) - [j62]Uriel Feige, Shimon Kogan:
Balanced coloring of bipartite graphs. J. Graph Theory 64(4): 277-291 (2010) - [j61]Uriel Feige:
On Optimal Strategies for a Hat Game on Graphs. SIAM J. Discret. Math. 24(3): 782-791 (2010) - [j60]Uriel Feige, Jan Vondrák:
The Submodular Welfare Problem with Demand Queries. Theory Comput. 6(1): 247-290 (2010) - 2009
- [j59]Uriel Feige, Kunal Talwar:
Approximating the Bandwidth of Caterpillars. Algorithmica 55(1): 190-204 (2009) - [j58]Uriel Feige:
On Maximizing Welfare When Utility Functions Are Subadditive. SIAM J. Comput. 39(1): 122-142 (2009) - 2008
- [j57]Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee:
Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008) - [j56]Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour:
Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008) - [j55]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. SIAM J. Discret. Math. 22(2): 693-718 (2008) - 2007
- [j54]Uriel Feige, James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1): 26-29 (2007) - [j53]Uriel Feige, Eran Ofek:
Easily refutable subformulas of large random 3CNF formulas. Theory Comput. 3(1): 25-43 (2007) - 2006
- [j52]Uriel Feige, Daniel Reichman:
On the hardness of approximating Max-Satisfy. Inf. Process. Lett. 97(1): 31-35 (2006) - [j51]Uriel Feige, Michael Langberg:
The RPR2 rounding technique for semidefinite programs. J. Algorithms 60(1): 1-23 (2006) - [j50]Uriel Feige:
On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph. SIAM J. Comput. 35(4): 964-984 (2006) - [j49]Robert Krauthgamer, Uriel Feige:
A Polylogarithmic Approximation of the Minimum Bisection. SIAM Rev. 48(1): 99-130 (2006) - 2005
- [j48]Dan Frumkin, Adam Wasserstrom, Shai Kaplan, Uriel Feige, Ehud Shapiro:
Genomic Variability within an Organism Exposes Its Cell Lineage Tree. PLoS Comput. Biol. 1(6) (2005) - [j47]Uriel Feige, Eran Ofek:
Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2): 251-275 (2005) - [j46]Eden Chlamtac, Uriel Feige:
Improved approximation of the minimum cover time. Theor. Comput. Sci. 341(1-3): 22-38 (2005) - 2004
- [j45]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004) - [j44]Uriel Feige, Daniele Micciancio:
The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. Sci. 69(1): 45-67 (2004) - [j43]Uriel Feige, Michael Langberg, Gideon Schechtman:
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33(6): 1338-1368 (2004) - [j42]Uriel Feige:
Approximating Maximum Clique by Removing Subgraphs. SIAM J. Discret. Math. 18(2): 219-225 (2004) - 2003
- [j41]Uriel Feige, Robert Krauthgamer, Kobbi Nissim:
On Cutting a Few Vertices from a Graph. Discret. Appl. Math. 127(3): 643-649 (2003) - [j40]Uriel Feige, Orly Yahalom:
On the complexity of finding balanced oneway cuts. Inf. Process. Lett. 87(1): 1-5 (2003) - [j39]Uriel Feige, Yuri Rabinovich:
Deterministic approximation of the cover time. Random Struct. Algorithms 23(1): 1-22 (2003) - [j38]Uriel Feige, Robert Krauthgamer:
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set. SIAM J. Comput. 32(2): 345-370 (2003) - 2002
- [j37]Uriel Feige, Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling. Comb. 22(3): 361-399 (2002) - [j36]Uriel Feige, Oleg Verbitsky:
Error Reduction by Parallel Repetition - A Negative Result. Comb. 22(4): 461-478 (2002) - [j35]Uriel Feige, Marek Karpinski, Michael Langberg:
Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002) - [j34]Uriel Feige, Gideon Schechtman:
On the optimality of the random hyperplane rounding technique for MAX CUT. Random Struct. Algorithms 20(3): 403-440 (2002) - [j33]Uriel Feige, Robert Krauthgamer:
A Polylogarithmic Approximation of the Minimum Bisection. SIAM J. Comput. 31(4): 1090-1118 (2002) - [j32]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan:
Approximating the Domatic Number. SIAM J. Comput. 32(1): 172-195 (2002) - [j31]Uriel Feige, Giora Rayzman:
On the drift of short schedules. Theor. Comput. Sci. 289(1): 473-484 (2002) - 2001
- [j30]Uriel Feige, Guy Kortsarz, David Peleg:
The Dense k-Subgraph Problem. Algorithmica 29(3): 410-421 (2001) - [j29]Uriel Feige, Marek Karpinski, Michael Langberg:
A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001) - [j28]Uriel Feige, Michael Langberg:
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2): 174-211 (2001) - [j27]Uriel Feige, Joe Kilian:
Heuristics for Semirandom Graph Problems. J. Comput. Syst. Sci. 63(4): 639-671 (2001) - 2000
- [j26]Uriel Feige, Robert Krauthgamer:
Networks on Which Hot-Potato Routing Does Not Livelock. Distributed Comput. 13(1): 53-58 (2000) - [j25]Uriel Feige, Joe Kilian:
Finding OR in a noisy broadcast network. Inf. Process. Lett. 73(1-2): 69-75 (2000) - [j24]Uriel Feige:
Approximating the Bandwidth via Volume Respecting Embeddings. J. Comput. Syst. Sci. 60(3): 510-539 (2000) - [j23]Uriel Feige, Robert Krauthgamer:
Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms 16(2): 195-208 (2000) - [j22]Uriel Feige, Joe Kilian:
Two-Prover Protocols - Low Error at Affordable Rates. SIAM J. Comput. 30(1): 324-346 (2000) - [j21]Yonatan Aumann, Judit Bar-Ilan, Uriel Feige:
On the cost of recomputing: Tight bounds on pebbling with faults. Theor. Comput. Sci. 233(1-2): 247-261 (2000) - 1999
- [j20]Uriel Feige, Dror Lapidot, Adi Shamir:
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1-28 (1999) - 1998
- [j19]Uriel Feige:
A Threshold of ln n for Approximating Set Cover. J. ACM 45(4): 634-652 (1998) - [j18]Uriel Feige, Joe Kilian:
Zero Knowledge and the Chromatic Number. J. Comput. Syst. Sci. 57(2): 187-199 (1998) - 1997
- [j17]Uriel Feige, Carsten Lund:
On the Hardness of Computing the Permanent of Random Matrices. Comput. Complex. 6(2): 101-132 (1997) - [j16]Uriel Feige:
Collecting Coupons on Trees, and the Cover Time of Random Walks. Comput. Complex. 6(4): 341-356 (1997) - [j15]Uriel Feige, Joe Kilian:
On Limited versus Polynomial Nondeterminism. Chic. J. Theor. Comput. Sci. 1997 (1997) - [j14]Uriel Feige:
Randomized Graph Products, Chromatic Numbers, and the Lovász vartheta-Funktion. Comb. 17(1): 79-90 (1997) - [j13]Uriel Feige:
A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity. J. Comput. Syst. Sci. 54(2): 305-316 (1997) - 1996
- [j12]Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy:
Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2): 268-292 (1996) - [j11]Greg Barnes, Uriel Feige:
Short Random Walks on Graphs. SIAM J. Discret. Math. 9(1): 19-28 (1996) - [j10]Don Coppersmith, Uriel Feige, James B. Shearer:
Random Walks on Regular and Irregular Graphs. SIAM J. Discret. Math. 9(2): 301-308 (1996) - [j9]Uriel Feige:
A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. Theor. Comput. Sci. 169(2): 147-160 (1996) - 1995
- [j8]Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman:
Derandomized Graph Products. Comput. Complex. 5(1): 60-75 (1995) - [j7]Uriel Feige:
A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(1): 51-54 (1995) - [j6]Uriel Feige:
A Tight Lower Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(4): 433-438 (1995) - 1994
- [j5]Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal:
Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994) - 1992
- [j4]Uriel Feige:
On the Complexity of Finite Random Functions. Inf. Process. Lett. 44(6): 295-296 (1992) - [j3]Uriel Feige, Adi Shamir:
Multi-Oracle Interactive Protocols with Constant Space Verifiers. J. Comput. Syst. Sci. 44(2): 259-271 (1992) - 1990
- [j2]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990) - 1988
- [j1]Uriel Feige, Amos Fiat, Adi Shamir:
Zero-Knowledge Proofs of Identity. J. Cryptol. 1(2): 77-94 (1988)
Conference and Workshop Papers
- 2025
- [c130]Moshe Babaioff, Uriel Feige:
Share-Based Fairness for Arbitrary Entitlements. STOC 2025: 1544-1555 - 2023
- [c129]Uriel Feige, Xin Huang:
On picking sequences for chores. EC 2023: 626-655 - 2022
- [c128]Moshe Babaioff, Uriel Feige:
Fair Shares: Feasibility, Domination and Incentives. EC 2022: 435 - [c127]Yushi Bai, Uriel Feige, Paul Gölz, Ariel D. Procaccia:
Fair Allocations for Smoothed Utilities. EC 2022: 436-465 - [c126]Moshe Babaioff, Tomer Ezra, Uriel Feige:
On Best-of-Both-Worlds Fair-Share Allocations. WINE 2022: 237-255 - 2021
- [c125]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair and Truthful Mechanisms for Dichotomous Valuations. AAAI 2021: 5119-5126 - [c124]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair-Share Allocations for Agents with Arbitrary Entitlements. EC 2021: 127 - [c123]Shahar Dobzinski, Uriel Feige, Michal Feldman:
Are Gross Substitutes a Substitute for Submodular Valuations? EC 2021: 390-408 - [c122]Uriel Feige, Ariel Sapir, Laliv Tauber:
A Tight Negative Example for MMS Fair Allocations. WINE 2021: 355-372 - 2020
- [c121]Uriel Feige, Vadim Grinberg:
How to Hide a Clique? ICALP 2020: 44:1-44:13 - 2019
- [c120]Alon Eden, Uriel Feige, Michal Feldman:
Max-Min Greedy Matching. APPROX-RANDOM 2019: 7:1-7:23 - [c119]Alon Eden, Uriel Feige, Michal Feldman:
Max-min greedy matching. NetEcon@SIGMETRICS 2019: 10:1 - [c118]Uriel Feige, Janardhan Kulkarni, Shi Li:
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. SODA 2019: 1585-1595 - [c117]Moshe Babaioff, Uriel Feige:
A New Approach to Fair Distribution of Welfare. WINE 2019: 71-84 - 2018
- [c116]Uriel Feige, Yishay Mansour, Robert E. Schapire:
Robust Inference for Multiclass Classification. ALT 2018: 368-386 - [c115]Uriel Feige, Boaz Patt-Shamir, Shai Vardi:
On the Probe Complexity of Local Computation Algorithms. ICALP 2018: 50:1-50:14 - 2017
- [c114]Roee David, Uriel Feige:
Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time. SODA 2017: 1839-1848 - [c113]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate modularity revisited. STOC 2017: 1028-1041 - 2016
- [c112]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Oblivious Rounding and the Integrality Gap. APPROX-RANDOM 2016: 8:1-8:23 - [c111]Roee David, Uriel Feige:
On the effect of randomness on planted 3-coloring models. STOC 2016: 77-90 - 2015
- [c110]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. AAAI 2015: 872-878 - [c109]Uriel Feige, Yishay Mansour, Robert E. Schapire:
Learning and inference in the presence of corrupted inputs. COLT 2015: 637-657 - [c108]Uriel Feige:
Why are Images Smooth? ITCS 2015: 229-236 - [c107]Uriel Feige, Shlomo Jozeph:
Separation between Estimation and Approximation. ITCS 2015: 271-276 - [c106]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. SODA 2015: 1953-1987 - 2014
- [c105]Uriel Feige, Tomer Koren, Moshe Tennenholtz:
Chasing Ghosts: Competing with Stateful Policies. FOCS 2014: 100-109 - [c104]Uriel Feige, Shlomo Jozeph:
Demand Queries with Preprocessing. ICALP (1) 2014: 477-488 - [c103]Uriel Feige, Moshe Tennenholtz:
Invitation games and the price of stability. ITCS 2014: 93-102 - [c102]Yossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz:
Sequential decision making with vector outcomes. ITCS 2014: 195-206 - [c101]Uriel Feige, R. Ravi, Mohit Singh:
Short Tours through Large Linear Forests. IPCO 2014: 273-284 - 2013
- [c100]Uriel Feige, Gil Kalai, Moshe Tennenholtz:
The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. AAAI 2013: 313-319 - [c99]Roee David, Uriel Feige:
Connectivity of Random High Dimensional Geometric Graphs. APPROX-RANDOM 2013: 497-512 - [c98]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c97]Uriel Feige, Rani Izsak:
Welfare maximization and the supermodular degree. ITCS 2013: 247-256 - [c96]Uriel Feige, Ron Lavi, Moshe Tennenholtz:
Competition among asymmetric sellers with fixed supply. EC 2013: 415-416 - 2012
- [c95]Yossi Azar, Uriel Feige, Moshe Tennenholtz, Michal Feldman:
Mastering multi-player games. AAMAS 2012: 897-904 - [c94]Uriel Feige, Shlomo Jozeph:
Universal Factor Graphs. ICALP (1) 2012: 339-350 - 2011
- [c93]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c92]Uriel Feige, Daniel Reichman:
Recoverable Values for Independent Sets. ICALP (1) 2011: 486-497 - [c91]Uriel Feige, Moshe Tennenholtz:
Mechanism design with uncertain inputs: (to err is human, to forgive divine). STOC 2011: 549-558 - [c90]Nikhil R. Devanur, Uriel Feige:
An O(n log n) Algorithm for a Load Balancing Problem on Paths. WADS 2011: 326-337 - [c89]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. DISC 2011: 489-504 - 2010
- [c88]Uriel Feige, Inbal Talgam-Cohen:
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. SAGT 2010: 138-149 - [c87]Uriel Feige, Moshe Tennenholtz:
Responsive Lotteries. SAGT 2010: 150-161 - [c86]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. STOC 2010: 201-210 - 2009
- [c85]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation. APPROX-RANDOM 2009: 111-124 - [c84]Noga Alon, Uriel Feige:
On the power of two, three and four probes. SODA 2009: 346-354 - [c83]Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460 - [c82]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer management for colored packets with deadlines. SPAA 2009: 319-327 - 2008
- [c81]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa Claus Meets Hypergraph Matchings. APPROX-RANDOM 2008: 10-20 - [c80]Uriel Feige, Mohit Singh:
Edge Coloring and Decompositions of Weighted Graphs. ESA 2008: 405-416 - [c79]Uriel Feige:
On Estimation Algorithms vs Approximation Algorithms. FSTTCS 2008: 357-363 - [c78]Uriel Feige:
On allocations that maximize fairness. SODA 2008: 287-293 - [c77]Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. SWAT 2008: 319-330 - [c76]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
A combinatorial allocation mechanism with penalties for banner advertising. WWW 2008: 169-178 - [c75]Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz:
Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208 - 2007
- [c74]Uriel Feige, Mohit Singh:
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. APPROX-RANDOM 2007: 104-118 - [c73]Uriel Feige, Guy Kindler, Ryan O'Donnell:
Understanding Parallel Repetition Requires Understanding Foams. CCC 2007: 179-192 - [c72]Uriel Feige:
Refuting Smoothed 3CNF Formulas. FOCS 2007: 407-417 - [c71]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471 - [c70]Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni:
Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453 - 2006
- [c69]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350 - [c68]Uriel Feige, Jeong Han Kim, Eran Ofek:
Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS 2006: 497-508 - [c67]Uriel Feige, Jan Vondrák:
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. FOCS 2006: 667-676 - [c66]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour:
Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171 - [c65]Uriel Feige:
On maximizing welfare when utility functions are subadditive. STOC 2006: 41-50 - [c64]Uriel Feige, Mohammad Mahdian:
Finding small balanced separators. STOC 2006: 375-384 - 2005
- [c63]Uriel Feige, Kunal Talwar:
Approximating the Bandwidth of Caterpillars. APPROX-RANDOM 2005: 62-73 - [c62]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. APPROX-RANDOM 2005: 282-293 - [c61]Uriel Feige:
Rigorous analysis of heuristics for NP-hard problems. SODA 2005: 927 - [c60]Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee:
Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572 - [c59]Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg:
On the Competitive Ratio of the Random Sampling Auction. WINE 2005: 878-886 - 2004
- [c58]Uriel Feige, Daniel Reichman:
On Systems of Linear Equations with Two Variables per Equation. APPROX-RANDOM 2004: 117-127 - [c57]Uriel Feige, Eran Ofek:
Easily Refutable Subformulas of Large Random 3CNF Formulas. ICALP 2004: 519-530 - [c56]Uriel Feige:
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. STOC 2004: 594-603 - 2002
- [c55]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min-sum Set Cover. APPROX 2002: 94-107 - [c54]Uriel Feige, Eran Ofek, Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs. APPROX 2002: 108-121 - [c53]Uriel Feige:
Relations between Average Case Complexity and Approximation Complexity. CCC 2002: 5 - [c52]Uriel Feige, Daniele Micciancio:
The Inapproximability of Lattice and Coding Problems with Preprocessing. CCC 2002: 44-52 - [c51]Uriel Feige, Michael Langberg, Gideon Schechtman:
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS 2002: 283-292 - [c50]Uriel Feige:
Relations between average case complexity and approximation complexity. STOC 2002: 534-543 - 2001
- [c49]Uriel Feige, Michael Langberg:
The RPR2 Rounding Technique for Semidefinite Programs. ICALP 2001: 213-224 - [c48]Uriel Feige, Gideon Schechtman:
On the integrality ratio of semidefinite relaxations of MAX CUT. STOC 2001: 433-442 - 2000
- [c47]Uriel Feige, Michael Langberg, Kobbi Nissim:
On the hardness of approximating N P witnesses. APPROX 2000: 120-131 - [c46]Uriel Feige, Robert Krauthgamer:
A polylogarithmic approximation of the minimum bisection. FOCS 2000: 105-115 - [c45]Andrei Z. Broder, Uriel Feige:
Min-Wise versus linear independence (extended abstract). SODA 2000: 147-154 - [c44]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz:
Approximating the domatic number. STOC 2000: 134-143 - [c43]Uriel Feige, Robert Krauthgamer, Kobbi Nissim:
Approximating the minimum bisection size (extended abstract). STOC 2000: 530-536 - [c42]Uriel Feige:
Coping with the NP-Hardness of the Graph Bandwidth Problem. SWAT 2000: 10-19 - 1999
- [c41]Uriel Feige:
Noncryptographic Selection Protocols. FOCS 1999: 142-153 - [c40]Uriel Feige:
Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example. RANDOM-APPROX 1999: 189-196 - [c39]Uriel Feige:
Nonmonotonic Phenomena in Packet Routing. STOC 1999: 583-591 - 1998
- [c38]Uriel Feige, Joe Kilian:
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. FOCS 1998: 674-683 - [c37]Uriel Feige:
Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract). STOC 1998: 90-99 - [c36]Uriel Feige, Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). STOC 1998: 624-633 - 1997
- [c35]Uriel Feige, Giora Rayzman:
On the Drift of Short Schedules. CIAC 1997: 74-85 - [c34]Uriel Feige, Robert Krauthgamer:
Stereoscopic families of permutations, and their applications. ISTCS 1997: 85-95 - [c33]Uriel Feige, Joe Kilian:
Making Games Short (Extended Abstract). STOC 1997: 506-516 - 1996
- [c32]Uriel Feige, Oleg Verbitsky:
Error Reduction by Parallel Repetition - a Negative Result. CCC 1996: 70-76 - [c31]Uriel Feige, Joe Kilian:
Zero Knowledge and the Chromatic Number. CCC 1996: 278-287 - [c30]Uriel Feige, Yuri Rabinovich:
Deterministic Approximation of the Cover Time. ISTCS 1996: 208-218 - [c29]Uriel Feige:
A Threshold of ln n for Approximating Set Cover (Preliminary Version). STOC 1996: 314-318 - [c28]Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor:
Adaptively Secure Multi-Party Computation. STOC 1996: 639-648 - 1995
- [c27]Uriel Feige:
Observations on Hot Potato Routing. ISTCS 1995: 30-39 - [c26]Uriel Feige, Michel X. Goemans:
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. ISTCS 1995: 182-189 - [c25]Mihir Bellare, Uriel Feige, Joe Kilian:
On the Role of Shared Randomness in Two Prover Proof Systems. ISTCS 1995: 199-208 - [c24]Uriel Feige, Joe Kilian:
Impossibility results for recycling random bits in two-prover proof systems. STOC 1995: 457-468 - [c23]Uriel Feige:
Randomized graph products, chromatic numbers, and Lovasz theta-function. STOC 1995: 635-640 - 1994
- [c22]Yonatan Aumann, Judit Bar-Ilan, Uriel Feige:
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994: 47-58 - [c21]Uriel Feige:
A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. ICALP 1994: 499-507 - [c20]Uriel Feige, Joe Kilian:
Two prover protocols: low error at affordable rates. STOC 1994: 172-183 - [c19]Uriel Feige, Joe Kilian, Moni Naor:
A minimal model for secure computation (extended abstract). STOC 1994: 554-563 - 1993
- [c18]Yonatan Aumann, Uriel Feige:
On Message Proof Systems with Known Space Verifiers. CRYPTO 1993: 85-99 - [c17]Uriel Feige:
A Randomized Time-Space Tradeoff of \tildeO(m\tildeR) for USTCON. FOCS 1993: 238-246 - [c16]Greg Barnes, Uriel Feige:
Short random walks on graphs. STOC 1993: 728-737 - 1992
- [c15]Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra:
Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992: 215-227 - [c14]Uriel Feige, Prabhakar Raghavan:
Exact Analysis of Hot-Potato Routing (Extended Abstract). FOCS 1992: 553-562 - [c13]Uriel Feige, Carsten Lund:
On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract). STOC 1992: 643-654 - [c12]Uriel Feige, László Lovász:
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract). STOC 1992: 733-744 - 1991
- [c11]Uriel Feige:
On the Success Probability of the Two Provers in One-Round Proof Systems. SCT 1991: 116-123 - [c10]Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy:
Approximating Clique is Almost NP-Complete (Preliminary Version). FOCS 1991: 2-12 - 1990
- [c9]Uriel Feige, Dror Lapidot, Adi Shamir:
Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract). FOCS 1990: 308-317 - [c8]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137 - [c7]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137 - [c6]Uriel Feige, Adi Shamir:
Witness Indistinguishable and Witness Hiding Protocols. STOC 1990: 416-426 - 1989
- [c5]Uriel Feige, Adi Shamir:
Multi-Oracle Interactive Protocols with Space Bounded Verifiers. SCT 1989: 158-164 - [c4]Uriel Feige, Adi Shamir:
Zero Knowledge Proofs of Knowledge in Two Rounds. CRYPTO 1989: 526-544 - [c3]Uriel Feige, Adi Shamir:
On Expected Polynomial Time Simulation of Zero Knowledge Protocols. Distributed Computing And Cryptography 1989: 155-160 - 1988
- [c2]Uriel Feige, Adi Shamir, Moshe Tennenholtz:
The Noisy Oracle Problem. CRYPTO 1988: 284-296 - 1987
- [c1]Uriel Feige, Amos Fiat, Adi Shamir:
Zero Knowledge Proofs of Identity. STOC 1987: 210-217
Parts in Books or Collections
- 2020
- [p1]Uriel Feige:
Introduction to Semirandom Models. Beyond the Worst-Case Analysis of Algorithms 2020: 189-211
Editorship
- 2023
- [e2]Kousha Etessami, Uriel Feige, Gabriele Puppis:
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. LIPIcs 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-278-5 [contents] - 2007
- [e1]David S. Johnson, Uriel Feige:
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. ACM 2007, ISBN 978-1-59593-631-8 [contents]
Informal and Other Publications
- 2025
- [i62]Uriel Feige, Shengyu Huang:
Concentration and maximin fair allocations for subadditive valuations. CoRR abs/2502.13541 (2025) - [i61]Uriel Feige, Vadim Grinberg:
Fair allocations with subadditive and XOS valuations. CoRR abs/2503.10513 (2025) - 2024
- [i60]Moshe Babaioff, Uriel Feige:
Share-Based Fairness for Arbitrary Entitlements. CoRR abs/2405.14575 (2024) - [i59]Uriel Feige:
Low communication protocols for fair allocation of indivisible goods. CoRR abs/2407.07641 (2024) - 2023
- [i58]Gilad Ben Uziahu, Uriel Feige:
On Fair Allocation of Indivisible Goods to Submodular Agents. CoRR abs/2303.12444 (2023) - [i57]Uriel Feige:
The inversion paradox, and classification of fairness notions. CoRR abs/2311.16770 (2023) - 2022
- [i56]Uriel Feige, Yehonatan Tahan:
On allocations that give intersecting groups their fair share. CoRR abs/2204.06820 (2022) - [i55]Uriel Feige, Alexey Norkin:
Improved maximin fair allocation of indivisible items to three agents. CoRR abs/2205.05363 (2022) - [i54]Moshe Babaioff, Uriel Feige:
Fair Shares: Feasibility, Domination and Incentives. CoRR abs/2205.07519 (2022) - [i53]Uriel Feige, Xin Huang:
On picking sequences for chores. CoRR abs/2211.13951 (2022) - 2021
- [i52]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Best-of-Both-Worlds Fair-Share Allocations. CoRR abs/2102.04909 (2021) - [i51]Shahar Dobzinski, Uriel Feige, Michal Feldman:
Are Gross Substitutes a Substitute for Submodular Valuations? CoRR abs/2102.13343 (2021) - [i50]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair-Share Allocations for Agents with Arbitrary Entitlements. CoRR abs/2103.04304 (2021) - [i49]Uriel Feige, Ariel Sapir, Laliv Tauber:
A tight negative example for MMS fair allocations. CoRR abs/2104.04977 (2021) - [i48]Uriel Feige, Tom Ferster:
A tight bound for the clique query problem in two rounds. CoRR abs/2112.06072 (2021) - 2020
- [i47]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair and Truthful Mechanisms for Dichotomous Valuations. CoRR abs/2002.10704 (2020) - [i46]Uriel Feige, Vadim Grinberg:
How to hide a clique? CoRR abs/2004.12258 (2020) - [i45]Uriel Feige, Amir Lellouche:
Quantitative Group Testing and the rank of random matrices. CoRR abs/2006.09074 (2020) - 2019
- [i44]Uriel Feige:
A randomized strategy in the mirror game. CoRR abs/1901.07809 (2019) - [i43]Uriel Feige, Shimon Kogan:
Target Set Selection for Conservative Populations. CoRR abs/1909.03422 (2019) - [i42]Moshe Babaioff, Uriel Feige:
A New Approach to Fair Distribution of Welfare. CoRR abs/1909.11346 (2019) - [i41]Uriel Feige, Ella Fuchs:
On the path partition number of 6-regular graphs. CoRR abs/1911.08397 (2019) - 2018
- [i40]Alon Eden, Uriel Feige, Michal Feldman:
Max-Min Greedy Matching. CoRR abs/1803.05501 (2018) - [i39]Uriel Feige, Janardhan Kulkarni, Shi Li:
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. CoRR abs/1807.09885 (2018) - [i38]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - [i37]Uriel Feige:
Tighter bounds for online bipartite matching. CoRR abs/1812.11774 (2018) - 2017
- [i36]Uriel Feige, Boaz Patt-Shamir, Shai Vardi:
On the Probe Complexity of Local Computation Algorithms. CoRR abs/1703.07734 (2017) - 2016
- [i35]Roee David, Uriel Feige:
On the effect of randomness on planted 3-coloring models. CoRR abs/1603.05183 (2016) - [i34]Roee David, Uriel Feige:
Random walks with the minimum degree local rule have $O(n^2)$ cover time. CoRR abs/1604.08326 (2016) - [i33]Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun Assembly of Random Jigsaw Puzzles. CoRR abs/1605.03086 (2016) - [i32]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate Modularity Revisited. CoRR abs/1612.02034 (2016) - 2014
- [i31]Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. CoRR abs/1401.6681 (2014) - [i30]Uriel Feige:
On robustly asymmetric graphs. CoRR abs/1402.1047 (2014) - [i29]Uriel Feige:
Why are images smooth? CoRR abs/1406.5035 (2014) - [i28]Uriel Feige, Tomer Koren, Moshe Tennenholtz:
Chasing Ghosts: Competing with Stateful Policies. CoRR abs/1407.7635 (2014) - [i27]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. CoRR abs/1408.1211 (2014) - [i26]Uriel Feige:
NP-hardness of hypercube 2-segmentation. CoRR abs/1411.0821 (2014) - [i25]Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, Vasilis Syrgkanis:
A Unifying Hierarchy of Valuations with Complements and Substitutes. Electron. Colloquium Comput. Complex. TR14 (2014) - [i24]Uriel Feige, Shlomo Jozeph:
Separation between Estimation and Approximation. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i23]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. CoRR abs/1306.2465 (2013) - [i22]Uriel Feige, Rani Izsak:
Welfare Maximization and the Supermodular Degree. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i21]Uriel Feige, Shlomo Jozeph:
Universal Factor Graphs. CoRR abs/1204.6484 (2012) - [i20]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical chairs. CoRR abs/1208.0813 (2012) - 2011
- [i19]Uriel Feige, Moshe Tennenholtz:
Mechanism design with uncertain inputs (to err is human, to forgive divine). CoRR abs/1103.2520 (2011) - [i18]Uriel Feige, Daniel Reichman:
Recoverable Values for Independent Sets. CoRR abs/1103.5609 (2011) - [i17]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. CoRR abs/1106.2065 (2011) - [i16]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - [i15]Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports 1(6): 24-53 (2011) - 2010
- [i14]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph. CoRR abs/1001.2891 (2010) - [i13]Uriel Feige, Inbal Talgam-Cohen:
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. CoRR abs/1007.3886 (2010) - [i12]Uriel Feige, Shlomo Jozeph:
Oblivious Algorithms for the Maximum Directed Cut Problem. CoRR abs/1010.0406 (2010) - 2009
- [i11]Reid Andersen, Uriel Feige:
Interchanging distance and capacity in probabilistic mappings. CoRR abs/0907.3631 (2009) - [i10]Uriel Feige, Ofer Zeitouni:
Deterministic approximation for the cover time of trees. CoRR abs/0909.2005 (2009) - [i9]Uriel Feige:
Faster FAST(Feedback Arc Set in Tournaments). CoRR abs/0911.5094 (2009) - 2007
- [i8]Uriel Feige, Guy Kindler, Ryan O'Donnell:
Understanding Parallel Repetition Requires Understanding Foams. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i7]Uriel Feige, Eran Ofek:
Random 3CNF formulas elude the Lovasz theta function. CoRR abs/cs/0603084 (2006) - [i6]Eran Ofek, Uriel Feige:
Random 3CNF formulas elude the Lovasz theta function. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i5]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i4]Uriel Feige, Daniel Reichman:
On The Hardness of Approximating Max-Satisfy. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [i3]Uriel Feige:
Approximation thresholds for combinatorial optimization problems. CoRR cs.CC/0304039 (2003) - 2000
- [i2]Uriel Feige, Marek Karpinski, Michael Langberg:
Improved Approximation of MAX-CUT on Graphs of Bounded Degree. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Uriel Feige, Marek Karpinski, Michael Langberg:
A Note on Approximating MAX-BISECTION on Regular Graphs. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
