( en | de | ru )

 

Disambiguation of "Feige, Uriel"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Clique is Almost NP-Complete (Preliminary Version)

, , , , and . Proc. 32th FOCS, page 2--12. (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Assaf Urieli

Uriel Dann

Uriel Gast

Katharina Feige

Molecular ecological analysis of methanogenic communities in terrestrial and submarine permafrost deposits of Siberian Laptev Sea area. Uni Potsdam, (2009)

Uriel Mora Zabala

 

Other publications of authors with the same name

Finding OR in a noisy broadcast network., and . Inf. Process. Lett., 73 (1-2): 69-75 (2000)On the Hardness of Computing the Permanent of Random Matrices., and . Comput. Complex., 6 (2): 101-132 (1997)The Noisy Oracle Problem., , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 284-296. Springer, (1988)A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time., , and . SODA, page 1585-1595. SIAM, (2019)Contagious Sets in Expanders., , , and . SODA, page 1953-1987. SIAM, (2015)How to Hide a Clique?, and . ICALP, volume 168 of LIPIcs, page 44:1-44:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Tight Negative Example for MMS Fair Allocations., , and . WINE, volume 13112 of Lecture Notes in Computer Science, page 355-372. Springer, (2021)On Best-of-Both-Worlds Fair-Share Allocations., , and . WINE, volume 13778 of Lecture Notes in Computer Science, page 237-255. Springer, (2022)Interactive Proofs and the Hardness of Approximating Cliques., , , , and . J. ACM, 43 (2): 268-292 (1996)The Submodular Welfare Problem with Demand Queries., and . Theory of Computing, 6 (1): 247-290 (2010)