default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMakoto Sakuta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j8]Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Jos W. H. M. Uiterwijk
, Hiroyuki Iida:
Application of the killer-tree heuristic and the lambda-search method to lines of action. Inf. Sci. 154(3-4): 141-155 (2003)- [j7]Makoto Sakuta, Iwao Sasase:
Approximate analysis of MAC protocol with multiple self-tokens in a slotted ring. J. Commun. Networks 5(3): 249-257 (2003) - 2002
- [j6]Hiroyuki Iida, Makoto Sakuta, Jeff Rollason:
Computer shogi. Artif. Intell. 134(1-2): 121-144 (2002) - [c6]Masanori Iizuka, Makoto Sakuta, Yoshiyuki Nishino, Iwao Sasase:
A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network. GLOBECOM 2002: 2736-2740 - [c5]Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Hiroyuki Iida:
Endgame Search Techniques Developed in Shogi: Application to Lines of Action. JCIS 2002: 458-460 - 2001
- [j5]Makoto Sakuta, Hiroyuki Iida:
AND/OR-Tree Search Algorithms in Shogi Mating Search. J. Int. Comput. Games Assoc. 24(4): 231-235 (2001) - [j4]Makoto Sakuta, Yoshiyuki Nishino, Iwao Sasase:
Contention-based reservation protocol using a counter for detecting a source conflict in WDM single-hop optical network with non-equivalent distance. J. Commun. Networks 3(4): 365-373 (2001) - [c4]Tsutomu Kitamura, Masanori Iizuka, Makoto Sakuta, Yoshiyuki Nishino, Iwao Sasase:
A new partition scheduling algorithm by prioritizing the transmission of multicast packets with less destination address overlap in WDM single-hop networks. GLOBECOM 2001: 1469-1473 - [c3]Makoto Sakuta, Yoshiyuki Nishino, Iwao Sasase:
Channel reservation protocol using a counter for detecting a source conflict in WDM single-hop optical network with non-equivalent distance. ICC 2001: 707-711 - 2000
- [j3]Makoto Sakuta, Hiroyuki Iida:
Solving Kriegspiel-like Problems: Exploiting a Transposition Table. J. Int. Comput. Games Assoc. 23(4): 218-229 (2000) - [c2]Makoto Sakuta, Hiroyuki Iida:
Solving Kriegspiel-Like Problems: Examining Efficient Search Methods. Computers and Games 2000: 55-73 - [c1]Masanori Iizuka, Makoto Sakuta, Yoshwuki Nishino, Iwao Sasase:
Performance evaluation of a wavelength assignment algorithm in WDM single-hop network with transceiver tuning latencies. GLOBECOM 2000: 1254-1258
1990 – 1999
- 1999
- [j2]Makoto Sakuta, Hiroyuki Iida:
Report on the 9th CSA World Computer-Shogi Championship. J. Int. Comput. Games Assoc. 22(3): 180-182 (1999) - [j1]Makoto Sakuta, Hiroyuki Iida:
Report on the First International Shogi Forum. J. Int. Comput. Games Assoc. 22(3): 183-185 (1999)
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 05:50 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:
