Potential of the Approximation Method (extended abstract). - Kazuyuki Amano; Akira Maruoka (FOCS, 1996)

Approximation Algorithms for DNF Under Distributions with Limited Independence. - Kazuyuki Amano; Akira Maruoka (Theory Comput. Syst., 1997)

On-Line Estimation of Hidden Markov Model Parameters. - Jun Mizuno; Tasuya Watanabe; Kazuya Ueki; Kazuyuki Amano; Eiji Takimoto; Akira Maruoka (Discovery Science, 2000)

The Computational Power of a Family of Decision Forests. - Kazuyuki Amano; Tsukuru Hirosawa; Yusuke Watanabe; Akira Maruoka (MFCS, 2001)

On a Generalized Ruin Problem. - Kazuyuki Amano; John Tromp; Paul M. B. Vitányi; Osamu Watanabe 001 (RANDOM-APPROX, 2001)

Some Properties of MODm Circuits Computing Simple Functions. - Kazuyuki Amano; Akira Maruoka (CIAC, 2003)

On Optimal Merging Networks. - Kazuyuki Amano; Akira Maruoka (MFCS, 2003)

On the negation-limited circuit complexity of merging. - Kazuyuki Amano; Akira Maruoka; Jun Tarui (Discret. Appl. Math., 2003)

Inclusion-exclusion for k-CNF formulas. - Kazuyuki Amano; Kazuo Iwama; Akira Maruoka; Kenshi Matsuo; Akihiro Matsuura (Inf. Process. Lett., 2003)

Better Simulation of Exponential Threshold Weights by Polynomial Weights - Kazuyuki Amano; Akira Maruoka (Electron. Colloquium Comput. Complex., 2004)

The Potential of the Approximation Method. - Kazuyuki Amano; Akira Maruoka (SIAM J. Comput., 2004)

On the Complexity of Depth-2 Circuits with Threshold Gates. - Kazuyuki Amano; Akira Maruoka (MFCS, 2005)

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates. - Kazuyuki Amano; Akira Maruoka (SIAM J. Comput., 2005)

On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. - Takayuki Sato; Kazuyuki Amano; Akira Maruoka (COCOON, 2006)

The Monotone Circuit Complexity of Quadratic Boolean Functions. - Kazuyuki Amano; Akira Maruoka (Algorithmica, 2006)

On learning monotone Boolean functions under the uniform distribution. - Kazuyuki Amano; Akira Maruoka (Theor. Comput. Sci., 2006)

Better upper bounds on the QOBDD size of integer multiplication. - Kazuyuki Amano; Akira Maruoka (Discret. Appl. Math., 2007)

Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. - Takayuki Sato; Kazuyuki Amano; Eiji Takimoto; Akira Maruoka (COCOON, 2008)

A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. - Kazuyuki Amano; Jun Tarui (TAMC, 2008)

k-Subgraph Isomorphism on AC0 Circuits. - Kazuyuki Amano (CCC, 2009)

Bounds on the Size of Small Depth Circuits for Approximating Majority. - Kazuyuki Amano (ICALP (1), 2009)

A Note on the Middle Levels Conjecture - Manabu Shimada; Kazuyuki Amano (CoRR, 2009)

On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. - Kazuyuki Amano (CATS, 2010)

New Upper Bounds on the Average PTF Density of Boolean Functions. - Kazuyuki Amano (ISAAC (1), 2010)

k-Subgraph Isomorphism on AC0 Circuits. - Kazuyuki Amano (Comput. Complex., 2010)

Researching the Complexity of Boolean Functions with Computers. - Kazuyuki Amano (Bull. EATCS, 2010)

NPN-Representatives of a Set of Optimal Boolean Formulas. - Hideaki Fukuhara; Eiji Takimoto; Kazuyuki Amano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. - Kazuyuki Amano (SODA, 2011)

On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. - Kazuyuki Amano (Chic. J. Theor. Comput. Sci., 2011)

