Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtsuki Nagao
Person information
- affiliation: University of Electro-Communications, Chofu, Department of Information and Communication Engineering, Japan
- affiliation: Kyoto University, Graduate School of Informatics, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Atsuki Nagao:
Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems. Kyoto University, Japan, 2015
Journal Articles
- 2022
- [j8]Tomu Makita, Atsuki Nagao
, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama:
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1298-1308 (2022) - 2020
- [j7]Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi:
K3 Edge Cover Problem in a Wide Sense. J. Inf. Process. 28: 849-858 (2020) - [j6]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory Comput. Syst. 64(8): 1392-1407 (2020) - 2019
- [j5]Hiro Ito, Atsuki Nagao, Teagun Park:
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1126-1133 (2019) - [j4]Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. ACM Trans. Comput. Theory 11(1): 5:1-5:12 (2019) - 2018
- [j3]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. Algorithmica 80(10): 2725-2741 (2018) - 2017
- [j2]Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25: 667-677 (2017) - 2015
- [j1]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. IEICE Trans. Inf. Syst. 98-D(10): 1736-1743 (2015)
Conference and Workshop Papers
- 2021
- [c8]Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone:
Card-Based ZKP Protocols for Takuzu and Juosan. FUN 2021: 20:1-20:21 - 2019
- [c7]Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa:
Light Cryptography. World Conference on Information Security Education 2019: 89-101 - 2018
- [c6]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone:
Physical Zero-Knowledge Proof for Makaro. SSS 2018: 111-125 - 2017
- [c5]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC 2017: 58:1-58:10 - 2016
- [c4]Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW 2016: 215-226 - 2015
- [c3]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. WADS 2015: 554-565 - 2014
- [c2]Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. STACS 2014: 409-420 - [c1]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. WALCOM 2014: 225-236
Informal and Other Publications
- 2020
- [i1]Naoki Matsumoto, Atsuki Nagao:
Feedback game on Eulerian graphs. CoRR abs/2002.09570 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
