Logical Networks of Flexible Cells. - Akira Maruoka; Namio Honda (IEEE Trans. Computers, 1973)

Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata. - Akira Maruoka; Masayuki Kimura (J. Comput. Syst. Sci., 1974)

The Range of Logical Flexibility of Tree Networks. - Akira Maruoka; Namio Honda (IEEE Trans. Computers, 1975)

Condition for Injectivity of Global Maps for Tessellation Automata - Akira Maruoka; Masayuki Kimura (Inf. Control., 1976)

Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States - Akira Maruoka; Masayuki Kimura (Inf. Control., 1977)

Completeness Problem of Multidimensional Tessellation Automata - Akira Maruoka; Masayuki Kimura (Inf. Control., 1977)

Injectivity and Surjectivity of Parallel Maps for Cellular Automata. - Akira Maruoka; Masayuki Kimura (J. Comput. Syst. Sci., 1979)

Pattern Decomposition for Tessellation Automata. - Akira Maruoka; Masayuki Kimura; Nobuyoshi Shoji (Theor. Comput. Sci., 1981)

Strong Surjectivity is Equivalent to C-Injectivity. - Akira Maruoka; Masayuki Kimura (Theor. Comput. Sci., 1982)

Open Maps for Tessellation Automata. - Akira Maruoka (Theor. Comput. Sci., 1983)

Expanders Obtained from Affine Transformations (Preliminary Version) - Shuji Jimbo; Akira Maruoka (STOC, 1985)

Time and communication complexity in parallel computations. - Hiroshi Ishioka; Akira Maruoka; Masayuki Kimura (Syst. Comput. Jpn., 1986)

Complexity Based on Partitioning of Boolean Circuits and Their Relation to Multivalued Circuits. - Akira Maruoka (IEEE Trans. Computers, 1986)

Expanders obtained from affine transformations. - Shuji Jimbo; Akira Maruoka (Comb., 1987)

Relationships between PAC-learning algorithms and weak Occam algorithms. - Eiji Takimoto; Akira Maruoka (ALT, 1991)

Learning boolean functions. - Qian-Ping Gu; Akira Maruoka (Syst. Comput. Jpn., 1991)

Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. - Qian-Ping Gu; Akira Maruoka (SIAM J. Comput., 1991)

Learning k-Term Monotone Boolean Formulae. - Yoshifumi Sakai; Akira Maruoka (ALT, 1992)

Selection Networks with 8n log2n Size and O(log n) Depth. - Shuji Jimbo; Akira Maruoka (ISAAC, 1992)

Learning Monotone Boolean Functions by Uniformly Distributed Examples. - Qian-Ping Gu; Akira Maruoka (SIAM J. Comput., 1992)

Conservativeness and Monotonicity for Learning Algorithms. - Eiji Takimoto; Akira Maruoka (COLT, 1993)

Relationships between learning and information compression based on PAC learning model. - Eiji Takimoto; Akira Maruoka (Syst. Comput. Jpn., 1993)

Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm. - Eiji Takimoto; Ichiro Tajika; Akira Maruoka (AII/ALT, 1994)

Learning Monotone Log-Term DNF Formulas. - Yoshifumi Sakai; Akira Maruoka (COLT, 1994)

On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. - Shuji Jimbo; Akira Maruoka (Inf. Process. Lett., 1994)

On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. - Shuji Jimbo; Akira Maruoka (Inf. Process. Lett., 1994)

Construction of pseudorandom permutations. - Yasuhiro Ohnishi; Akira Maruoka (Syst. Comput. Jpn., 1994)

Learning Orthogonal F-Horn Formulas. - Akira Miyashiro; Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (ALT, 1995)

Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. - Yoshifumi Sakai; Eiji Takimoto; Akira Maruoka (COLT, 1995)

On the Sample Complexity of Consistent Learning with One-Sided Error. - Eiji Takimoto; Akira Maruoka (IEICE Trans. Inf. Syst., 1995)

Loop Circuits and Their Relation to Razborov's Approximation Model - Katsutoshi Nakayama; Akira Maruoka (Inf. Comput., 1995)

Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. - Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (ALT, 1996)

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

Approximation of the size of the union. - Shuji Jimbo; Akira Maruoka (Syst. Comput. Jpn., 1996)

A Method of Constructing Selection Networks with O(log n) Depth. - Shuji Jimbo; Akira Maruoka (SIAM J. Comput., 1996)

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 (ALT, 1997)

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

Learning Orthogonal F-Horn Formulas. - Eiji Takimoto; Akira Miyashiro; Akira Maruoka; Yoshifumi Sakai (Theor. Comput. Sci., 1997)

Structured Weight-Based Prediction Algorithms. - Akira Maruoka; Eiji Takimoto (ALT, 1998)

On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion. - Eiji Takimoto; Akira Maruoka (Discovery Science, 1998)

Consistency of Natural Relations on Sets. - Akira Maruoka; Mike Paterson; Hirotaka Koizumi (Comb. Probab. Comput., 1998)

Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. - Yoshifumi Sakai; Eiji Takimoto; Akira Maruoka (Inf. Comput., 1999)

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

Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. - Yoshifumi Sakai; Akira Maruoka (Theory Comput. Syst., 2000)

The learnability of exclusive-or expansions based on monotone DNF formulas. - Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (Theor. Comput. Sci., 2000)

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

Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. - Eiji Takimoto; Akira Maruoka; Volodya Vovk (Theor. Comput. Sci., 2001)

On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree. - Akira Maruoka; Eiji Takimoto (Progress in Discovery Science, 2002)

Top-Down Decision Tree Boosting and Its Applications. - Eiji Takimoto; Akira Maruoka (Progress in Discovery Science, 2002)

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)

Top-down decision tree learning as information based boosting. - Eiji Takimoto; Akira Maruoka (Theor. Comput. Sci., 2003)

Boosting Based on Divide and Merge. - Eiji Takimoto; Syuhei Koya; Akira Maruoka (ALT, 2004)

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

Relationships between Horn Formulas and XOR-MDNF Formulas. - Kenshi Matsuo; Tetsuya Koyama; Eiji Takimoto; Akira Maruoka (IEICE Trans. Inf. Syst., 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)

Aggregating Strategy for Online Auctions. - Shigeaki Harada; Eiji Takimoto; Akira Maruoka (COCOON, 2006)

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)

Online Allocation with Risk Information. - Shigeaki Harada; Eiji Takimoto; Akira Maruoka (IEICE Trans. Inf. Syst., 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)

How to Produce BlockSum Instances with Various Levels of Difficulty. - Kazuya Haraguchi; Yasutaka Abe; Akira Maruoka (J. Inf. Process., 2012)

A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. - Kazuya Haraguchi; Masaki Ishigaki; Akira Maruoka (FedCSIS, 2013)

Halide and GENESIS for Generating Domain-Specific Architecture of Guided Image Filtering. - Akari Ishikawa; Norishige Fukushima; Akira Maruoka; Takuro Iizuka (ISCAS, 2019)

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. - Shuji Jimbo; Akira Maruoka (WALCOM, 2019)

Analyzing trajectories of learning processes through behaviour-based entropy. - Shinsuke Seino; Kenji Kimura; Satoshi Kawamura; Yoshifumi Sasaki; Akira Maruoka (J. Exp. Theor. Artif. Intell., 2020)