岩間 一雄

Last Update: 2015/11/20 08:42:01

Print

Name(Kanji/Kana/Abecedarium Latinum)
岩間 一雄/イワマ カズオ/Iwama, Kazuo
Primary Affiliation(Org1/Job title)
Research Institute for Mathematical Sciences (RIMS)/Researcher
Faculty
Org1 Job title
工学部
Contact Address
Type Address(Japanese) Address(English)
Office
Phone
Type Number
Office 075-753-5372
E-mail Address
E-mail address
iwama @ kuis.kyoto-u.ac.jp
Academic Organizations You are Affiliated to in Japan
Organization name(Japanese) Organization name(English)
電子情報通信学会
情報処理学会
ACM
SIAM
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
工学博士 京都大学
Personal Profile
(Japanese)
73年京大卒(電気).78年博士了.京都産大講師,助教授,カリフォルニア大学バークレー客員準教授,九大助教授を経て,92年より九大教授.97年京大教授.AAAC(アジア理論計算機科学学会)創立者・会長(平成19年ー), EATCS(欧州理論計算機科学学会)理事(平成13年ー平成17年).ESA(欧州アルゴリズム会議)運営委員.科学研究費特定研究(新生代の計算限界-その解明と打破-,平成16年ー19年)領域代表.ラトビア大学名誉博士号(平成20年).猪瀬賞,電子情報通信学会(平成18年).日本学術会議連携会員(平 成18年).研究テーマはアルゴリズムの設計と解析,計算量理論,量子計算.
(English)
Received B.E., M.E. and Ph.D. degrees from Department of Electrical Engineering, Kyoto University in 1973, 1975 and 1980, respectively. Associate Professor of Kyoto Sangyo (Industrial) University, 1978-1990, Visiting Associate Professor of UC Berkeley, 1983-1984, Associate Professor of Kyushu University, 1990-1992, Professor of Kyushu University, 1992-1997 and Professor of Kyoto University, 1997-present. Research interests include design and analysis of algorithms, computational complexity and quantum computation. Founder and Chair of Executive Board, Asian Association for Algorithms and Computation (AAAC), 2007-, Council Member, European Association for Theoretical Computer Science (EATCS), 2002-2006, and Steering Committee Member, European Symposium on Algorithms (ESA), 2003-2007. Honorary Doctor (Dr. honoris causa), University of Latvia, 2008. ACM/SIAM SODA 2012 organizing committee chair.
researchmap URL
https://researchmap.jp/7000008626
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
K. Iwama; K. Seto; S. Tamaki K. Iwama; K. Seto; S. Tamaki The planar Hajós calculus for bounded degree graphs The planar Hajós calculus for bounded degree graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E93A, 6, 1000-1007 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E93A, 6, 1000-1007 , E93A, 6, 1000-1007 2010/06 Refereed Japanese Disclose to all
K. Iwama; K. Seto; S. Tamaki K. Iwama; K. Seto; S. Tamaki The complexity of the Hajós calculus for planar graphs The complexity of the Hajós calculus for planar graphs Theoretical Computer Science, 411, 7-9, 1182-1191 Theoretical Computer Science, 411, 7-9, 1182-1191 , 411, 7-9, 1182-1191 2010/02/28 Refereed Japanese Disclose to all
吉広卓哉;島田将行;岡部寿男;岩間一雄 吉広卓哉;島田将行;岡部寿男;岩間一雄 IPv6におけるサイトローカルアドレスのステートレス自動設定 IPv6におけるサイトローカルアドレスのステートレス自動設定 システム制御情報学会論文誌, 15, 6, 294-301 システム制御情報学会論文誌, 15, 6, 294-301 , 15, 6, 294-301 2002/06 Refereed Japanese Disclose to all
河合大輔,宮崎修一,岡部寿男,岩間一雄 河合大輔,宮崎修一,岡部寿男,岩間一雄 SATに対する局所探索法のベクトル化 SATに対する局所探索法のベクトル化 情報処理学会論文誌, 42, 4, 754-761 情報処理学会論文誌, 42, 4, 754-761 , 42, 4, 754-761 2001/04/15 Refereed Japanese Disclose to all
岩本宙造;岩間一雄 岩本宙造;岩間一雄 テープ記号数を制限したチューリング機械の領域階層 テープ記号数を制限したチューリング機械の領域階層 電子情報通信学会論文誌 D-1, J82-D-1, 6, 661-668 電子情報通信学会論文誌 D-1, J82-D-1, 6, 661-668 , J82-D-1, 6, 661-668 1999/06/25 Refereed Japanese Disclose to all
農添三資;浜口清治;岩間一雄;矢島しゅう三 農添三資;浜口清治;岩間一雄;矢島しゅう三 しきい値関数を表す共有2分決定グラフの最適な変数順序付けの計算複雑度 しきい値関数を表す共有2分決定グラフの最適な変数順序付けの計算複雑度 電子情報通信学会論文誌 D-1, J82-D-1, 5, 595-602 電子情報通信学会論文誌 D-1, J82-D-1, 5, 595-602 , J82-D-1, 5, 595-602 1999/05/25 Refereed Japanese Disclose to all
宮崎修一;岩間一雄 宮崎修一;岩間一雄 Approximation of coNP Sets by NP-Complete Sets and Its Application. Approximation of coNP Sets by NP-Complete Sets and Its Application. 電子情報通信学会論文誌 D-1, J81-D-1, 6, 677-684 電子情報通信学会論文誌 D-1, J81-D-1, 6, 677-684 , J81-D-1, 6, 677-684 1998/06 Refereed Japanese Disclose to all
D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku Reputation games for undirected graphs Reputation games for undirected graphs Discrete Applied Mathematics, 166, 1-13 , 166, 1-13 Discrete Applied Mathematics, 166, 1-13 2014 Refereed English Disclose to all
K. Iwama; S. Miyazaki; H. Yanagisawa K. Iwama; S. Miyazaki; H. Yanagisawa A 25/17-approximation algorithm for the stable marriage problem with one-sided ties A 25/17-approximation algorithm for the stable marriage problem with one-sided ties Algorithmica, 68, 3, 758-775 , 68, 3, 758-775 Algorithmica, 68, 3, 758-775 2014 Refereed English Disclose to all
N. Bansal; X. Han; K. Iwama; M. Sviridenko; G. Zhang N. Bansal; X. Han; K. Iwama; M. Sviridenko; G. Zhang A harmonic algorithm for the 3D strip packing problem A harmonic algorithm for the 3D strip packing problem SIAM Journal on Computing, 42, 2, 579-592 , 42, 2, 579-592 SIAM Journal on Computing, 42, 2, 579-592 2013 Refereed English Disclose to all
T. Inoshita; R.W. Irving; K. Iwama; S. Miyazaki; T. Nagase T. Inoshita; R.W. Irving; K. Iwama; S. Miyazaki; T. Nagase Improving man-optimal stable matchings by minimum change of preference lists Improving man-optimal stable matchings by minimum change of preference lists Algorithms, 6, 2, 371-382 , 6, 2, 371-382 Algorithms, 6, 2, 371-382 2013 Refereed English Disclose to all
J. Chen; X. Han; K. Iwama; H.-F. Ting J. Chen; X. Han; K. Iwama; H.-F. Ting Online bin packing with (1,1) and (2,R) bins Online bin packing with (1,1) and (2,R) bins Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287 LNCS, 387-401 , 8287 LNCS, 387-401 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287 LNCS, 387-401 2013 Refereed English Disclose to all
J. Chen; H. Guo; X. Han; K. Iwama J. Chen; H. Guo; X. Han; K. Iwama The train delivery problem revisited The train delivery problem revisited Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8283 LNCS, 601-611 , 8283 LNCS, 601-611 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8283 LNCS, 601-611 2013 Refereed English Disclose to all
K. Iwama; H. Nishimura K. Iwama; H. Nishimura Recovering strings in oracles: Quantum and classic Recovering strings in oracles: Quantum and classic International Journal of Foundations of Computer Science, 24, 7, 979-993 , 24, 7, 979-993 International Journal of Foundations of Computer Science, 24, 7, 979-993 2013 Refereed English Disclose to all
K. Iwama K. Iwama Approximability of stable matching problems Approximability of stable matching problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157 LNCS, 2- , 7157 LNCS, 2- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157 LNCS, 2- 2012 Refereed English Disclose to all
K. Iwama; S. Miyazaki; H. Yanagisawa K. Iwama; S. Miyazaki; H. Yanagisawa Improved approximation bounds for the Student-Project Allocation problem with preferences over projects Improved approximation bounds for the Student-Project Allocation problem with preferences over projects Journal of Discrete Algorithms, 13, 59-66 , 13, 59-66 Journal of Discrete Algorithms, 13, 59-66 2012 Refereed English Disclose to all
R. Cleve; K. Iwama; F. Le Gall; H. Nishimura; S. Tani; J. Teruyama; S. Yamashita R. Cleve; K. Iwama; F. Le Gall; H. Nishimura; S. Tani; J. Teruyama; S. Yamashita Reconstructing strings from substrings with quantum queries Reconstructing strings from substrings with quantum queries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7357 LNCS, 388-397 , 7357 LNCS, 388-397 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7357 LNCS, 388-397 2012 Refereed English Disclose to all
K. Iwama K. Iwama Recovering strings in oracles: Quantum and classic Recovering strings in oracles: Quantum and classic Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7410 LNCS, 23- , 7410 LNCS, 23- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7410 LNCS, 23- 2012 Refereed English Disclose to all
K. Iwama; H. Nishimura; R. Raymond; J. Teruyama K. Iwama; H. Nishimura; R. Raymond; J. Teruyama Quantum counterfeit coin problems Quantum counterfeit coin problems Theoretical Computer Science, 456, 51-64 , 456, 51-64 Theoretical Computer Science, 456, 51-64 2012 Refereed English Disclose to all
W. Bein; K. Iwama; J. Kawahara; L.L. Larmore; J.A. Oravec W. Bein; K. Iwama; J. Kawahara; L.L. Larmore; J.A. Oravec A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces Theoretical Computer Science, 412, 7, 563-572 , 412, 7, 563-572 Theoretical Computer Science, 412, 7, 563-572 2011/02/25 Refereed English Disclose to all
H. Fujiwara; K. Iwama; Y. Sekiguchi H. Fujiwara; K. Iwama; Y. Sekiguchi Average-case competitive analyses for one-way trading Average-case competitive analyses for one-way trading Journal of Combinatorial Optimization, 21, 1, 83-107 , 21, 1, 83-107 Journal of Combinatorial Optimization, 21, 1, 83-107 2011/01 Refereed English Disclose to all
K. Iwama; G. Zhang K. Iwama; G. Zhang Online knapsack with resource augmentation Online knapsack with resource augmentation Information Processing Letters, 110, 22, 1016-1020 , 110, 22, 1016-1020 Information Processing Letters, 110, 22, 1016-1020 2010/10/31 Refereed English Disclose to all
D.F. Manlove; R.W. Irving; K. Iwama D.F. Manlove; R.W. Irving; K. Iwama Guest editorial: Special issue on matching under preferences Guest editorial: Special issue on matching under preferences Algorithmica (New York), 58, 1, 1-4 , 58, 1, 1-4 Algorithmica (New York), 58, 1, 1-4 2010/09 Refereed English Disclose to all
H. Ito; K. Iwama H. Ito; K. Iwama Enumeration of isolated cliques and pseudo-cliques Enumeration of isolated cliques and pseudo-cliques ACM Transactions on Algorithms, 5, 4 , 5, 4 ACM Transactions on Algorithms, 5, 4 2009/10 Refereed English Disclose to all
K. Hamada; K. Iwama; S. Miyazaki K. Hamada; K. Iwama; S. Miyazaki An improved approximation lower bound for finding almost stable maximum matchings An improved approximation lower bound for finding almost stable maximum matchings Information Processing Letters, 109, 18, 1036-1040 , 109, 18, 1036-1040 Information Processing Letters, 109, 18, 1036-1040 2009/08/31 Refereed English Disclose to all
K. Iwama; H. Morizumi; J. Tarui K. Iwama; H. Morizumi; J. Tarui Negation-limited complexity of parity and inverters Negation-limited complexity of parity and inverters Algorithmica (New York), 54, 2, 256-267 , 54, 2, 256-267 Algorithmica (New York), 54, 2, 256-267 2009/06 Refereed English Disclose to all
K. Iwama; E. Miyano; H. Ono K. Iwama; E. Miyano; H. Ono Drawing borders efficiently Drawing borders efficiently Theory of Computing Systems, 44, 2, 230-244 , 44, 2, 230-244 Theory of Computing Systems, 44, 2, 230-244 2009/02 Refereed English Disclose to all
R. Freivalds; K. Iwama R. Freivalds; K. Iwama Quantum queries on permutations with a promise Quantum queries on permutations with a promise Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5642 LNCS, 208-216 , 5642 LNCS, 208-216 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5642 LNCS, 208-216 2009 Refereed English Disclose to all
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita 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 Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size CoRR abs/0908.2468 CoRR abs/0908.2468 2009 Refereed English Disclose to all
D. Avis; L. Devroye; K. Iwama D. Avis; L. Devroye; K. Iwama The locker problem with empty lockers The locker problem with empty lockers World Academy of Science, Engineering and Technology, 36, 103-106 , 36, 103-106 World Academy of Science, Engineering and Technology, 36, 103-106 2009 Refereed English Disclose to all
Y. Hanatani; T. Horiyama; K. Iwama; S. Tamaki Y. Hanatani; T. Horiyama; K. Iwama; S. Tamaki New graph calculi for planar non-3-colorable graphs New graph calculi for planar non-3-colorable graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91A, 9, 2301-2307 , E91A, 9, 2301-2307 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91A, 9, 2301-2307 2008/09 Refereed English Disclose to all
K. Iwama; S. Miyazaki; N. Yamauchi K. Iwama; S. Miyazaki; N. Yamauchi A (2 - c1/√N)-approximation algorithm for the stable marriage problem A (2 - c1/√N)-approximation algorithm for the stable marriage problem Algorithmica (New York), 51, 3, 342-356 , 51, 3, 342-356 Algorithmica (New York), 51, 3, 342-356 2008/07 Refereed English Disclose to all
K. Iwama; A. Lingas; M. Okita K. Iwama; A. Lingas; M. Okita Max-stretch reduction for tree spanners Max-stretch reduction for tree spanners Algorithmica (New York), 50, 2, 223-235 , 50, 2, 223-235 Algorithmica (New York), 50, 2, 223-235 2008 Refereed English Disclose to all
X. Han; K. Iwama; G. Zhang X. Han; K. Iwama; G. Zhang Online removable square packing Online removable square packing Theory of Computing Systems, 43, 1, 38-55 , 43, 1, 38-55 Theory of Computing Systems, 43, 1, 38-55 2008 Refereed English Disclose to all
K. Iwama K. Iwama SAT, UNSAT and coloring SAT, UNSAT and coloring Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4996 LNCS, 153- , 4996 LNCS, 153- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4996 LNCS, 153- 2008 Refereed English Disclose to all
H. Fujiwara; K. Iwama; Y. Sekiguchi H. Fujiwara; K. Iwama; Y. Sekiguchi Average-case competitive analyses for one-way Trading Average-case competitive analyses for one-way Trading Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5092 LNCS, 41-51 , 5092 LNCS, 41-51 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5092 LNCS, 41-51 2008 Refereed English Disclose to all
K. Iwama; H. Nishimura; M. Paterson; R. Raymond; S. Yamashita K. Iwama; H. Nishimura; M. Paterson; R. Raymond; S. Yamashita Polynomial-time construction of linear network coding Polynomial-time construction of linear network coding Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5125 LNCS, PART 1, 271-282 , 5125 LNCS, PART 1, 271-282 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5125 LNCS, PART 1, 271-282 2008 Refereed English Disclose to all
W. Bein; K. Iwama; J. Kawahara; L.L. Larmore; J.A. Oravec W. Bein; K. Iwama; J. Kawahara; L.L. Larmore; J.A. Oravec A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4927 LNCS, 246-259 , 4927 LNCS, 246-259 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4927 LNCS, 246-259 2008 Refereed English Disclose to all
H. Fujiwara; K. Iwama; K. Yonezawa H. Fujiwara; K. Iwama; K. Yonezawa Online chasing problems for regular polygons Online chasing problems for regular polygons Information Processing Letters, 108, 3, 155-159 , 108, 3, 155-159 Information Processing Letters, 108, 3, 155-159 2008 Refereed English Disclose to all
K. Iwama; H. Morizumi; J. Tarui K. Iwama; H. Morizumi; J. Tarui Reductions for monotone Boolean circuits Reductions for monotone Boolean circuits Theoretical Computer Science, 408, 2-3, 208-212 , 408, 2-3, 208-212 Theoretical Computer Science, 408, 2-3, 208-212 2008 Refereed English Disclose to all
W. Bein; K. Iwama; J. Kawahara W. Bein; K. Iwama; J. Kawahara Randomized competitive analysis for two-server problems Randomized competitive analysis for two-server problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5193 LNCS, 161-172 , 5193 LNCS, 161-172 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5193 LNCS, 161-172 2008 Refereed English Disclose to all
A. Ambainis; K. Iwama; M. Nakanishi; H. Nishimura; R. Raymond; S. Tani; S. Yamashita A. Ambainis; K. Iwama; M. Nakanishi; H. Nishimura; R. Raymond; S. Tani; S. Yamashita Quantum query complexity of boolean functions with small on-sets Quantum query complexity of boolean functions with small on-sets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5369 LNCS, 907-918 , 5369 LNCS, 907-918 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5369 LNCS, 907-918 2008 Refereed English Disclose to all
W. Bein; K. Iwama; J. Kawahara W. Bein; K. Iwama; J. Kawahara Randomized competitive analysis for two server problems Randomized competitive analysis for two server problems Algorithms, 1, 1, 30-42 , 1, 1, 30-42 Algorithms, 1, 1, 30-42 2008 Refereed English Disclose to all
K. Iwama K. Iwama Editor\\'s foreword Editor\\'s foreword Algorithms, 1, 1, 1- , 1, 1, 1- Algorithms, 1, 1, 1- 2008 Refereed English Disclose to all
Iwama. K., Miyazaki. S., Iwama. K., Miyazaki. S., Stable Marriage with Ties and Incomplete Lists Stable Marriage with Ties and Incomplete Lists Encyclopedia of Algorithms, Springer, pp. 883-885, 2008-6 Encyclopedia of Algorithms, Springer, pp. 883-885, 2008-6 2008 Refereed English Disclose to all
K. Iwama; S. Tamaki K. Iwama; S. Tamaki Exploiting partial knowledge of satisfying assignments Exploiting partial knowledge of satisfying assignments Discrete Applied Mathematics, 155, 12, 1596-1603 , 155, 12, 1596-1603 Discrete Applied Mathematics, 155, 12, 1596-1603 2007/06/15 Refereed English Disclose to all
A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita Improved algorithms for quantum identification of Boolean oracles Improved algorithms for quantum identification of Boolean oracles Theoretical Computer Science, 378, 1, 41-53 , 378, 1, 41-53 Theoretical Computer Science, 378, 1, 41-53 2007 Refereed English Disclose to all
M.M. Halldórsson; K. Iwama; S. Miyazaki; H. Yanagisawa M.M. Halldórsson; K. Iwama; S. Miyazaki; H. Yanagisawa Improved approximation results for the stable marriage problem Improved approximation results for the stable marriage problem ACM Transactions on Algorithms, 3, 3 , 3, 3 ACM Transactions on Algorithms, 3, 3 2007 Refereed English Disclose to all
K. Iwama; S. Miyazaki; K. Okamoto K. Iwama; S. Miyazaki; K. Okamoto A (2 - Clog NN)-approximation algorithm for the stable marriage problem A (2 - Clog NN)-approximation algorithm for the stable marriage problem IEICE Transactions on Information and Systems, E89D, 8, 2380-2387 , E89D, 8, 2380-2387 IEICE Transactions on Information and Systems, E89D, 8, 2380-2387 2006/08 Refereed English Disclose to all
M. Adcock; R. Cleve; K. Iwama; R. Putra; S. Yamashita M. Adcock; R. Cleve; K. Iwama; R. Putra; S. Yamashita Quantum lower bounds for the Goldreich-Levin problem Quantum lower bounds for the Goldreich-Levin problem Information Processing Letters, 97, 5, 208-211 , 97, 5, 208-211 Information Processing Letters, 97, 5, 208-211 2006 Refereed English Disclose to all
H. Ito; K. Iwama; T. Tamura H. Ito; K. Iwama; T. Tamura Efficient methods for determining DNA probe orders Efficient methods for determining DNA probe orders IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1292-1298 , E89-A, 5, 1292-1298 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1292-1298 2006 Refereed English Disclose to all
X. Han; K. Iwama; G. Zhang X. Han; K. Iwama; G. Zhang Online removable square packing Online removable square packing Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3879 LNCS, 216-229 , 3879 LNCS, 216-229 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3879 LNCS, 216-229 2006 Refereed English Disclose to all
K. Iwama K. Iwama Classic and quantum network coding Classic and quantum network coding Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4059 LNCS, 3-4 , 4059 LNCS, 3-4 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4059 LNCS, 3-4 2006 Refereed English Disclose to all
A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita Improved algorithms for quantum identification of boolean oracles Improved algorithms for quantum identification of boolean oracles Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4059 LNCS, 280-291 , 4059 LNCS, 280-291 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4059 LNCS, 280-291 2006 Refereed English Disclose to all
M. Hayashi; K. Iwama; H. Nishimura; R. Raymond; S. Yamashita M. Hayashi; K. Iwama; H. Nishimura; R. Raymond; S. Yamashita (4,1)-Quantum random access coding does not exist - One qubit is not enough to recover one of four bits (4,1)-Quantum random access coding does not exist - One qubit is not enough to recover one of four bits New Journal of Physics, 8 , 8 New Journal of Physics, 8 2006 Refereed English Disclose to all
T. Imamura; K. Iwama; T. Tsukiji T. Imamura; K. Iwama; T. Tsukiji Approximated vertex cover for graphs with perfect matchings Approximated vertex cover for graphs with perfect matchings IEICE Transactions on Information and Systems, E89-D, 8, 2405-2410 , E89-D, 8, 2405-2410 IEICE Transactions on Information and Systems, E89-D, 8, 2405-2410 2006 Refereed English Disclose to all
Y. Hanatani; T. Horiyama; K. Iwama Y. Hanatani; T. Horiyama; K. Iwama Density condensation of Boolean formulas Density condensation of Boolean formulas Discrete Applied Mathematics, 154, 16, 2263-2270 , 154, 16, 2263-2270 Discrete Applied Mathematics, 154, 16, 2263-2270 2006 Refereed English Disclose to all
K. Iwama; R. Raymond; S. Yamashita K. Iwama; R. Raymond; S. Yamashita Query complexity of quantum biased oracles Query complexity of quantum biased oracles Topics in Applied Physics, 102, 19-42 , 102, 19-42 Topics in Applied Physics, 102, 19-42 2006 Refereed English Disclose to all
A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita A. Ambainis; K. Iwama; A. Kawachi; R. Raymond; S. Yamashita Quantum identification of boolean oracles Quantum identification of boolean oracles Topics in Applied Physics, 102, 3- , 102, 3- Topics in Applied Physics, 102, 3- 2006 Refereed English Disclose to all
K. Iwama; H. Morizumi; J. Tarui K. Iwama; H. Morizumi; J. Tarui Negation-limited complexity of parity and inverters Negation-limited complexity of parity and inverters Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4288 LNCS, 223-232 , 4288 LNCS, 223-232 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4288 LNCS, 223-232 2006 Refereed English Disclose to all
T. Horiyama; K. Iwama; J. Kawahara T. Horiyama; K. Iwama; J. Kawahara Finite-state online algorithms and their automated competitive analysis Finite-state online algorithms and their automated competitive analysis Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4288 LNCS, 71-80 , 4288 LNCS, 71-80 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4288 LNCS, 71-80 2006 Refereed English Disclose to all
H. Ito; K. Iwama; Y. Okabe; T. Yoshihiro H. Ito; K. Iwama; Y. Okabe; T. Yoshihiro Single backup table schemes for shortest-path routing Single backup table schemes for shortest-path routing Theoretical Computer Science, 333, 3, 347-353 , 333, 3, 347-353 Theoretical Computer Science, 333, 3, 347-353 2005 Refereed English Disclose to all
H. Fujiwara; K. Iwama H. Fujiwara; K. Iwama Average-case competitive analyses for ski-rental problems Average-case competitive analyses for ski-rental problems Algorithmica (New York), 42, 1, 95-107 , 42, 1, 95-107 Algorithmica (New York), 42, 1, 95-107 2005 Refereed English Disclose to all
K. Iwama; A. Kawachi K. Iwama; A. Kawachi Compact routing with stretch factor of less than three Compact routing with stretch factor of less than three IEICE Transactions on Information and Systems, E88-D, 1, 47-52 , E88-D, 1, 47-52 IEICE Transactions on Information and Systems, E88-D, 1, 47-52 2005 Refereed English Disclose to all
K. Iwama; A. Kawachi; S. Yamashita K. Iwama; A. Kawachi; S. Yamashita Quantum sampling for balanced allocations Quantum sampling for balanced allocations IEICE Transactions on Information and Systems, E88-D, 1, 39-46 , E88-D, 1, 39-46 IEICE Transactions on Information and Systems, E88-D, 1, 39-46 2005 Refereed English Disclose to all
K. Iwama; S. Miyazaki; N. Yamauchi K. Iwama; S. Miyazaki; N. Yamauchi A (2 - c1/√N)-approximation algorithm for the stable marriage problem A (2 - c1/√N)-approximation algorithm for the stable marriage problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827, 902-914 , 3827, 902-914 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827, 902-914 2005 Refereed English Disclose to all
W.W. Bein; K. Iwama; L.L. Larmore; J. Noga W.W. Bein; K. Iwama; L.L. Larmore; J. Noga The delayed k-server problem The delayed k-server problem Lecture Notes in Computer Science, 3623, 281-292 , 3623, 281-292 Lecture Notes in Computer Science, 3623, 281-292 2005 Refereed English Disclose to all
H. Ito; K. Iwama; T. Osumi H. Ito; K. Iwama; T. Osumi Linear-time enumeration of isolated cliques Linear-time enumeration of isolated cliques Lecture Notes in Computer Science, 3669, 119-130 , 3669, 119-130 Lecture Notes in Computer Science, 3669, 119-130 2005 Refereed English Disclose to all
M.M. Halldórsson; K. Iwama; S. Miyazaki; H. Yanagisawa M.M. Halldórsson; K. Iwama; S. Miyazaki; H. Yanagisawa Randomized approximation of the stable marriage problem Randomized approximation of the stable marriage problem Theoretical Computer Science, 325, 3, 439-465 , 325, 3, 439-465 Theoretical Computer Science, 325, 3, 439-465 2004/10/06 Refereed English Disclose to all
K. Iwama; K. Yonezawa K. Iwama; K. Yonezawa The orthogonal CNN problem The orthogonal CNN problem Information Processing Letters, 90, 3, 115-120 , 90, 3, 115-120 Information Processing Letters, 90, 3, 115-120 2004 Refereed English Disclose to all
T. Fujiwara; K. Iwama; C. Iwamoto T. Fujiwara; K. Iwama; C. Iwamoto Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs Journal of Parallel and Distributed Computing, 64, 3, 319-326 , 64, 3, 319-326 Journal of Parallel and Distributed Computing, 64, 3, 319-326 2004 Refereed English Disclose to all
M. Amano; K. Iwama; R.H. Putra M. Amano; K. Iwama; R.H. Putra Exploiting the difference in probability calculation between quantum and probabilistic computations Exploiting the difference in probability calculation between quantum and probabilistic computations IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E87-A, 5, 1004-1011 , E87-A, 5, 1004-1011 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E87-A, 5, 1004-1011 2004 Refereed English Disclose to all
M.M. Halldórsson; R.W. Irving; K. Iwama; D.F. Manlove; S. Miyazaki; Y. Morita; S. Scott M.M. Halldórsson; R.W. Irving; K. Iwama; D.F. Manlove; S. Miyazaki; Y. Morita; S. Scott Approximability results for stable marriage problems with ties Approximability results for stable marriage problems with ties Theoretical Computer Science, 306, 1-3, 431-447 , 306, 1-3, 431-447 Theoretical Computer Science, 306, 1-3, 431-447 2003/09/05 Refereed English Disclose to all
K. Iwama; A. Matsuura; M. Paterson K. Iwama; A. Matsuura; M. Paterson A family of NFAs which need 2<sup>n</sup>-α deterministic states A family of NFAs which need 2<sup>n</sup>-α deterministic states Theoretical Computer Science, 301, 1-3, 451-462 , 301, 1-3, 451-462 Theoretical Computer Science, 301, 1-3, 451-462 2003 Refereed English Disclose to all
K. Amano; K. Iwama; A. Maruoka; K. Matsuo; A. Matsuura K. Amano; K. Iwama; A. Maruoka; K. Matsuo; A. Matsuura Inclusion-exclusion for k-CNF formulas Inclusion-exclusion for k-CNF formulas Information Processing Letters, 87, 2, 111-117 , 87, 2, 111-117 Information Processing Letters, 87, 2, 111-117 2003 Refereed English Disclose to all
H. Ito; K. Iwama; Y. Okabe; T. Yoshihiro H. Ito; K. Iwama; Y. Okabe; T. Yoshihiro Avoiding Routing Loops on the Internet Avoiding Routing Loops on the Internet Theory of Computing Systems, 36, 6, 597-609 , 36, 6, 597-609 Theory of Computing Systems, 36, 6, 597-609 2003 Refereed English Disclose to all
K. Iwama; A. Matsuura K. Iwama; A. Matsuura Solving SAT efficiently with promises Solving SAT efficiently with promises IEICE Transactions on Information and Systems, E86-D, 2, 213-218 , E86-D, 2, 213-218 IEICE Transactions on Information and Systems, E86-D, 2, 213-218 2003 Refereed English Disclose to all
K. Iwama; S. Yamashita K. Iwama; S. Yamashita Transformation Rules for CNOT-based Quantum Circuits and Their Applications Transformation Rules for CNOT-based Quantum Circuits and Their Applications New Generation Computing, 21, 4, 297-317 , 21, 4, 297-317 New Generation Computing, 21, 4, 297-317 2003 Refereed English Disclose to all
K. Iwama; A. Kawachi K. Iwama; A. Kawachi A New Quantum Claw-finding Algorithm for Three Functions A New Quantum Claw-finding Algorithm for Three Functions New Generation Computing, 21, 4, 319-327 , 21, 4, 319-327 New Generation Computing, 21, 4, 319-327 2003 Refereed English Disclose to all
M.M. Halldórsson; K. Iwama; S. Miyazaki; S. Taketomi M.M. Halldórsson; K. Iwama; S. Miyazaki; S. Taketomi Online independent sets Online independent sets Theoretical Computer Science, 289, 2, 953-962 , 289, 2, 953-962 Theoretical Computer Science, 289, 2, 953-962 2002/10/30 Refereed English Disclose to all
D.F. Manlove; R.W. Irving; K. Iwama; S. Miyazaki; Y. Morita D.F. Manlove; R.W. Irving; K. Iwama; S. Miyazaki; Y. Morita Hard variants of stable marriage Hard variants of stable marriage Theoretical Computer Science, 276, 1-2, 261-279 , 276, 1-2, 261-279 Theoretical Computer Science, 276, 1-2, 261-279 2002/04/06 Refereed English Disclose to all
K. Iwama; S. Yamashita K. Iwama; S. Yamashita A complete set of transformation rules for quantum Boolean circuits with CNOT gates A complete set of transformation rules for quantum Boolean circuits with CNOT gates Superlattices and Microstructures, 31, 2-4, 181-192 , 31, 2-4, 181-192 Superlattices and Microstructures, 31, 2-4, 181-192 2002 Refereed English Disclose to all
Y. Asahiro; R. Hassin; K. Iwama Y. Asahiro; R. Hassin; K. Iwama Complexity of finding dense subgraphs Complexity of finding dense subgraphs Discrete Applied Mathematics, 121, 1-3, 15-26 , 121, 1-3, 15-26 Discrete Applied Mathematics, 121, 1-3, 15-26 2002 Refereed English Disclose to all
H. Fujiwara; K. Iwama H. Fujiwara; K. Iwama Average-case competitive analyses for ski-rental problems Average-case competitive analyses for ski-rental problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518 LNCS, 476-488 , 2518 LNCS, 476-488 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518 LNCS, 476-488 2002 Refereed English Disclose to all
K. Iwama; E. Miyano; S. Tajima; H. Tamaki K. Iwama; E. Miyano; S. Tajima; H. Tamaki Efficient randomized routing algorithms on the two-dimensional mesh of buses Efficient randomized routing algorithms on the two-dimensional mesh of buses Theoretical Computer Science, 261, 2, 227-239 , 261, 2, 227-239 Theoretical Computer Science, 261, 2, 227-239 2001 Refereed English Disclose to all
K. Iwama; E. Miyano K. Iwama; E. Miyano A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes Journal of Algorithms, 39, 2, 145-161 , 39, 2, 145-161 Journal of Algorithms, 39, 2, 145-161 2001 Refereed English Disclose to all
K. Iwama; E. Miyano K. Iwama; E. Miyano An O(√N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size An O(√N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size Journal of Algorithms, 41, 2, 262-279 , 41, 2, 262-279 Journal of Algorithms, 41, 2, 262-279 2001 Refereed English Disclose to all
K. Iwama; S. Tamaki K. Iwama; S. Tamaki Exploiting partial knowledge of satisfying assignments Exploiting partial knowledge of satisfying assignments Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2141 LNCS, 118-128 , 2141 LNCS, 118-128 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2141 LNCS, 118-128 2001 Refereed English Disclose to all
K. Iwama; Y. Kambayashi; E. Miyano K. Iwama; Y. Kambayashi; E. Miyano New bounds for oblivious mesh routing New bounds for oblivious mesh routing Journal of Graph Algorithms and Applications, 5, 5, 17-38 , 5, 5, 17-38 Journal of Graph Algorithms and Applications, 5, 5, 17-38 2001 Refereed English Disclose to all
K. Iwama; Y. Kambayashi; K. Takaki K. Iwama; Y. Kambayashi; K. Takaki Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs Theoretical Computer Science, 237, 1-2, 485-494 , 237, 1-2, 485-494 Theoretical Computer Science, 237, 1-2, 485-494 2000 Refereed English Disclose to all
K. Iwama; E. Miyano K. Iwama; E. Miyano Oblivious Routing Algorithms on the Mesh of Buses Oblivious Routing Algorithms on the Mesh of Buses Journal of Parallel and Distributed Computing, 60, 2, 137-149 , 60, 2, 137-149 Journal of Parallel and Distributed Computing, 60, 2, 137-149 2000 Refereed English Disclose to all
Y. Asahiro; K. Iwama; H. Tamaki; T. Tokuyama Y. Asahiro; K. Iwama; H. Tamaki; T. Tokuyama Greedily Finding a Dense Subgraph Greedily Finding a Dense Subgraph Journal of Algorithms, 34, 2, 203-221 , 34, 2, 203-221 Journal of Algorithms, 34, 2, 203-221 2000 Refereed English Disclose to all
K. Iwama; E. Miyano K. Iwama; E. Miyano Recent developments in mesh routing algorithms Recent developments in mesh routing algorithms IEICE Transactions on Information and Systems, E83-D, 3, 530-540 , E83-D, 3, 530-540 IEICE Transactions on Information and Systems, E83-D, 3, 530-540 2000 Refereed English Disclose to all
S. Miyazaki; K. Iwama S. Miyazaki; K. Iwama Approximation of coNP Sets by NP-complete Sets and Its Applications Approximation of coNP Sets by NP-complete Sets and Its Applications Systems and Computers in Japan, 30, 7, 47-53 , 30, 7, 47-53 Systems and Computers in Japan, 30, 7, 47-53 1999 Refereed English Disclose to all
J. Ma; S. Ma; I. Kazuo; Q. Gu J. Ma; S. Ma; I. Kazuo; Q. Gu A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs Acta Mathematicae Applicatae Sinica, 15, 3, 303-309 , 15, 3, 303-309 Acta Mathematicae Applicatae Sinica, 15, 3, 303-309 1999 Refereed English Disclose to all
K. Iwama; E. Miyano K. Iwama; E. Miyano Better approximations of non-Hamiltonian graphs Better approximations of non-Hamiltonian graphs Discrete Applied Mathematics, 81, 1-3, 239-261 , 81, 1-3, 239-261 Discrete Applied Mathematics, 81, 1-3, 239-261 1998 Refereed English Disclose to all
K. Iwama; C. Iwamoto K. Iwama; C. Iwamoto A Canonical Form of Vector Machines A Canonical Form of Vector Machines Information and Computation, 141, 1, 37-65 , 141, 1, 37-65 Information and Computation, 141, 1, 37-65 1998 Refereed English Disclose to all
K. Iwama; C. Iwamoto; T. Ohsawa K. Iwama; C. Iwamoto; T. Ohsawa A faster parallel algorithm for k-connectivity A faster parallel algorithm for k-connectivity Information Processing Letters, 61, 5, 265-269 , 61, 5, 265-269 Information Processing Letters, 61, 5, 265-269 1997 Refereed English Disclose to all
Jun Ma; Iwama Kazuo; Shaohan Ma Jun Ma; Iwama Kazuo; Shaohan Ma Parallel algorithms for finding cycles in undirected graphs Parallel algorithms for finding cycles in undirected graphs Ruan Jian Xue Bao/Journal of Software, 8, 6, 475-480 , 8, 6, 475-480 Ruan Jian Xue Bao/Journal of Software, 8, 6, 475-480 1997 Refereed English Disclose to all
M. Morshed; C. Iwamoto; K. Iwama M. Morshed; C. Iwamoto; K. Iwama A hierarchy of time-complexities based on CRCW PRAMs A hierarchy of time-complexities based on CRCW PRAMs Research Reports on Information Science and Electrical Engineering of Kyushu University, 2, 2, 265-269 , 2, 2, 265-269 Research Reports on Information Science and Electrical Engineering of Kyushu University, 2, 2, 265-269 1997 Refereed English Disclose to all
K. Iwama; K. Hino; H. Kurokawa; S. Sawada K. Iwama; K. Hino; H. Kurokawa; S. Sawada Generating random benchmark circuits with restricted fan-ins Generating random benchmark circuits with restricted fan-ins IEICE Transactions on Information and Systems, E80-D, 10, 1009-1016 , E80-D, 10, 1009-1016 IEICE Transactions on Information and Systems, E80-D, 10, 1009-1016 1997 Refereed English Disclose to all
K. Iwama; E. Miyano; Y. Kambayashi K. Iwama; E. Miyano; Y. Kambayashi Routing Problems on the Mesh of Buses Routing Problems on the Mesh of Buses Journal of Algorithms, 20, 3, 613-631 , 20, 3, 613-631 Journal of Algorithms, 20, 3, 613-631 1996 Refereed English Disclose to all
K. Iwama; C. Iwamoto; M. Morshed K. Iwama; C. Iwamoto; M. Morshed Time lower bounds do not exist for CRCW PRAMs Time lower bounds do not exist for CRCW PRAMs Theoretical Computer Science, 155, 2, 411-424 , 155, 2, 411-424 Theoretical Computer Science, 155, 2, 411-424 1996 Refereed English Disclose to all
K. Iwama; C. Iwamoto K. Iwama; C. Iwamoto α-Connectivity: A gradually nonparallel graph problem α-Connectivity: A gradually nonparallel graph problem Journal of Algorithms, 20, 3, 526-544 , 20, 3, 526-544 Journal of Algorithms, 20, 3, 526-544 1996 Refereed English Disclose to all
K. Iwama; Y. Kambayashi K. Iwama; Y. Kambayashi A Simpler Parallel Algorithm for Graph Connectivity A Simpler Parallel Algorithm for Graph Connectivity Journal of Algorithms, 16, 2, 190-217 , 16, 2, 190-217 Journal of Algorithms, 16, 2, 190-217 1994 Refereed English Disclose to all
Kazuo Iwama; Shuichi Miyazaki Kazuo Iwama; Shuichi Miyazaki SAT-variable complexity of hard combinatorial problems SAT-variable complexity of hard combinatorial problems IFIP Transactions A: Computer Science and Technology, 51, 253-258 , 51, 253-258 IFIP Transactions A: Computer Science and Technology, 51, 253-258 1994 Refereed English Disclose to all
Kazuo Iwama Kazuo Iwama Space(o(log log n)) is regular Space(o(log log n)) is regular SIAM Journal on Computing, 22, 1, 136-146 , 22, 1, 136-146 SIAM Journal on Computing, 22, 1, 136-146 1993 Refereed English Disclose to all
Chuzo Iwamoto; Kazuo Iwama Chuzo Iwamoto; Kazuo Iwama RS-vector algorithms for combinational problems RS-vector algorithms for combinational problems Systems and Computers in Japan, 24, 7, 41-51 , 24, 7, 41-51 Systems and Computers in Japan, 24, 7, 41-51 1993 Refereed English Disclose to all
Kazuo Iwama Kazuo Iwama CNF satisfiability test by counting and polynomial average time CNF satisfiability test by counting and polynomial average time SIAM Journal on Computing, 18, 2, 385-391 , 18, 2, 385-391 SIAM Journal on Computing, 18, 2, 385-391 1989 Refereed English Disclose to all
K. Iwama K. Iwama The universe problem for unrestricted flow languages The universe problem for unrestricted flow languages Acta Informatica, 19, 1, 85-96 , 19, 1, 85-96 Acta Informatica, 19, 1, 85-96 1983 Refereed English Disclose to all
Koichi Goto; Kosaku Inagaki; Masaru Tsukamoto; Masatoshi Yoshikawa; Shuzo Yajima; Kazuo Iwama Koichi Goto; Kosaku Inagaki; Masaru Tsukamoto; Masatoshi Yoshikawa; Shuzo Yajima; Kazuo Iwama COMPUTER COMMUNICATION CONTROL TECHNIQUE FOR VIRTUALIZATION OF NETWORK MEMORY RESOURCES AND ITS IMPLEMENTATION. COMPUTER COMMUNICATION CONTROL TECHNIQUE FOR VIRTUALIZATION OF NETWORK MEMORY RESOURCES AND ITS IMPLEMENTATION. Journal of Information Processing, 3, 4, 217-225 , 3, 4, 217-225 Journal of Information Processing, 3, 4, 217-225 1981 Refereed English Disclose to all
Kazuo Iwama; Yahiko Kambayashi; Shuzo Yajima Kazuo Iwama; Yahiko Kambayashi; Shuzo Yajima EQUIVALENCE PROBLEM FOR PARTIALLY AUTONOMOUS FINITE AUTOMATA. EQUIVALENCE PROBLEM FOR PARTIALLY AUTONOMOUS FINITE AUTOMATA. Systems, computers, controls, 11, 2, 27-35 , 11, 2, 27-35 Systems, computers, controls, 11, 2, 27-35 1980 Refereed English Disclose to all
Kazuo Iwama; Yahiko Kambayashi; Shuzo Yajima Kazuo Iwama; Yahiko Kambayashi; Shuzo Yajima COMPUTER COMMUNICATION INTERFACES BASED ON TWO-INPUT/OUTPUT-PAIR AUTOMATA AND THEIR IMPLEMENTATION IN THE LABOLINK NETWORK. COMPUTER COMMUNICATION INTERFACES BASED ON TWO-INPUT/OUTPUT-PAIR AUTOMATA AND THEIR IMPLEMENTATION IN THE LABOLINK NETWORK. , 149-154 , 149-154 , 149-154 1978 Refereed English Disclose to all
Shuzo Yajima; Yahiko Kambayashi; Susumu Yoshida; Kazuo Iwama Shuzo Yajima; Yahiko Kambayashi; Susumu Yoshida; Kazuo Iwama LABOLINK: AN OPTICALLY LINKED LABORATORY COMPUTER NETWORK. LABOLINK: AN OPTICALLY LINKED LABORATORY COMPUTER NETWORK. Computer, 10, 11, 52-59 , 10, 11, 52-59 Computer, 10, 11, 52-59 1977 Refereed English Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
井下貴雄,Robert W. Irving,宮崎修一,岩間一雄,永瀬高志 井下貴雄,Robert W. Irving,宮崎修一,岩間一雄,永瀬高志 “ 希望リスト変更による男性最良安定マッチン グの改善” “ 希望リスト変更による男性最良安定マッチン グの改善” 電子情報通信学会2013 年総合大会DS-1-1,2013 年3 月19 日. 電子情報通信学会2013 年総合大会DS-1-1,2013 年3 月19 日. 2013 Refereed Japanese Disclose to all
山内直哉,宮崎修一,岩間一雄 山内直哉,宮崎修一,岩間一雄 安定結婚問題に対する1.8-近似アルゴリズム 安定結婚問題に対する1.8-近似アルゴリズム 電子情報通信学会 総合大会DS-1-3, 2007-3. 電子情報通信学会 総合大会DS-1-3, 2007-3. 2007 Refereed Japanese Disclose to all
岩間 一雄 岩間 一雄 今井量子計算機構プロジェクト 今井量子計算機構プロジェクト 科学技術振興事業団 戦略的基礎研究推進事業(CREST) 創造科学技術推進事業(EROTO) 科学技術振興事業団 戦略的基礎研究推進事業(CREST) 創造科学技術推進事業(EROTO) Refereed Japanese Disclose to all
K. Iwama; Y. Yoshida K. Iwama; Y. Yoshida Parameterized testability Parameterized testability ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science, 507-516 , 507-516 ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science, 507-516 2014 Refereed English Disclose to all
K. Iwama; S. Miyazaki; H. Yanagisawa K. Iwama; S. Miyazaki; H. Yanagisawa Improved approximation bounds for the student-project allocation problem with preferences over projects Improved approximation bounds for the student-project allocation problem with preferences over projects Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6648 LNCS, 440-451 , 6648 LNCS, 440-451 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6648 LNCS, 440-451 2011 Refereed English Disclose to all
D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku Verifying Nash equilibria in PageRank games on undirected web graphs Verifying Nash equilibria in PageRank games on undirected web graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 415-424 , 7074 LNCS, 415-424 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 415-424 2011 Refereed English Disclose to all
K. Hamada; K. Iwama; S. Miyazaki K. Hamada; K. Iwama; S. Miyazaki The hospitals/residents problem with quota lower bounds The hospitals/residents problem with quota lower bounds Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6942 LNCS, 180-191 , 6942 LNCS, 180-191 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6942 LNCS, 180-191 2011 Refereed English Disclose to all
K. Iwama; S. Miyazaki; H. Yanagisawa K. Iwama; S. Miyazaki; H. Yanagisawa Approximation algorithms for the sex-equal stable marriage problem Approximation algorithms for the sex-equal stable marriage problem ACM Transactions on Algorithms, 7, 1 , 7, 1 ACM Transactions on Algorithms, 7, 1 2010/11 Refereed English Disclose to all
K. Iwama; H. Nishimura; R. Raymond; J. Teruyama K. Iwama; H. Nishimura; R. Raymond; J. Teruyama Quantum counterfeit coin problems Quantum counterfeit coin problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506 LNCS, PART 1, 85-96 , 6506 LNCS, PART 1, 85-96 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506 LNCS, PART 1, 85-96 2010 Refereed English Disclose to all
K. Iwama; K. Seto; T. Takai; S. Tamaki K. Iwama; K. Seto; T. Takai; S. Tamaki Improved randomized algorithms for 3-SAT Improved randomized algorithms for 3-SAT Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506 LNCS, PART 1, 73-84 , 6506 LNCS, PART 1, 73-84 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506 LNCS, PART 1, 73-84 2010 Refereed English Disclose to all
K. Iwama; S. Miyazaki; H. Yanagisawa K. Iwama; S. Miyazaki; H. Yanagisawa A 25/17-approximation algorithm for the stable marriage problem with one-sided ties A 25/17-approximation algorithm for the stable marriage problem with one-sided ties Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6347 LNCS, PART 2, 135-146 , 6347 LNCS, PART 2, 135-146 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6347 LNCS, PART 2, 135-146 2010 Refereed English Disclose to all
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama Quantum Counterfeit Coin Problems Quantum Counterfeit Coin Problems Quantum Counterfeit Coin Problems CoRR abs/1009.0416 Quantum Counterfeit Coin Problems CoRR abs/1009.0416 2010 Refereed English Disclose to all
Rusins Freivalds, Kazuo Iwama Rusins Freivalds, Kazuo Iwama Quantum Queries on Permutations with a Promise Quantum Queries on Permutations with a Promise CIAA CIAA 2009 Refereed English Disclose to all
T. Horiyama; K. Iwama; H. Ito; J. Kawahara T. Horiyama; K. Iwama; H. Ito; J. Kawahara Enumeration of Tsume-Shogi diagrams by the reverse method Enumeration of Tsume-Shogi diagrams by the reverse method Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008, 193-196 , 193-196 Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008, 193-196 2008 Refereed English Disclose to all
K. Iwama; S. Miyazaki K. Iwama; S. Miyazaki A survey of the stable marriage problem and its variants A survey of the stable marriage problem and its variants Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008, 131-136 , 131-136 Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008, 131-136 2008 Refereed English Disclose to all
Iwama. K., Miyazaki. S., Okamoto. K., Iwama. K., Miyazaki. S., Okamoto. K., Inapproximability of Stable Roommates Problem with Triple Room Inapproximability of Stable Roommates Problem with Triple Room Proc. 1st Asian Association for Algorithms and Computation (AAAC), p.30, 2008-4. Proc. 1st Asian Association for Algorithms and Computation (AAAC), p.30, 2008-4. 2008 Refereed English Disclose to all
H. Fujiwara; K. Iwama; K. Yonezawa H. Fujiwara; K. Iwama; K. Yonezawa Online chasing problems for regular n-gons Online chasing problems for regular n-gons 2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007, 36-41 , 36-41 2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007, 36-41 2007 Refereed English Disclose to all
J.-J. Chen; K. Iwama; T.-W. Kuo; H.-I. Lu J.-J. Chen; K. Iwama; T.-W. Kuo; H.-I. Lu Flow time minimization under energy constraints Flow time minimization under energy constraints Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, 866-871 , 866-871 Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, 866-871 2007 Refereed English Disclose to all
Iwama, K., Miyazaki, S. and Okamoto, K. Iwama, K., Miyazaki, S. and Okamoto, K. “Stable Roommates Problem with Triple Rooms," “Stable Roommates Problem with Triple Rooms," Proc. 10th KOREAJAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), pp. 105-112 Proc. 10th KOREAJAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), pp. 105-112 2007 Refereed English Disclose to all
Iwama K., Miyazaki S. and Yanagisawa H. Iwama K., Miyazaki S. and Yanagisawa H. “Approximation Algorithms for the Sc χ-Equal Stable Marriage Problem," “Approximation Algorithms for the Sc χ-Equal Stable Marriage Problem," Proc. 10th Workshop on Algorithms and Data Structures (WADS 2007), (Lecture Notes in Computer Science 4619), pp. 201-213 Proc. 10th Workshop on Algorithms and Data Structures (WADS 2007), (Lecture Notes in Computer Science 4619), pp. 201-213 2007 Refereed English Disclose to all
M. Hayashi; K. Iwama; H. Nishimura; R. Raymond; S. Yamashita M. Hayashi; K. Iwama; H. Nishimura; R. Raymond; S. Yamashita (4, 1)-Quantum random access coding does not exist (4, 1)-Quantum random access coding does not exist IEEE International Symposium on Information Theory - Proceedings, 446-450 , 446-450 IEEE International Symposium on Information Theory - Proceedings, 446-450 2006 Refereed English Disclose to all
K. Iwama K. Iwama Classic and quantum network coding Classic and quantum network coding Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, 2005, 10- , 2005, 10- Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, 2005, 10- 2005 Refereed English Disclose to all
T. Imamura; K. Iwama T. Imamura; K. Iwama Approximating vertex cover on dense graphs Approximating vertex cover on dense graphs Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 582-589 , 582-589 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 582-589 2005 Refereed English Disclose to all
K. Iwama; S. Tamaki K. Iwama; S. Tamaki Improved Upper Bounds for 3-SAT Improved Upper Bounds for 3-SAT Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 15, 321-322 , 15, 321-322 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 15, 321-322 2004 Refereed English Disclose to all
K. Iwama; Y. Kambayashi; S. Yamashita K. Iwama; Y. Kambayashi; S. Yamashita Transformation rules for designing CNOT-based quantum circuits Transformation rules for designing CNOT-based quantum circuits Proceedings - Design Automation Conference, 419-424 , 419-424 Proceedings - Design Automation Conference, 419-424 2002 Refereed English Disclose to all
K. Iwama; M. Okita K. Iwama; M. Okita Brief announcement: Compact routing for average-case networks Brief announcement: Compact routing for average-case networks Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 255- , 255- Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 255- 2002 Refereed English Disclose to all
Kazuo Iwama; Eiji Miyano Kazuo Iwama; Eiji Miyano (2.954+ε)n oblivious routing algorithm on 2D meshes (2.954+ε)n oblivious routing algorithm on 2D meshes Annual ACM Symposium on Parallel Algorithms and Architectures, 186-195 , 186-195 Annual ACM Symposium on Parallel Algorithms and Architectures, 186-195 2000 Refereed English Disclose to all
Masami Amano; Kazuo Iwama Masami Amano; Kazuo Iwama Undecidability on quantum finite automata Undecidability on quantum finite automata Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 368-375 , 368-375 Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 368-375 1999 Refereed English Disclose to all
Kazuo Iwama; Eiji Miyano Kazuo Iwama; Eiji Miyano O(√N) oblivious routing algorithm for 2-D meshes of constant queue-size O(√N) oblivious routing algorithm for 2-D meshes of constant queue-size Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 466-475 , 466-475 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 466-475 1999 Refereed English Disclose to all
Jun Ma; Kazuo Iwama; Tadao Takaoka; Qian-Ping Gu Jun Ma; Kazuo Iwama; Tadao Takaoka; Qian-Ping Gu Efficient parallel and distributed topological sort algorithms Efficient parallel and distributed topological sort algorithms Aizu International Symposium on Parallel Algorithms/Architecture Synthesis, 378-383 , 378-383 Aizu International Symposium on Parallel Algorithms/Architecture Synthesis, 378-383 1997 Refereed English Disclose to all
Kazuo Iwama; Kensuke Hino; Hiroyuki Kurokawa; Sunao Sawada Kazuo Iwama; Kensuke Hino; Hiroyuki Kurokawa; Sunao Sawada Random benchmark circuits with controlled attributes Random benchmark circuits with controlled attributes Proceedings of European Design and Test Conference, 90-97 , 90-97 Proceedings of European Design and Test Conference, 90-97 1997 Refereed English Disclose to all
Byungki Cha; Kazuo Iwama; Yahiko Kambayashi; Shuichi Miyazaki Byungki Cha; Kazuo Iwama; Yahiko Kambayashi; Shuichi Miyazaki Local search algorithms for partial MAXSAT Local search algorithms for partial MAXSAT Proceedings of the National Conference on Artificial Intelligence, 263-268 , 263-268 Proceedings of the National Conference on Artificial Intelligence, 263-268 1997 Refereed English Disclose to all
Kazuo Iwama; Chuzo Iwamoto Kazuo Iwama; Chuzo Iwamoto Parallel complexity hierarchies based on PRAMs and DLOGTIME-uniform circuits Parallel complexity hierarchies based on PRAMs and DLOGTIME-uniform circuits Proceedings of the Annual IEEE Conference on Computational Complexity, 24-32 , 24-32 Proceedings of the Annual IEEE Conference on Computational Complexity, 24-32 1996 Refereed English Disclose to all
Byungki Cha; Kazuo Iwama Byungki Cha; Kazuo Iwama Adding new clauses for faster local search Adding new clauses for faster local search Proceedings of the National Conference on Artificial Intelligence, 1, 332-337 , 1, 332-337 Proceedings of the National Conference on Artificial Intelligence, 1, 332-337 1996 Refereed English Disclose to all
Kazuo Iwama; Eiji Miyano Kazuo Iwama; Eiji Miyano Intractability of read-once resolution Intractability of read-once resolution Proceedings of the IEEE Annual Structure in Complexity Theory Conference, 29-36 , 29-36 Proceedings of the IEEE Annual Structure in Complexity Theory Conference, 29-36 1995 Refereed English Disclose to all
Kazuo Iwama; Kensuke Hino Kazuo Iwama; Kensuke Hino Random generation of test instances for logic optimizers Random generation of test instances for logic optimizers Proceedings - Design Automation Conference, 430-434 , 430-434 Proceedings - Design Automation Conference, 430-434 1994 Refereed English Disclose to all
Kazuo Iwama Kazuo Iwama UNIQUE DECOMPOSABILITY OF SHUFFLED STRINGS: A FORMAL TREATMENT OF ASYNCHRONOUS TIME-MULTIPLEXED COMMUNICATION. UNIQUE DECOMPOSABILITY OF SHUFFLED STRINGS: A FORMAL TREATMENT OF ASYNCHRONOUS TIME-MULTIPLEXED COMMUNICATION. Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 374-381 , 374-381 Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 374-381 1983 Refereed English Disclose to all
Kazuo Iwama Kazuo Iwama ON EQUATIONS INCLUDING STRING VARIABLES. ON EQUATIONS INCLUDING STRING VARIABLES. Annual Symposium on Foundations of Computer Science - Proceedings, 226-235 , 226-235 Annual Symposium on Foundations of Computer Science - Proceedings, 226-235 1982 Refereed English Disclose to all

  • <<
  • >>
