( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Random-Edge Is Slower Than Random-Facet on Abstract Cubes.

, и . ICALP, том 55 из LIPIcs, стр. 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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 Iurgel

Uri Oz

Uri Zilbersheid

Katrin Uri

Uri Schachtel

 

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

Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems., и . SODA, стр. 438-447. ACM/SIAM, (1996)Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.. SODA, стр. 201-210. ACM/SIAM, (1998)Discounted deterministic Markov decision processes and discounted all-pairs shortest paths., , и . ACM Trans. Algorithms, 6 (2): 33:1-33:25 (2010)Union-Find with Constant Time Deletions., , , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 78-89. Springer, (2005)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)An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract)., и . SPAA, стр. 1-10. ACM, (1994)Connection caching under vaious models of communication., , и . SPAA, стр. 54-63. ACM, (2000)On Dynamic Shortest Paths Problems., и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 580-591. Springer, (2004)Semidefinite Programming Based Approximation Algorithms.. FSTTCS, том 2245 из Lecture Notes in Computer Science, стр. 57. Springer, (2001)Soft Heaps Simplified., , и . SIAM J. Comput., 42 (4): 1660-1673 (2013)