( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Segment Folding is Hard.

, , , , , и . CoRR, (2020)

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.

Katsuhisa Shibuya

Yukio Yamanaka

Nobuyuki Yamanaka

Yuri Yamanaka

 

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

Efficient enumeration of ordered trees with k leaves., , и . Theor. Comput. Sci., (2012)A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs., , и . FAW, том 12340 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2020)Floorplans with Walls., и . TAMC, том 12337 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2020)Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , и . CoRR, (2014)The Complexity of Induced Tree Reconfiguration Problems., , и . LATA, том 9618 из Lecture Notes in Computer Science, стр. 330-342. Springer, (2016)Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits., , , и . ISMVL, стр. 153-157. IEEE, (2023)Competitive Diffusion on Weighted Graphs., , , , , , , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 422-433. Springer, (2015)Sorting Balls and Water: Equivalence and Computational Complexity., , , , , , , , , и . FUN, том 226 из LIPIcs, стр. 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Improved Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits., , и . ISMVL, стр. 120-125. IEEE, (2024)Listing All Plane Graphs., и . WALCOM, том 4921 из Lecture Notes in Computer Science, стр. 210-221. Springer, (2008)