Title language:
Books etc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Publisher Publisher(Japanese) Publisher(English) Publication date Language Type Disclose
岩間一雄 岩間一雄 アルゴリズム・サイエンス: 出口からの超入門 アルゴリズム・サイエンス: 出口からの超入門 共立出版 共立出版 2006 Japanese Disclose to all
岩間一雄 岩間一雄 オートマトン・言語と計算理論 (電子情報通信レクチャーシリーズ B-6) オートマトン・言語と計算理論 (電子情報通信レクチャーシリーズ B-6) コロナ社 コロナ社 2003 Japanese Disclose to all
岩間一雄 岩間一雄 アルゴリズム理論入門 (情報系教科書シリーズ 4) アルゴリズム理論入門 (情報系教科書シリーズ 4) 昭晃堂 昭晃堂 2001 Japanese Disclose to all
Title language:
Awards
Title(Japanese) Title(English) Organization name(Japanese) Organization name(English) Date
電子情報通信学会 フェロー,9 2005
日本学術会議 連携会員,9 2006
猪瀬賞 電子情報通信学会 2007/05
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
特定領域研究 Representative 新世代の計算限界 -その解明と打破- -
基盤研究(B) 実世界組み合わせ問題に対する実行可能近似解の高速探索 1998-1998
特定領域研究 適応化と確立化による高速ラウティングアルゴリズムの開発 1998-1998
基盤研究(B) 高速SAT アルゴリズムを利用した実世界組合せ問題の統一的解法 1998-1998
特定領域研究 適応化と確率化による高速ラウティングアルゴリズムの開発 1999-1999
基盤研究(B) 高速SAT アルゴリズムを利用した実世界組合わせ問題の統一的解法 1999-1999
基盤研究(B) 実世界組み合せ問題に対する実行可能近似解の高速探索 1999-1999
基盤研究(B) 実世界組み合わせ問題に対する実行可能近似解の高速探索 2000-2000
基盤研究(B) 工学的評価基準による離散アルゴリズムの高品質化に 関する研究 2001-2001
基盤研究(B) 工学的評価基準による離散アルゴリズムの高品質化に 関する研究 2002-2002
基盤研究(C) 離散アルゴリズムの品質保証技術に関する調査と新し い展開 2003-2003
基盤研究(B) 工学的評価基準に基づく離散アルゴリズムの品質保証技術に関す る研究 2004-2004
基盤研究(B) 工学的評価基準に基づく離散アルゴリズムの品質保証技術に関す る研究 2005-2005
特定領域研究 新世代の計算限界―その解明と打破― 2006-2006
基盤研究(B) 工学的評価基準に基づく離散アルゴリズムの品質保証技術に関す る研究 2006-2006
基盤研究(A) 情報補填を可能にするアルゴリズムの設計と解析 2007-2010
特定領域研究 新世代の計算限界─その解明と打破─ 2008-2008
基盤研究(A) 空間的な情報補填を可能にするアルゴリズムの研究 2010-2012
基盤研究(A) 空間的な情報補填を可能にするアルゴリズムの研究 2011-2011
基盤研究(A) Representative データの巨大化から生じる不完全情報への対処に主眼をおいた近似計算 2013-2015
基盤研究(A) Representative データの巨大化から生じる不完全情報への対処に主眼をおいた近似計算 (平成26年度分) 2014/04/01-2015/03/31

  • <<
  • >>
