From post

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.

 

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

Isomorphism testing of Boolean functions computable by constant-depth circuits., и . Inf. Comput., (2014)Graph Isomorphism is in SPP., и . Inf. Comput., 204 (5): 835-852 (2006)The Complexity of Modular Graph Automorphism., , и . SIAM J. Comput., 30 (4): 1299-1320 (2000)On the Weisfeiler-Leman Dimension of Fractional Packing., , , и . LATA, том 12038 из Lecture Notes in Computer Science, стр. 357-368. Springer, (2020)Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids., , , и . CoRR, (2020)Some Sieving Algorithms for Lattice Problems., и . FSTTCS, том 2 из LIPIcs, стр. 25-36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)The Orbit Problem Is in the GapL Hierarchy., и . COCOON, том 5092 из Lecture Notes in Computer Science, стр. 160-169. Springer, (2008)On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach, , и . CoRR, (2007)Arithmetic Circuits, Monomial Algebras and Finite Automata., и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 78-89. Springer, (2009)The Remote Point Problem, Small Bias Space, and Expanding Generator Sets, и . CoRR, (2009)