Perfect Storage Representations for Families of Data Structures

DOI10.1137/0604055zbMATH Open0524.68026OpenAlexW2104812271MaRDI QIDQ3036701FDOQ3036701

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

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

Cited In (5)

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

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)