default search action
Kazuo Nakajima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j21]Mitsuru Tomono, Masaki Nakanishi, Shigeru Yamashita, Kazuo Nakajima, Katsumasa Watanabe:
An Efficient and Effective Algorithm for Online Task Placement with I/O Communications in Partially Reconfigurable FPGAs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(12): 3416-3426 (2006) - [c12]Mitsuru Tomono, Masaki Nakanishi, Shigeru Yamashita, Kazuo Nakajima, Katsumasa Watanabe:
A New Approach to Online FPGA Placement. CISS 2006: 145-150 - 2003
- [j20]Gary Spivey, Shuvra S. Bhattacharyya, Kazuo Nakajima:
Logic Foundry: Rapid Prototyping for FPGA-Based DSP Systems. EURASIP J. Adv. Signal Process. 2003(6): 565-579 (2003) - [c11]Gary Spivey, Shuvra S. Bhattacharyya, Kazuo Nakajima:
Logic foundry: rapid prototyping of FPGA-based DSP systems. ASP-DAC 2003: 374-381 - [c10]Kazuo Nakajima, Brian Schott, Tokinori Kozawa, Jose L. Muñoz, Wolfgang Rosenstiel, Sakae Takahashi, Chen-Wen Wu:
Roles of funding agencies in technology-driven economic development. ASP-DAC 2003: 547 - [e1]Mircea R. Stan, David Garrett, Kazuo Nakajima:
Proceedings of the 13th ACM Great Lakes Symposium on VLSI 2003, Washington, DC, USA, April 28-29, 2003. ACM 2003, ISBN 1-58113-677-3 [contents] - 2002
- [c9]Gary Spivey, Shuvra S. Bhattacharyya, Kazuo Nakajima:
A Component Architecture for FPGA-Based, DSP System Design. ASAP 2002: 41- - 2000
- [c8]Kazuo Aoyama, Hiroshi Sawada, Akira Nagoya, Kazuo Nakajima:
A Threshold Logic-Based Reconfigurable Logic Element with a New Programming Technology. FPL 2000: 665-674
1990 – 1999
- 1999
- [j19]Jagannathan Narasimhan, Kazuo Nakajima, Chong S. Rim:
A Graph Theoretical Approach for the Yield Enhancement of Reconfigurable VLSI/WSI Arrays. Discret. Appl. Math. 90(1-3): 195-221 (1999) - [j18]Young-Jun Cha, Chong S. Rim, Kazuo Nakajima:
SEGRA: a very fast general area router for multichip modules. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(5): 659-665 (1999) - [c7]Kazuyoshi Tsutsumi, Kazuo Nakajima:
Maximum/minimum detection by a module-based neural network with redundant architecture. IJCNN 1999: 558-561 - 1997
- [c6]Young-Jun Cha, Chong S. Rim, Kazuo Nakajima:
A simple and effective greedy multilayer router for MCMs. ISPD 1997: 67-72 - 1995
- [j17]Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato:
Min-cut placement with global objective functions for large scale sea-of-gates arrays. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(4): 434-446 (1995) - 1994
- [j16]Masayuki Terai, Kazuo Nakajima, Kazuhiro Takahashi, Koji Sato:
A new approach to over-the-cell channel routing with three layers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(2): 187-200 (1994) - [j15]Jagannathan Narasimham, Kazuo Nakajima, Chong S. Rim, Anton T. Dahbura:
Yield enhancement of programmable ASIC arrays by reconfiguration of circuit placements. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(8): 976-986 (1994) - [c5]Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato:
Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays. ICCAD 1994: 428-431 - 1993
- [c4]Jagannathan Narasimhan, Kazuo Nakajima:
A Reconfiguration-Based Yield Enhancement System. ICCD 1993: 224-228 - 1992
- [j14]Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph. J. Algorithms 13(1): 161-174 (1992) - [j13]Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda:
General Circular Permutation Layout. Math. Syst. Theory 25(4): 269-292 (1992) - [j12]Hirokazu Kotani, Akira Kawamura, Asako Takahashi, Masako Nakatsuji, Nobutsugu Hiraoka, Kazuo Nakajima, Mituru Takanami:
Site-specific dissection of E. coli chromosome by lambda terminase. Nucleic Acids Res. 20(13): 3357-3360 (1992) - 1991
- [j11]Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Polynomial time algorithms on circular-arc overlap graphs. Networks 21(2): 195-203 (1991) - [c3]Masayuki Terai, Kazuhiro Takahashi, Kazuo Nakajima, Koji Sato:
A New Model for Over-The-Cell Channel Routing with Three Layers. ICCAD 1991: 432-435 - 1990
- [j10]Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa:
Efficient algorithms for finding maximum cliques of an overlap graph. Networks 20(2): 157-171 (1990) - [j9]Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa:
Crossing Minimization in Linear Embeddings of Graphs. IEEE Trans. Computers 39(1): 124-127 (1990) - [c2]Po-Yang F. Lin, Kazuo Nakajima:
A linear time algorithm for optimal CMOS functional cell layouts. ICCD 1990: 449-453
1980 – 1989
- 1989
- [j8]Hyeong-Ah Choi, Kazuo Nakajima, Chong S. Rim:
Graph Bipartization and via Minimization. SIAM J. Discret. Math. 2(1): 38-47 (1989) - [j7]Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
The Via Minimization Problem is NP-Complete. IEEE Trans. Computers 38(11): 1604-1608 (1989) - [j6]Chong S. Rim, Toshinobu Kashiwabara, Kazuo Nakajima:
Exact algorithms for multilayer topological via minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(11): 1165-1173 (1989) - 1988
- [j5]Sumio Masuda, Kazuo Nakajima:
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph. SIAM J. Comput. 17(1): 41-52 (1988) - 1987
- [c1]Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
Via Minimization for Gridless Layouts. DAC 1987: 159-165 - 1986
- [j4]Jagannathan Narasimhan, Kazuo Nakajima:
An Algorithm for Determining the Fault Diagnosability of a System. IEEE Trans. Computers 35(11): 1004-1008 (1986) - 1984
- [j3]S. Louis Hakimi, Kazuo Nakajima:
On Adaptive System Diagnosis. IEEE Trans. Computers 33(3): 234-240 (1984) - 1982
- [j2]Kazuo Nakajima, S. Louis Hakimi:
Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3(4): 344-361 (1982) - 1980
- [j1]Hideo Yabe, Yoshisuke Shimizu, Chikara Iwata, Kazuo Nakajima:
Traffic Assistance Service System for ESS. IEEE Trans. Commun. 28(1): 117-122 (1980)
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-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint