( en | de | ru )

 

Disambiguation of "Zwick, Uri"

Author of the publication

copydeleteadd this publication to your clipboard
On Dynamic Shortest Paths Problems.

, and . ESA, volume 3221 of Lecture Notes in Computer Science, page 580-591. Springer, (2004)

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.

Uri Iurgel

Uri Oz

Uri Zilbersheid

Katrin Uri

Uri Schachtel

 

Other publications of authors with the same name

Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems., and . SODA, page 438-447. ACM/SIAM, (1996)Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.. SODA, page 201-210. ACM/SIAM, (1998)Discounted deterministic Markov decision processes and discounted all-pairs shortest paths., , and . ACM Trans. Algorithms, 6 (2): 33:1-33:25 (2010)Union-Find with Constant Time Deletions., , , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 78-89. Springer, (2005)A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths.. ISAAC, volume 3341 of Lecture Notes in Computer Science, page 921-932. Springer, (2004)An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract)., and . SPAA, page 1-10. ACM, (1994)Connection caching under vaious models of communication., , and . SPAA, page 54-63. ACM, (2000)On Dynamic Shortest Paths Problems., and . ESA, volume 3221 of Lecture Notes in Computer Science, page 580-591. Springer, (2004)Semidefinite Programming Based Approximation Algorithms.. FSTTCS, volume 2245 of Lecture Notes in Computer Science, page 57. Springer, (2001)Soft Heaps Simplified., , and . SIAM J. Comput., 42 (4): 1660-1673 (2013)