( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs.

, , , и . Proc. VLDB Endow., 15 (11): 3263-3276 (2022)

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.

Oded Green

Oded Maron

Oded Friedmann

Oded Löwenbein

Oded Krebs

 

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

Two-phase algorithms for the parametric shortest path problem, , и . CoRR, (2010)Testing Formula Satisfaction., , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 376-387. Springer, (2012)Improving and Extending the Testing of Distributions for Shape-Restricted Properties., , и . STACS, том 66 из LIPIcs, стр. 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability., , и . FOCS, стр. 1163-1182. IEEE Computer Society, (2015)Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs., и . CoRR, (2016)Improved competitive ratio for the matroid secretary problem., и . SODA, стр. 1702-1712. SIAM, (2012)Testing st -Connectivity., , , , и . APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 380-394. Springer, (2007)Space Complexity vs. Query Complexity., , и . APPROX-RANDOM, том 4110 из Lecture Notes in Computer Science, стр. 426-437. Springer, (2006)O(log log Rank) Competitive Ratio for the Matroid Secretary Problem.. FOCS, стр. 326-335. IEEE Computer Society, (2014)Testing Periodicity., и . Algorithmica, 60 (2): 401-420 (2011)