Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 43
Volume 43, March 2017
- Travis Gagie
:
Preface - Compact Data Structures. 1 - Julian Labeit, Julian Shun, Guy E. Blelloch:
Parallel lightweight wavelet tree, suffix array and FM-index construction. 2-17 - M. Oguzhan Külekci, Sharma V. Thankachan:
Range selection and predecessor queries in data aware space and time. 18-25 - Gilad Baruch, Shmuel T. Klein, Dana Shapira:
A space efficient direct access data structure. 26-37 - Sandra Álvarez-García, Guillermo de Bernardo, Nieves R. Brisaboa, Gonzalo Navarro:
A succinct data structure for self-indexing ternary relations. 38-53 - Alberto Ordóñez Pereira, Gonzalo Navarro, Nieves R. Brisaboa:
Grammar compressed sequences with rank/select support. 54-71 - Héctor Ferrada, Gonzalo Navarro:
Improved Range Minimum Queries. 72-80
- Daxin Zhu, Yingjie Wu, Lei Wang, Xiaodong Wang:
A note on the largest number of red nodes in red-black trees. 81-94 - Joe Sawada, Aaron Williams:
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. 95-110
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
