| Publication | Date of Publication | Type |
|---|
| Nearest neighbor representations of Boolean functions | 2022-06-08 | Paper |
| Betweenness centrality profiles in trees | 2021-04-22 | Paper |
| On the computational complexity of MapReduce | 2018-08-24 | Paper |
| Hydras: directed hypergraphs and Horn formulas | 2017-02-06 | Paper |
| Characterizability in Horn Belief Revision | 2016-11-30 | Paper |
| Biclique Coverings, Rectifier Networks and the Cost of ε-Removal | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403025 | 2014-03-25 | Paper |
| Non-characterizability of belief revision: an application of finite model theory | 2014-03-25 | Paper |
| Hydras: Directed Hypergraphs and Horn Formulas | 2012-11-06 | Paper |
| On multiple-instance learning of halfspaces | 2012-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3006474 | 2011-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081624 | 2011-03-09 | Paper |
| Finding bipartite subgraphs efficiently | 2010-09-07 | Paper |
| On Approximate Horn Formula Minimization | 2010-09-07 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Combinatorial Problems for Horn Clauses | 2010-01-07 | Paper |
| On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance | 2009-11-19 | Paper |
| Horn Upper Bounds and Renaming | 2009-03-10 | Paper |
| On k-Term DNF with the Largest Number of Prime Implicants | 2008-12-05 | Paper |
| Projective DNF formulae and their revision | 2008-02-26 | Paper |
| Revising threshold functions | 2007-09-18 | Paper |
| The inverse protein folding problem on 2D and 3D lattices | 2007-04-18 | Paper |
| On set systems with a threshold property | 2006-12-14 | Paper |
| The DNF exception problem | 2006-03-24 | Paper |
| Theory revision with queries: Horn, read-once, and parity formulas | 2006-02-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Learnability and definability in trees and similar structures | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736878 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431347 | 2003-10-21 | Paper |
| Remarks on computational learning theory | 2002-06-27 | Paper |
| Theory revision with queries: DNF formulas | 2002-04-11 | Paper |
| On frequent sets of Boolean matrices | 1999-05-03 | Paper |
| Malicious omissions and errors in answers to membership queries | 1997-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336120 | 1997-05-12 | Paper |
| On the computation of Boolean functions by analog circuits of bounded fan-in | 1997-03-18 | Paper |
| A size-depth trade-off for the analog computation of Boolean functions | 1997-02-27 | Paper |
| On the complexity of planar Boolean circuits | 1995-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839057 | 1995-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302463 | 1994-09-13 | Paper |
| Algorithms and lower bounds for on-line learning of geometrical concepts | 1994-07-12 | Paper |
| Two tapes versus one for off-line Turing machines | 1994-05-08 | Paper |
| Threshold circuits of bounded depth | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036606 | 1993-05-18 | Paper |
| Lower bound methods and separation results for on-line learning models | 1993-04-01 | Paper |
| The communication complexity of interval orders | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013555 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470257 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477957 | 1990-01-01 | Paper |
| Lower bounds for synchronous circuits and planar circuits | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3031924 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352964 | 1989-01-01 | Paper |
| Resolution proofs of generalized pigeonhole principles | 1988-01-01 | Paper |
| Sorting and Recognition Problems for Ordered Sets | 1988-01-01 | Paper |
| On the complexity of cutting-plane proofs | 1987-01-01 | Paper |
| On the complexity of interval orders and semiorders | 1987-01-01 | Paper |
| A lower bound for read-once-only branching programs | 1987-01-01 | Paper |
| The Complexity of Defining a Relation on a Finite Graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3748301 | 1986-01-01 | Paper |
| Searching in Trees, Series-Parallel and Interval Orders | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685207 | 1985-01-01 | Paper |
| On the definability of properties of finite graphs | 1984-01-01 | Paper |
| The critical complexity of graph properties | 1984-01-01 | Paper |
| On the succinct representation of graphs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686052 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219131 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339312 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3938507 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919717 | 1978-01-01 | Paper |
