Dynamic Succinct Data Structures and Compressed Random Access Memory

Simon J. Puglisi. Dynamic Succinct Data Structures and Compressed Random Access Memory. In Jan Holub, Jan Zdárek, editors, Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017. pages 1-1, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 2017. [doi]

@inproceedings{Puglisi17,
  title = {Dynamic Succinct Data Structures and Compressed Random Access Memory},
  author = {Simon J. Puglisi},
  year = {2017},
  url = {http://www.stringology.org/event/2017/p01.html},
  researchr = {https://researchr.org/publication/Puglisi17},
  cites = {0},
  citedby = {0},
  pages = {1},
  booktitle = {Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017},
  editor = {Jan Holub and Jan Zdárek},
  publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague},
  isbn = {978-80-01-06193-0},
}