Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Compressed tries

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

DOI10.1145/360248.360258zbMath0329.68037OpenAlexW2340098382MaRDI QIDQ4095864

Kurt Maly

Publication date: 1976

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360248.360258


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items

An Efficient Trie Construction for Natural Language Dictionaries, An algorithm for dynamic processing of dawg's, A fast retrieval technique for large graph structures, A practical method for implementing string pattern matching machines, How to squeeze a lexicon



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4095864&oldid=17858918"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 07:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki