| Publication | Date of Publication | Type |
|---|
| The Hadamard decomposition problem | 2024-09-20 | Paper |
| Randomization methods for assessing data analysis results on real‐valued matrices | 2020-10-14 | Paper |
| Mining Chains of Relations | 2012-02-09 | Paper |
| A Theory of Inductive Query Answering | 2010-12-22 | Paper |
| Approximating the Minimum Chain Completion problem | 2010-08-20 | Paper |
| A randomized approximation algorithm for computing bucket orders | 2010-06-16 | Paper |
| Complexity control in a mixture model by the Hardy-Weinberg equilibrium | 2010-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301537 | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5456817 | 2008-04-14 | Paper |
| Constraint-Based Mining and Inductive Databases | 2006-11-13 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829128 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046472 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737144 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4802614 | 2003-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797094 | 2003-03-12 | Paper |
| Rule discovery in telecommunication alarm data | 2003-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547546 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736344 | 2001-08-29 | Paper |
| Reasoning with examples: Propositional formulae and database dependencies | 1999-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375696 | 1998-03-30 | Paper |
| Approximate inference of functional dependencies from relations | 1997-02-28 | Paper |
| Distance measures for point sets and their computation | 1996-09-25 | Paper |
| Ordered and Unordered Tree Inclusion | 1995-05-30 | Paper |
| Recognizing renamable generalized propositional Horn formulas is NP- complete | 1995-05-17 | Paper |
| Algorithms for inferring functional dependencies from relations | 1994-05-15 | Paper |
| Right invariant metrics and measures of presortedness | 1993-05-16 | Paper |
| On the complexity of inferring functional dependencies | 1993-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023862 | 1993-01-23 | Paper |
| Discovering functional and inclusion dependencies in relational databases | 1993-01-17 | Paper |
| Unifications, deunifications, and their complexity | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3485855 | 1990-01-01 | Paper |
| Automatic generation of test data for relational queries | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796783 | 1988-01-01 | Paper |
| A note on the largest empty rectangle problem | 1988-01-01 | Paper |
| Design by example: An application of Armstrong relations | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721668 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730015 | 1986-01-01 | Paper |
| Measures of Presortedness and Optimal Sorting Algorithms | 1985-01-01 | Paper |
| A simple proof of the rectilinear art gallery theorem | 1985-01-01 | Paper |
| On the suitability of trace semantics for modular proofs of communicating processes | 1985-01-01 | Paper |
| A semantic approach to program modularity | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714470 | 1984-01-01 | Paper |
| On the relationship of minimum and optimum covers for a set of functional dependencies | 1983-01-01 | Paper |
| A topological characterization of \((\lambda,\mu)^*-compactness\) | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316560 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959469 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942373 | 1982-01-01 | Paper |
