Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Storage-efficient data structure for large lookup dictionaries

From MaRDI portal
Publication:1352017
Jump to:navigation, search

DOI10.1016/0020-0190(96)00028-2zbMATH Open1004.68518OpenAlexW2077703397MaRDI QIDQ1352017FDOQ1352017


Authors: Bala Srinivasan, Santosh Kulkarni, Vishv Mohan Malhotra Edit this on Wikidata


Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00028-2





zbMATH Keywords

data structuresdata compressioninformation retrieval


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)


Cites Work

  • Title not available (Why is that?)






This page was built for publication: Storage-efficient data structure for large lookup dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352017)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1352017&oldid=13488913"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 14:10. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki