| 2008 |
|---|
| 156 | EE | Hiroshi Fujiwara,
Kazuo Iwama,
Yoshiyuki Sekiguchi:
Average-Case Competitive Analyses for One-Way Trading.
COCOON 2008: 41-51 |
| 155 | EE | Wolfgang W. Bein,
Kazuo Iwama,
Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems.
ESA 2008: 161-172 |
| 154 | EE | Kazuo Iwama,
Harumichi Nishimura,
Mike Paterson,
Rudy Raymond,
Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding.
ICALP (1) 2008: 271-282 |
| 153 | EE | Andris Ambainis,
Kazuo Iwama,
Masaki Nakanishi,
Harumichi Nishimura,
Rudy Raymond,
Seiichiro Tani,
Shigeru Yamashita:
Quantum Query Complexity of Boolean Functions with Small On-Sets.
ISAAC 2008: 907-918 |
| 152 | EE | Kazuo Iwama:
SAT, UNSAT and Coloring.
SAT 2008: 153 |
| 151 | EE | Kazuo Iwama:
Local Search Algorithms for kSAT.
Encyclopedia of Algorithms 2008 |
| 150 | EE | Kazuo Iwama,
Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists.
Encyclopedia of Algorithms 2008 |
| 149 | EE | Kazuo Iwama,
Andrzej Lingas,
Masaki Okita:
Max-Stretch Reduction for Tree Spanners.
Algorithmica 50(2): 223-235 (2008) |
| 148 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Naoya Yamauchi:
A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
Algorithmica 51(3): 342-356 (2008) |
| 147 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
On Two Dimensional Orthogonal Knapsack Problem
CoRR abs/0803.4260: (2008) |
| 146 | EE | Kazuo Iwama,
Suguru Tamaki:
The Complexity of the Hajos Calculus for Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(011): (2008) |
| 145 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama,
Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Transactions 91-A(9): 2301-2307 (2008) |
| 144 | EE | Hiroshi Fujiwara,
Kazuo Iwama,
Kouki Yonezawa:
Online chasing problems for regular polygons.
Inf. Process. Lett. 108(3): 155-159 (2008) |
| 143 | EE | Kazuo Iwama,
Hiroki Morizumi,
Jun Tarui:
Reductions for monotone Boolean circuits.
Theor. Comput. Sci. 408(2-3): 208-212 (2008) |
| 142 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
Online Removable Square Packing.
Theory Comput. Syst. 43(1): 38-55 (2008) |
| 2007 |
|---|
| 141 | EE | Xin Han,
Kazuo Iwama,
Rolf Klein,
Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
AAIM 2007: 337-345 |
| 140 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
AAIM 2007: 358-367 |
| 139 | EE | Kazuo Iwama,
Guochuan Zhang:
Optimal Resource Augmentations for Online Knapsack.
APPROX-RANDOM 2007: 180-188 |
| 138 | EE | Jian-Jia Chen,
Kazuo Iwama,
Tei-Wei Kuo,
Hsueh-I Lu:
Flow Time Minimization under Energy Constraints.
ASP-DAC 2007: 866-871 |
| 137 | EE | Kazuo Iwama,
Takuya Nakashima:
An Improved Exact Algorithm for Cubic Graph TSP.
COCOON 2007: 108-117 |
| 136 | EE | Xiaotie Deng,
Kazuo Iwama,
Qi Qi,
Aries Wei Sun,
Toyotaka Tasaka:
Properties of Symmetric Incentive Compatible Auctions.
COCOON 2007: 264-273 |
| 135 | EE | Kazuo Iwama,
Eiji Miyano,
Hirotaka Ono:
Drawing Borders Efficiently.
FUN 2007: 213-226 |
| 134 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity.
ICALP 2007: 110-121 |
| 133 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity.
ISAAC 2007: 100-111 |
| 132 | EE | Hiroshi Fujiwara,
Kazuo Iwama,
Kouki Yonezawa:
Online Chasing Problems for Regular n-Gons.
RIVF 2007: 36-41 |
| 131 | EE | Nikhil Bansal,
Xin Han,
Kazuo Iwama,
Maxim Sviridenko,
Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem.
SODA 2007: 1197-1206 |
| 130 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Naoya Yamauchi:
A 1.875: approximation algorithm for the stable marriage problem.
SODA 2007: 288-297 |
| 129 | EE | Masahito Hayashi,
Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond Harry Putra,
Shigeru Yamashita:
Quantum Network Coding.
STACS 2007: 610-621 |
| 128 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Hiroki Yanagisawa:
Approximation Algorithms for the Sex-Equal Stable Marriage Problem.
WADS 2007: 201-213 |
| 127 | EE | Wolfgang W. Bein,
Kazuo Iwama,
Jun Kawahara,
Lawrence L. Larmore,
James A. Oravec:
A Randomized Algorithm for Two Servers in Cross Polytope Spaces.
WAOA 2007: 246-259 |
| 126 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem.
ACM Transactions on Algorithms 3(3): (2007) |
| 125 | EE | Kazuo Iwama,
Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments.
Discrete Applied Mathematics 155(12): 1596-1603 (2007) |
| 124 | EE | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Rudy Raymond,
Shigeru Yamashita:
Improved algorithms for quantum identification of Boolean oracles.
Theor. Comput. Sci. 378(1): 41-53 (2007) |
| 2006 |
|---|
| 123 | EE | Masahito Hayashi,
Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Quantum Network Coding.
Complexity of Boolean Functions 2006 |
| 122 | EE | Kazuo Iwama:
Stable Matching Problems.
ISAAC 2006: 1 |
| 121 | EE | Kazuo Iwama,
Hiroki Morizumi,
Jun Tarui:
Negation-Limited Complexity of Parity and Inverters.
ISAAC 2006: 223-232 |
| 120 | EE | Takashi Horiyama,
Kazuo Iwama,
Jun Kawahara:
Finite-State Online Algorithms and Their Automated Competitive Analysis.
ISAAC 2006: 71-80 |
| 119 | EE | Kazuo Iwama,
Hiroki Morizumi:
Reductions for Monotone Boolean Circuits.
MFCS 2006: 540-548 |
| 118 | EE | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Rudy Raymond Harry Putra,
Shigeru Yamashita:
Improved Algorithms for Quantum Identification of Boolean Oracles.
SWAT 2006: 280-291 |
| 117 | EE | Kazuo Iwama:
Classic and Quantum Network Coding.
SWAT 2006: 3-4 |
| 116 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing
CoRR abs/cs/0607046: (2006) |
| 115 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
New Upper Bounds on The Approximability of 3D Strip Packing
CoRR abs/cs/0607100: (2006) |
| 114 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama:
Density condensation of Boolean formulas.
Discrete Applied Mathematics 154(16): 2263-2270 (2006) |
| 113 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
Electronic Colloquium on Computational Complexity (ECCC) 13(112): (2006) |
| 112 | EE | Hiro Ito,
Kazuo Iwama,
Takeyuki Tamura:
Efficient Methods for Determining DNA Probe Orders.
IEICE Transactions 89-A(5): 1292-1298 (2006) |
| 111 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Kazuya Okamoto:
A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem.
IEICE Transactions 89-D(8): 2380-2387 (2006) |
| 110 | EE | Tomokazu Imamura,
Kazuo Iwama,
Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings.
IEICE Transactions 89-D(8): 2405-2410 (2006) |
| 109 | EE | Mark Adcock,
Richard Cleve,
Kazuo Iwama,
Raymond H. Putra,
Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem.
Inf. Process. Lett. 97(5): 208-211 (2006) |
| 2005 |
|---|
| 108 | EE | Hiroshi Fujiwara,
Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems.
Algorithms for Optimization with Incomplete Information 2005 |
| 107 | EE | Hiro Ito,
Kazuo Iwama,
Tsuyoshi Osumi:
Linear-Time Enumeration of Isolated Cliques.
ESA 2005: 119-130 |
| 106 | EE | Wolfgang W. Bein,
Kazuo Iwama,
Lawrence L. Larmore,
John Noga:
The Delayed k-Server Problem.
FCT 2005: 281-292 |
| 105 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Naoya Yamauchi:
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
ISAAC 2005: 902-914 |
| 104 | EE | Kazuo Iwama:
Classic and Quantum Network Coding.
ISPAN 2005: 10 |
| 103 | EE | Tomokazu Imamura,
Kazuo Iwama:
Approximating vertex cover on dense graphs.
SODA 2005: 582-589 |
| 102 | EE | Kazuo Iwama,
Andrzej Lingas,
Masaki Okita:
Max-stretch Reduction for Tree Spanners.
WADS 2005: 122-133 |
| 101 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
Online Removable Square Packing.
WAOA 2005: 216-229 |
| 100 | EE | Hiroshi Fujiwara,
Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems.
Algorithmica 42(1): 95-107 (2005) |
| 99 | EE | Kazuo Iwama,
Akinori Kawachi,
Shigeru Yamashita:
Quantum Sampling for Balanced Allocations.
IEICE Transactions 88-D(1): 39-46 (2005) |
| 98 | EE | Kazuo Iwama,
Akinori Kawachi:
Compact Routing with Stretch Factor of Less Than Three.
IEICE Transactions 88-D(1): 47-52 (2005) |
| 97 | EE | Hiro Ito,
Kazuo Iwama,
Yasuo Okabe,
Takuya Yoshihiro:
Single backup table schemes for shortest-path routing.
Theor. Comput. Sci. 333(3): 347-353 (2005) |
| 2004 |
|---|
| 96 | EE | Tomokazu Imamura,
Kazuo Iwama,
Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings.
COCOON 2004: 132-142 |
| 95 | | Hiro Ito,
Kazuo Iwama,
Takeyuki Tamura:
Imperfectness of Data for STS-Based Physical Mapping.
IFIP TCS 2004: 279-292 |
| 94 | EE | Kazuo Iwama,
Akinori Kawachi:
Approximated Two Choices in Randomized Load Balancing.
ISAAC 2004: 545-557 |
| 93 | EE | Kazuo Iwama,
Suguru Tamaki:
Improved upper bounds for 3-SAT.
SODA 2004: 328 |
| 92 | EE | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Hiroyuki Masuda,
Raymond H. Putra,
Shigeru Yamashita:
Quantum Identification of Boolean Oracles.
STACS 2004: 105-116 |
| 91 | EE | Kazuo Iwama,
Shuichi Miyazaki,
Kazuya Okamoto:
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.
SWAT 2004: 349-361 |
| 90 | | Kazuo Iwama:
Worst-Case Upper Bounds for kSAT (Column: Algorithmics).
Bulletin of the EATCS 82: 61-71 (2004) |
| 89 | EE | Kazuo Iwama,
Kouki Yonezawa:
The orthogonal CNN problem.
Inf. Process. Lett. 90(3): 115-120 (2004) |
| 88 | EE | Toshiyuki Fujiwara,
Kazuo Iwama,
Chuzo Iwamoto:
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distrib. Comput. 64(3): 319-326 (2004) |
| 87 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Hiroki Yanagisawa:
Randomized approximation of the stable marriage problem.
Theor. Comput. Sci. 325(3): 439-465 (2004) |
| 2003 |
|---|
| 86 | EE | Kazuo Iwama,
Akinori Kawachi,
Shigeru Yamashita:
Quantum Sampling for Balanced Allocations.
COCOON 2003: 304-318 |
| 85 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Hiroki Yanagisawa:
Randomized Approximation of the Stable Marriage Problem.
COCOON 2003: 339-350 |
| 84 | EE | Kazuo Iwama,
Masaki Okita:
Compact Routing for Flat Networks.
DISC 2003: 196-210 |
| 83 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Hiroki Yanagisawa:
Improved Approximation of the Stable Marriage Problem.
ESA 2003: 266-277 |
| 82 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama:
Density Condensation of Boolean Formulas.
SAT 2003: 69-77 |
| 81 | | Hiro Ito,
Kazuo Iwama,
Yasuo Okabe,
Takuya Yoshihiro:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing.
SIROCCO 2003: 163-177 |
| 80 | EE | Kazuo Iwama,
Suguru Tamaki:
Improved Upper Bounds for 3-SAT
Electronic Colloquium on Computational Complexity (ECCC)(053): (2003) |
| 79 | EE | Kazuyuki Amano,
Kazuo Iwama,
Akira Maruoka,
Kenshi Matsuo,
Akihiro Matsuura:
Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett. 87(2): 111-117 (2003) |
| 78 | EE | Kazuo Iwama,
Akinori Kawachi:
A New Quantum Claw-finding Algorithm for Three Functions.
New Generation Comput. 21(4): (2003) |
| 77 | EE | Kazuo Iwama,
Shigeru Yamashita:
Transformation Rules for CNOT-based Quantum Circuits and Their Applications.
New Generation Comput. 21(4): (2003) |
| 76 | EE | Kazuo Iwama,
Akihiro Matsuura,
Mike Paterson:
A family of NFAs which need 2n- deterministic states.
Theor. Comput. Sci. 1-3(301): 451-462 (2003) |
| 75 | EE | Magnús M. Halldórsson,
Robert W. Irving,
Kazuo Iwama,
David Manlove,
Shuichi Miyazaki,
Yasufumi Morita,
Sandy Scott:
Approximability results for stable marriage problems with ties.
Theor. Comput. Sci. 306(1-3): 431-447 (2003) |
| 74 | EE | Hiro Ito,
Kazuo Iwama,
Yasuo Okabe,
Takuya Yoshihiro:
Avoiding Routing Loops on the Internet.
Theory Comput. Syst. 36(6): 597-609 (2003) |
| 2002 |
|---|
| 73 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Shigeru Yamashita:
Transformation rules for designing CNOT-based quantum circuits.
DAC 2002: 419-424 |
| 72 | EE | Kazuo Iwama,
Shiro Taketomi:
Removable Online Knapsack Problems.
ICALP 2002: 293-305 |
| 71 | EE | Hiroshi Fujiwara,
Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems.
ISAAC 2002: 476-488 |
| 70 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Yasufumi Morita:
Inapproximability Results on Stable Marriage Problems.
LATIN 2002: 554-568 |
| 69 | EE | Kazuo Iwama,
Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
MFCS 2002: 353-364 |
| 68 | EE | Kazuo Iwama,
Masaki Okita:
Compact routing for average-case networks.
PODC 2002: 255 |
| 67 | | Hiro Ito,
Kazuo Iwama,
Yasuo Okabe,
Takuya Yoshihiro:
Avoiding Routing Loops on the Internet.
SIROCCO 2002: 197-210 |
| 66 | EE | Masami Amano,
Kazuo Iwama,
Raymond H. Putra:
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations.
UMC 2002: 100-114 |
| 65 | EE | Kazuo Iwama,
Daisuke Kawai,
Shuichi Miyazaki,
Yasuo Okabe,
Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
ACM Journal of Experimental Algorithmics 7: 2 (2002) |
| 64 | | Yuichi Asahiro,
Refael Hassin,
Kazuo Iwama:
Complexity of finding dense subgraphs.
Discrete Applied Mathematics 121(1-3): 15-26 (2002) |
| 63 | EE | David Manlove,
Robert W. Irving,
Kazuo Iwama,
Shuichi Miyazaki,
Yasufumi Morita:
Hard variants of stable marriage.
Theor. Comput. Sci. 276(1-2): 261-279 (2002) |
| 62 | | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Shiro Taketomi:
Online independent sets.
Theor. Comput. Sci. 289(2): 953-962 (2002) |
| 2001 |
|---|
| 61 | EE | Kazuo Iwama,
Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments.
Algorithm Engineering 2001: 118-128 |
| 60 | EE | Kazuo Iwama,
Yasuo Okabe,
Toshiro Takase:
Separating Oblivious and Non-oblivious BPs.
COCOON 2001: 28-38 |
| 59 | | Kazuo Iwama,
Eiji Miyano:
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
J. Algorithms 39(2): 145-161 (2001) |
| 58 | EE | Kazuo Iwama,
Eiji Miyano:
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
J. Algorithms 41(2): 262-279 (2001) |
| 57 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Eiji Miyano:
New Bounds for Oblivious Mesh Routing.
J. Graph Algorithms Appl. 5(5): 17-38 (2001) |
| 56 | EE | Kazuo Iwama,
Eiji Miyano,
Satoshi Tajima,
Hisao Tamaki:
Efficient randomized routing algorithms on the two-dimensional mesh of buses.
Theor. Comput. Sci. 261(2): 227-239 (2001) |
| 2000 |
|---|
| 55 | EE | Kazuo Iwama,
Daisuke Kawai,
Shuichi Miyazaki,
Yasuo Okabe,
Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
Algorithm Engineering 2000: 123-134 |
| 54 | EE | Magnús M. Halldórsson,
Kazuo Iwama,
Shuichi Miyazaki,
Shiro Taketomi:
Online Independent Sets.
COCOON 2000: 202-209 |
| 53 | EE | Takao Asano,
Magnús M. Halldórsson,
Kazuo Iwama,
Takeshi Matsuda:
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.
ISAAC 2000: 204-215 |
| 52 | EE | Kazuo Iwama,
Akihiro Matsuura,
Mike Paterson:
A Family of NFA's Which Need 2n -alpha Deterministic States.
MFCS 2000: 436-445 |
| 51 | EE | Kazuo Iwama,
Akinori Kawachi:
Compact routing with stretch factor of less than three (brief announcement).
PODC 2000: 337 |
| 50 | EE | Kazuo Iwama,
Eiji Miyano:
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.
SPAA 2000: 186-195 |
| 49 | | Yuichi Asahiro,
Kazuo Iwama,
Hisao Tamaki,
Takeshi Tokuyama:
Greedily Finding a Dense Subgraph.
J. Algorithms 34(2): 203-221 (2000) |
| 48 | | Kazuo Iwama,
Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses.
J. Parallel Distrib. Comput. 60(2): 137-149 (2000) |
| 47 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Kazuya Takaki:
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs.
Theor. Comput. Sci. 237(1-2): 485-494 (2000) |
| 1999 |
|---|
| 46 | EE | Kazuo Iwama,
Kouki Yonezawa:
Using Generalized Forecasts for Online Currency Conversion.
COCOON 1999: 409-421 |
| 45 | EE | Kazuo Iwama,
Eiji Miyano:
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
ESA 1999: 53-64 |
| 44 | EE | Kazuo Iwama,
David Manlove,
Shuichi Miyazaki,
Yasufumi Morita:
Stable Marriage with Incomplete Lists and Ties.
ICALP 1999: 443-452 |
| 43 | EE | Kazuo Iwama,
Shuichi Miyazaki:
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.
ISAAC 1999: 133-142 |
| 42 | EE | Kazuo Iwama,
Eiji Miyano:
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
SODA 1999: 466-475 |
| 41 | EE | Masami Amano,
Kazuo Iwama:
Undecidability on Quantum Finite Automata.
STOC 1999: 368-375 |
| 40 | EE | Shuichi Miyazaki,
Kazuo Iwama:
Approximation of coNP sets by NP-complete sets and its applications.
Systems and Computers in Japan 30(7): 47-54 (1999) |
| 1998 |
|---|
| 39 | EE | Kazuo Iwama,
Eiji Miyano,
Satoshi Tajima,
Hisao Tamaki:
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.
COCOON 1998: 229-240 |
| 38 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Eiji Miyano:
New Bounds for Oblivious Mesh Routing.
ESA 1998: 295-306 |
| 37 | EE | Kazuo Iwama,
Chuzo Iwamoto:
Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
MFCS 1998: 580-588 |
| 36 | EE | Kazuo Iwama,
Mitsushi Nouzoe,
Shuzo Yajima:
Optimizing OBDDs Is Still Intractable for Monotone Functions.
MFCS 1998: 625-635 |
| 35 | EE | Kazuo Iwama,
Eiji Miyano:
Better Approximations of Non-Hamiltonian Graphs.
Discrete Applied Mathematics 81(1-3): 239-261 (1998) |
| 34 | | Kazuo Iwama,
Chuzo Iwamoto:
A Canonical Form of Vector Machines.
Inf. Comput. 141(1): 37-65 (1998) |
| 1997 |
|---|
| 33 | | Byungki Cha,
Kazuo Iwama,
Yahiko Kambayashi,
Shuichi Miyazaki:
Local Search Algorithms for Partial MAXSAT.
AAAI/IAAI 1997: 263-268 |
| 32 | | Kazuo Iwama,
Kazuya Takaki:
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's.
Developments in Language Theory 1997: 147-154 |
| 31 | EE | Kazuo Iwama,
Kensuke Hino,
Hiroyuki Kurokawa,
Sunao Sawada:
Random benchmark circuits with controlled attributes.
ED&TC 1997: 90-97 |
| 30 | | Kazuo Iwama,
Eiji Miyano:
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.
ESA 1997: 284-295 |
| 29 | EE | Kazuo Iwama,
Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses.
IPPS 1997: 721-727 |
| 28 | | Kazuo Iwama:
Complexity of Finding Short Resolution Proofs.
MFCS 1997: 309-318 |
| 27 | EE | Kazuo Iwama,
Chuzo Iwamoto,
T. Ohsawa:
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett. 61(5): 265-269 (1997) |
| 1996 |
|---|
| 26 | | Byungki Cha,
Kazuo Iwama:
Adding New Clauses for Faster Local Search.
AAAI/IAAI, Vol. 1 1996: 332-337 |
| 25 | | Shuichi Miyazaki,
Kazuo Iwama,
Yahiko Kambayashi:
Database Queries as Combinatorial Optimization Problems.
CODAS 1996: 477-483 |
| 24 | EE | Kazuo Iwama,
Chuzo Iwamoto:
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
IEEE Conference on Computational Complexity 1996: 24-32 |
| 23 | | Yuichi Asahiro,
Kazuo Iwama,
Hisao Tamaki,
Takeshi Tokuyama:
Greedily Finding a Dense Subgraph.
SWAT 1996: 136-148 |
| 22 | | Kazuo Iwama,
Chuzo Iwamoto:
alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms 20(3): 526-544 (1996) |
| 21 | | Kazuo Iwama,
Eiji Miyano,
Yahiko Kambayashi:
Routing Problems on the Mesh of Buses.
J. Algorithms 20(3): 613-631 (1996) |
| 20 | EE | Kazuo Iwama,
Chuzo Iwamoto,
Manzur Morshed:
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci. 155(2): 411-424 (1996) |
| 1995 |
|---|
| 19 | | Kazuo Iwama,
Shuichi Miyazaki:
Approximation of coNP Sets by NP-complete Sets.
COCOON 1995: 11-20 |
| 18 | | Byungki Cha,
Kazuo Iwama:
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas.
IJCAI 1995: 304-311 |
| 17 | | Yuichi Asahiro,
Kazuo Iwama:
Finding Dense Subgraphs.
ISAAC 1995: 102-111 |
| 16 | | Kazuo Iwama,
Eiji Miyano:
Intractability of Read-Once Resolution.
Structure in Complexity Theory Conference 1995: 29-36 |
| 15 | EE | Kazuo Iwama,
Toniann Pitassi:
Exponential Lower Bounds for the Tree-Like Hajós Calculus.
Inf. Process. Lett. 54(5): 289-294 (1995) |
| 1994 |
|---|
| 14 | EE | Kazuo Iwama,
Kensuke Hino:
Random Generation of Test Instances for Logic Optimizers.
DAC 1994: 430-434 |
| 13 | | Kazuo Iwama,
Shuichi Miyazaki:
SAT-Varible Complexity of Hard Combinatorial Problems.
IFIP Congress (1) 1994: 253-258 |
| 12 | | Chuzo Iwamoto,
Kazuo Iwama:
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
ISAAC 1994: 478-486 |
| 11 | | Kazuo Iwama,
Yahiko Kambayashi:
A Simpler Parallel Algorithm for Graph Conectivity.
J. Algorithms 16(2): 190-217 (1994) |
| 1993 |
|---|
| 10 | | Kazuo Iwama:
Low-Level Tradeoffs between Reversals and Alternations.
Developments in Language Theory 1993: 326-341 |
| 9 | | Kazuo Iwama:
ASPACE(o(log log n)) is Regular.
SIAM J. Comput. 22(1): 136-146 (1993) |
| 1992 |
|---|
| 8 | | Toshihide Ibaraki,
Yasuyoshi Inagaki,
Kazuo Iwama,
Takao Nishizeki,
Masafumi Yamashita:
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings
Springer 1992 |
| 7 | | Kazuo Iwama,
Hidetoshi Abeta,
Eiji Miyano:
Random Generation of Satisfiable and Unsatisfiable CNF Predicates.
IFIP Congress (1) 1992: 322-328 |
| 6 | | Kazuo Iwama,
Eiji Miyano:
Routing Problems on the Mesh of Buses.
ISAAC 1992: 155-164 |
| 1989 |
|---|
| 5 | | Kazuo Iwama,
Yahiko Kambayashi:
An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses.
IFIP Congress 1989: 305-310 |
| 4 | | Kazuo Iwama:
CNF Satisfiability Test by Counting and Polynomial Average Time.
SIAM J. Comput. 18(2): 385-391 (1989) |
| 1983 |
|---|
| 3 | | Kazuo Iwama:
Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication
STOC 1983: 374-381 |
| 2 | | Kazuo Iwama:
The Universe Problem for Unrestricted Flow Languages.
Acta Inf. 19: 85-96 (1983) |
| 1982 |
|---|
| 1 | | Kazuo Iwama:
On Equations Including String Variables
FOCS 1982: 226-235 |
