| Publication | Date of Publication | Type |
|---|
| Learning orthogonal F-Horn formulas | 2023-12-08 | Paper |
| The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver | 2019-10-15 | Paper |
| Finite element analysis of solitary wave propagation by acoustic velocity method | 2018-02-08 | Paper |
| Concise Guide to Computation Theory | 2011-04-07 | Paper |
| Learnability of exclusive-or expansion based on monotone DNF formulas | 2010-04-27 | Paper |
| Inclusion-exclusion for \(k\)-CNF formulas | 2009-04-28 | Paper |
| Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments | 2008-07-10 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Aggregating Strategy for Online Auctions | 2007-09-10 | Paper |
| On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences | 2007-09-10 | Paper |
| Better upper bounds on the QOBDD size of integer multiplication | 2007-06-26 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The monotone circuit complexity of quadratic Boolean functions | 2006-10-16 | Paper |
| On learning monotone Boolean functions under the uniform distribution | 2006-03-20 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates | 2005-10-28 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| The Potential of the Approximation Method | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044512 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044515 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470578 | 2004-07-01 | Paper |
| Finite Element Analysis for Flow Around a Rotating Body using Chimera Method | 2004-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437511 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420740 | 2003-08-18 | Paper |
| Top-down decision tree learning as information based boosting | 2003-05-14 | Paper |
| On the negation-limited circuit complexity of merging | 2003-03-09 | Paper |
| Proper learning algorithm for functions of \(k\) terms under smooth distributions. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779140 | 2002-11-25 | Paper |
| Three Dimensional Numerical Flow Simulation Around Parallel Rectangular Cylinders | 2002-01-08 | Paper |
| Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme | 2001-08-20 | Paper |
| The Numerical Simulation of Snowdrift Around a Building | 2001-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505387 | 2000-09-27 | Paper |
| The learnability of exclusive-or expansions based on monotone DNF formulas | 2000-08-21 | Paper |
| Learning monotone log-term DNF formulas under the uniform distribution | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938666 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937854 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937870 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937191 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937202 | 2000-02-03 | Paper |
| Numerical Fluid Flow Analysis for Aerodynamic Response Characteristics of Tandem Circular Cylinders | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703440 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703450 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703860 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703861 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253367 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267808 | 1999-10-24 | Paper |
| Consistency of Natural Relations on Sets | 1999-09-05 | Paper |
| Optimal Control in Navier-Stokes Equations | 1999-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218113 | 1999-06-27 | Paper |
| Learning k-Term Monotone Boolean Formulae. | 1999-05-31 | Paper |
| Learning orthogonal F-Horn formulas | 1998-07-22 | Paper |
| 2-D Fluid-Structure Interaction Problems by an Arbitrary Lagrangian-Eulerian Finite Element Method | 1997-10-26 | Paper |
| Approximation algorithm for DNF under distributions with limited independence | 1997-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126930 | 1997-04-03 | Paper |
| A Method of Constructing Selection Networks with $O(\log n)$ Depth | 1996-12-16 | Paper |
| On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables | 1994-08-03 | Paper |
| On the relationship between the diameter and the size of a boundary of a directed graph | 1994-07-04 | Paper |
| Learning Monotone Boolean Functions by Uniformly Distributed Examples | 1993-01-16 | Paper |
| Amplification of Bounded Depth Monotone Read-Once Boolean Formulae | 1991-01-01 | Paper |
| Expanders obtained from affine transformations | 1987-01-01 | Paper |
| Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits | 1986-01-01 | Paper |
| Open maps for tessellation automata | 1983-01-01 | Paper |
| Strong surjectivity is equivalent to C-injectivity | 1982-01-01 | Paper |
| Pattern decomposition for tessellation automata | 1981-01-01 | Paper |
| Injectivity and surjectivity of parallel maps for cellular automata | 1979-01-01 | Paper |
| Decomposition phenomenon in one-dimensional scope-three tessellation automata with arbitrary number of states | 1977-01-01 | Paper |
| Completeness problem of multidimensional tessellation automata | 1977-01-01 | Paper |
| Condition for injectivity of global maps for tessellation automata | 1976-01-01 | Paper |
| The Range of Logical Flexibility of Tree Networks | 1975-01-01 | Paper |
| Completeness problem of one-dimensional binary scope-3 tessellation automata | 1974-01-01 | Paper |
| Logical Networks of Flexible Cells | 1973-01-01 | Paper |
