Lower Bounds on the Efficiency of Transforming Static Data Structures into 
Dynamic Structures

Mehlhorn, Kurt

doi:10.1007/BF01786969

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K. (1981). Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. Mathematical Systems Theory, 15(1), 1-16. doi:10.1007/BF01786969.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF50-A

Abstract

There is no abstract available