研究発表等
公開件数:179件
No. 発表題名 発表会議名(発表誌等の媒体名) 発表年月日
1 Placement of Reagents on Programmable Microfluidic Device
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), R2-1, March 2018. (Outstanding Paper Award)
2018/03
2 On Optimization Methods for Decision Diagrams to Represent Probabilities
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), R2-3, March 2018.
2018/03
3 Systematic Design of Approximate Array Multipliers with Different Accuracy
In International Workshop on Highly Efficient Neural Networks Design, 2017 (ポスター、査読あり)
2017/10/20
4 Locating Loops for TCSC Considering Bridge Transformation
in Proc. of AQIS 2017, pp .425-426, Sep. 2017.
2017/09/05
5 Quantum Circuit Design by Using ESOP Minimization
in Proc. of AQIS 2017, pp. 423-424, Sep. 2017.
2017/09/05
6 Synthesis of Physical-Limitation-Aware Optimal Quantum Circuits in 2-D Architecture
in Proc. of AQIS 2017, pp. 298-299, Sep. 2017.
2017/09/05
7 An Ancilla Reduction Technique for Quantum Circuits Converted from NAND-based Circuits
in Proc. of AQIS 2017, pp. 289-290, Sep. 2017
2017/09/05
8 改良型配列型近似乗算器の設計と解析 
回路とシステムワークショップ
2017/05/11
9 試料生成における汚染問題を考慮したDMFB合成手法
ETNET2017 (21)
2017/03/09
10 Stochastic Computingにおけるマルチプレクサの制御入力として複雑な式を用いる回路設計
ETNET2017 (20)
2017/03/09
11 Stochastic Computingにおける相関の許容によるSNGの削減
ETNET2017 (19)
2017/03/09
12 A Decision Diagram to Analyze Probabilistic Behavior of Circuits
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), R2-6, Oct. 2016.
2016/10
13 Optimization of Quantum Circuits with Multiple Outputs
Proc. of AQIS 2016, pp. 188-189.
2016/08
14 Parallelization of Braiding Operations for Topological Quantum Computation
Proc. of AQIS 2016, pp. 190 -191.
2016/08
15 Reducing Loops for Topological Cluster State Quantum Computation
Proc. of AQIS 2016, pp.208 -209.
2016/08
16 Reduction of Quantum Cost by Changing the Functionality
Proc. of AQIS 2016, pp. 212-213.
2016/08
17 A systematic methodology for design and analysis of approximate array multipliers
2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), Jeju, 2016, pp. 352-354.
2016/07
18 A Pre-Optimization Technique to Generate Initial Reversible Circuits with Low Quantum Cost
Proc. of 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2298-3001.
2016/05
19 配列型近似乗算器の設計と解析
回路とシステムワークショップ
2016/05/13
20 Effect of LFSR Seeding, Scrambling and Feedback Polynomial on Stochastic Computing Accuracy
Proc. ACM/IEEE DATE 2016, March, 2016
2016/03
21 Approximate Computing を用いた乗算器の実装および検証
ETNET2016 (35)
2016/03
22 RQFPゲートを用いた超低消費電力AQFP論理回路の設計手法
ETNET2016 (32)
2016/03
23 Partially-Programmable Circuit を 用いた遅延故障の回避手法
ETNET2016 (26)
2016/03
24 Pin-Count Reduction Techniques for Logic Integrated Digital Microfluidic Biochips
in the Proceedings of 29th International Conference on VLSI Design, M/D-1.2, Jan. 2016 (Invited Talk)
2016/01
25 ILP-Based Synthesis for Sample Preparation Applications on Digital Microfluidic Biochips
in the Proceedings of 29th International Conference on VLSI Design, pp. 355-360, Jan. 2016
2016/01
26 Stochastic Number Generation with Few Inputs
in the Proceedings of 29th International Conference on VLSI Design, pp. 128-133, Jan. 2016
2016/01
27 A General Testing Method for Digital Microfluidic Biochips under Physical Constraints
in the Proceedings of IEEE International Test Conference (ITC-2015), pp. 1 - 8, October 2015
2015/10
28 MPMCTゲートの挿入による論理関数を実現する量子回路のコスト削減手法        
2015 年度情報処理学会関西支部大会, A-02 (学生奨励賞 受賞)
2015/09
29 Stochastic Computingに用いる定数を近似する回路の合成手法     
2015 年度情報処理学会関西支部大会, A-01
2015/09
30 Reduction of Computational Steps for Topological Quantum Computation by Inserting SWAP Gates
in Proc. of AQIS 2015, pp. 131-132, Aug. 2015.
2015/08
31 Reordering of Multiple-Control Toffoli gates for Better Decomposition
in Proc. of AQIS 2015, pp. 127-128, Aug. 2015.
2015/08
32 Changing Specification By Adding Multiple-Control Toffoli Gates for Generating a Better Initial Reversible Circuit
in Proc. of AQIS 2015, pp. 123-124, Aug. 2015.
2015/08
33 Reduction of Computational Steps for Topological Quantum
(Invited) Circuits Quantum Programming and Circuits Workshop, June 2015
2015/06
34 Testing of digital microfluidic biochips with arbitrary layouts
in Proc. of 20th IEEE European Test Symposium (ETS 2015), pp. 1-2
2015/05
35 Global Transformation-Based Optimization of Threshold Logic Circuits
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 311-316, March 2015.
2015/03
36 An Efficient Calculation Method for Reliability Analysis of Logic Circuits
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 344-349, March 2015.
2015/03
37 Graph-Covering-Based Architectural Synthesis for Programmable Digital Microfluidic Biochips
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 344 – 349, March 2015.
2015/03
38 Evaluation of Approximate SAD Circuits with Error Compensation
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 140-145, March 2015.
2015/03
39 Single-Flux-Quantum Digital Circuit Design Using Clockless Logic Cells with a Jitter Constraint
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 293-298, March 2015.
2015/03
40 Efficient Manipulation of Truth Tables on CUDA for Gate-Level Simulation
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 427-432, March 2015.
2015/03
41 Quantitative Evaluations and Efficient Exploration for Optimal Partially-Programmable Circuits Generation
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI) 2015, pp. 199-204, March 2015.
2015/03
42 SeqBDDのメモリ使用効率化手法
2014年度情報処理学会関西支部大会
2014/09
43 組み合わせ回路におけるソフトエラー発生確率の効率的計算手法
2014年度情報処理学会関西支部大会 
2014/09
44 SeqBDDのメモリ使用効率化手法
アルゴリズムデザインコンテスト, DAシンポジウム2014
2014/08
45 SPFDによる論理関数の自由度の表現とその回路設計への応用
第27回回路とシステム軽井沢ワークショップ予稿集, pp.68-73
2014/08
46 2D Qubit Layout Optimization for Topological Quantum Computation
Lecture Notes in Computer Science Volume 8507, 2014, pp 176-188 (Reversible computation 2014, Jul. 2014.)
2014/07
47 Better-than-DMR Techniques for Yield Improvement
IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM), p. 34
2014/05
48 Logic Integrated Optimal Pin-Count Design for Digital Microfluidic Biochips
In Proc. ACM/IEEE DATE 2014.
2014/03
49 Novel Area-Efficient Technique for Yield Improvement
the W3 Special Interest Workshop "Electronic System-Level Design towards Heterogeneous Computing"
2014/03/28
50 A Network-Flow-Based Optimal Sample Preparation Algorithm for Digital Microfluidic Biochips
VLSI設計技術研究会 VLD Excellent Student Award 記念講演
2014/03/04
51 A Network-Flow-Based Optimal Sample Preparation Algorithms for Digital Microfluidic Biochips
in Proc. ACM/IEEE ASP-DAC 2014, pp. 225-230, Jan. 2014. (Best Paper Candidate)
2014/01
52 On the Error Resiliency of Combinational Logic Cells – Implications for Nano-based Digital Design
Proc. 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, pp. 118-119, Dec. 2013
2013/12
53 二重化よりも面積オーバーヘッドが少ない耐故障化手法
信学技報, vol. 113, no. 320, VLD2013-66, pp. 33-37
2013/11/27
54 PPCに基づく高歩留まり回路の発見的設計手法
信学技報, vol. 113, no. 320, VLD2013-65, pp. 27-32
2013/11/27
55 Digital Microfluidic Biochip向けの最適な試料生成
信学技報, vol. 113, no. 320, VLD2013-64, pp. 19-24
2013/11/27
56 可逆な素子による論理設計の研究動向(招待講演)
応用物理学会 (超伝導分科会 第48回研究会)
2013/11/22
57 A Variable-Length String Matching Circuit Based On SeqBDDs
Proc. Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 282 - 287, Oct. 2013
2013/10
58 Qubit Arrangement Problems for Topological Quantum Computation
Proc. of AQIS’13, pp. 181-182, Aug. 2013
2013/08
59 Partially-Programmable Circuitの歩留まり向上のためのLUT最適化手法
DAシンポジウム2013, 2B-1
2013/08/21
60 可逆計算に関する研究動向(招待講演)
日本学術振興会超伝導エレクトロニクス第146委員会通信・情報処理分科会第9回研究会
2013/07/22
61 A Clique-Based Approach to Find Binding and Scheduling Result in Flow-Based Microfluidic Biochips (Invited Talk)
in Proc. of ASP-DAC'13, pp. 199-204
2013/01
62 A Redundant Wire Addition Method for Patchable Accelerator
in Proc. of The 2012 IEEE International Conference on Electronics, Circuits, and Systems (ICECS), pp. 552-555
2012/12
63 An Optimization Problem for Topological Quantum Computation
in Proc. of IEEE ATS'12, pp. 61-66 (Invited Talk)
2012/11
64 Partially-Programmable Circuits with CAMs
デザインガイア2012, VLD2012-64, pp. 31-36
2012/11/26
65 SeqBDDにおける最長共通部分列・部分文字列アルゴリズム
平成24年度情報処理学会関西支部大会 B-04
2012/09/21
66 Circuit Optimization by Clique Finding for Topological Quantum Computation
in Proc. of AQIS’12, pp. 161-162
2012/08
67 Reconstructing Strings from Substrings with Quantum Queries
in Proc. of (SWAT 2012), pp. 388-397
2012/07
68 Qubit Order Optimization Problem for Topological Quantum Computation
TQC2012
2012/05
69 Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
Proc. of the 9th Annual Conference on Theory and Applications of Models of Computation (TAMC2012), pp. 400-411
2012/05
70 Sequence Binary Decision Diagrams with Mapping Edges
IEICE-COMP2012-4, pp. 23--28
2012/04
71 Improved Quantum Algorithms for Reconstructing Strings from Substrings
Asian Association for Algorithms and Computation (AAAC2012)
2012/04
72 Bit Selective SAD and Its Evaluation
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 22-27
2012/03
73 A TMR-based Soft Error Mitigation Technique With Less Area Overhead in High-Level Synthesis
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. pp. 396-401
2012/03
74 High-Level Synthesis Using Partially-Programmable Resources for Yield Improvement
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 414-419
2012/03
75 Evaluation of Migration Methods for Island Based Parallel Genetic Algorithm on CUDA
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 378-383
2012/03
76 トポロジカル量子コンピュータにおける量子回路の最適化手法
電子情報通信学会関西支部学生会 第17回学生会研究発表講演会
2012/03/09
77 SeqBDDにおける最長共通部分列・部分文字列アルゴリズム
電子情報通信学会関西支部学生会 第17回学生会研究発表講演会
2012/03/09
78 On Error Tolerance and Engineering Change with Partially Programmable Circuits
ASP-DAC'12, pp. 695-700
2012/02
79 Logic level circuit optimization for topological quantum computation (Invited Talk)
Dagstuhl Seminar 11502: Design of Reversible and Quantum Circuits
2011/12
80 Logic level circuit ooptimization for topological quantum computation
in Proc. of QIT25, pp. 185-188
2011/11
81 An Efficient Algorithm for Constructing a Sequence Binary Decision Diagram Representing a Set of Reversed Sequences
IEEE International Conference on Granular Computing 2011, pp. 54-55.
2011/11
82 SAD演算回路における最適な比較ビット使用箇所およびブロックサイズの検討
情報処理学会関西支部支部大会, Sep. 2011
2011/09
83 Quantum Query Complexity of Hamming Distance Estimation
in Proc. of AQIS’11, pp. 103-104
2011/08
84 リソースの再利用による実装面積を考慮した耐故障化高位合成手法 (in Japanese)
DAシンポジウム 2011 論文集, pp. 15-20
2011/08
85 Changing the Gate Order for Optimal LNN Conversion
Proc. of 3rd Workshop on Reversible Computation, pp. 175--186
2011/07/05
86 逆順の系列集合を表すSeqBDDの構築
電子情報通信学会技術研究報告, COMP, コンピュテーション, vol.111, no.20, pp.17-23
2011/04
87 Reconstructing Strings from Substrings with Quantum Queries
Asian Association for Algorithms and Computation (AAAC2011)
2011/04/17
88 Soft Error-Aware Scheduling in High-Level Synthesis (in English)
電子情報通信学会技術研究報告, vol.2011-SLDM-149/vol.2011-EMB-20, no.19, pp.1-6
2011/03
89 A Restricted Quantum Circuit Class for  Designing Large Quantum Circuits
The 3rd ERATO-SORST Quantum Computation and Information Workshop
2011/03/01
90 ゲート順序を考慮したLNNアーキテクチャへの変換手法
第23回量子情報技術研究会資料, QIT2010-65, pp. 125-128
2010/11/15
91 Increasing Yield Using Partially-Programmable Circuits
Proc. of Conference of Synthesis And System Integration of Mixed Information technologies (SASIMI2010), pp. 237-242 (Best Paper Award)
2010/10
92 Towards Robust Circuit Design with Low Overhead
Asia South Pacific Design Automation Workshop
2010/09/11
93 A SAT Solver Based on Quantum and Classical Random Walks
Asian Conference on Quantum Information Science 2010 (AQIS2010)
2010/08/29
94 Asymptotics of Quantum Walks on the Line with Phase Parameters
Asian Conference on Quantum Information Science 2010 (AQIS2010)
2010/08/29
95 Synthesis of Semi-Classical Quantum Circuits
Proc. of 2nd Workshop on Reversible Computation, pp. 93-99
2010/07/03
96 Fast Equivalence-checking for Quantum Circuits
Proc. of NANOARCH '10, pp. 23 - 28
2010/06/16
97 少品種高信頼セルを用いた高信頼回路設計手法と信頼性評価手法の提案 (SLDM 研究会 優秀発表学生賞受賞)
組込み技術とネットワークに関するワークショップ ETNET2010
2010/03
98 Increasing Yield Using Partially-Programmable Circuits
電子情報通信学会技術研究報告,vol. 109, no. 315, pp. 125-130 (VLD2009-59)
2009/12
99 Discrete Quantum Walks on the Line with Phase Parameters
The International Conference on Quantum Information and Technology
2009/12/03
100 Quantum Communication Protocols with Public Coins
情報処理学会研究報告 2009-AL-126(6), 1-7
2009/09/15
101 Adaptive Equivalence-checking for Quantum Circuits
Proc. of Reed-Muller Workshop 2009, pp. 97-106
2009/05/24
102 An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture
Proc. of the Third International Conference on Quantum, Nano and Micro Technologiesv (ICQNM 2009), pp. 26-33
2009/02/02
103 Average/Worst-Case Gap of Quantum Query Complexities
The Twelfth Workshop on Quantum Information Processing (QIP2009)
2009/01/14
104 A Functional Unit with Small Variety of Highly Reliable Cells
Proc. of 14th Pacific Rim International Symposium on Dependable Computing (PRDC’08), pp. 353-354
2008/12
105 Quantum Query Complexity of Boolean Functions with Small On-Sets
Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pp. 907-918
2008/12/17
106 Quantum Query Complexity of Boolean Functions with Small On-Sets
第19回量子情報技術研究会
2008/11/20
107 An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture
第19回量子情報技術研究会
2008/11/20
108 量子計算の並列シミュレーションにおける通信量削減手法
SWoPP2008
2008/08/06
109 An Efficient Verification of Quantum Circuits under a Practical Restriction
Proc. of IEEE 8th International Conference on Computer and Information Technology (CIT 2008), pp. 873-879
2008/07/08
110 Polynomial-Time Construction of Linear Network Coding
L. Aceto et al. (Eds.): ICALP 2008, Part I, LNCS 5125, pp. 271-282
2008/07/07
111 Multi-Party Quantum Communication Complexity with Routed Messages
Proc. of 14th Annual International Computing and Combinatorics Conference (COCOON 2008), LNCS 5092 (2008), pp. 180-190
2008/06/27
112 Equivalence-checking for Reversible Circuits
IEEE International Workshop on Logic Synthesis (IWLS 2008), pp. 51-58
2008/06/04
113 並列量子計算シミュレータにおける通信量削減手法の提案
第18回量子情報技術研究会
2008/05/22
114 線形ネットワーク符号の構成とその多項式時間アルゴリズム
(招待)第21回回路とシステム軽井沢ワークショップ, pp. 665-670
2008/04
115 An almost optimal quantum string sealing protocol and its security analysis
In Proc. of the First AAAC (Asian Association of Algorithms and Computation) Annual Meeting. AAAC, 2008
2008/04/26
116 A quantum secure direct communication protocol for sending a quantum state and its security analy
The 2008 Symposium on Cryptography and Information Security (SCIS2008)
2008/01/23
117 Quantum Network Coding
Proc. of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), W. Thomas and P. Weil (Eds.), Lecture Notes in Computer Science, Volume 4393, Springer-Verlag, pp. 610-621, 2007.
2007
118 Tight Bounds on Information Gains in Quantum Sealing Protocols
Workshop on Quantum Information Processing 2007
2007
119 A Quantum Secure Direct Communication Protocol for Sending a Quantum State and Its Security Analysis
Workshop on Quantum Information Processing 2007
2007
120 Quantum Network Coding for General Graphs
Workshop on Quantum Information Processing 2007
2007
121 Quantum Random Access Coding using Multiple Qubits
Workshop on Quantum Information Processing 2007
2007
122 Unbounded-Error One-Way Classical and Quantum Communication Complexity
L. Arge et al. (Eds.): ICALP 2007, LNCS 4596, pp. 110-121
2007
123 A quantum secure direct communication protocol for sending a quantum state and its security analysis
In Proc. of the 6th WSEAS International Conference on Information Security and Privacy (ISP’07), pp. 91-97
2007/12
124 An Information-Theoretic Security Analysis of Quantum String Sealing
In Proc. of the 6th WSEAS International Conference on Information Security and Privacy (ISP’07), pp. 30-35
2007/12
125 Unbounded-Error Classical and Quantum Communication Complexity
Workshop on Quantum Information Processing 2008
2007/12/21
126 Synthesis of quantum circuits for d-level systems using KAK decomposition
Workshop on Quantum Information Processing 2008
2007/12/18
127 Fidelity-Efficient Quantum Network Coding
Workshop on Quantum Information Processing 2008
2007/12/18
128 Unbounded-error classical and quantum communication complexity
Proc. of 18th International Symposium on Algorithms and Computation (ISAAC2007), Lecture Notes in Computer Science 4835, pp. 100-111
2007/12/17
129 An analysis of quantum communication complexity depending on network topologies
第17回量子情報技術研究会, QIT2007-83, pp. 150–153
2007/11/22
130 A Practical Framework to Utilize Quantum Search
Proc. of the 2007 IEEE Congress on Evolutionary Computation (CEC2007)
2007/09/28
131 Communication Complexity by Arrangement Argument
(Invited) 4th Central European Quantum Information Processing Workshop
2007/07
132 非有界誤り一方向量子および古典通信計算量
QIT2007-26, pp. 106-111
2007/05/18
133 A hardware SAT solver using non-chronological backtracking and clause recording without overheads
In Proc. of 3rd International Workshop on Applied Reconfigurable Computing (ARC2007), pp.343-349
2007/03
134 Quantum Network Coding
Workshop on Quantum Information Processing 2006 (Talk).
2006
135 A Transduction-based Framework to Synthesize RSFQ Circuits
Proc. of Asia and South Pacific Design Automation Conference 2006 (ASP-DAC 2006), pp. 266-272, Jan. 2006.
2006
136 Quantum Communication Complexity for the Distinctness Function on a Ring
Workshop on Theory of Quantum Computation, Communication and Cryptography 2006 (TQC 2006), pp. 10-11, Feb. 2006.
2006
137 Online task placement for partially reconfigurable FPGAs using I/O routing information
Proc. of Conference of Synthesis And System Integration of Mixed Information technologies (SASIMI2006), pp. 342-349, April 2006.
2006
138 (4,1)-Quantum Random Access Coding Does Not Exist
Proc. of the 2006 IEEE International Symposium on Information Theory (ISIT2006), pp. 446-450, Jul. 2006.
2006
139 Improved Algorithms for Quantum Identification of Boolean Oracles
Prof. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), Lecture Notes in Computer Science 4059, pp. 280-291, 2006.
2006
140 Robust quantum algorithms with e-biased oracles
Proc. of 12th Annual International Computing and Combinatorics Conference (COCOON 2006), LNCS 4112 (2006), pp. 116-125.
2006
141 (4,1)-Quantum Random Access Coding Does Not Exist ? One qubit is not enough to recover one of four bits ?
Proc. of Asian Conference on Quantum Information Science 2006 (AQIS 2006), pp. 188-189, Sep. 2006.
2006
142 An Efficient Approximation of SU(d) Using Decomposition
Proc. of Asian Conference on Quantum Information Science 2006 (AQIS 2006), pp. 147-148, Sep. 2006.
2006
143 Quantum Secure Direct Communication Protocols for Sending a Quantum State
Proc. of 2006 International Symposium on Information Theory and its Applications (ISITA2006), Seoul, Korea (CD-ROM), Oct. 2006.
2006
144 A New Approach to Online FPGA Placement
Proc. of Conference of Information Science and Systems, Princeton, NJ, CD-ROM, March 2006.
2006
145 How to Utilize Grover Search in General Programming
(Invited) 14th International Laser Physics Workshop (Laser physics, Vol. 16, No. 4, pp. 1-5)
2006
146 Quantum Protocol for the List-nonequality Function
Workshop on Quantum Information Processing 2005
2005
147 Robust Quantum Algorithms for Oracle Identification
Workshop on Quantum Information Processing 2005
2005
148 Event-Oriented Computing with Reconfigurable Platform
Proc. of Asia and South Pacific Design Automation Conference 2005 (ASP-DAC 2005), pp. 1248-1251, Jan. 2005.
2005
149 Reconfigurable 1-Bit Processor Array with Reduced Wiring Area
Proc. International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA 2005), pp. 225-231, June 2005.
2005
150 A Design Method for Large-scaled Quantum Circuits
COE workshop for SoC Design Technology and Automation, p1-7
2005/09
151 Quantum Oracle Computation with and without Noises
The Seventh Workshop on Quantum Information Processing, Waterloo, Canada, Jan. 14-19, 2004.
2004
152 SPFD-based One-to-Many Rewiring
Proc. of International Symposium on Field Programmable Gate Arrays (FPGA 2004), p. 250.
2004
153 Quantum Pushdown Automata that can Deterministically Solve a Certain Problem
International Symposium on Mesoscopic Superconductivity and Spintronics (MS+S2004), p. 16, March 2004.
2004
154 Quantum identification of boolean oracles
Proc. of the 21th International Symposium on Theoretical Aspects of Computer Science (STACS 2004), Diekert, Volker and Habib, Michel (Eds.), Lecture Notes in Computer Science, Volume 2996, Springer-Verlag, pp. 105-116, 2004.
2004
155 SPFD-based One-to-Many Rewiring (OMR) for Delay Reduction of LUT-based FPGA Circuits
Proc. of GLS-VLSI 2004, pp. 348-353, Apr. 2004.
2004
156 Toward a Practical Environment for Quantum Programming
Proc. of Asia-Pacific Conference on Quantum Information Science, pp. 133-141, Dec. 2004.
2004
157 Quantum Query Complexity of Biased Oracles
Workshop on ERATO Quantum Information Science 2003, pp. 33-34, Sep. 2003
2003
158 Explicit Implementation of Quantum Computers on a Unidirectional Periodic Structure
Carrier Interactions and Spintronics in Nanostructures (CISN 2003), 2003.
2003
159 Quantum sampling for balanced allocations
Proc. of 9th Annual International Computing and Combinatorics Conference (COCOON 2003), LNCS 2697 (2003), pp. 304-318.
2003
160 Transformation Rules for Designing CNOTbased Quantum Circuits
Proc. of Design Automation Conference 2002, pp. 419-424, Jun. 2002.
2002
161 Quantum query complexity and the number of inverted states
Workshop on ERATO Quantum Information Science 2002, pp. 79-80, Sep. 2002.
2002
162 Explicit implementation of quantum circuits on unidirectional periodic structure
Workshop on ERATO Quantum Information Science 2002, pp. 83-84, Sep. 2002.
2002
163 Quantum complexity of noisy IP query
Workshop on ERATO Quantum Information Science 2002, pp. 77-78, Sep. 2002.
2002
164 量子サンプリングとその応用
(招待)電子情報通信学会2002年総合大会, TD-1-3
2002/03
165 A Complete Set of Transformation Rules for Quantum Boolean Circuits with CNOT gates
Workshop on ERATO Quantum Information Science 2001, p. 22, Sep. 2001.
2001
166 New algorithms for factoring and discrete logarithm with NMR quantum computers
Workshop on ERATO Quantum Information Science 2001, p. 52, Sep. 2001.
2001
167 SPFD: A Method to Express Functional Flexibility
(Invited) Booklet of 10th International Workshops on Post-Binary ULSI Systems (ULSI 2001), pp. 19-24
2001/05
168 An Efficient Framework of Using Various Decomposition Methods to Synthesize LUT Networks and Its Evaluation
Proc. of Asia and South Pacific Design Automation Conference 2000 (ASP-DAC 2000), pp. 253-258, Jan. 2000.
2000
169 A Boolean Division Algorithm for Implicit Cube Set Representations
Proc. of the 9th International Workshop on Synthesis And System Integration of MIxed Technologies (SASIMI 2000), pp. 279-283, Apr. 2000.
2000
170 A Layout Driven Logic Decomposition Model
IEEE International Workshop on Logic Synthesis (IWLS 2000), pp. 111-115, May 2000.
2000
171 An Integrated Approach for Synthesizing LUT Networks
Proc. of the 9th Great Lakes Symposium on VLSI (GLS-VLSI ’99), pp. 136-139, Feb. 1999.
1999
172 An Efficient Method for Generating Kernels on Implicit Cube Set Representations
the 12th Workshop on Circuits and Systems in Karuizawa, pp. 331-336, Apr. 1999 (in Japanese).
1999
173 An Efficient Method for Generating Kernels on Implicit Cube Set Representations
IEEE International Workshop on Logic Synthesis (IWLS ’99), pp. 260-263, June 1999.
1999
174 New Methods to Find Optimal Non-Disjoint Bi-Decompositions
Proc. of Asia and South Pacific Design Automation Conference 1998 (ASP-DAC ’98), pp. 59-68, Feb. 1998.
1998
175 Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions
Proc. Design, Automation and Test in Europe Conf. (DATE ’98), pp. 755-759, Feb. 1998.
1998
176 Efficient Methods for a Simple Disjoint Decomposition and a Non-Disjoint Bi-Decomposition
the 7th International Workshop on Post-Binary ULSI Systems, pp. 34-37, May 1998.
1998
177 Restricted Simple Disjunctive Decompositions Based on Grouping Symmetric Variables
Proc. the Seventh Great Lakes Symposium on VLSI (GLS-VLSI ’97), pp. 39-44, Mar. 1997.
1997
178 A New Method to Express Functional Permissibilities for LUT based FPGAs and Its Applications
Proc. Int’l Conf. Computer-Aided Design (ICCAD ’96), pp. 254-261, Nov. 1996.
1996
179 Optimization Methods for Lookup-Table-Based FPGAs Using Transduction Method
Proc. of Asia and South Pacific Design Automation Conference 1995 (ASP-DAC ’95), pp. 353-356, Aug. 1995.
1995