On Extremal k-CNF Formulas. - Kazuyuki Amano (Electron. Notes Discret. Math., 2011)

Minterm-transitive functions with asymptotically smallest block sensitivity. - Kazuyuki Amano (Inf. Process. Lett., 2011)

A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. - Kazuyuki Amano; Jun Tarui (Theor. Comput. Sci., 2011)

Tight Bounds on the Average Sensitivity of k-CNF. - Kazuyuki Amano (Theory Comput., 2011)

How to Solve the Torus Puzzle. - Kazuyuki Amano; Yuta Kojima; Toshiya Kurabayashi; Keita Kurihara; Masahiro Nakamura; Ayaka Omi; Toshiyuki Tanaka; Koichi Yamazaki (Algorithms, 2012)

Some improved bounds on communication complexity via new decomposition of cliques. - Kazuyuki Amano (Discret. Appl. Math., 2014)

On extremal kk-CNF formulas. - Kazuyuki Amano (Eur. J. Comb., 2014)

Foreword. - Kazuyuki Amano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. - Kazuyuki Amano; Atsushi Saito (LATA, 2015)

Ordered biclique partitions and communication complexity problems. - Manami Shigeta; Kazuyuki Amano (Discret. Appl. Math., 2015)

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. - Kazuyuki Amano; Kyaw May Oo; Yota Otachi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2015)

A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits. - Kazuyuki Amano; Atsushi Saito (IEICE Trans. Inf. Syst., 2015)

Anti-Slide. - Kazuyuki Amano; Shin-Ichi Nakano; Koichi Yamazaki (J. Inf. Process., 2015)

On XOR Lemma for Polynomial Threshold Weight and Length. - Kazuyuki Amano (LATA, 2016)

Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. - Kazuyuki Amano (ISIT, 2017)

Away from Rivals. - Kazuyuki Amano; Shin-Ichi Nakano (CCCG, 2018)

Depth Two Majority Circuits for Majority and List Expanders. - Kazuyuki Amano (MFCS, 2018)

Depth Two (n-2)-Majority Circuits for n-Majority. - Kazuyuki Amano; Masafumi Yoshida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

On XOR lemmas for the weight of polynomial threshold functions. - Kazuyuki Amano; Shoma Tate (Inf. Comput., 2019)

On the Number of p4-Tilings by an n-Omino. - Kazuyuki Amano; Yoshinobu Haruyama (Int. J. Comput. Geom. Appl., 2019)

On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. - Kazuyuki Amano (LATA, 2020)

Search for developments of a box having multiple ways of folding by SAT solver. - Riona Tadaki; Kazuyuki Amano (CoRR, 2020)

An Approximation Algorithm for the 2-Dispersion Problem. - Kazuyuki Amano; Shin-Ichi Nakano (IEICE Trans. Inf. Syst., 2020)

Maximum Number of Steps of Topswops on 18 and 19 Cards. - Kento Kimura; Atsuki Takahashi; Tetsuya Araki; Kazuyuki Amano (CoRR, 2021)

On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes. - Kento Kimura; Kazuyuki Amano; Tetsuya Araki (IEICE Trans. Inf. Syst., 2021)

Escape from the Room. - Kento Kimura; Kazuyuki Amano; Shin-Ichi Nakano (COCOON, 2022)

Integer Complexity and Mixed Binary-Ternary Representation. - Kazuyuki Amano (ISAAC, 2022)

Depth-Three Circuits for Inner Product and Majority Functions. - Kazuyuki Amano (ISAAC, 2023)

Lower Bounds on the PTF Weight of ODD-MAXBIT Function. - Kazuyuki Amano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

(15/14)n Flips are (Almost) Sufficient to Sort Heydari and Sudborough's Pancake Stack. - Kazuyuki Amano (IEICE Trans. Inf. Syst., 2025)

Escape from the Room. - Kento Kimura; Tomohiro Haramiishi; Kazuyuki Amano; Shin-Ichi Nakano (IEICE Trans. Inf. Syst., 2025)