default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucien Haddad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Miguel Couceiro, Lucien Haddad, Victor Lagerkvist:
A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms. J. Multiple Valued Log. Soft Comput. 38(1-2): 115-136 (2022)- [j20]Miguel Couceiro, Lucien Haddad, Maurice Pouzet:
Preface to Ivo G. Rosenberg's Special Issue. J. Multiple Valued Log. Soft Comput. 39(1): 1-3 (2022) - [j19]Miguel Couceiro, Lucien Haddad, Maurice Pouzet:
The Mathematics of Ivo Rosenberg. J. Multiple Valued Log. Soft Comput. 39(1): 5-25 (2022) - 2021
- [c29]Lucien Haddad, Masahiro Miyakawa, Maurice Pouzet, Hisayuki Tatsumi:
Hereditary rigidity, separation and density: In memory of Professor I.G. Rosenberg. ISMVL 2021: 62-67 - [i1]Lucien Haddad, Masahiro Miyakawa, Maurice Pouzet, Hisayuki Tatsumi:
Hereditary rigidity, separation and density In memory of Professor I.G. Rosenberg. CoRR abs/2104.00292 (2021)
2010 – 2019
- 2019
- [j18]Miguel Couceiro, Lucien Haddad, Karsten Schölzel:
On the Lower Part of the Lattice of Partial Clones. J. Multiple Valued Log. Soft Comput. 33(3): 177-196 (2019) - [c28]Miguel Couceiro
, Lucien Haddad, Maurice Pouzet:
The mathematics of Ivo Rosenberg. ISMVL 2019: 43-48 - [c27]Miguel Couceiro, Lucien Haddad, Victor Lagerkvist:
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey. ISMVL 2019: 170-175 - 2017
- [j17]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones. J. Multiple Valued Log. Soft Comput. 28(1): 47-58 (2017) - [c26]Miguel Couceiro, Lucien Haddad, Karsten Schölzel:
On the Nonexistence of Minimal Strong Partial Clones. ISMVL 2017: 82-87 - [c25]Miguel Couceiro, Lucien Haddad, Victor Lagerqvist, Biman Roy:
On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. ISMVL 2017: 88-93 - [c24]Lucien Haddad, Karsten Schölzel:
A Note on Intervals of Słupecki Partial Clones. ISMVL 2017: 94-99 - 2016
- [j16]Youssef Boudabbous, Lucien Haddad, Nejib Zaguia:
The Mathematics of Gérard Lopez and Maurice Pouzet. J. Multiple Valued Log. Soft Comput. 27(2-3): 117-132 (2016) - [j15]Miguel Couceiro, Lucien Haddad, Ivo G. Rosenberg:
Partial Clones Containing all Boolean Monotone Self-dual Partial Functions. J. Multiple Valued Log. Soft Comput. 27(2-3): 183-192 (2016) - 2015
- [c23]Miguel Couceiro, Lucien Haddad, Maurice Pouzet, Karsten Schölzel:
Hereditarily Rigid Relations: Dedicated to Professor I.G. Rosenberg on the Occasion of His 80-th Birthday. ISMVL 2015: 84-89 - 2014
- [c22]Lucien Haddad, Karsten Schölzel:
Countable Intervals of Partial Clones. ISMVL 2014: 155-160 - [c21]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
Relation Graphs and Partial Clones on a 2-Element Set. ISMVL 2014: 161-166 - 2013
- [c20]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones. ISMVL 2013: 123-128 - [c19]Lucien Haddad, Karsten Schölzel:
Intersections with Slupecki Partial Clones on a Finite Set. ISMVL 2013: 135-140 - 2012
- [j14]Lucien Haddad:
Infinite Chains of Partial Clones Containing All Selfdual Monotonic Partial Functions. J. Multiple Valued Log. Soft Comput. 18(2): 139-152 (2012) - [j13]Miguel Couceiro, Lucien Haddad:
Intersections of Finitely Generated Maximal Partial Clones. J. Multiple Valued Log. Soft Comput. 19(1-3): 85-94 (2012) - [c18]Miguel Couceiro, Lucien Haddad:
A Survey on Intersections of Maximal Partial Clones of Boolean Partial Functions. ISMVL 2012: 287-292 - 2011
- [c17]Hajime Machida, Lucien Haddad, Jovanka Pantovic:
Invitation to Clone Theory with Partial Clones and Hyperclones. ISMVL 2011: 205-212 - 2010
- [c16]Miguel Couceiro, Lucien Haddad:
Finitely Generated Maximal Partial Clones and Their Intersections. ISMVL 2010: 122-127
2000 – 2009
- 2009
- [c15]Lucien Haddad:
Partial Clones Containing All Selfdual Monotonic Boolean Partial Functions. ISMVL 2009: 173-178 - 2007
- [j12]Lucien Haddad, Dietlinde Lau:
Some Criteria for Partial Sheffer Functions in k-valued Logic. J. Multiple Valued Log. Soft Comput. 13(4-6): 415-446 (2007) - [c14]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Monoidal Intervals of Partial Clones. ISMVL 2007: 9 - [c13]Lucien Haddad, Dietlinde Lau:
Characterization of Partial Sheffer Functions in 3-Valued Logic. ISMVL 2007: 34 - 2006
- [j11]Lucien Haddad, Dietlinde Lau, Ivo G. Rosenberg:
Intervals of Partial Clones Containing Maximal Clones. J. Autom. Lang. Comb. 11(4): 399-421 (2006) - [c12]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Theoretical Basis of Commutation Theory for Partial Clones. ISMVL 2006: 22 - 2005
- [c11]Lucien Haddad, Ivo G. Rosenberg:
Partial Clones Determined by Concatenated Relations. ISMVL 2005: 101-106 - 2004
- [j10]Lucien Haddad, Claude Tardif:
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. Discuss. Math. Graph Theory 24(3): 545-549 (2004) - [c10]Lucien Haddad, Dietlinde Lau:
On Partial Clones containing Maximal Clones. ISMVL 2004: 96-101 - 2003
- [c9]Lucien Haddad, G. E. Simons:
On Intervals of Partial Clones of Boolean Partial Functions. ISMVL 2003: 315-322 - 2002
- [j9]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Maximal and Minimal Partial Clones. J. Autom. Lang. Comb. 7(1): 83-93 (2002) - 2000
- [c8]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
On the Intersection of Maximal Partial Clones and the Join of Minimal Partial Clones. ISMVL 2000: 396-401
1990 – 1999
- 1999
- [c7]Lucien Haddad, Jean Fugère:
Maximal Chains of Partial Clones Containing All Idempotent Partial Functions. ISMVL 1999: 80-84 - [c6]Lucien Haddad, Dietlinde Lau:
Partial Clones and their Generating Sets. ISMVL 1999: 85-90 - 1998
- [j8]Aiden A. Bruen, Lucien Haddad, David L. Wehlau:
Caps and Colouring Steiner Triple Systems. Des. Codes Cryptogr. 13(1): 51-55 (1998) - [c5]Ferdinand Börner, Lucien Haddad:
Generating Sets for Clones and Partial Clones. ISMVL 1998: 363-368 - [c4]Jean Fugère, Lucien Haddad:
On Partial Clones Containing All Idempotent Partial Operations. ISMVL 1998: 369-373 - 1997
- [j7]Charles J. Colbourn, Lucien Haddad, Václav Linek:
Balanced Steiner Triple Systems. J. Comb. Theory A 78(2): 292-302 (1997) - 1996
- [j6]Charles J. Colbourn, Lucien Haddad, Václav Linek:
Equitable Embeddings of Steiner Triple Systems. J. Comb. Theory A 73(2): 229-247 (1996) - [c3]Lucien Haddad, Jean Fugère:
On the Lattice of Partial Clones on a Finite Set. ISMVL 1996: 273-278 - 1994
- [j5]Lucien Haddad, Vojtech Rödl:
Unbalanced Steiner Triple Systems. J. Comb. Theory A 66(1): 1-16 (1994) - 1992
- [j4]Lucien Haddad, Ivo G. Rosenberg:
Generating sequences for k-valued logic. Inf. Sci. 65(3): 275-282 (1992) - 1991
- [j3]Lucien Haddad, Ivo G. Rosenberg:
Partial Sheffer Operations. Eur. J. Comb. 12(1): 9-21 (1991) - [c2]Ferdinand Börner, Lucien Haddad, Reinhard Pöschel:
A Note on Minimal Partial Clones. ISMVL 1991: 262-267 - 1990
- [c1]Lucien Haddad, Ivo G. Rosenberg:
A Note on Finite Clones Containing All Permutations. ISMVL 1990: 34-41
1980 – 1989
- 1989
- [j2]Lucien Haddad, Ivo G. Rosenberg:
Maximal partial clones determined by the areflexive relations. Discret. Appl. Math. 24(1-3): 133-143 (1989) - 1988
- [j1]Lucien Haddad:
Maximal Partial Clones Determined by Quasi-diagonal Relations. J. Inf. Process. Cybern. 24(7/8): 355-366 (1988)
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 2025-01-09 12:51 CET 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:
