Stephan Foldes

24 papers Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
Packing of permutations into Latin squares.
Discret. Appl. Math.
Stephan Foldes, András Kaszanyitzky, László Major
2019 J jnl
The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence.
IEEE Trans. Inf. Theory
Stephan Foldes, Douglas Stott Parker, Sándor Radeleczki
2015 J jnl
Arrow type impossibility theorems over median algebras.
CoRR
Miguel Couceiro, Stephan Foldes, Gerasimos C. Meletiou
2013 J jnl
Antichain Cutsets of Strongly Connected Posets.
Order
Stephan Foldes, Russ Woodroofe
2012 J jnl
A general framework for island systems
CoRR
Stephan Foldes, Eszter K. Horváth, Sándor Radeleczki, Tamás Waldhauser
2010 J jnl
Column-Partitioned Matrices Over Rings Without Invertible Transversal Submatrices.
Ars Comb.
Stephan Foldes, Erkko Lehtonen
2009 J jnl
Algebraic and topological closure conditions for classes of pseudo-Boolean functions.
Discret. Appl. Math.
Stephan Foldes, Peter L. Hammer
2008 J jnl
On McMillan's theorem about uniquely decipherable codes
CoRR
Stephan Foldes
2007 J jnl
A Half-Space Approach to Order Dimension.
Order
Stephan Foldes, Jenö Szigeti
2007 J jnl
Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables.
Acta Cybern.
Miguel Couceiro, Stephan Foldes
2006 J jnl
Composition of Post classes and normal forms of Boolean functions.
Discret. Math.
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
2006 J jnl
On maximal instantaneous codes.
Electron. Notes Discret. Math.
Stephan Foldes, Navin M. Singhi
2005 J jnl
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions.
Math. Oper. Res.
Stephan Foldes, Peter L. Hammer
2004 J jnl
Consensus algorithms for the generation of all maximal bicliques.
Discret. Appl. Math.
Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone
2004 — conf
Decomposition of planar motions into reflections and rotations with distance constraints.
CCCG
Stephan Foldes
2004 J jnl
Definability of Boolean function classes by linear equations over GF(2).
Discret. Appl. Math.
Miguel Couceiro, Stephan Foldes
2004 J jnl
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions.
Discret. Appl. Math.
Stephan Foldes, Peter L. Hammer
2004 J jnl
Post classes characterized by functional terms.
Discret. Appl. Math.
Stephan Foldes, Grant R. Pogosyan
2002 J jnl
Disjunctive and conjunctive representations in finite lattices and convexity spaces.
Discret. Math.
Stephan Foldes, Peter L. Hammer
2001 J jnl
On the Face Lattice of a Poset Polyhedron.
Ars Comb.
Stephan Foldes, Alexander Lawrenz
2000 J jnl
Disjunctive and conjunctive normal forms of pseudo-Boolean functions.
Discret. Appl. Math.
Stephan Foldes, Peter L. Hammer
2000 J jnl
Equational characterizations of Boolean function classes.
Discret. Math.
Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein
2000 J jnl
Monotone, Horn and Quadratic Pseudo-Boolean Functions.
J. Univers. Comput. Sci.
Stephan Foldes, Peter L. Hammer
1992 J jnl
Light sources, obstructions and spherical orders.
Discret. Math.
Stephan Foldes, Ivan Rival, Jorge Urrutia