Akira Maruoka

From MaRDI portal
Person:675866

Available identifiers

zbMath Open maruoka.akiraMaRDI QIDQ675866

List of research outcomes

PublicationDate of PublicationType
Learning orthogonal F-Horn formulas2023-12-08Paper
The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver2019-10-15Paper
Finite element analysis of solitary wave propagation by acoustic velocity method2018-02-08Paper
Concise Guide to Computation Theory2011-04-07Paper
Learnability of exclusive-or expansion based on monotone DNF formulas2010-04-27Paper
Inclusion-exclusion for \(k\)-CNF formulas2009-04-28Paper
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments2008-07-10Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Aggregating Strategy for Online Auctions2007-09-10Paper
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences2007-09-10Paper
Better upper bounds on the QOBDD size of integer multiplication2007-06-26Paper
Algorithmic Learning Theory2006-11-01Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
The monotone circuit complexity of quadratic Boolean functions2006-10-16Paper
On learning monotone Boolean functions under the uniform distribution2006-03-20Paper
Algorithms and Computation2005-12-22Paper
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates2005-10-28Paper
Algorithmic Learning Theory2005-08-18Paper
The Potential of the Approximation Method2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q30445122004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30445152004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44705782004-07-01Paper
Finite Element Analysis for Flow Around a Rotating Body using Chimera Method2004-03-21Paper
https://portal.mardi4nfdi.de/entity/Q44375112003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44207402003-08-18Paper
Top-down decision tree learning as information based boosting2003-05-14Paper
On the negation-limited circuit complexity of merging2003-03-09Paper
Proper learning algorithm for functions of \(k\) terms under smooth distributions.2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47791402002-11-25Paper
Three Dimensional Numerical Flow Simulation Around Parallel Rectangular Cylinders2002-01-08Paper
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme2001-08-20Paper
The Numerical Simulation of Snowdrift Around a Building2001-07-16Paper
https://portal.mardi4nfdi.de/entity/Q45053872000-09-27Paper
The learnability of exclusive-or expansions based on monotone DNF formulas2000-08-21Paper
Learning monotone log-term DNF formulas under the uniform distribution2000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49386662000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49378542000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49378702000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49371912000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49372022000-02-03Paper
Numerical Fluid Flow Analysis for Aerodynamic Response Characteristics of Tandem Circular Cylinders1999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q47034401999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47034501999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47038601999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q47038611999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42533671999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42678081999-10-24Paper
Consistency of Natural Relations on Sets1999-09-05Paper
Optimal Control in Navier-Stokes Equations1999-08-11Paper
https://portal.mardi4nfdi.de/entity/Q42181131999-06-27Paper
Learning k-Term Monotone Boolean Formulae.1999-05-31Paper
Learning orthogonal F-Horn formulas1998-07-22Paper
2-D Fluid-Structure Interaction Problems by an Arbitrary Lagrangian-Eulerian Finite Element Method1997-10-26Paper
Approximation algorithm for DNF under distributions with limited independence1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q31269301997-04-03Paper
A Method of Constructing Selection Networks with $O(\log n)$ Depth1996-12-16Paper
On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables1994-08-03Paper
On the relationship between the diameter and the size of a boundary of a directed graph1994-07-04Paper
Learning Monotone Boolean Functions by Uniformly Distributed Examples1993-01-16Paper
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae1991-01-01Paper
Expanders obtained from affine transformations1987-01-01Paper
Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits1986-01-01Paper
Open maps for tessellation automata1983-01-01Paper
Strong surjectivity is equivalent to C-injectivity1982-01-01Paper
Pattern decomposition for tessellation automata1981-01-01Paper
Injectivity and surjectivity of parallel maps for cellular automata1979-01-01Paper
Decomposition phenomenon in one-dimensional scope-three tessellation automata with arbitrary number of states1977-01-01Paper
Completeness problem of multidimensional tessellation automata1977-01-01Paper
Condition for injectivity of global maps for tessellation automata1976-01-01Paper
The Range of Logical Flexibility of Tree Networks1975-01-01Paper
Completeness problem of one-dimensional binary scope-3 tessellation automata1974-01-01Paper
Logical Networks of Flexible Cells1973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Akira Maruoka