( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster.

, , , и . CoRR, (2015)

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.

Thomas Seth

Seth Nzahumunyurwa

Deep Seth

Martin Seth

Sebastian Seth

 

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

Degrees of nonlinearity in forbidden 0-1 matrix problems.. Discret. Math., 311 (21): 2396-2410 (2011)Sources of Superlinearity in Davenport-Schinzel Sequences.. Data Structures, том 08081 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2008)Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time., , , и . SODA, стр. 510-520. SIAM, (2017)Simple Contention Resolution via Multiplicative Weight Updates., , и . SOSA, том 69 из OASIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Higher Lower Bounds from the 3SUM Conjecture., , и . SODA, стр. 1272-1287. SIAM, (2016)Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms., и . SODA, стр. 713-722. ACM/SIAM, (2002)Bounded-leg distance and reachability oracles., и . SODA, стр. 436-445. SIAM, (2008)Deterministic Worst Case Dynamic Connectivity: Simpler and Faster., , , и . CoRR, (2015)Three Generalizations of Davenport-Schinzel Sequences.. CoRR, (2014)An optimal minimum spanning tree algorithm., и . J. ACM, 49 (1): 16-34 (2002)