![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Takayuki Sakai
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Takayuki Sakai, Kensuke Inai, Kenji Kutsuna, Bishnu Kumar Adhikary, Norbert Buzás:
Technology transfer performance: a comparative analysis of two universities in Japan. Int. J. Technol. Manag. 90(1/2): 78-101 (2022)
2010 – 2019
- 2019
- [j4]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki, Junichi Teruyama:
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. J. Comput. Syst. Sci. 105: 87-103 (2019) - 2017
- [j3]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki, Junichi Teruyama:
Improved exact algorithms for mildly sparse instances of Max SAT. Theor. Comput. Sci. 697: 58-68 (2017) - 2016
- [c5]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. MFCS 2016: 82:1-82:16 - [i2]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j2]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Theory Comput. Syst. 57(2): 426-443 (2015) - [c4]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC 2015: 90-101 - [i1]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Takayuki Sakai, Kazuhisa Seto
, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. SAT 2014: 32-47
2000 – 2009
- 2000
- [c2]Minh Anh Thi Ho, Yoji Yamada, Takayuki Sakai, Tetsuya Morizono, Yoji Umetani:
An Adaptive Vision-based Interactional Intention Inference System in Human / Robot Coexistence. MVA 2000: 223-226
1990 – 1999
- 1999
- [c1]Yoji Yamada, Yoji Umetani, Haruyoshi Daitoh, Takayuki Sakai:
Construction of a human/robot coexistence system based on a model of human will-intention and desire. ICRA 1999: 2861-2873 - 1998
- [j1]Yoji Yamada, Haruyoshi Daitoh, Yasuhiro Hirasawa, Takayuki Sakai, Yoji Umetani:
Human-will-oriented techniques constructed for cooperative motions between a human and a power assisting robot. Adv. Robotics 13(3): 229-230 (1998)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint