-
1
-
-
84880338581
-
Succinct trees in practice
-
D. Arroyuelo, R. Cánovas, G. Navarro, and K. Sadakane. Succinct trees in practice. In Proc. 11th ALENEX, pages 84-97, 2010.
-
(2010)
Proc. 11th ALENEX
, pp. 84-97
-
-
Arroyuelo, D.1
Cánovas, R.2
Navarro, G.3
Sadakane, K.4
-
2
-
-
80052802174
-
Alphabet-independent compressed text indexing
-
D. Belazzougui and G. Navarro. Alphabet-independent compressed text indexing. In Proc. 19th ESA, pages 748-759, 2011.
-
(2011)
Proc. 19th ESA
, pp. 748-759
-
-
Belazzougui, D.1
Navarro, G.2
-
3
-
-
80053949092
-
Improved compressed indexes for full-text document retrieval
-
D. Belazzougui and G. Navarro. Improved compressed indexes for full-text document retrieval. In Proc. 18th SPIRE, pages 386-397, 2011.
-
(2011)
Proc. 18th SPIRE
, pp. 386-397
-
-
Belazzougui, D.1
Navarro, G.2
-
5
-
-
85041120916
-
Practical rank/select queries over arbitrary sequences
-
F. Claude and G. Navarro. Practical rank/select queries over arbitrary sequences. In Proc. 15th SPIRE, pages 176-187, 2008.
-
(2008)
Proc. 15th SPIRE
, pp. 176-187
-
-
Claude, F.1
Navarro, G.2
-
6
-
-
79957456930
-
Space-efficient preprocessing schemes for range minimum queries on static arrays
-
J. Fischer and V. Heun. Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput., 40(2):465-492, 2011.
-
(2011)
SIAM J. Comput.
, vol.40
, Issue.2
, pp. 465-492
-
-
Fischer, J.1
Heun, V.2
-
7
-
-
33845514938
-
Practical implementation of rank and select queries
-
R. González, Sz. Grabowski, V. Mäkinen, and G. Navarro. Practical implementation of rank and select queries. In Proc. Posters 4th WEA, pages 27-38, 2005.
-
(2005)
Proc. Posters 4th WEA
, pp. 27-38
-
-
González, R.1
Grabowski, Sz.2
Mäkinen, V.3
Navarro, G.4
-
8
-
-
0037739870
-
High-order entropy-compressed text indexes
-
R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th SODA, pages 841-850, 2003.
-
(2003)
Proc. 14th SODA
, pp. 841-850
-
-
Grossi, R.1
Gupta, A.2
Vitter, J.3
-
9
-
-
78049348697
-
Efficient index for retrieving top-k most frequent documents
-
W.-K. Hon, M. Patil, R. Shah, and S.-B. Wu. Efficient index for retrieving top-k most frequent documents. J. Discr. Alg., 8(4):402-417, 2010.
-
(2010)
J. Discr. Alg.
, vol.8
, Issue.4
, pp. 402-417
-
-
Hon, W.-K.1
Patil, M.2
Shah, R.3
Wu, S.-B.4
-
10
-
-
84863107499
-
Towards an optimal space-and-querytime index for top-k document retrieval
-
W.-K. Hon, R. Shah, and S. Thankachan. Towards an optimal space-and-querytime index for top-k document retrieval. In Proc. 23rd CPM, pages 173-184, 2012.
-
(2012)
Proc. 23rd CPM
, pp. 173-184
-
-
Hon, W.-K.1
Shah, R.2
Thankachan, S.3
-
11
-
-
77952349728
-
Space-efficient framework for top-k string retrieval problems
-
W.-K. Hon, R. Shah, and J. S. Vitter. Space-efficient framework for top-k string retrieval problems. In Proc. 50th FOCS, pages 713-722, 2009.
-
(2009)
Proc. 50th FOCS
, pp. 713-722
-
-
Hon, W.-K.1
Shah, R.2
Vitter, J.S.3
-
12
-
-
70350637480
-
Efficient index for retrieving top-k most frequent documents
-
W.-K. Hon, R. Shah, and S.-B. Wu. Efficient index for retrieving top-k most frequent documents. In Proc. 16th SPIRE, pages 182-193, 2009.
-
(2009)
Proc. 16th SPIRE
, pp. 182-193
-
-
Hon, W.-K.1
Shah, R.2
Wu, S.-B.3
-
13
-
-
33745597587
-
Position-restricted substring searching
-
V. Mäkinen and G. Navarro. Position-restricted substring searching. In Proc. 7th LATIN, pages 703-714, 2006.
-
(2006)
Proc. 7th LATIN
, pp. 703-714
-
-
Mäkinen, V.1
Navarro, G.2
-
14
-
-
0027681165
-
Suffix arrays: A new method for on-line string searches
-
U. Manber and E. W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935-948, 1993.
-
(1993)
SIAM J. Comput.
, vol.22
, Issue.5
, pp. 935-948
-
-
Manber, U.1
Myers, E.W.2
-
15
-
-
0037967496
-
An analysis of the burrows-wheeler transform
-
G. Manzini. An analysis of the Burrows-Wheeler transform. J. ACM, 48(3):407- 430, 2001.
-
(2001)
J. ACM
, vol.48
, Issue.3
, pp. 407-430
-
-
Manzini, G.1
-
17
-
-
33744962566
-
Efficient algorithms for document retrieval problems
-
S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proc. 13th SODA, pages 657-666, 2002.
-
(2002)
Proc. 13th SODA
, pp. 657-666
-
-
Muthukrishnan, S.1
-
18
-
-
34147186297
-
Compressed full-text indexes
-
article 2
-
G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Comp. Surv., 39(1):article 2, 2007.
-
(2007)
ACM Comp. Surv.
, vol.39
, Issue.1
-
-
Navarro, G.1
Mäkinen, V.2
-
19
-
-
84860191488
-
Top-k document retrieval in optimal time and linear space
-
G. Navarro and Y. Nekrich. Top-k document retrieval in optimal time and linear space. In Proc. 23rd SODA, pages 1066-1077, 2012.
-
(2012)
Proc. 23rd SODA
, pp. 1066-1077
-
-
Navarro, G.1
Nekrich, Y.2
-
20
-
-
84055217312
-
Space-efficient data-analysis queries on grids
-
G. Navarro and L. Russo. Space-efficient data-analysis queries on grids. In Proc. 22nd ISAAC, pages 323-332, 2011.
-
(2011)
Proc. 22nd ISAAC
, pp. 323-332
-
-
Navarro, G.1
Russo, L.2
-
21
-
-
84864349548
-
Space-efficient top-k document retrieval
-
G. Navarro and D. Valenzuela. Space-efficient top-k document retrieval. In Proc. 11th SEA, pages 307-319, 2012.
-
(2012)
Proc. 11th SEA
, pp. 307-319
-
-
Navarro, G.1
Valenzuela, D.2
-
22
-
-
37149033290
-
Practical entropy-compressed rank/select dictionary
-
D. Okanohara and K. Sadakane. Practical entropy-compressed rank/select dictionary. In Proc. 8th ALENEX, 2007.
-
(2007)
Proc. 8th ALENEX
-
-
Okanohara, D.1
Sadakane, K.2
-
24
-
-
78349268787
-
Top-k ranked document search in general text databases
-
S. Puglisi S. Culpepper, G. Navarro and A. Turpin. Top-k ranked document search in general text databases. In Proc. 18th ESA, pages 194-205, 2010.
-
(2010)
Proc. 18th ESA
, pp. 194-205
-
-
Culpepper, S.P.S.1
Navarro, G.2
Turpin, A.3
-
25
-
-
77951686861
-
Fully-functional succinct trees
-
K. Sadakane and G. Navarro. Fully-functional succinct trees. In Proc. 21st SODA, pages 134-149, 2010.
-
(2010)
Proc. 21st SODA
, pp. 134-149
-
-
Sadakane, K.1
Navarro, G.2
-
26
-
-
0027846339
-
A generalized suffix tree and its (un)expected asymptotic behaviors
-
W. Szpankowski. A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM J. Comput., 22(6):1176-1198, 1993.
-
(1993)
SIAM J. Comput.
, vol.22
, Issue.6
, pp. 1176-1198
-
-
Szpankowski, W.1
-
28
-
-
0020802573
-
Log-logarithmic worst case range queries are possible in space Θ(n)
-
D. E. Willard. Log-logarithmic worst case range queries are possible in space Θ(n). Inf. Proc. Lett., 17:81-84, 1983.
-
(1983)
Inf. Proc. Lett.
, vol.17
, pp. 81-84
-
-
Willard, D.E.1
|