default search action
Stephan Foldes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j20]Stephan Foldes, András Kaszanyitzky, László Major
:
Packing of permutations into Latin squares. Discret. Appl. Math. 297: 102-108 (2021)
2010 – 2019
- 2019
- [j19]Stephan Foldes, Douglas Stott Parker, Sándor Radeleczki
The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence. IEEE Trans. Inf. Theory 65(12): 8207-8212 (2019) - 2015
- [i3]Miguel Couceiro, Stephan Foldes, Gerasimos C. Meletiou:
Arrow type impossibility theorems over median algebras. CoRR abs/1508.04741 (2015) - 2013
- [j18]Stephan Foldes
Antichain Cutsets of Strongly Connected Posets. Order 30(2): 351-361 (2013) - 2012
- [i2]Stephan Foldes, Eszter K. Horváth, Sándor Radeleczki, Tamás Waldhauser:
A general framework for island systems. CoRR abs/1210.1741 (2012) - 2010
- [j17]Stephan Foldes, Erkko Lehtonen:
Column-Partitioned Matrices Over Rings Without Invertible Transversal Submatrices. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j16]Stephan Foldes
Algebraic and topological closure conditions for classes of pseudo-Boolean functions. Discret. Appl. Math. 157(13): 2818-2827 (2009) - 2008
- [i1]Stephan Foldes:
On McMillan's theorem about uniquely decipherable codes. CoRR abs/0806.3277 (2008) - 2007
- [j15]Miguel Couceiro, Stephan Foldes:
Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables. Acta Cybern. 18(1): 61-75 (2007) - [j14]Stephan Foldes
A Half-Space Approach to Order Dimension. Order 24(1): 59-73 (2007) - 2006
- [j13]Miguel Couceiro
Composition of Post classes and normal forms of Boolean functions. Discret. Math. 306(24): 3223-3243 (2006) - [j12]Stephan Foldes
On maximal instantaneous codes. Electron. Notes Discret. Math. 27: 27-28 (2006) - 2005
- [j11]Stephan Foldes
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions. Math. Oper. Res. 30(2): 453-461 (2005) - 2004
- [j10]Miguel Couceiro
Definability of Boolean function classes by linear equations over GF(2). Discret. Appl. Math. 142(1-3): 29-34 (2004) - [j9]Stephan Foldes
Post classes characterized by functional terms. Discret. Appl. Math. 142(1-3): 35-51 (2004) - [j8]Stephan Foldes
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. Discret. Appl. Math. 142(1-3): 53-65 (2004) - [j7]Gabriela Alexe, Sorin Alexe, Yves Crama
Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1): 11-21 (2004) - [c1]Stephan Foldes:
Decomposition of planar motions into reflections and rotations with distance constraints. CCCG 2004: 33-35 - 2002
- [j6]Stephan Foldes, Peter L. Hammer:
Disjunctive and conjunctive representations in finite lattices and convexity spaces. Discret. Math. 258(1-3): 13-25 (2002) - 2001
- [j5]Stephan Foldes, Alexander Lawrenz:
On the Face Lattice of a Poset Polyhedron. Ars Comb. 60 (2001) - 2000
- [j4]Stephan Foldes, Peter L. Hammer:
Disjunctive and conjunctive normal forms of pseudo-Boolean functions. Discret. Appl. Math. 107(1-3): 1-26 (2000) - [j3]Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein:
Equational characterizations of Boolean function classes. Discret. Math. 211: 27-51 (2000) - [j2]Stephan Foldes, Peter L. Hammer:
Monotone, Horn and Quadratic Pseudo-Boolean Functions. J. Univers. Comput. Sci. 6(1): 97-104 (2000)
1990 – 1999
- 1992
- [j1]Stephan Foldes
Light sources, obstructions and spherical orders. Discret. Math. 102(1): 13-23 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: