( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum overhang.

, , , , и . SODA, стр. 756-765. SIAM, (2008)

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.

Uri Oz

Uri Iurgel

Uri Zilbersheid

Uri Schachtel

Katrin Uri

 

Другие публикации лиц с тем же именем

Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.. SODA, стр. 201-210. ACM/SIAM, (1998)Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems., и . SODA, стр. 438-447. ACM/SIAM, (1996)Connection caching under vaious models of communication., , и . SPAA, стр. 54-63. ACM, (2000)MAX CUT in cubic graphs., , и . SODA, стр. 506-513. ACM/SIAM, (2002)Maximum overhang., , , , и . SODA, стр. 756-765. SIAM, (2008)On Dynamic Shortest Paths Problems., и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 580-591. Springer, (2004)Connection Caching., , и . STOC, стр. 612-621. ACM, (1999)Approximate distance oracles., и . STOC, стр. 183-192. ACM, (2001)A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.. ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 921-932. Springer, (2004)Union-Find with Constant Time Deletions., , , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 78-89. Springer, (2005)