nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on the largest number of red nodes in red-black trees
|
Zhu, Daxin |
|
2017 |
43 |
C |
p. 81-94 14 p. |
artikel |
2 |
A space efficient direct access data structure
|
Baruch, Gilad |
|
2017 |
43 |
C |
p. 26-37 12 p. |
artikel |
3 |
A succinct data structure for self-indexing ternary relations
|
Alvarez-Garcia, Sandra |
|
2017 |
43 |
C |
p. 38-53 16 p. |
artikel |
4 |
Editorial Board
|
|
|
2017 |
43 |
C |
p. iii- 1 p. |
artikel |
5 |
Grammar compressed sequences with rank/select support
|
Ordóñez, Alberto |
|
2017 |
43 |
C |
p. 54-71 18 p. |
artikel |
6 |
Improved Range Minimum Queries
|
Ferrada, Héctor |
|
2017 |
43 |
C |
p. 72-80 9 p. |
artikel |
7 |
Parallel lightweight wavelet tree, suffix array and FM-index construction
|
Labeit, Julian |
|
2017 |
43 |
C |
p. 2-17 16 p. |
artikel |
8 |
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
|
Sawada, Joe |
|
2017 |
43 |
C |
p. 95-110 16 p. |
artikel |
9 |
Preface – Compact Data Structures
|
Gagie, Travis |
|
2017 |
43 |
C |
p. 1- 1 p. |
artikel |
10 |
Range selection and predecessor queries in data aware space and time
|
Külekci, M. Oğuzhan |
|
2017 |
43 |
C |
p. 18-25 8 p. |
artikel |