| Publication | Date of Publication | Type |
|---|
Computations with finite closure systems and implications
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Compression with wildcards: all exact or all minimal hitting sets
Open Mathematics | 2023-10-31 | Paper |
Compression with wildcards: Abstract simplicial complexes
Quaestiones Mathematicae | 2023-07-14 | Paper |
Enumerating all minimal hitting sets in polynomial total time
| 2023-03-14 | Paper |
Modular lattices of finite length (Part B)
| 2022-02-08 | Paper |
Modular lattices of finite length (Part A)
| 2022-01-26 | Paper |
Finding or counting all shellings of a simplicial complex
| 2018-11-28 | Paper |
Tight embedding of modular lattices into partition lattices: progress and program
Algebra Universalis | 2018-10-24 | Paper |
Compressed representation of learning spaces
Journal of Mathematical Psychology | 2017-11-08 | Paper |
Tight embedding of modular lattices into partition lattices: progress and program
| 2017-04-12 | Paper |
Calculating the output distribution of stack filters that are erosion-dilation cascades, in particular \(LU\,LU\)-filters
Quaestiones Mathematicae | 2017-03-20 | Paper |
The joy of implications, aka pure Horn formulas: mainly a survey
Theoretical Computer Science | 2017-02-06 | Paper |
Compactly generating all satisfying truth assignments of a Horn formula
Journal of Satisfiability, Boolean Modeling and Computation | 2016-02-23 | Paper |
Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function
Journal of Mathematical Imaging and Vision | 2015-01-28 | Paper |
Counting or producing all fixed cardinality transversals
Algorithmica | 2014-11-19 | Paper |
Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
Order | 2014-06-12 | Paper |
Coupon collecting and transversals of hypergraphs
| 2014-02-14 | Paper |
Inclusion-exclusion enhanced by nerve stimulation
| 2013-09-26 | Paper |
How to partition or count an abstract simplicial complex, given its facets
| 2013-02-05 | Paper |
Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees
Discrete Mathematics | 2012-05-30 | Paper |
Coupons collecting with or without replacement, and with multipurpose coupons
| 2011-07-07 | Paper |
A catalogue of small regular matroids and their Tutte polynomials
| 2011-07-07 | Paper |
Lattices freely generated by posets within a variety. Part II: Finitely generated varieties
| 2010-07-09 | Paper |
Realization of abstract convex geometries by point configurations
European Journal of Combinatorics | 2009-12-01 | Paper |
Incidence algebras that are uniquely determined by their zero-nonzero matrix pattern.
Linear Algebra and its Applications | 2009-02-10 | Paper |
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Algebraic aspects of an ordered band arising in nonlinear signal processing
Semigroup Forum | 2008-04-09 | Paper |
The fundamental theorem of projective geometry for an arbitrary length two module.
Rocky Mountain Journal of Mathematics | 2008-03-14 | Paper |
Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid
Discrete Mathematics | 2008-02-11 | Paper |
The Groups of Order Sixteen Made Easy
The American Mathematical Monthly | 2007-07-30 | Paper |
On rank functions of lattices
Order | 2006-06-26 | Paper |
The Asymptotic Number of Binary Codes and Binary Matroids
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Characterizing wavelet coefficient decay of discrete-time signals
Applied and Computational Harmonic Analysis | 2006-04-28 | Paper |
HOMOGENEOUS BIJECTIONS THAT INDUCE AUTOMORPHISMS OF THE SUBMODULE LATTICE
Communications in Algebra | 2005-10-27 | Paper |
The many benefits of putting stack filters into disjunctive or conjunctive normal form
Discrete Applied Mathematics | 2005-09-02 | Paper |
When are homogeneous functions linear? A lattice point of view.
Results in Mathematics | 2005-06-09 | Paper |
Structural matrix algebras and their lattices of invariant subspaces
Linear Algebra and its Applications | 2005-02-23 | Paper |
Natural Alternatives For One Dimensional Median Filtering
Quaestiones Mathematicae | 2004-03-19 | Paper |
Idempotent and co-idempotent stack filters and min--max operators.
Theoretical Computer Science | 2003-05-25 | Paper |
The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
Finite Fields and their Applications | 2002-01-06 | Paper |
Optimal implicational bases for finite modular lattices
Quaestiones Mathematicae | 2001-06-28 | Paper |
Three notes on distributive lattices
Advances in Applied Mathematics | 1999-04-08 | Paper |
A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
International Journal of Algebra and Computation | 1997-03-11 | Paper |
Consequences of the Brylawski-Lucas theorem for binary matroids
European Journal of Combinatorics | 1996-10-06 | Paper |
Base exchange properties of graphic matroids
Discrete Mathematics | 1996-03-24 | Paper |
The minimal number of join irreducibles of a finite modular lattice
Algebra Universalis | 1996-02-01 | Paper |
A theory of finite closure spaces based on implications
Advances in Mathematics | 1995-01-02 | Paper |
On Rota's problem about \(n\) bases in a rank \(n\) matroid
Advances in Mathematics | 1994-11-23 | Paper |
Axiomatizing simple binary matroids by their closed circuits
Applied Mathematics Letters | 1994-05-24 | Paper |
Cover preserving embedding of modular lattices into partition lattices
Discrete Mathematics | 1993-08-30 | Paper |
Cover-preserving order embeddings into Boolean lattices
Order | 1993-05-16 | Paper |
Obituary: Herbert Gross
Order | 1992-06-27 | Paper |
On the congruence problem in infinite dimensional sesquilinear spaces
Order | 1992-06-26 | Paper |
Acyclic modular lattices and their representations
Journal of Algebra | 1991-01-01 | Paper |
Join epimorphisms which preserve certain lattice identities
Algebra Universalis | 1990-01-01 | Paper |
Every Hamiltonian variety has the congruence extension property - a short proof
Algebra Universalis | 1989-01-01 | Paper |
Lattices freely generated by posets within a variety. Part I: Four easy varieties
| N/A | Paper |
