@inproceedings{conf/isaac/BilleGGLW19,
  added-at = {2019-12-19T00:00:00.000+0100},
  author = {Bille, Philip and Gawrychowski, Pawel and Gørtz, Inge Li and Landau, Gad M. and Weimann, Oren},
  biburl = {https://www.bibsonomy.org/bibtex/2ccc43b776d10149be869918c7d078abc/dblp},
  booktitle = {ISAAC},
  crossref = {conf/isaac/2019},
  editor = {Lu, Pinyan and Zhang, Guochuan},
  ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4},
  interhash = {d0b499254a1749f97dacefc75ccff069},
  intrahash = {ccc43b776d10149be869918c7d078abc},
  isbn = {978-3-95977-130-6},
  keywords = {dblp},
  pages = {4:1-4:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  series = {LIPIcs},
  timestamp = {2019-12-20T11:47:34.000+0100},
  title = {Top Tree Compression of Tries.},
  url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2019.html#BilleGGLW19},
  volume = 149,
  year = 2019
}

{"_id":"EKbKfxkwMTuvzTKHg","bibbaseid":"bille-gawrychowski-grtz-landau-weimann-toptreecompressionoftries-2019","author_short":["Bille, P.","Gawrychowski, P.","Gørtz, I. L.","Landau, G. M.","Weimann, O."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2019-12-19T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Bille"],"firstnames":["Philip"],"suffixes":[]},{"propositions":[],"lastnames":["Gawrychowski"],"firstnames":["Pawel"],"suffixes":[]},{"propositions":[],"lastnames":["Gørtz"],"firstnames":["Inge","Li"],"suffixes":[]},{"propositions":[],"lastnames":["Landau"],"firstnames":["Gad","M."],"suffixes":[]},{"propositions":[],"lastnames":["Weimann"],"firstnames":["Oren"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2ccc43b776d10149be869918c7d078abc/dblp","booktitle":"ISAAC","crossref":"conf/isaac/2019","editor":[{"propositions":[],"lastnames":["Lu"],"firstnames":["Pinyan"],"suffixes":[]},{"propositions":[],"lastnames":["Zhang"],"firstnames":["Guochuan"],"suffixes":[]}],"ee":"https://doi.org/10.4230/LIPIcs.ISAAC.2019.4","interhash":"d0b499254a1749f97dacefc75ccff069","intrahash":"ccc43b776d10149be869918c7d078abc","isbn":"978-3-95977-130-6","keywords":"dblp","pages":"4:1-4:18","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series":"LIPIcs","timestamp":"2019-12-20T11:47:34.000+0100","title":"Top Tree Compression of Tries.","url":"http://dblp.uni-trier.de/db/conf/isaac/isaac2019.html#BilleGGLW19","volume":"149","year":"2019","bibtex":"@inproceedings{conf/isaac/BilleGGLW19,\n added-at = {2019-12-19T00:00:00.000+0100},\n author = {Bille, Philip and Gawrychowski, Pawel and Gørtz, Inge Li and Landau, Gad M. and Weimann, Oren},\n biburl = {https://www.bibsonomy.org/bibtex/2ccc43b776d10149be869918c7d078abc/dblp},\n booktitle = {ISAAC},\n crossref = {conf/isaac/2019},\n editor = {Lu, Pinyan and Zhang, Guochuan},\n ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4},\n interhash = {d0b499254a1749f97dacefc75ccff069},\n intrahash = {ccc43b776d10149be869918c7d078abc},\n isbn = {978-3-95977-130-6},\n keywords = {dblp},\n pages = {4:1-4:18},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},\n series = {LIPIcs},\n timestamp = {2019-12-20T11:47:34.000+0100},\n title = {Top Tree Compression of Tries.},\n url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2019.html#BilleGGLW19},\n volume = 149,\n year = 2019\n}\n\n","author_short":["Bille, P.","Gawrychowski, P.","Gørtz, I. L.","Landau, G. M.","Weimann, O."],"editor_short":["Lu, P.","Zhang, G."],"key":"conf/isaac/BilleGGLW19","id":"conf/isaac/BilleGGLW19","bibbaseid":"bille-gawrychowski-grtz-landau-weimann-toptreecompressionoftries-2019","role":"author","urls":{"Link":"https://doi.org/10.4230/LIPIcs.ISAAC.2019.4","Paper":"http://dblp.uni-trier.de/db/conf/isaac/isaac2019.html#BilleGGLW19"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Landau?items=1000","dataSources":["2Mbw2PT5CoNiwZHYd"],"keywords":["dblp"],"search_terms":["top","tree","compression","tries","bille","gawrychowski","gørtz","landau","weimann"],"title":"Top Tree Compression of Tries.","year":2019}