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

scientific article

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

zbMath1297.68278MaRDI QIDQ2921685

No author found.

Publication date: 13 October 2014


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Algorithms on strings (68W32)


Related Items (8)

Computing minimal and maximal suffixes of a substring ⋮ Sublinear algorithms for approximating string compressibility ⋮ Fingerprints in compressed strings ⋮ Generalized substring compression ⋮ A linear-space data structure for range-LCP queries in poly-logarithmic time ⋮ Range LCP ⋮ Bicriteria Data Compression ⋮ Orthogonal Range Searching for Text Indexing







This page was built for publication:

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