( 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 . FOCS, page 2-12. IEEE Computer Society, (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

Shotgun Assembly of Random Jigsaw Puzzles., , and . CoRR, (2016)Random 3CNF formulas elude the Lovasz theta function, and . CoRR, (2006)Networks on Which Hot-Potato Routing Does Not Livelock., and . Distributed Comput., 13 (1): 53-58 (2000)Approximating Clique is Almost NP-Complete (Preliminary Version), , , , and . Proc. 32th FOCS, page 2--12. (1991)Trust-based recommendation systems: an axiomatic approach., , , , , , , and . WWW, page 199-208. ACM, (2008)On Expected Polynomial Time Simulation of Zero Knowledge Protocols., and . Distributed Computing And Cryptography, volume 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 155-160. DIMACS/AMS, (1989)Zero Knowledge and the Chromatic Number., and . CCC, page 278-287. IEEE Computer Society, (1996)Relations between Average Case Complexity and Approximation Complexity.. CCC, page 5. IEEE Computer Society, (2002)Multi-Oracle Interactive Protocols with Space Bounded Verifiers., and . SCT, page 158-164. IEEE Computer Society, (1989)Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems., , and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 339-350. Springer, (2006)