default search action
Takashi Hirayama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani:
New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. IEICE Trans. Inf. Syst. 107(8): 940-948 (2024) - [c10]Takashi Hirayama, Ryo Endo, Katsuhisa Yamanaka:
An Improved Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. ISMVL 2024: 120-125 - 2023
- [j10]Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno:
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1082-1091 (2023) - [c9]Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani:
Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. ISMVL 2023: 153-157 - 2022
- [j9]Taishu Ito, Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama:
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs. IEICE Trans. Inf. Syst. 105-D(3): 466-473 (2022) - 2020
- [c8]Yusuke Sano, Katsuhisa Yamanaka
, Takashi Hirayama:
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs. FAW 2020: 13-24
2010 – 2019
- 2019
- [j8]Katsuhisa Yamanaka, Shogo Kawaragi, Takashi Hirayama:
Exact Exponential Algorithm for Distance-3 Independent Set Problem. IEICE Trans. Inf. Syst. 102-D(3): 499-501 (2019) - 2018
- [j7]Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani:
Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2231-2243 (2018) - 2016
- [c7]Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani:
New Two-Qubit Gate Library with Entanglement. ISMVL 2016: 235-240 - 2014
- [j6]Takashi Hirayama, Hayato Sugawara, Katsuhisa Yamanaka, Yasuaki Nishitani:
A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. IEICE Trans. Inf. Syst. 97-D(9): 2253-2261 (2014) - 2011
- [c6]Takashi Hirayama, Yasuaki Nishitani, Seiji Kitamura:
A Testable Realization for Decimal Multipliers. ISMVL 2011: 248-253
2000 – 2009
- 2009
- [j5]Takashi Hirayama, Yasuaki Nishitani:
Exact Minimization of and-EXOR Expressions of Practical Benchmark Functions. J. Circuits Syst. Comput. 18(3): 465-486 (2009) - [c5]Takashi Hirayama:
Let's make a tennis game!: introduction to game programming. SIGGRAPH ASIA Courses 2009 - 2006
- [c4]Takashi Hirayama, Masatoshi Takahashi, Yasuaki Nishitani:
Simplification of Exclusive-or Sum-of-Products Expressions Through Function Transformation. APCCAS 2006: 1480-1483 - [c3]Takashi Hirayama, Yasuaki Nishitani:
Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions. DELTA 2006: 137-142 - 2004
- [j4]Ryoji Ishikawa, Takashi Hirayama, Goro Koda, Kensuke Shimizu:
New Three-Level Boolean Expression Based on EXOR Gates. IEICE Trans. Inf. Syst. 87-D(5): 1214-1222 (2004) - 2002
- [j3]Takashi Hirayama, Yasuaki Nishitani, Toru Sato:
A Faster Algorithm of Minimizing AND-EXOR Expressions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(12): 2708-2714 (2002) - [c2]Takashi Hirayama, Yasuaki Nishitani, Toru Sato:
A faster algorithm of minimizing AND-EXOR expressions. APCCAS (2) 2002: 293-298 - [c1]Ryoji Ishikawa, Tomonori Igarashi, Takashi Hirayama, Kensuke Shimizu:
Pseudocube-based expressions to enhance testability. APCCAS (2) 2002: 305-310
1990 – 1999
- 1999
- [j2]Ryoji Ishikawa, Goro Koda, Kensuke Shimizu, Takashi Hirayama:
Exor Decomposition with Common Variables and its Application to Multiple-Output Networks. J. Circuits Syst. Comput. 9(1-2): 83-97 (1999) - 1996
- [j1]Takashi Hirayama, Yasuaki Nishitani:
A simplification algorithm of and-exor expressions guaranteeing minimality for some class of logic functions. Syst. Comput. Jpn. 27(3): 18-25 (1996)
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 2025-01-04 03:07 CET 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: