The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kazuo Iwama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  128. Flow Time Minimization under Energy Constraints. [Citation Graph (, )][DBLP]


  129. Average-Case Competitive Analyses for One-Way Trading. [Citation Graph (, )][DBLP]


  130. Quantum Network Coding. [Citation Graph (, )][DBLP]


  131. Random benchmark circuits with controlled attributes. [Citation Graph (, )][DBLP]


  132. Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's. [Citation Graph (, )][DBLP]


  133. Randomized Competitive Analysis for Two-Server Problems. [Citation Graph (, )][DBLP]


  134. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. [Citation Graph (, )][DBLP]


  135. Polynomial-Time Construction of Linear Network Coding. [Citation Graph (, )][DBLP]


  136. Quantum Query Complexity of Boolean Functions with Small On-Sets. [Citation Graph (, )][DBLP]


  137. Unbounded-Error Classical and Quantum Communication Complexity. [Citation Graph (, )][DBLP]


  138. Classic and Quantum Network Coding. [Citation Graph (, )][DBLP]


  139. Compact routing with stretch factor of less than three (brief announcement). [Citation Graph (, )][DBLP]


  140. Online Chasing Problems for Regular n-Gons. [Citation Graph (, )][DBLP]


  141. SAT, UNSAT and Coloring. [Citation Graph (, )][DBLP]


  142. A Randomized Algorithm for Two Servers in Cross Polytope Spaces. [Citation Graph (, )][DBLP]


  143. Quantum Queries on Permutations with a Promise. [Citation Graph (, )][DBLP]


  144. Negation-Limited Complexity of Parity and Inverters. [Citation Graph (, )][DBLP]


  145. Max-Stretch Reduction for Tree Spanners. [Citation Graph (, )][DBLP]


  146. A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. [Citation Graph (, )][DBLP]


  147. On Two Dimensional Orthogonal Knapsack Problem [Citation Graph (, )][DBLP]


  148. Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size [Citation Graph (, )][DBLP]


  149. The Complexity of the Hajos Calculus for Planar Graphs. [Citation Graph (, )][DBLP]


  150. Strip Packing vs. Bin Packing. [Citation Graph (, )][DBLP]


Search in 0.233secs, Finished in 0.243secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002