Top Tree Compression of Tries. Bille, P., Gawrychowski, P., G\ortz, I. L., Landau, G. M., & Weimann, O. In Lu, P. & Zhang, G., editors, 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China, volume 149, of LIPIcs, pages 4:1–4:18, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Top Tree Compression of Tries [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/isaac/BilleGGLW19,
  author    = {Philip Bille and
               Pawel Gawrychowski and
               Inge Li G{\o}rtz and
               Gad M. Landau and
               Oren Weimann},
  editor    = {Pinyan Lu and
               Guochuan Zhang},
  title     = {Top Tree Compression of Tries},
  booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
               2019, December 8-11, 2019, Shanghai University of Finance and Economics,
               Shanghai, China},
  series    = {LIPIcs},
  volume    = {149},
  pages     = {4:1--4:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4},
  doi       = {10.4230/LIPIcs.ISAAC.2019.4},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/isaac/BilleGGLW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0