most citedOn signature-based expressions of system reliability

51 citations · 81 across the 8 of their papers we have counts for

collaborators

10 papers

math.CO20114 cited

Proofs of some binomial identities using the method of last squares

Mark Shattuck, Tamás Waldhauser

We give combinatorial proofs for some identities involving binomial sums that have no closed form.

math.RA20114 cited

On composition-closed classes of Boolean functions

Tamás Waldhauser

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under…

math.RA20119 cited

On associative spectra of operations

Sebastian Liebscher, Tamás Waldhauser

The distance of an operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Associative spectra were introduced…

math.RA20114 cited

Minimal clones with few majority operations

Tamás Waldhauser

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

math.RA2011

Almost associative operations generating a minimal clone

Tamás Waldhauser

Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the asso…

math.RA20117 cited

Associative spectra of binary operations

Béla Csákány, Tamás Waldhauser

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and gene…