| 2019 | ISCAS | Halide and GENESIS for Generating Domain-Specific Architecture of Guided Image Filtering. | Akari Ishikawa, Norishige Fukushima, Akira Maruoka, Takuro Iizuka |
| 2019 | WALCOM | The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. | Shuji Jimbo, Akira Maruoka |
| 2013 | FedCSIS | A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. | Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka |
| 2008 | COCOON | Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. | Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
| 2006 | COCOON | Aggregating Strategy for Online Auctions. | Shigeaki Harada, Eiji Takimoto, Akira Maruoka |
| 2006 | COCOON | On the Negation-Limited Circuit Complexity of Sorting and Inverting | Takayuki Sato, Kazuyuki Amano, Akira Maruoka |
| 2005 | ALT | Online Allocation with Risk Information. | Shigeaki Harada, Eiji Takimoto, Akira Maruoka |
| 2005 | MFCS | On the Complexity of Depth-2 Circuits with Threshold Gates. | Kazuyuki Amano, Akira Maruoka |
| 2004 | ALT | Boosting Based on Divide and Merge. | Eiji Takimoto, Syuhei Koya, 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 | ALT | Structured Weight-Based Prediction Algorithms. | Akira Maruoka, Eiji Takimoto |
| 1998 | DIS | On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion. | Eiji Takimoto, Akira Maruoka |
| 1998 | MFCS | A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log | Kazuyuki Amano, Akira Maruoka |
| 1997 | ALT | A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree. | Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka |
| 1996 | ALT | Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. | Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka |
| 1996 | FOCS | Potential of the Approximation Method (extended abstract). | Kazuyuki Amano, Akira Maruoka |
| 1995 | ALT | Learning Orthogonal | Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka |
| 1995 | COLT | Proper Learning Algorithm for Functions of | Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka |
| 1994 | ALT | Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm. | Eiji Takimoto, Ichiro Tajika, Akira Maruoka |
| 1994 | COLT | Learning Monotone Log-Term DNF Formulas. | Yoshifumi Sakai, Akira Maruoka |
| 1993 | ALT | On the Sample Complexity of Consistent Learning with One-Sided Error. | Eiji Takimoto, Akira Maruoka |
| 1993 | COLT | Conservativeness and Monotonicity for Learning Algorithms. | Eiji Takimoto, Akira Maruoka |
| 1992 | ALT | Learning | Yoshifumi Sakai, Akira Maruoka |
| 1992 | ISAAC | Selection Networks with 8 | Shuji Jimbo, Akira Maruoka |
| 1991 | ALT | Relationships between PAC-learning algorithms and weak Occam algorithms. | Eiji Takimoto, Akira Maruoka |
| 1985 | STOC | Expanders Obtained from Affine Transformations (Preliminary Version) | Shuji Jimbo, Akira Maruoka |