98F 98S 99 00 01 02 03 04 05 06 07
No Articles
98F 98S 99 00 01 02 03 04 05 06 07
宮崎修一, 岩間一雄
NP完全集合によるcoNP集合の近似とその応用について
電子情報通信学会論文誌, J81-D-I, 677-684
98 99F 99S 00 01 02 03 04 05 06 07
No Articles
98 99F 99S 00 01 02 03 04 05 06 07
Miyazaki S., Iwama K.
Approximation of coNP Sets by NP-complete Sets and Its Applications
Systems and Computers in Japan, 30, 47-54
農添三資, 浜口清治, 岩間一雄, 矢島脩三
しきい値関数を表す共有2分決定グラフの最適な変数順序付けの計算複雑度
電子情報通信学会論文誌, J82-D-I, 595-602
岩本宙造, 岩間一雄
テープ記号数を制限したチューリング機械の領域階層
電子情報通信学会論文誌, J82-D-I, 661-668
98 99 00F 00S 01 02 03 04 05 06 07
Asahiro Y., Iwama K., Tamaki H., Tokuyama T.
Greedily Finding a Dense Subgraph
J. Algorithms, 34, 203-221
Iwama K., Miyano E.
Oblivious Routing Algorithms on the Mesh of Buses
J. Parallel and Distributed Computing, 60, 137-149
Iwama K., Kambayashi Y., Takaki K.
Tight Bounds on the Number of States of DFA's That Are Equivalent ton-State NFA's
Theoretical Computer Science, 237, 485-494
98 99 00F 00S 01 02 03 04 05 06 07
Iwama K., Miyano E.
Recent Developments in Mesh Routing Algorithms
Trans. IEICE Information and Systems, E83-D, 530-540
98 99 00 01F 01S 02 03 04 05 06 07
Yoda K., Okabe Y., Kanazawa M.
An Unbiased Global Coin Flipping Protocol on SynchronousDistributed Systems
IEICE Trans. Information and Systems, E84,
Iwama K., Kambayashi Y., Miyano E.
New bounds for oblivious mesh routing
Journal of Graph Algorithms and Applications, ,
Iwama K., Miyano E.
An $O(\sqrt{N})$ oblivious routing algorithm for 2-D meshes ofconstant queue-size
Journal of Algorithms, ,
Asahiro Y., Hassin R., Iwama K.
Complexity of Finding Dense Subgraphs
Discrete Applied Mathematics, ,
98 99 00 01F 01S 02 03 04 05 06 07
Iwama K., Miyano E.
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
J. Algorithms, 39, 145-161
Iwama K., Miyano E., Tajima S., Tamaki H.
Efficient randomized routing algorithms on the two-dimensional meshof buses
Theoretical Computer Science, 261, 227-239
河合大輔, 宮崎修一, 岡部寿男, 岩間一雄
SATに対する局所探索法のベクトル化
情報処理学会論文誌, 42, 754-761
98 99 00 01 02F 02S 03 04 05 06 07
Ito H., Ito M., Itatsu Y., Uehara H., Yokoyama M.
Source location problems considering vertex-connectivity andedge-connectivity simultaneously
Networks, 40, 63-70
Halldorsson M., Iwama K., Miyazaki S., Taketomi S.
Online Independent Sets
Theoretical Computer Science, ,
Iwama K., Kawai D., Miyazaki S., Okabe Y., Umemoto J.
Parallelizing Local Search for CNF Satisfiability Using Vectorizationand PVM
ACM Journal of Experimental Algorithmics, ,
Ito H.
Sum of edge lengths of a multigraph drawn on a convex polygon
Computational Geometry, ,
98 99 00 01 02F 02S 03 04 05 06 07
A. Uejima, H. Ito
On $H$-coloring Problems with $H$ Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs
IEICE Trans., E85-A(5), 1026-1030
H. Ito, M. Ito, Y. Itatsu, K. Nakai, H. Uehara, M. Yokoyama
Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Networks, 40(2), 63-70
Y. Asahiro, R. Hassin, K. Iwama
Complexity of Finding Dense Subgraphs
Discrete Applied Mathematics, 121(1-3),
K. Iwama, D. Kawai, S. Miyazaki, Y. Okabe, J. Umemoto
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
ACM Journal of Experimental Algorithmics, 7,
K. Iwama, S. Yamashita
A Complete Set of Transformation Rules for Quantum Boolean Circuits with CNOT gates
Worshop on Quantum Dots for Quantum Computing and Classical Size Effect Circuits (special volume of Superlattices and Microstructures), 31(2-4), 181-192
M. Halldorsson, K. Iwama, S. MIyazaki, S. Taketomi
Online Independent Sets
Theoretical Computer Science, 289(2), 953-962
S. Kimura, A. Ishii, T. Horiyama, M. Nakanishi, H. Kajihara, K. Watanabe
Look Up Table Compaction Based on Folding of Logic Functions
IEICE Trans. Fundamentals, E85-A(12), 2701-2707
D. Manlove, R. Irving, K. Iwama, S. Miyazaki, Y. Morita
Hard Variants of Stable Marriage
Theoretical Computer Science, 276(1-2), 261-279
吉廣卓哉, 島田将行, 岡部寿男, 岩間一雄
IPv6におけるサイトローカルアドレスのステートレス自動設定
システム制御情報学会論文誌, 15(6), 294-301
98 99 00 01 02 03F 03S 04 05 06 07
H. Ito
Sum of edge lengths of a multigraph drawn on a convex polygon
Computational Geometry, 24(1), 41-47
K. Iwama, A. Matsuura
Solving SAT efficiently with promises
IEICE Transactions on Information and Systems, E86-D(2),
T. Horiyama, T. Ibaraki
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
Information Processing Letters, 85(4), 191-198
98 99 00 01 02 03F 03S 04 05 06 07
K. Iwama, A. Kawachi
A New Quantum Claw-Finding Algorithm for Three Functions
New Generation Computing, 21(4), 319-327
H. Ito, K. Makino, K. Arata, S. Honami, Y. Itatsu, S. Fujishige
Source location problem with flow requirements in directed networks
Optimization Methods and Software, 18, 427-435
M. Halldorsson, R. Irving, K. Iwama, D. Manlove, S. Miyazaki, Y. Morita, S. Scott
Approximability Results for Stable Marriage Problems with Ties
Theoretical Computer Science, 306(1-3), 431-447
E. Boros, T. Horiyama, T. Ibaraki, K. Makino, M. Yagiura
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence, 39(3), 223-257
H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro
Avoiding routing loops on the Internet
Theory of Computing Systems, 36(6), 597-609
N. Doi, T. Horiyama, M. Nakanishi, S. Kimura, K. Watanabe
Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synsthesis
IEICE Trans. Fundamentals, E86-A(12), 3184-3191
K. Iwama, A. Matsuura, M. Paterson
A family of NFAs which need $2n-\alpha$ deterministic states
Theoretical Computer Science, 301(1-3), 451-462
K. Amano, K. Iwama, A. Maruokap, K. Matsuo, A. Matsuura
Inclusion-Exclusion for k-CNF Formulas
Information Processing Letters, 87(2), 111-117
K. Iwama, S. Yamashita
Transformation Rules for CNOT-based Quantum Circuits and Their Applications
New Generation Computing, 21(4), 297-317
98 99 00 01 02 03 04F 04S 05 06 07
H. Fujiwara, K. Iwama, C. Iwamoto
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
Journal of Parallel and Distributed Computing, 64(3), 319-326
98 99 00 01 02 03 04F 04S 05 06 07
A. Uejima, H. Ito, T. Tsukiji
$\overline{C_7}$-coloring problem
Communications and Computer Sciences, E87-A(5), 1243-1250
K. Iwama, K. Yonezawa
The Orthogonal CNN Problem
Information Processing Letters, 90(3), 115-120
K. Iwama, K. Yonezawa
The Axis-bound CNN Problem
IEICE Transactions on Fundamentals, 87E-A(5), 1235-1242
T. Horiyama, T. Ibaraki
Reasoning with Ordered Binary Decision Diagrams
Discrete Applied Mathematics, 142(1-3), 151-163
M. Halldorsson, K. Iwama, S. Miyazaki, H. Yanagisawa
Randomized Approximation of the Stable Marriage Problem
Theoretical Computer Science, 325(3), 439-465
H. Miwa, H. Ito
NA-Edge-Connectivity Augmentation Problems by Adding Edges
Journal of the Operations Reserch Society of Japan, 47(4), 224-243
98 99 00 01 02 03 04 05F 05S 06 07
K. Iwama, A. Kawachi
Compact Routing with Stretch Factor of Less Than Three
IEICE Trans. Inf. \& Syst., Special Issue on Foundations of Computer Science, E88-D(1), 47-52
K. Iwama, A. Kawachi, S. Yamashita
Quantum Sampling for Balanced Allocations
IEICE Trans. Inf. \& Syst., Special Issue on Foundations of Computer Science, E88-D(1), 39-46
H. Fujiwara, K. Iwama
Average-Case Competitive Analyses for Ski-Rental Problems
Algorithmica, 42(1), 95-107
H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro
Single-Backup-Table Schemes for Shortest-Path Routing
Theoretical Computer Science, 333(3), 347-353
98 99 00 01 02 03 04 05F 05S 06 07
M. Adcock, R. Cleve, K. Iwama, R. Raymond, S. Yamashita
Quantum Lower Bounds for the Goldreich-Levin Problem
Information Processing Letters, 97(5), 208-211
98 99 00 01 02 03 04 05 06F 06S 07
No Articles
98 99 00 01 02 03 04 05 06F 06S 07
H. Ito, K. Iwama, T. Tamura
Efficient Methods for Determining DNA Probe Orders
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A(5), 1292-1298
K. Sugihara, H. Ito
Maximum-Cover Source Location Problems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A(5), 1370-1377
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
New Journal of Physics, 8, 129
K. Iwama, S. Miyazaki, K. Okamoto
A (2-c log N/N)-Approximation Algorithm for the Stable Marriage Problem
IEICE Transactions on Information and Systems, E89-D(8), 2380-2387
T. Imamura, K. Iwama, T. Tsukiji
Approximated Vertex Cover for Graphs with Perfect Matchings
IEICE Transactions on Information and Systems, E89-D(8), 2405-2410
M. Yamamoto
Generating Instances for MAX2SAT with Optimal Solutions
Theory of Computing Systems, 39(5), 723-742
Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, M. Yamashita
How to Collect Balls Moving in the Euclidean Plane
Discrete Applied Mathematics, 154(16), 2247-2262
Y. Hanatani, T. Horiyama, K. Iwama
Density Condensation of Boolean Formulas
Discrete Applied Mathematics, 154(16), 2263-2270
H. Ito, H. Nagamochi
Two Equivalent Measures on Weighted Hypergraphs
Discrete Applied Mathematics, 154(16), 2330-2334
H. Ito
ハラリイの一般化三並べ
信学論A, J89-A(6), 458-469
98 99 00 01 02 03 04 05 06 07F 07S
T. Riege, J. Rothe, H. Spakowski, M. Yamamoto
An Improved Exact Algorithm for the Domatic Number Problem
Information Processing Letter, 101(3), 101-106
98 99 00 01 02 03 04 05 06 07F 07S
No Articles