( en | de | ru )

 

Disambiguation of "Nagao, Atsuki"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Algorithms for Sorting k-Sets in Bins.

, , and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 225-236. Springer, (2014)

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.

No persons found for author name Nagao, Atsuki
add a person with the name Nagao, Atsuki
 

Other publications of authors with the same name

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , and . J. Inf. Process., (2017)Read-Once Branching Programs for Tree Evaluation Problems., and . STACS, volume 25 of LIPIcs, page 409-420. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 554-565. Springer, (2015)Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems.. Kyoto University, Japan, (2015)Light Cryptography., , , and . World Conference on Information Security Education, volume 557 of IFIP Advances in Information and Communication Technology, page 89-101. Springer, (2019)A Satisfiability Algorithm for Deterministic Width-2 Branching Programs., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1298-1308 (September 2022)Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs., , and . ISAAC, volume 92 of LIPIcs, page 58:1-58:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Feedback game on Eulerian graphs., and . CoRR, (2020)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . Algorithmica, 80 (10): 2725-2741 (2018)Card-Based ZKP Protocols for Takuzu and Juosan., , , , , , , and . FUN, volume 157 of LIPIcs, page 20:1-20:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)