( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Algorithms for Unique Games via Divide and Conquer.

, , , и . Electron. Colloquium Comput. Complex., (2010)

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.

Dieter Russell

Wolter Russell

Russell Kleckley

Russell Stinson

Emma Russell

 

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

Models of Greedy Algorithms for Graph Problems., и . Algorithmica, 54 (3): 269-317 (2009)Stabbing Planes., , , , , , и . Electron. Colloquium Comput. Complex., (2017)Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems.. RANDOM-APPROX, том 2129 из Lecture Notes in Computer Science, стр. 2-5. Springer, (2001)A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion., и . IACR Cryptology ePrint Archive, (1999)Decision trees and downward closures., и . SCT, стр. 29-38. IEEE Computer Society, (1988)Agnostic Learning from Tolerant Natural Proofs., , , и . APPROX-RANDOM, том 81 из LIPIcs, стр. 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Hard-Core Distributions for Somewhat Hard Problems.. FOCS, стр. 538-545. IEEE Computer Society, (1995)The Fine-Grained Complexity of Multi-Dimensional Ordering Properties., , , , , и . IPEC, том 214 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Completeness for First-order Properties on Sparse Structures with Algorithmic Applications., , , и . ACM Trans. Algorithms, 15 (2): 23:1-23:35 (2019)Toward a Model for Backtracking and Dynamic Programming., , , , , и . Comput. Complex., 20 (4): 679-740 (2011)