( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fine-Grained Completeness for Optimization in P.

, , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 9:1-9:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Nick Fandrich

Zur Charakterisierung von amphiphilen Blockcopolymeren aus N-Vinylpyrrolidon und Vinylacetat. Uni Potsdam, (2009)

Nick Bretschneider

Nick Bretl

Gerhard Nick

Gernot Nick

 

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

Dynamic Dynamic Time Warping., , , , , и . CoRR, (2023)Can You Solve Closest String Faster Than Exhaustive Search?, , , , и . ESA, том 274 из LIPIcs, стр. 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!, , и . FOCS, стр. 515-538. IEEE, (2023)The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties., , и . SODA, стр. 4704-4727. SIAM, (2024)Faster Sublinear-Time Edit Distance., , , и . SODA, стр. 3274-3301. SIAM, (2024)Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics., , и . STOC, стр. 391-404. ACM, (2023)Faster Combinatorial k-Clique Algorithms., , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 193-206. Springer, (2024)Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics., , и . CoRR, (2022)Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours., и . J. Log. Algebraic Methods Program., (2019)A Structural Investigation of the Approximability of Polynomial-Time Problems., , , и . ICALP, том 229 из LIPIcs, стр. 30:1-30:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)