( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Space Complexity of Reachability Testing in Labelled Graphs.

, , и . LATA, том 10168 из Lecture Notes in Computer Science, стр. 351-363. (2017)

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

 

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

Evaluating Monotone Circuits on Cylinders, Planes and Tori., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 660-671. Springer, (2006)New Bounds for Energy Complexity of Boolean Functions., , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 738-750. Springer, (2018)Space complexity of reachability testing in labelled graphs., , и . J. Comput. Syst. Sci., (2019)Sensitivity, Affine Transforms and Quantum Communication Complexity., и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 140-152. Springer, (2019)On Isomorphism Testing of Groups with Normal Hall Subgroups., , и . STACS, том 9 из LIPIcs, стр. 567-578. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)On the Complexity of L-reachability., , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2014)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , и . CoRR, (2016)On the Complexity of L-reachability., , и . CoRR, (2017)Min/Max-Poly Weighting Schemes and the NL versus UL Problem., , и . TOCT, 9 (2): 10:1-10:25 (2017)Upper Bounds for Monotone Planar Circuit Value and Variants., , и . Comput. Complex., 18 (3): 377-412 (2009)