External funds: other than those above
System Main person Title(Japanese) Title(English) Period
外部機関との協力事業 ○科学技術庁関係 科学技術振興事業団(ERATO)創造科学技術推進事業 「今井量子計算機構」 平成12 年後半より5 年間-平成12 年後半より5 年間
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
Advanced Study in CCE I 通年 情報学研究科 2011/04-2012/03
Advanced Study in CCE II 通年 情報学研究科 2011/04-2012/03
アルゴリズム論 後期 工学部 2011/04-2012/03
言語・オートマトン 後期 工学部 2011/04-2012/03
通信情報システム特別研究1 通年 情報学研究科 2011/04-2012/03
通信情報システム特別研究1 前期集中 情報学研究科 2011/04-2012/03
通信情報システム特別研究2 通年 情報学研究科 2011/04-2012/03
通信情報システム特別研究2 後期集中 情報学研究科 2011/04-2012/03
Theory of Computational Complexity 後期 情報学研究科 2011/04-2012/03
Theory of Discrete Algorithms 前期 情報学研究科 2011/04-2012/03
コンピュータ工学特別セミナー 通年 情報学研究科 2011/04-2012/03
通信情報システム特別セミナー 通年 情報学研究科 2011/04-2012/03
Perspective in Informatics 4B 後期 情報学研究科 2011/04-2012/03
Perspective in Informatics 4B Perspective in Informatics 4B 後期 情報学研究科 2012/04-2013/03
Theory of Computational Complexity Theory of Computational Complexity 後期 情報学研究科 2012/04-2013/03
Theory of Discrete Algorithms Theory of Discrete Algorithms 前期 情報学研究科 2012/04-2013/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2012/04-2013/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2012/04-2013/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2012/04-2013/03
言語・オートマトン Languages and Automata 後期 工学部 2012/04-2013/03
計算機科学概論 Introduction to Computer Science 前期 全学共通科目 2012/04-2013/03
計算機科学概論 Introduction to Computer Science 前期 工学部 2012/04-2013/03
アルゴリズム論 Theory of Algorithms 後期 工学部 2012/04-2013/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 後期集中 情報学研究科 2012/04-2013/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2012/04-2013/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 前期集中 情報学研究科 2012/04-2013/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 後期前期 情報学研究科 2012/04-2013/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2012/04-2013/03
アルゴリズム論 Theory of Algorithms 後期 工学部 2013/04-2014/03
言語・オートマトン Languages and Automata 後期 工学部 2013/04-2014/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2013/04-2014/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2013/04-2014/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 前期集中 情報学研究科 2013/04-2014/03
Theory of Computational Complexity Theory of Computational Complexity 後期 情報学研究科 2013/04-2014/03
Theory of Discrete Algorithms Theory of Discrete Algorithms 前期 情報学研究科 2013/04-2014/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2013/04-2014/03
通信情報システム特別セミナー Seminar on Communications and Computer Engineering, Advanced 通年 情報学研究科 2013/04-2014/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2013/04-2014/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2013/04-2014/03
アルゴリズム論 Theory of Algorithms 後期 工学部 2014/04-2015/03
言語・オートマトン Languages and Automata 後期 工学部 2014/04-2015/03
計算機科学概論 Introduction to Computer Science 前期 工学部 2014/04-2015/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2014/04-2015/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2014/04-2015/03
Theory of Computational Complexity Theory of Computational Complexity 後期 情報学研究科 2014/04-2015/03
Theory of Discrete Algorithms Theory of Discrete Algorithms 前期 情報学研究科 2014/04-2015/03
通信情報システム特別セミナー Seminar on Communications and Computer Engineering, Advanced 通年 情報学研究科 2014/04-2015/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2014/04-2015/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2014/04-2015/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2014/04-2015/03
計算機科学概論 Introduction to Computer Science 前期 全学共通科目 2014/04-2015/03
Introduction to Contemporary Algorithms Introduction to Contemporary Algorithms 前期 全学共通科目 2014/04-2015/03
Advanced Study in CCE I Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2014/04-2015/03
Advanced Study in CCE II Advanced Study in Communications and Computer Engineering II 後期前期 情報学研究科 2014/04-2015/03
Advanced Study in CCE II Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2014/04-2015/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 後期前期 情報学研究科 2014/04-2015/03
Advanced Study in CCE I Advanced Study in Communications and Computer Engineering I 前期集中 情報学研究科 2015/04-2016/03
Advanced Study in CCE I Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2015/04-2016/03
Advanced Study in CCE II Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2015/04-2016/03
Introduction to Contemporary Algorithms Introduction to Contemporary Algorithms 前期 全学共通科目 2015/04-2016/03
Theory of Computational Complexity Theory of Computational Complexity 後期 情報学研究科 2015/04-2016/03
Theory of Discrete Algorithms Theory of Discrete Algorithms 前期 情報学研究科 2015/04-2016/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2015/04-2016/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2015/04-2016/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2015/04-2016/03
言語・オートマトン Languages and Automata 後期 工学部 2015/04-2016/03
アルゴリズム論 Theory of Algorithms 後期 工学部 2015/04-2016/03
通信情報システム特別セミナー Seminar on Communications and Computer Engineering, Advanced 通年 情報学研究科 2015/04-2016/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 後期集中 情報学研究科 2015/04-2016/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2015/04-2016/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2015/04-2016/03

  • <<
  • >>
School management (title, position)
Title Period
オープンキャンパス委員会 委員 2010/04/01-2011/03/31
Faculty management (title, position)
Title Period
基盤整備委員会委員 2011/04/01-2012/03/31
G30WG委員 2011/04/01-2012/03/31
基盤整備委員会委員 2012/04/01-2013/03/31
図書WG委員長 2012/04/01-2013/03/31
G30WG委員長 2012/04/01-2013/03/31
基盤整備委員会委員 2013/04/01-2014/03/31
G30WG委員長 2013/04/01-2014/03/31
企画委員会委員 2014/04/01-2015/03/31
企画委員会委員 2015/04/01-2016/03/31