Using persistent data structures for adding range restrictions to searching 
problems

Lenhof, Hans-Peter; Smid, Michiel

doi:10.1051/ita/1994280100251

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Using persistent data structures for adding range restrictions to searching problems

MPS-Authors

/persons/resource/persons44909

Lenhof, Hans-Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid, Michiel
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)

ita1994280100251.pdf
(Publisher version), 3MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Lenhof, H.-P., & Smid, M. (1994). Using persistent data structures for adding range restrictions to searching problems. RAIRO Theoretical Informatics and Applications, 28(-), 25-49. doi:10.1051/ita/1994280100251.

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

Abstract

There is no abstract available