Author of the publication

Reversible Pebble Game on Trees.

, , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 83-94. Springer, (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. 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

New Bounds for Energy Complexity of Boolean Functions., , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 738-750. Springer, (2018)On the Complexity of L-reachability., , and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 258-269. Springer, (2014)On Isomorphism Testing of Groups with Normal Hall Subgroups., , and . STACS, volume 9 of LIPIcs, page 567-578. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Space complexity of reachability testing in labelled graphs., , and . J. Comput. Syst. Sci., (2019)Sensitivity, Affine Transforms and Quantum Communication Complexity., and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 140-152. Springer, (2019)Evaluating Monotone Circuits on Cylinders, Planes and Tori., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 660-671. Springer, (2006)On the Complexity of Matroid Isomorphism Problem., and . Theory Comput. Syst., 49 (2): 246-272 (2011)Arithmetic Circuit Lower Bounds via MaxRank., , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 661-672. Springer, (2013)Using Elimination Theory to construct Rigid Matrices., , , and . FSTTCS, volume 4 of LIPIcs, page 299-310. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)On the Complexity of Rank and Rigidity., and . Electron. Colloquium Comput. Complex., (2006)