Perfect Storage Representations for Families of Data Structures

DOI10.1137/0604055zbMath0524.68026OpenAlexW2104812271MaRDI QIDQ3036701

Arnold L. Rosenberg, Lawrence V. Snyder, Fan R. K. Chung

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604055

zbMATH Keywords

gridsdata structurestreesuniversal graphsarraysperfect hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

Blocking for external graph searching ⋮ Universal graphs and induced-universal graphs ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ ⋮ Size Ramsey Number of Bounded Degree Graphs for Games

Cites Work

• Unnamed Item
• Unnamed Item
• Uniform data encodings
• Data encodings and their costs
• Storage schemes for boundedly extendible arrays
• On graphs which contain all small trees
• Data graphs and addressing schemes
• Cost Trade-offs in Graph Embeddings, with Applications
• External Hashing Schemes for Collections of Data Structures
• Universality considerations in VLSI circuits
• On Embedding Rectangular Grids in Square Grids
• On Graphs Which Contain All Sparse Graphs
• Managing Storage for Extendible Arrays
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Perfect hashing functions

This page was built for publication: Perfect Storage Representations for Families of Data Structures