@article{DBLP:journals/tcs/BarbayFN12,
  author       = {J{\'{e}}r{\'{e}}my Barbay and
                  Johannes Fischer and
                  Gonzalo Navarro},
  title        = {LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations},
  journal      = {Theor. Comput. Sci.},
  volume       = {459},
  pages        = {26--41},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.010},
  doi          = {10.1016/j.tcs.2012.08.010},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BarbayFN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"vYvsTA2mropqokvBv","bibbaseid":"barbay-fischer-navarro-lrmtreescompressedindicesadaptivesortingandcompressedpermutations-2012","author_short":["Barbay, J.","Fischer, J.","Navarro, G."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Jérémy"],"propositions":[],"lastnames":["Barbay"],"suffixes":[]},{"firstnames":["Johannes"],"propositions":[],"lastnames":["Fischer"],"suffixes":[]},{"firstnames":["Gonzalo"],"propositions":[],"lastnames":["Navarro"],"suffixes":[]}],"title":"LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations","journal":"Theor. Comput. Sci.","volume":"459","pages":"26–41","year":"2012","url":"https://doi.org/10.1016/j.tcs.2012.08.010","doi":"10.1016/j.tcs.2012.08.010","timestamp":"Sun, 02 Oct 2022 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/tcs/BarbayFN12.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/tcs/BarbayFN12,\n author = {J{\\'{e}}r{\\'{e}}my Barbay and\n Johannes Fischer and\n Gonzalo Navarro},\n title = {LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations},\n journal = {Theor. Comput. Sci.},\n volume = {459},\n pages = {26--41},\n year = {2012},\n url = {https://doi.org/10.1016/j.tcs.2012.08.010},\n doi = {10.1016/j.tcs.2012.08.010},\n timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/tcs/BarbayFN12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Barbay, J.","Fischer, J.","Navarro, G."],"key":"DBLP:journals/tcs/BarbayFN12","id":"DBLP:journals/tcs/BarbayFN12","bibbaseid":"barbay-fischer-navarro-lrmtreescompressedindicesadaptivesortingandcompressedpermutations-2012","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.tcs.2012.08.010"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/56/5867.bib","dataSources":["XyFfyYv4a4hanxoJy"],"keywords":[],"search_terms":["lrm","trees","compressed","indices","adaptive","sorting","compressed","permutations","barbay","fischer","navarro"],"title":"LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations","year":2012}