Get started
Author

Akira Maruoka

Observed names: A Maruoka, A. Maruoka, AKIRA MARUOKA, Akira MARUOKA, Maruoka Akira, Maruoka, Akira
Institution: Tohoku University
Observed institutions: University of Waterloo, City University of Hong Kong, Tohoku University, Ishinomaki Senshu University, Hachinohe National College of Technology, Information Processing Society of Japan, Hitachi (Japan), Carnegie Mellon University, Saarland University
OpenAlex ID: A5088040293
Expanders obtained from affine transformations
1987 · Shuji Jimbo, Akira Maruoka · COMBINATORICA · 79
Condition for injectivity of global maps for tessellation automata
1976 · Akira Maruoka, Masayuki Kimura · Information and Control · 66
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
2005 · Kazuyuki Amano, Akira Maruoka · SIAM Journal on Computing · 42
Injectivity and surjectivity of parallel maps for cellular automata
1979 · Akira Maruoka, Masayuki Kimura · Journal of Computer and System Sciences · 33
Expanders obtained from affine transformations
1985 · S Jimbo, A Maruoka · ACM Symposium on Theory of Computing (STOC) · 29
On the Complexity of Depth-2 Circuits with Threshold Gates
2005 · Kazuyuki Amano, Akira Maruoka · Lecture notes in computer science · 24
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution
2000 · Y. Sakai, A. Maruoka · Theory of Computing Systems · 20
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
2001 · Eiji Takimoto, Akira Maruoka, et al. · Theoretical Computer Science · 19
PDF
Top-down decision tree learning as information based boosting
2003 · Eiji Takimoto, Akira Maruoka · Theoretical Computer Science · 17
PDF
On the negation-limited circuit complexity of merging
2002 · Kazuyuki Amano, Akira Maruoka, et al. · Discrete Applied Mathematics · 17
On-line Estimation of Hidden Markov Model Parameters
2000 · Jun Mizuno, Tatsuya Watanabe, et al. · Lecture notes in computer science · 17
Potential of the approximation method
2002 · K. Amano, A. Maruoka · Annual Symposium on Foundations of Computer Science · 16
On learning monotone Boolean functions under the uniform distribution
2005 · Kazuyuki Amano, Akira Maruoka · Theoretical Computer Science · 15
PDF
The Potential of the Approximation Method
2004 · Kazuyuki Amano, Akira Maruoka · SIAM Journal on Computing · 14
A Method of Constructing Selection Networks with $O(\log n)$ Depth
1996 · S. Jimbo, A. Maruoka · SIAM Journal on Computing · 14
Algorithmic Learning Theory: 8th International Workshop, ALT '97 Sendai, Japan, October 6–8, 1997 Proceedings
1997 · Li, Ming, Maruoka, Akira · Lecture notes in computer science · 11
Learning Monotone Boolean Functions by Uniformly Distributed Examples
1992 · Qian Ping Gu, Akira Maruoka · SIAM Journal on Computing · 10
Completeness problem of one-dimensional binary scope-3 tessellation automata
1974 · Akira Maruoka, Masayuki Kimura · Journal of Computer and System Sciences · 10
Better upper bounds on the QOBDD size of integer multiplication
2007 · Kazuyuki Amano, Akira Maruoka · Discrete Applied Mathematics · 9
Proper learning algorithm for functions of k terms under smooth distributions
1995 · Yoshifumi Sakai, Eiji Takimoto, et al. · Conference on Learning Theory · 9
PDF
Learning monotone log-term DNF formulas
1994 · Yoshifumi Sakai, Akira Maruoka · Conference on Learning Theory · 9
PDF
Concise Guide to Computation Theory
2011 · Akira Maruoka · Springer eBooks · 7
Selection networks with 8n log2 n size and O(log n) depth
1992 · Shuji Jimbo, Akira Maruoka · Lecture notes in computer science · 7
PDF
Logical Networks of Flexible Cells
1973 · A. Maruoka, N. Honda · IEEE Transactions on Computers · 7
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences
2006 · Takayuki Sato, Kazuyuki Amano, et al. · Lecture notes in computer science · 6
Works count: 109
Citation count: 601
H-index: 14
I10-index: 18
Year
Topic
Type