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

The complexity of partial match retrieval in a dynamic setting

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

DOI10.1016/0196-6774(82)90009-8zbMATH Open0477.68112OpenAlexW1965884921MaRDI QIDQ3933804FDOQ3933804


Authors: Michael L. Fredman, Dennis James Volper Edit this on Wikidata


Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90009-8





zbMATH Keywords

designing data structures


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)







This page was built for publication: The complexity of partial match retrieval in a dynamic setting

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

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