On the public citation graph
A survey of some combinatorial results concerning functional dependencies in database relations
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-18740-5_99openalex-snapshot
On the number of keys in relational databases
inferredcites →https://doi.org/10.1007/3-540-19121-6_7openalex-snapshot
Extremal combinatorial problems of database models
inferredcites →https://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferredcites →https://doi.org/10.1007/bf00337692openalex-snapshot
The poset of closures as a model of changing databases
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf02579291openalex-snapshot
A note on minimal matrix representation of closure operations
inferredcites →https://doi.org/10.1016/0012-365x(80)90108-9openalex-snapshot
On the number of maximal dependencies in a data base relation of fixed order
inferredcites →https://doi.org/10.1016/0012-365x(91)90006-nopenalex-snapshot
Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
inferredcites →https://doi.org/10.1016/0012-365x(91)90044-3openalex-snapshot
Descriptively sufficient subcollections of flats in matroids
inferredcites →https://doi.org/10.1016/0166-218x(90)90018-8openalex-snapshot
On minimum matrix representation of closure operations
inferredcites →https://doi.org/10.1016/0166-218x(90)90114-ropenalex-snapshot
Perfect error-correcting databases
inferredcites →https://doi.org/10.1016/0166-218x(92)90026-7openalex-snapshot
Partial dependencies in relational databases and their realization
inferredcites →https://doi.org/10.1016/0166-218x(92)90027-8openalex-snapshot
The characterization of branching dependencies
inferredcites →https://doi.org/10.1016/0166-218x(92)90031-5openalex-snapshot
On the complexity of inferring functional dependencies
inferredcites →https://doi.org/10.1016/0304-3975(91)90359-aopenalex-snapshot
On the number of databases and closure operations
inferredcites →https://doi.org/10.1016/s0019-9958(85)80017-6openalex-snapshot
Normalization and axiomatization for numerical dependencies
inferredcites →https://doi.org/10.1016/s0021-9800(66)80035-2openalex-snapshot
A short proof of Sperner's lemma
inferredcites →https://doi.org/10.1016/s0166-218x(85)80003-2openalex-snapshot
Minimum matrix representation of closure operations
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/1108023openalex-snapshot
Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.2969/jmsj/00630343openalex-snapshot
Logarithmic order of free distributive lattice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11663881_6openalex-snapshot
On the Number of Independent Functional Dependencies
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_30openalex-snapshot
Combinatorial and algebraic results for database relations
inferred← citeshttps://doi.org/10.1007/978-3-031-56940-1_4openalex-snapshot
Minimal Armstrong Databases for Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-77684-0_12openalex-snapshot
On the Existence of Armstrong Instances with Bounded Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-11829-6_9openalex-snapshot
On the Existence of Armstrong Data Trees for XML Functional Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-642-23441-5_6openalex-snapshot
Coding Theory Motivated by Relational Databases
inferred← citeshttps://doi.org/10.1007/978-3-7091-2704-9_15openalex-snapshot
Semantical Constraints for Database Models
inferred← citeshttps://doi.org/10.1007/s13740-021-00135-wopenalex-snapshot
Possible Keys and Functional Dependencies
inferred← citeshttps://doi.org/10.1016/j.dam.2004.03.004openalex-snapshot
New type of coding problem motivated by database theory
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00029-9openalex-snapshot
Design type problems motivated by database theory
inferred← citeshttps://doi.org/10.1023/a:1013133428451openalex-snapshot
On the implication problem for cardinality constraints and functional dependencies
inferred← citeshttps://doi.org/10.14778/3358701.3358703openalex-snapshot
Discovery and ranking of embedded uniqueness constraints
inferred← citeshttps://doi.org/10.15625/1813-9663/17/1/2427openalex-snapshot
Some rerults about choice functions.
inferred← citeshttps://doi.org/10.15625/1813-9663/18/1/2407openalex-snapshot
Some properties of choice functions.
inferred← citeshttps://doi.org/10.2478/s11533-008-0001-4openalex-snapshot
Codes that attain minimum distance in every possible direction
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.