A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm. Krishnan, N. & Baron, D. CoRR, 2014.
Link
Paper bibtex @article{journals/corr/KrishnanB14,
added-at = {2014-08-01T00:00:00.000+0200},
author = {Krishnan, Nikhil and Baron, Dror},
biburl = {http://www.bibsonomy.org/bibtex/2fd554521848fcf3980dc222106dee684/dblp},
ee = {http://arxiv.org/abs/1407.1514},
interhash = {6f4c60f060894b6ba64798fd46229e04},
intrahash = {fd554521848fcf3980dc222106dee684},
journal = {CoRR},
keywords = {dblp},
timestamp = {2015-06-18T04:22:29.000+0200},
title = {A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1407.html#KrishnanB14},
volume = {abs/1407.1514},
year = 2014
}
Downloads: 0
{"_id":"BP97udWxEfRC554e9","bibbaseid":"krishnan-baron-auniversalparalleltwopassmdlcontexttreecompressionalgorithm-2014","downloads":0,"creationDate":"2016-10-11T08:28:54.260Z","title":"A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm.","author_short":["Krishnan, N.","Baron, D."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/krishnan?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2014-08-01T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Krishnan"],"firstnames":["Nikhil"],"suffixes":[]},{"propositions":[],"lastnames":["Baron"],"firstnames":["Dror"],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/2fd554521848fcf3980dc222106dee684/dblp","ee":"http://arxiv.org/abs/1407.1514","interhash":"6f4c60f060894b6ba64798fd46229e04","intrahash":"fd554521848fcf3980dc222106dee684","journal":"CoRR","keywords":"dblp","timestamp":"2015-06-18T04:22:29.000+0200","title":"A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm.","url":"http://dblp.uni-trier.de/db/journals/corr/corr1407.html#KrishnanB14","volume":"abs/1407.1514","year":"2014","bibtex":"@article{journals/corr/KrishnanB14,\n added-at = {2014-08-01T00:00:00.000+0200},\n author = {Krishnan, Nikhil and Baron, Dror},\n biburl = {http://www.bibsonomy.org/bibtex/2fd554521848fcf3980dc222106dee684/dblp},\n ee = {http://arxiv.org/abs/1407.1514},\n interhash = {6f4c60f060894b6ba64798fd46229e04},\n intrahash = {fd554521848fcf3980dc222106dee684},\n journal = {CoRR},\n keywords = {dblp},\n timestamp = {2015-06-18T04:22:29.000+0200},\n title = {A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm.},\n url = {http://dblp.uni-trier.de/db/journals/corr/corr1407.html#KrishnanB14},\n volume = {abs/1407.1514},\n year = 2014\n}\n\n","author_short":["Krishnan, N.","Baron, D."],"key":"journals/corr/KrishnanB14","id":"journals/corr/KrishnanB14","bibbaseid":"krishnan-baron-auniversalparalleltwopassmdlcontexttreecompressionalgorithm-2014","role":"author","urls":{"Link":"http://arxiv.org/abs/1407.1514","Paper":"http://dblp.uni-trier.de/db/journals/corr/corr1407.html#KrishnanB14"},"keyword":["dblp"],"downloads":0},"search_terms":["universal","parallel","two","pass","mdl","context","tree","compression","algorithm","krishnan","baron"],"keywords":["dblp"],"authorIDs":[],"dataSources":["xsmEhpcqYQxeyggwv"]}