PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Feige, Uriel"

Author of the publication

copydeleteadd this publication to your clipboard
Derandomized Graph Products.

, , , and . Computational Complexity, 5 (1): 60-75 (1995)

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.

No persons found for author name Feige, Uriel
add a person with the name Feige, Uriel
 

Other publications of authors with the same name

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees., , and . Algorithmica, 57 (3): 517-537 (2010)Balanced coloring of bipartite graphs., and . Journal of Graph Theory, 64 (4): 277-291 (2010)A Tight Upper Bound on the Cover Time for Random Walks on Graphs.. Random Struct. Algorithms, 6 (1): 51-54 (1995)Finding OR in a noisy broadcast network., and . Inf. Process. Lett., 73 (1-2): 69-75 (2000)A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity.. J. Comput. Syst. Sci., 54 (2): 305-316 (1997)Heuristics for Semirandom Graph Problems., and . J. Comput. Syst. Sci., 63 (4): 639-671 (2001)Multi-Oracle Interactive Protocols with Constant Space Verifiers., and . J. Comput. Syst. Sci., 44 (2): 259-271 (1992)Musical Chairs., , , , , and . SIAM J. Discrete Math., 28 (3): 1578-1600 (2014)On the Hardness of Computing the Permanent of Random Matrices., and . Computational Complexity, 6 (2): 101-132 (1997)On the cost of recomputing: Tight bounds on pebbling with faults., , and . Theor. Comput. Sci., 233 (1-2): 247-261 (2000)