de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Using persistent data structures for adding range restrictions to searching problems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44909

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AD4F-B
Abstract
There is no abstract available