Masaki Nakanishi

	2009
18		Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size CoRR abs/0908.2468: (2009)
17		Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita: Multi-Party Quantum Communication Complexity with Routed Messages. IEICE Transactions 92-D(2): 191-199 (2009)
	2008
16		Masaki Nakanishi: An FPGA Configuration Scheme for Bitstream Protection. ARC 2008: 326-331
15		Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita: Multi-party Quantum Communication Complexity with Routed Messages. COCOON 2008: 180-190
14		Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918
	2007
13		Shinya Hiramoto, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima: A Hardware SAT Solver Using Non-chronological Backtracking and Clause Recording Without Overheads. ARC 2007: 343-349
12		Shigeru Yamashita, Masaki Nakanishi: A practical framework to utilize quantum search. IEEE Congress on Evolutionary Computation 2007: 4086-4093
11		Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe: Robust Quantum Algorithms Computing OR with epsilon-Biased Oracles. IEICE Transactions 90-D(2): 395-402 (2007)
	2006
10		Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe: Robust Quantum Algorithms with epsilon-Biased Oracles. COCOON 2006: 116-125
9		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 Transactions 89-A(12): 3416-3426 (2006)
8		Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura: Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique. IEICE Transactions 89-A(12): 3427-3434 (2006)
7		Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara: Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition. IEICE Transactions 89-D(3): 1120-1127 (2006)
	2005
6		Mitsuru Tomono, Masaki Nakanishi, Katsumasa Watanabe, Shigeru Yamashita: Event-oriented computing with reconfigurable platform. ASP-DAC 2005: 1248-1251
5		Nobuo Nakai, Masaki Nakanishi, Shigeru Yamashita, Katsumasa Watanabe: Reconfigurable 1-Bit Processor Array with Reduced Wirng Area. ERSA 2005: 225-234
	2004
4		Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura: Minimization of fractional wordlength on fixed-point conversion for high-level synthesis. ASP-DAC 2004: 80-85
3		Masaki Nakanishi: On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations. COCOON 2004: 179-186
	2002
2		Shinji Kimura, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara: Folding of logic functions and its application to look up table compaction. ICCAD 2002: 694-697
	2000
1		Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara: Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. COCOON 2000: 467-476

Coauthor Index

1	Andris Ambainis	[14] [18]
2	Nobuhiro Doi	[4] [8]
3	Kiyoharu Hamaguchi	[1] [7]
4	Shinya Hiramoto	[13]
5	Takashi Horiyama	[2] [4] [8]
6	Kazuo Iwama	[14] [18]
7	Hirotsugu Kajihara	[2]
8	Toshinobu Kashiwabara	[1] [7]
9	Shinji Kimura	[2] [4] [8]
10	Nobuo Nakai	[5]
11	Kazuo Nakajima	[9]
12	Yasuhiko Nakashima	[13]
13	Harumichi Nishimura	[14] [18]
14	Rudy Raymond	[14] [18]
15	Tomoya Suzuki	[10] [11]
16	Seiichiro Tani	[14] [15] [17] [18]
17	Mitsuru Tomono	[6] [9]
18	Katsumasa Watanabe	[5] [6] [9] [10] [11]
19	Shigeru Yamashita	[5] [6] [9] [10] [11] [12] [13] [14] [15] [17] [18]