Lower bounds on the efficiency of transforming static data structures into dynamic structures
From MaRDI portal
Publication:3940857
DOI10.1007/BF01786969zbMath0482.68057MaRDI QIDQ3940857
Publication date: 1981
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01786969
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68P05: Data structures
Related Items
Efficient splitting and merging algorithms for order decomposable problems, AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, Efficient splitting and merging algorithms for order decomposable problems.
Cites Work