scientific article
From MaRDI portal
Publication:3919122
zbMath0466.68086MaRDI QIDQ3919122
Gyula O. H. Katona, Janos Demetrovics
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99)
Related Items
Extremal problems in relational data bases ⋮ New type of coding problem motivated by database theory ⋮ Minimum matrix representation of some key system ⋮ Recent combinatorial results in the theory of relational databases ⋮ Dependencies in composite databases ⋮ On cyclic orthogonal double covers of circulant graphs by special infinite graphs ⋮ On the distance of databases ⋮ The novel generally described graphs for cyclic orthogonal double covers of some circulants ⋮ SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ Orthogonal double covers of general graphs. ⋮ Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions ⋮ ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Perfect error-correcting databases ⋮ Coding Theory Motivated by Relational Databases ⋮ Design type problems motivated by database theory ⋮ Minimum matrix representation of closure operations
This page was built for publication:
