Preserving average proximity in arrays

DOI10.1145/359361.359447zbMath0378.68014OpenAlexW2073107529MaRDI QIDQ4157931

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

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

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

Related Items

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