default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe Leck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Thomas Kalinowski
, Uwe Leck:
Independent domination in the graph defined by two consecutive levels of the n-cube. Discret. Appl. Math. 357: 161-172 (2024)- 2023
- [j27]Philipp Skavantzos, Uwe Leck, Kaiqi Zhao, Sebastian Link:
Uniqueness Constraints for Object Stores. ACM J. Data Inf. Qual. 15(2): 13:1-13:29 (2023) - [j26]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
The Saturation Spectrum for Antichains of Subsets. Order 40(3): 537-574 (2023) - [i3]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Sizes of flat maximal antichains of subsets. CoRR abs/2302.07062 (2023) - 2021
- [j25]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Minimum Weight Flat Antichains of Subsets. Order 38(3): 441-453 (2021) - [i2]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Maximal antichains of subsets I: The shadow spectrum. CoRR abs/2106.02226 (2021)
2010 – 2019
- 2019
- [j24]Nishita Balamuralikrishna, Yingnan Jiang, Henning Koehler, Uwe Leck, Sebastian Link, Henri Prade:
Possibilistic keys. Fuzzy Sets Syst. 376: 1-36 (2019) - [j23]Ziheng Wei, Uwe Leck, Sebastian Link:
Discovery and Ranking of Embedded Uniqueness Constraints. Proc. VLDB Endow. 12(13): 2339-2352 (2019) - [c6]Ziheng Wei, Uwe Leck, Sebastian Link:
Entity Integrity, Referential Integrity, and Query Optimization with Embedded Uniqueness Constraints. ICDE 2019: 1694-1697 - 2018
- [c5]Sven Hartmann, Markus Kirchberg, Henning Koehler, Uwe Leck, Sebastian Link:
Extremal Combinatorics of SQL Keys. Models: Concepts, Theory, Logic, Reasoning and Semantics 2018: 75-91 - 2017
- [i1]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Full and maximal squashed flat antichains of minimum weight. CoRR abs/1704.00067 (2017) - 2016
- [j22]Thomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts:
Minimizing the regularity of maximal regular antichains of 2- and 3-sets. Australas. J Comb. 64: 277-288 (2016) - [j21]Henning Köhler, Uwe Leck, Sebastian Link, Xiaofang Zhou:
Possible and certain keys for SQL. VLDB J. 25(4): 571-596 (2016) - 2015
- [j20]Sven Hartmann, Henning Köhler, Uwe Leck, Sebastian Link, Bernhard Thalheim, Jing Wang:
Constructing Armstrong tables for general cardinality constraints and not-null constraints. Ann. Math. Artif. Intell. 73(1-2): 139-165 (2015) - 2014
- [j19]Uwe Leck, Ian T. Roberts:
Inequalities for cross-unions of collections of finite sets. Eur. J. Comb. 35: 392-401 (2014) - [c4]Henning Köhler, Uwe Leck, Sebastian Link, Henri Prade:
Logical Foundations of Possibilistic Keys. JELIA 2014: 181-195 - 2013
- [j18]Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Antichains of Minimum Size. Electron. J. Comb. 20(2): 3 (2013) - [c3]Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski:
On Data Recovery in Distributed Databases. Information Theory, Combinatorics, and Search Theory 2013: 419-431 - 2012
- [j17]Uwe Leck, Ian T. Roberts, Jamie Simpson:
Minimizing the weight of the union-closure of families of two-sets. Australas. J Comb. 52: 67-74 (2012) - 2011
- [j16]Sven Hartmann, Uwe Leck, Sebastian Link:
On Codd Families of Keys over Incomplete Relations. Comput. J. 54(7): 1166-1180 (2011) - [j15]Uwe Leck, Ian T. Roberts:
Minimizing the weight of the union-closure of uniform families of sets. Electron. Notes Discret. Math. 38: 553-558 (2011)
2000 – 2009
- 2009
- [j14]Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Flat Antichains of Minimum Weight. Electron. J. Comb. 16(1) (2009) - [j13]Sergei L. Bezrukov, Uwe Leck:
A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus. SIAM J. Discret. Math. 23(3): 1416-1421 (2009) - [c2]Sven Hartmann, Uwe Leck, Sebastian Link:
On Matrix Representations of Participation Constraints. ER Workshops 2009: 75-84 - 2008
- [j12]Sven Hartmann, Uwe Leck, Volker Leck:
More orthogonal double covers of complete graphs by Hamiltonian paths. Discret. Math. 308(12): 2502-2508 (2008) - 2006
- [j11]Dalibor Froncek, Uwe Leck:
Orthogonal double covers of complete graphs by fat catepillars. Discuss. Math. Graph Theory 26(2): 343-349 (2006) - [c1]Uwe Leck:
A Conjecture in Finite Fields. GTIT-C 2006: 1095-1096 - 2005
- [j10]Sven Hartmann, Uwe Leck:
Self-orthogonal decompositions of graphs into matchings. Electron. Notes Discret. Math. 23: 5-11 (2005) - 2004
- [j9]Uwe Leck:
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders. Comb. 24(2): 305-312 (2004) - 2003
- [j8]Uwe Leck:
On the orthogonal product of simplices and direct products of truncated Boolean lattices. Discret. Math. 273(1-3): 163-172 (2003) - 2002
- [j7]Hans-Dietrich O. F. Gronau, Martin Grüttmüller, Sven Hartmann, Uwe Leck, Volker Leck:
On Orthogonal Double Covers of Graphs. Des. Codes Cryptogr. 27(1-2): 49-91 (2002) - [j6]Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck:
On the average size of sets in intersecting Sperner families. Discret. Math. 257(2-3): 259-266 (2002) - [j5]Uwe Leck:
A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths. Graphs Comb. 18(1): 155-167 (2002) - [j4]Uwe Leck:
Another Generalization of Lindström's Theorem on Subcubes of a Cube. J. Comb. Theory A 99(2): 281-296 (2002) - 2001
- [j3]Uwe Leck:
Optimal shadows and ideals in submatrix orders. Discret. Math. 235(1-3): 173-187 (2001) - 2000
- [j2]Uwe Leck:
A property of colored complexes and their duals. Discret. Math. 213(1-3): 245-251 (2000)
1990 – 1999
- 1999
- [j1]Uwe Leck, Volker Leck:
Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter. Discret. Appl. Math. 95(1-3): 377-388 (1999)
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-10-07 21:14 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:
