Stephan Foldes

According to our database, Stephan Foldes authored at least 24 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Packing of permutations into Latin squares.

Stephan Foldes, András Kaszanyitzky, László Major

Discret. Appl. Math., 2021

2019

The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence.

Stephan Foldes, Douglas Stott Parker, Sándor Radeleczki

IEEE Trans. Inf. Theory, 2019

2015

Arrow type impossibility theorems over median algebras.

Miguel Couceiro, Stephan Foldes, Gerasimos C. Meletiou

CoRR, 2015

2013

Antichain Cutsets of Strongly Connected Posets.

Stephan Foldes, Russ Woodroofe

Order, 2013

2012

A general framework for island systems

Stephan Foldes, Eszter K. Horváth, Sándor Radeleczki, Tamás Waldhauser

CoRR, 2012

2010

Column-Partitioned Matrices Over Rings Without Invertible Transversal Submatrices.

Stephan Foldes, Erkko Lehtonen

Ars Comb., 2010

2009

Algebraic and topological closure conditions for classes of pseudo-Boolean functions.

Stephan Foldes, Peter L. Hammer

Discret. Appl. Math., 2009

2008

On McMillan's theorem about uniquely decipherable codes

Stephan Foldes

CoRR, 2008

2007

A Half-Space Approach to Order Dimension.

Stephan Foldes, Jenö Szigeti

Order, 2007

Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables.

Miguel Couceiro, Stephan Foldes

Acta Cybern., 2007

2006

On maximal instantaneous codes.

Stephan Foldes, Navin M. Singhi

Electron. Notes Discret. Math., 2006

Composition of Post classes and normal forms of Boolean functions.

Miguel Couceiro, Stephan Foldes, Erkko Lehtonen

Discret. Math., 2006

2005

Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions.

Stephan Foldes, Peter L. Hammer

Math. Oper. Res., 2005

2004

Post classes characterized by functional terms.

Stephan Foldes, Grant R. Pogosyan

Discret. Appl. Math., 2004

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions.

Stephan Foldes, Peter L. Hammer

Discret. Appl. Math., 2004

Definability of Boolean function classes by linear equations over GF(2).

Miguel Couceiro, Stephan Foldes

Discret. Appl. Math., 2004

Consensus algorithms for the generation of all maximal bicliques.

Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone

Discret. Appl. Math., 2004

Decomposition of planar motions into reflections and rotations with distance constraints.

Stephan Foldes

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2002

Disjunctive and conjunctive representations in finite lattices and convexity spaces.

Stephan Foldes, Peter L. Hammer

Discret. Math., 2002

2001

On the Face Lattice of a Poset Polyhedron.

Stephan Foldes, Alexander Lawrenz

Ars Comb., 2001

2000

Monotone, Horn and Quadratic Pseudo-Boolean Functions.

Stephan Foldes, Peter L. Hammer

J. Univers. Comput. Sci., 2000

Equational characterizations of Boolean function classes.

Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein

Discret. Math., 2000

Disjunctive and conjunctive normal forms of pseudo-Boolean functions.

Stephan Foldes, Peter L. Hammer

Discret. Appl. Math., 2000

1992

Light sources, obstructions and spherical orders.

Stephan Foldes, Ivan Rival, Jorge Urrutia

Discret. Math., 1992