Pages that link to "Item:Q2547121"

The following pages link to Data graphs and addressing schemes (Q2547121):

Displaying 19 items.

• An extrinsic characterization of addressable data graphs (Q1212795) (← links)
• Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. I: Datenstrukturen und Schemata (Q1213739) (← links)
• Relational data graphs and some properties of them (Q1238410) (← links)
• Addressable approximations to nonaddressable data graphs (Q1248365) (← links)
• Some decision problems for polynomial mappings (Q1248614) (← links)
• Data types, abstract data types and their specification problem (Q1252032) (← links)
• Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials (Q1252374) (← links)
• Diagonal polynomials and diagonal orders on multidimensional lattices (Q1361888) (← links)
• The diagonal polynomials of dimension four (Q1775741) (← links)
• Perfect Storage Representations for Families of Data Structures (Q3036701) (← links)
• Locally finite properties of data structures and their computation (Q3694686) (← links)
• Data schemata based on directed graphs (Q3853110) (← links)
• Generalized addressing schemes for data graphs (Q4062624) (← links)
• Polynomial enumeration of multidimensional lattices (Q4170231) (← links)
• Characterizing sets of data structures by the connectivity relation (Q4188718) (← links)
• A model for optimizing indexed file structures (Q4401558) (← links)
• Cantor Polynomials and the Fueter-Pólya Theorem (Q4576574) (← links)
• Exposing graph uniformities via algebraic specification (Q4712581) (← links)
• An enlarged family of packing polynomials on multidimensional lattices (Q4879211) (← links)