default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkira Maruoka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j44]Shinsuke Seino, Kenji Kimura, Satoshi Kawamura, Yoshifumi Sasaki, Akira Maruoka:
Analyzing trajectories of learning processes through behaviour-based entropy. J. Exp. Theor. Artif. Intell. 32(3): 465-501 (2020)
2010 – 2019
- 2019
- [c34]Akari Ishikawa, Norishige Fukushima, Akira Maruoka, Takuro Iizuka:
Halide and GENESIS for Generating Domain-Specific Architecture of Guided Image Filtering. ISCAS 2019: 1-5 - [c33]Shuji Jimbo
, Akira Maruoka:
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. WALCOM 2019: 199-208 - 2013
- [c32]Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka:
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. FedCSIS 2013: 347-354 - 2012
- [j43]Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka:
How to Produce BlockSum Instances with Various Levels of Difficulty. Inf. Media Technol. 7(3): 1033-1043 (2012) - [j42]Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka:
How to Produce BlockSum Instances with Various Levels of Difficulty. J. Inf. Process. 20(3): 727-737 (2012)
2000 – 2009
- 2008
- [c31]Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka:
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. COCOON 2008: 191-203 - 2007
- [j41]Kazuyuki Amano, Akira Maruoka:
Better upper bounds on the QOBDD size of integer multiplication. Discret. Appl. Math. 155(10): 1224-1232 (2007) - 2006
- [j40]Kazuyuki Amano, Akira Maruoka:
The Monotone Circuit Complexity of Quadratic Boolean Functions. Algorithmica 46(1): 3-14 (2006) - [j39]Shigeaki Harada, Eiji Takimoto, Akira Maruoka:
Online Allocation with Risk Information. IEICE Trans. Inf. Syst. 89-D(8): 2340-2347 (2006) - [j38]Kazuyuki Amano, Akira Maruoka:
On learning monotone Boolean functions under the uniform distribution. Theor. Comput. Sci. 350(1): 3-12 (2006) - [c30]Shigeaki Harada, Eiji Takimoto, Akira Maruoka:
Aggregating Strategy for Online Auctions. COCOON 2006: 33-41 - [c29]Takayuki Sato, Kazuyuki Amano, Akira Maruoka:
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. COCOON 2006: 104-115 - 2005
- [j37]Kazuyuki Amano, Akira Maruoka:
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates. SIAM J. Comput. 35(1): 201-216 (2005) - [c28]Shigeaki Harada, Eiji Takimoto, Akira Maruoka:
Online Allocation with Risk Information. ALT 2005: 343-355 - [c27]Kazuyuki Amano, Akira Maruoka:
On the Complexity of Depth-2 Circuits with Threshold Gates. MFCS 2005: 107-118 - 2004
- [j36]Kenshi Matsuo, Tetsuya Koyama, Eiji Takimoto, Akira Maruoka:
Relationships between Horn Formulas and XOR-MDNF Formulas. IEICE Trans. Inf. Syst. 87-D(2): 343-351 (2004) - [j35]Kazuyuki Amano, Akira Maruoka:
The Potential of the Approximation Method. SIAM J. Comput. 33(2): 433-447 (2004) - [c26]Eiji Takimoto, Syuhei Koya, Akira Maruoka:
Boosting Based on Divide and Merge. ALT 2004: 127-141 - [c25]Kazuyuki Amano, Akira Maruoka:
On the Monotone Circuit Complexity of Quadratic Boolean Functions. ISAAC 2004: 28-40 - [e3]Shai Ben-David, John Case, Akira Maruoka:
Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings. Lecture Notes in Computer Science 3244, Springer 2004, ISBN 978-3-540-23356-5 [contents] - [i1]Kazuyuki Amano, Akira Maruoka:
Better Simulation of Exponential Threshold Weights by Polynomial Weights. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j34]Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the negation-limited circuit complexity of merging. Discret. Appl. Math. 126(1): 3-8 (2003) - [j33]Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura:
Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87(2): 111-117 (2003) - [j32]Eiji Takimoto, Akira Maruoka:
Top-down decision tree learning as information based boosting. Theor. Comput. Sci. 292(2): 447-464 (2003) - [c24]Kazuyuki Amano, Akira Maruoka:
Some Properties of MODm Circuits Computing Simple Functions. CIAC 2003: 227-237 - [c23]Kazuyuki Amano, Akira Maruoka:
On Optimal Merging Networks. MFCS 2003: 152-161 - 2002
- [c22]Kazuyuki Amano, Akira Maruoka:
On Learning Monotone Boolean Functions under the Uniform Distribution. ALT 2002: 57-68 - [c21]Akira Maruoka, Eiji Takimoto:
On-Line Algorithm to Predict Nearly as Well as the Best Pruning of a Decision Tree. Progress in Discovery Science 2002: 296-306 - [c20]Eiji Takimoto, Akira Maruoka:
Top-Down Decision Tree Boosting and Its Applications. Progress in Discovery Science 2002: 327-337 - 2001
- [j31]Eiji Takimoto, Akira Maruoka, Volodya Vovk:
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. Theor. Comput. Sci. 261(1): 179-209 (2001) - [c19]Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka:
The Computational Power of a Family of Decision Forests. MFCS 2001: 123-134 - 2000
- [j30]Yoshifumi Sakai, Akira Maruoka:
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. Theory Comput. Syst. 33(1): 17-33 (2000) - [j29]Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
The learnability of exclusive-or expansions based on monotone DNF formulas. Theor. Comput. Sci. 241(1-2): 37-50 (2000) - [c18]Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka:
On-Line Estimation of Hidden Markov Model Parameters. Discovery Science 2000: 155-169
1990 – 1999
- 1999
- [j28]Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka:
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. Inf. Comput. 152(2): 188-204 (1999) - [c17]Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the Negation-Limited Circuit Complexity of Merging. COCOON 1999: 204-209 - 1998
- [j27]Akira Maruoka, Mike Paterson, Hirotaka Koizumi:
Consistency of Natural Relations on Sets. Comb. Probab. Comput. 7(3): 281-293 (1998) - [c16]Akira Maruoka, Eiji Takimoto:
Structured Weight-Based Prediction Algorithms. ALT 1998: 127-142 - [c15]Eiji Takimoto, Akira Maruoka:
On the Boosting Algorithm for Multiclass Functions Based on Information-Theoretic Criterion for Approxiamtion. Discovery Science 1998: 256-267 - [c14]Kazuyuki Amano, Akira Maruoka:
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. MFCS 1998: 399-408 - 1997
- [j26]Kazuyuki Amano, Akira Maruoka:
Approximation Algorithms for DNF Under Distributions with Limited Independence. Theory Comput. Syst. 30(2): 181-196 (1997) - [j25]Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai:
Learning Orthogonal F-Horn Formulas. Theor. Comput. Sci. 185(1): 177-190 (1997) - [c13]Eiji Takimoto, Ken'ichi Hirai, Akira Maruoka:
A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree. ALT 1997: 385-400 - [e2]Ming Li, Akira Maruoka:
Algorithmic Learning Theory, 8th International Conference, ALT '97, Sendai, Japan, October 6-8, 1997, Proceedings. Lecture Notes in Computer Science 1316, Springer 1997, ISBN 3-540-63577-7 [contents] - 1996
- [j24]Shuji Jimbo, Akira Maruoka:
Approximation of the size of the union. Syst. Comput. Jpn. 27(6): 11-23 (1996) - [j23]Shuji Jimbo, Akira Maruoka:
A Method of Constructing Selection Networks with O(log n) Depth. SIAM J. Comput. 25(4): 709-739 (1996) - [c12]Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. ALT 1996: 12-25 - [c11]Kazuyuki Amano, Akira Maruoka:
Potential of the Approximation Method (extended abstract). FOCS 1996: 431-440 - 1995
- [j22]Katsutoshi Nakayama, Akira Maruoka:
Loop Circuits and Their Relation to Razborov's Approximation Model. Inf. Comput. 119(2): 154-159 (1995) - [j21]Eiji Takimoto, Akira Maruoka:
On the Sample Complexity of Consistent Learning with One-Sided Error. IEICE Trans. Inf. Syst. 78-D(5): 518-525 (1995) - [c10]Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
Learning Orthogonal F-Horn Formulas. ALT 1995: 110-122 - [c9]Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka:
Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. COLT 1995: 206-213 - 1994
- [j20]Shuji Jimbo, Akira Maruoka:
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. Inf. Process. Lett. 50(5): 277-282 (1994) - [j19]Shuji Jimbo, Akira Maruoka:
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. Inf. Process. Lett. 51(1): 17-23 (1994) - [j18]Yasuhiro Ohnishi, Akira Maruoka:
Construction of pseudorandom permutations. Syst. Comput. Jpn. 25(9): 32-40 (1994) - [c8]Eiji Takimoto, Ichiro Tajika, Akira Maruoka:
Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm. AII/ALT 1994: 547-559 - [c7]Yoshifumi Sakai, Akira Maruoka:
Learning Monotone Log-Term DNF Formulas. COLT 1994: 165-172 - 1993
- [j17]Eiji Takimoto, Akira Maruoka:
Relationships between learning and information compression based on PAC learning model. Syst. Comput. Jpn. 24(8): 47-58 (1993) - [c6]Eiji Takimoto, Akira Maruoka:
On the Sample Complexity of Consistent Learning with One-Sided Error. ALT 1993: 265-278 - [c5]Eiji Takimoto, Akira Maruoka:
Conservativeness and Monotonicity for Learning Algorithms. COLT 1993: 377-383 - 1992
- [j16]Qian-Ping Gu, Akira Maruoka:
Learning Monotone Boolean Functions by Uniformly Distributed Examples. SIAM J. Comput. 21(3): 587-599 (1992) - [c4]Yoshifumi Sakai, Akira Maruoka:
Learning k-Term Monotone Boolean Formulae. ALT 1992: 197-207 - [c3]Shuji Jimbo, Akira Maruoka:
Selection Networks with 8n log2n Size and O(log n) Depth. ISAAC 1992: 165-174 - 1991
- [j15]Qian-Ping Gu, Akira Maruoka:
Learning boolean functions. Syst. Comput. Jpn. 22(1): 1-9 (1991) - [j14]Qian-Ping Gu, Akira Maruoka:
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. SIAM J. Comput. 20(1): 41-55 (1991) - [c2]Eiji Takimoto, Akira Maruoka:
Relationships between PAC-learning algorithms and weak Occam algorithms. ALT 1991: 151-162 - [e1]Setsuo Arikawa, Akira Maruoka, Taisuke Sato:
Algorithmic Learning Theory, 2nd International Workshop, ALT '91, Tokyo, Japan, October 23-25, 1991, Proceedings. Ohmsha 1991 [contents]
1980 – 1989
- 1987
- [j13]Shuji Jimbo, Akira Maruoka:
Expanders obtained from affine transformations. Comb. 7(4): 343-355 (1987) - 1986
- [j12]Hiroshi Ishioka, Akira Maruoka, Masayuki Kimura:
Time and communication complexity in parallel computations. Syst. Comput. Jpn. 17(10): 1-10 (1986) - [j11]Akira Maruoka:
Complexity Based on Partitioning of Boolean Circuits and Their Relation to Multivalued Circuits. IEEE Trans. Computers 35(2): 115-123 (1986) - 1985
- [c1]Shuji Jimbo, Akira Maruoka:
Expanders Obtained from Affine Transformations (Preliminary Version). STOC 1985: 88-97 - 1983
- [j10]Akira Maruoka:
Open Maps for Tessellation Automata. Theor. Comput. Sci. 27: 217-224 (1983) - 1982
- [j9]Akira Maruoka, Masayuki Kimura:
Strong Surjectivity is Equivalent to C-Injectivity. Theor. Comput. Sci. 18: 269-277 (1982) - 1981
- [j8]Akira Maruoka, Masayuki Kimura, Nobuyoshi Shoji:
Pattern Decomposition for Tessellation Automata. Theor. Comput. Sci. 14: 211-226 (1981)
1970 – 1979
- 1979
- [j7]Akira Maruoka, Masayuki Kimura:
Injectivity and Surjectivity of Parallel Maps for Cellular Automata. J. Comput. Syst. Sci. 18(1): 47-64 (1979) - 1977
- [j6]Akira Maruoka, Masayuki Kimura:
Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States. Inf. Control. 34(4): 296-313 (1977) - [j5]Akira Maruoka, Masayuki Kimura:
Completeness Problem of Multidimensional Tessellation Automata. Inf. Control. 35(1): 52-86 (1977) - 1976
- [j4]Akira Maruoka, Masayuki Kimura:
Condition for Injectivity of Global Maps for Tessellation Automata. Inf. Control. 32(2): 158-162 (1976) - 1975
- [j3]Akira Maruoka, Namio Honda:
The Range of Logical Flexibility of Tree Networks. IEEE Trans. Computers 24(1): 9-28 (1975) - 1974
- [j2]Akira Maruoka, Masayuki Kimura:
Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata. J. Comput. Syst. Sci. 9(1): 31-47 (1974) - 1973
- [j1]Akira Maruoka, Namio Honda:
Logical Networks of Flexible Cells. IEEE Trans. Computers 22(4): 347-358 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
