Space-Time Trade-Offs in Structured Programming

DOI10.1145/322169.322180zbMath0426.68046OpenAlexW1990678572WikidataQ56505177 ScholiaQ56505177MaRDI QIDQ3862426

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

Publication date: 1980

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

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

zbMATH Keywords

embeddingdirected graphstructured programmingcontrol structureancestor tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01)

Related Items (3)

Optimal dynamic embedding of X-trees into arrays ⋮ A fast implementation of a multidimensional storage into a tree storage ⋮ Accessibility of values as a determinant of relative complexity in algebras

This page was built for publication: Space-Time Trade-Offs in Structured Programming