Perfect Storage Representations for Families of Data Structures

DOI10.1137/0604055MaRDI QIDQ3036701zbMATH OpenOpenAlexFDO

Authors Arnold L. Rosenberg, Lawrence V. Snyder, Fan 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

treesdata structuresgridsarraysuniversal graphsperfect hashing

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3747149 (Why is no real title available?)
• scientific article; zbMATH DE number 3613090 (Why is no real title available?)
• Cost Trade-offs in Graph Embeddings, with Applications
• Data encodings and their costs
• Data graphs and addressing schemes
• External Hashing Schemes for Collections of Data Structures
• Managing Storage for Extendible Arrays
• On Embedding Rectangular Grids in Square Grids
• On Graphs Which Contain All Sparse Graphs
• On graphs which contain all small trees
• Perfect hashing functions
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Storage schemes for boundedly extendible arrays
• Uniform data encodings
• Universality considerations in VLSI circuits

Cited in

(7)

• Universal graphs and induced-universal graphs
• Universality for graphs of bounded degeneracy
• Blocking for external graph searching
• Universality for graphs with bounded density
• Size Ramsey number of bounded degree graphs for games
• Sparse multipartite graphs as partition universal for graphs with bounded degree
• Explicit sparse almost-universal graphs for G (n, kn)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3036701)