Top Tree Compression of Tries. Bille, P., G\ortz, I. L., Gawrychowski, P., Landau, G. M., & Weimann, O. CoRR, 2019.
Paper bibtex @article{DBLP:journals/corr/abs-1902-02187,
author = {Philip Bille and
Inge Li G{\o}rtz and
Pawel Gawrychowski and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {CoRR},
volume = {abs/1902.02187},
year = {2019},
url = {http://arxiv.org/abs/1902.02187},
archivePrefix = {arXiv},
eprint = {1902.02187},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-02187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"oYe5Wx5gipGGSJSKQ","bibbaseid":"bille-gortz-gawrychowski-landau-weimann-toptreecompressionoftries-2019","author_short":["Bille, P.","G\\ortz, I. L.","Gawrychowski, P.","Landau, G. M.","Weimann, O."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Philip"],"propositions":[],"lastnames":["Bille"],"suffixes":[]},{"firstnames":["Inge","Li"],"propositions":[],"lastnames":["G\\ortz"],"suffixes":[]},{"firstnames":["Pawel"],"propositions":[],"lastnames":["Gawrychowski"],"suffixes":[]},{"firstnames":["Gad","M."],"propositions":[],"lastnames":["Landau"],"suffixes":[]},{"firstnames":["Oren"],"propositions":[],"lastnames":["Weimann"],"suffixes":[]}],"title":"Top Tree Compression of Tries","journal":"CoRR","volume":"abs/1902.02187","year":"2019","url":"http://arxiv.org/abs/1902.02187","archiveprefix":"arXiv","eprint":"1902.02187","timestamp":"Tue, 21 May 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-1902-02187.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-1902-02187,\n author = {Philip Bille and\n Inge Li G{\\o}rtz and\n Pawel Gawrychowski and\n Gad M. Landau and\n Oren Weimann},\n title = {Top Tree Compression of Tries},\n journal = {CoRR},\n volume = {abs/1902.02187},\n year = {2019},\n url = {http://arxiv.org/abs/1902.02187},\n archivePrefix = {arXiv},\n eprint = {1902.02187},\n timestamp = {Tue, 21 May 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1902-02187.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bille, P.","G\\ortz, I. L.","Gawrychowski, P.","Landau, G. M.","Weimann, O."],"key":"DBLP:journals/corr/abs-1902-02187","id":"DBLP:journals/corr/abs-1902-02187","bibbaseid":"bille-gortz-gawrychowski-landau-weimann-toptreecompressionoftries-2019","role":"author","urls":{"Paper":"http://arxiv.org/abs/1902.02187"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/93/2346.bib","dataSources":["gzaiqt38X7DKLvHXK"],"keywords":[],"search_terms":["top","tree","compression","tries","bille","g\\ortz","gawrychowski","landau","weimann"],"title":"Top Tree Compression of Tries","year":2019}