| Publication | Date of Publication | Type |
|---|
Nearest neighbor representations of Boolean functions
Information and Computation | 2022-06-08 | Paper |
Betweenness centrality profiles in trees
Journal of Complex Networks | 2021-04-22 | Paper |
On the computational complexity of MapReduce
(available as arXiv preprint) | 2018-08-24 | Paper |
Hydras: directed hypergraphs and Horn formulas
Theoretical Computer Science | 2017-02-06 | Paper |
Characterizability in Horn belief revision
Logics in Artificial Intelligence | 2016-11-30 | Paper |
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
| Random Horn formulas and propagation connectivity for directed hypergraphs | 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
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
On multiple-instance learning of halfspaces
Information Processing Letters | 2012-10-23 | Paper |
| Horn upper bounds and renaming | 2011-06-14 | Paper |
| Learning Boolean functions with queries | 2011-03-09 | Paper |
Finding bipartite subgraphs efficiently
Information Processing Letters | 2010-09-07 | Paper |
On approximate Horn formula minimization
Automata, Languages and Programming | 2010-09-07 | Paper |
Projective DNF formulae and their revision.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Combinatorial Problems for Horn Clauses
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
Horn Upper Bounds and Renaming
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
On k-Term DNF with the Largest Number of Prime Implicants
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Projective DNF formulae and their revision
Discrete Applied Mathematics | 2008-02-26 | Paper |
Revising threshold functions
Theoretical Computer Science | 2007-09-18 | Paper |
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics | 2007-04-18 | Paper |
On set systems with a threshold property
Discrete Mathematics | 2006-12-14 | Paper |
The DNF exception problem
Theoretical Computer Science | 2006-03-24 | Paper |
Theory revision with queries: Horn, read-once, and parity formulas
Artificial Intelligence | 2006-02-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Learnability and definability in trees and similar structures
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086423 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1995129 (Why is no real title available?) | 2003-10-21 | Paper |
Remarks on computational learning theory
Annals of Mathematics and Artificial Intelligence | 2002-06-27 | Paper |
Theory revision with queries: DNF formulas
Machine Learning | 2002-04-11 | Paper |
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence | 1999-05-03 | Paper |
Malicious omissions and errors in answers to membership queries
Machine Learning | 1997-10-07 | Paper |
| scientific article; zbMATH DE number 1008380 (Why is no real title available?) | 1997-05-12 | Paper |
On the computation of Boolean functions by analog circuits of bounded fan-in
Journal of Computer and System Sciences | 1997-03-18 | Paper |
A size-depth trade-off for the analog computation of Boolean functions
Information Processing Letters | 1997-02-27 | Paper |
On the complexity of planar Boolean circuits
Computational Complexity | 1995-07-19 | Paper |
| scientific article; zbMATH DE number 774003 (Why is no real title available?) | 1995-07-13 | Paper |
| scientific article; zbMATH DE number 619542 (Why is no real title available?) | 1994-09-13 | Paper |
Algorithms and lower bounds for on-line learning of geometrical concepts
Machine Learning | 1994-07-12 | Paper |
Two tapes versus one for off-line Turing machines
Computational Complexity | 1994-05-08 | Paper |
Threshold circuits of bounded depth
Journal of Computer and System Sciences | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176776 (Why is no real title available?) | 1993-05-18 | Paper |
Lower bound methods and separation results for on-line learning models
Machine Learning | 1993-04-01 | Paper |
The communication complexity of interval orders
Discrete Applied Mathematics | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 67634 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4147508 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4137540 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4204280 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4130003 (Why is no real title available?) | 1989-01-01 | Paper |
Lower bounds for synchronous circuits and planar circuits
Information Processing Letters | 1989-01-01 | Paper |
Resolution proofs of generalized pigeonhole principles
Theoretical Computer Science | 1988-01-01 | Paper |
Sorting and Recognition Problems for Ordered Sets
SIAM Journal on Computing | 1988-01-01 | Paper |
A lower bound for read-once-only branching programs
Journal of Computer and System Sciences | 1987-01-01 | Paper |
On the complexity of cutting-plane proofs
Discrete Applied Mathematics | 1987-01-01 | Paper |
On the complexity of interval orders and semiorders
Discrete Mathematics | 1987-01-01 | Paper |
The Complexity of Defining a Relation on a Finite Graph
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1987-01-01 | Paper |
Searching in Trees, Series-Parallel and Interval Orders
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3983202 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3907780 (Why is no real title available?) | 1985-01-01 | Paper |
On the succinct representation of graphs
Discrete Applied Mathematics | 1984-01-01 | Paper |
The critical complexity of graph properties
Information Processing Letters | 1984-01-01 | Paper |
On the definability of properties of finite graphs
Discrete Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3909755 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3885330 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3872712 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3754050 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3732055 (Why is no real title available?) | 1978-01-01 | Paper |
