( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reversible Pebble Game on Trees.

, , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 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.

Sarma Siahaan

Nima Sarmadi

Srikrishna Sarma

Pranab Kumar Sarma

Santanu Sarma

 

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

Sensitivity, Affine Transforms and Quantum Communication Complexity., и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 140-152. Springer, (2019)Space complexity of reachability testing in labelled graphs., , и . J. Comput. Syst. Sci., (2019)Evaluating Monotone Circuits on Cylinders, Planes and Tori., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 660-671. Springer, (2006)On the Complexity of L-reachability., , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2014)On Isomorphism Testing of Groups with Normal Hall Subgroups., , и . STACS, том 9 из LIPIcs, стр. 567-578. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)New Bounds for Energy Complexity of Boolean Functions., , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 738-750. Springer, (2018)On the Complexity of Matroid Isomorphism Problem., и . Theory Comput. Syst., 49 (2): 246-272 (2011)On the Complexity of Rank and Rigidity., и . Electron. Colloquium Comput. Complex., (2006)On Directed Tree Realizations of Degree Sets., , и . WALCOM, том 7748 из Lecture Notes in Computer Science, стр. 274-285. Springer, (2013)Arithmetic Circuit Lower Bounds via MaxRank., , и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 661-672. Springer, (2013)