Ontology type: schema:Chapter Open Access: True
2007
AUTHORSSofya Raskhodnikova , Dana Ron , Ronitt Rubinfeld , Adam Smith
ABSTRACTWe raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (LZ), and present sublinear algorithms for approximating compressibility with respect to both schemes. We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly.Our investigation of LZ yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lemmas that relate the compressibility of a string with respect to Lempel-Ziv to the number of distinct short substrings contained in it. In addition, we show that approximating the compressibility with respect to LZ is related to approximating the support size of a distribution. More... »
PAGES609-623
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN
978-3-540-74207-4
978-3-540-74208-1
http://scigraph.springernature.com/pub.10.1007/978-3-540-74208-1_44
DOIhttp://dx.doi.org/10.1007/978-3-540-74208-1_44
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1037212078
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Pennsylvania State University, USA",
"id": "http://www.grid.ac/institutes/grid.29857.31",
"name": [
"Pennsylvania State University, USA"
],
"type": "Organization"
},
"familyName": "Raskhodnikova",
"givenName": "Sofya",
"id": "sg:person.07502404747.45",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07502404747.45"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Tel Aviv University, Israel",
"id": "http://www.grid.ac/institutes/grid.12136.37",
"name": [
"Tel Aviv University, Israel"
],
"type": "Organization"
},
"familyName": "Ron",
"givenName": "Dana",
"id": "sg:person.015036626555.78",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015036626555.78"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "MIT, Cambridge MA, USA",
"id": "http://www.grid.ac/institutes/grid.116068.8",
"name": [
"MIT, Cambridge MA, USA"
],
"type": "Organization"
},
"familyName": "Rubinfeld",
"givenName": "Ronitt",
"id": "sg:person.01300130330.47",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01300130330.47"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Pennsylvania State University, USA",
"id": "http://www.grid.ac/institutes/grid.29857.31",
"name": [
"Pennsylvania State University, USA"
],
"type": "Organization"
},
"familyName": "Smith",
"givenName": "Adam",
"id": "sg:person.013307226666.21",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
],
"type": "Person"
}
],
"datePublished": "2007",
"datePublishedReg": "2007-01-01",
"description": "We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (LZ), and present sublinear algorithms for approximating compressibility with respect to both schemes. We also give several lower bounds that show that our algorithms for both schemes cannot be improved significantly.Our investigation of LZ yields results whose interest goes beyond the initial questions we set out to study. In particular, we prove combinatorial structural lemmas that relate the compressibility of a string with respect to Lempel-Ziv to the number of distinct short substrings contained in it. In addition, we show that approximating the compressibility with respect to LZ is related to approximating the support size of a distribution.",
"editor": [
{
"familyName": "Charikar",
"givenName": "Moses",
"type": "Person"
},
{
"familyName": "Jansen",
"givenName": "Klaus",
"type": "Person"
},
{
"familyName": "Reingold",
"givenName": "Omer",
"type": "Person"
},
{
"familyName": "Rolim",
"givenName": "Jos\u00e9 D. P.",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-540-74208-1_44",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-540-74207-4",
"978-3-540-74208-1"
],
"name": "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques",
"type": "Book"
},
"keywords": [
"run-length encoding",
"Lempel-Ziv",
"compression scheme",
"sublinear algorithms",
"lossless compression scheme",
"sublinear time",
"short substrings",
"algorithm",
"scheme",
"structural lemma",
"lower bounds",
"strings",
"encoding",
"substrings",
"support size",
"compressibility",
"bounds",
"lemma",
"respect",
"detail",
"interest",
"questions",
"time",
"initial question",
"number",
"distribution",
"size",
"addition",
"investigation",
"yield"
],
"name": "Sublinear Algorithms for Approximating String Compressibility",
"pagination": "609-623",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1037212078"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-540-74208-1_44"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-540-74208-1_44",
"https://app.dimensions.ai/details/publication/pub.1037212078"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-06-01T22:34",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_409.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-540-74208-1_44"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74208-1_44'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74208-1_44'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74208-1_44'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74208-1_44'
This table displays all metadata directly associated to this object as RDF triples.
132 TRIPLES
23 PREDICATES
56 URIs
49 LITERALS
7 BLANK NODES