Preserving average proximity in arrays

DOI10.1145/359361.359447zbMATH Open0378.68014OpenAlexW2073107529MaRDI QIDQ4157931FDOQ4157931

Authors: Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton 

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359361.359447

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (14)

• A fast implementation of a multidimensional storage into a tree storage
• LINEAR LAYOUT OF GENERALIZED HYPERCUBES
• Blocking for external graph searching
• Bounds on the costs of data encodings
• Storage representations for tree-like data structures
• Encoding search trees in lists^†
• On computing distances between leaves in a complete tree
• Edge separators for graphs of bounded genus with applications
• A new combinatorial approach to optimal embeddings of rectangles
• A comparison of two methods of encoding arrays
• Data encodings and their costs
• Linear layouts of generalized hypercubes
• Storing matrices on disk for efficient row and column retrieval
• Pyramids: A data type for matrix representation in Pascal

This page was built for publication: Preserving average proximity in arrays

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