Author of the publication

A Note on the Hardness of Tree Isomorphism.

, , and . Computational Complexity Conference, page 101-105. IEEE Computer Society, (1998)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Circuits, Matrices, and Nonassociative Computation., and . J. Comput. Syst. Sci., 50 (3): 441-455 (1995)Parallel Algorithms for Solvable Permutation Groups., and . J. Comput. Syst. Sci., 37 (1): 39-62 (1988)Permutations of Bounded Degree Generate Groups of Polynomial Diameter.. Inf. Process. Lett., 19 (5): 253-254 (1984)Special Issue on Circuit Complexity: Foreword., and . Computational Complexity, (1994)Separation of the Monotone NC Hierarchy., and . FOCS, page 234-243. IEEE Computer Society, (1997)The Descriptive Complexity Approach to LOGCFL., , , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 444-454. Springer, (1999)Worst Case Nonzero-Error Interactive Communication., , and . IEEE Trans. Information Theory, 54 (7): 2857-2867 (2008)On the Expressiveness of Parikh Automata and Related Models., , and . NCMA, volume 282 of books@ocg.at, page 103-119. Austrian Computer Society, (2011)On Generalized Addition Chains., and . CoRR, (2016)Storming the Parikh Automaton, , and . CoRR, (2011)