| 2023 | ISAAC | Depth-Three Circuits for Inner Product and Majority Functions. | Kazuyuki Amano |
| 2022 | COCOON | Escape from the Room. | Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano |
| 2022 | ISAAC | Integer Complexity and Mixed Binary-Ternary Representation. | Kazuyuki Amano |
| 2020 | LATA | On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. | Kazuyuki Amano |
| 2018 | MFCS | Depth Two Majority Circuits for Majority and List Expanders. | Kazuyuki Amano |
| 2017 | ISAAC | On the Number of p4-Tilings by an n-Omino. | Kazuyuki Amano, Yoshinobu Haruyama |
| 2017 | ISIT | Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. | Kazuyuki Amano |
| 2016 | LATA | On XOR Lemma for Polynomial Threshold Weight and Length. | Kazuyuki Amano |
| 2015 | LATA | A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. | Kazuyuki Amano, Atsushi Saito |
| 2011 | SODA | Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. | Kazuyuki Amano |
| 2010 | ISAAC | New Upper Bounds on the Average PTF Density of Boolean Functions. | Kazuyuki Amano |
| 2009 | ICALP | Bounds on the Size of Small Depth Circuits for Approximating Majority. | Kazuyuki Amano |
| 2008 | COCOON | Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. | Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
| 2008 | TAMC | A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. | Kazuyuki Amano, Jun Tarui |
| 2006 | COCOON | On the Negation-Limited Circuit Complexity of Sorting and Inverting | Takayuki Sato, Kazuyuki Amano, Akira Maruoka |
| 2005 | MFCS | On the Complexity of Depth-2 Circuits with Threshold Gates. | Kazuyuki Amano, Akira Maruoka |
| 2004 | ISAAC | On the Monotone Circuit Complexity of Quadratic Boolean Functions. | Kazuyuki Amano, Akira Maruoka |
| 2003 | CIAC | Some Properties of MOD | Kazuyuki Amano, Akira Maruoka |
| 2003 | MFCS | On Optimal Merging Networks. | Kazuyuki Amano, Akira Maruoka |
| 2002 | ALT | On Learning Monotone Boolean Functions under the Uniform Distribution. | Kazuyuki Amano, Akira Maruoka |
| 2001 | MFCS | The Computational Power of a Family of Decision Forests. | Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka |
| 2000 | DIS | On-Line Estimation of Hidden Markov Model Parameters. | Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
| 1999 | COCOON | On the Negation-Limited Circuit Complexity of Merging. | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
| 1998 | MFCS | A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log | Kazuyuki Amano, Akira Maruoka |
| 1996 | FOCS | Potential of the Approximation Method (extended abstract). | Kazuyuki Amano, Akira Maruoka |