Cross-document pattern matching.
Kopelowitz, T.; Kucherov, G.; Nekrich, Y.; and Starikovskaya, T.
J. Discrete Algorithms, 24: 40-47. 2014.
Link
Paper
link
bibtex
@article{journals/jda/KopelowitzKNS14,
added-at = {2019-10-15T00:00:00.000+0200},
author = {Kopelowitz, Tsvi and Kucherov, Gregory and Nekrich, Yakov and Starikovskaya, Tatiana},
biburl = {https://www.bibsonomy.org/bibtex/282c7c86c7f11429974324a46926b078c/dblp},
ee = {https://www.wikidata.org/entity/Q58064467},
interhash = {fcf2e1f9129e16dce6cbe32a86f6a7b9},
intrahash = {82c7c86c7f11429974324a46926b078c},
journal = {J. Discrete Algorithms},
keywords = {dblp},
pages = {40-47},
timestamp = {2019-10-16T11:38:15.000+0200},
title = {Cross-document pattern matching.},
url = {http://dblp.uni-trier.de/db/journals/jda/jda24.html#KopelowitzKNS14},
volume = 24,
year = 2014
}
Efficient Fully-Compressed Sequence Representations.
Barbay, J.; Claude, F.; Gagie, T.; Navarro, G.; and Nekrich, Y.
Algorithmica, 69(1): 232-268. 2014.
Link
Paper
link
bibtex
@article{journals/algorithmica/BarbayCGNN14,
added-at = {2018-11-30T00:00:00.000+0100},
author = {Barbay, Jérémy and Claude, Francisco and Gagie, Travis and Navarro, Gonzalo and Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/294526fe93332916b4d34f3f724fe1f91/dblp},
ee = {https://doi.org/10.1007/s00453-012-9726-3},
interhash = {f8cef17c643c68a02c94babbc774d6a8},
intrahash = {94526fe93332916b4d34f3f724fe1f91},
journal = {Algorithmica},
keywords = {dblp},
number = 1,
pages = {232-268},
timestamp = {2018-12-01T11:39:36.000+0100},
title = {Efficient Fully-Compressed Sequence Representations.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica69.html#BarbayCGNN14},
volume = 69,
year = 2014
}
Space-Efficient String Indexing for Wildcard Pattern Matching.
Lewenstein, M.; Nekrich, Y.; and Vitter, J. S.
In Mayr, E. W.; and Portier, N., editor(s),
STACS, volume 25, of
LIPIcs, pages 506-517, 2014. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Link
Paper
link
bibtex
@inproceedings{conf/stacs/LewensteinNV14,
added-at = {2018-11-30T00:00:00.000+0100},
author = {Lewenstein, Moshe and Nekrich, Yakov and Vitter, Jeffrey Scott},
biburl = {https://www.bibsonomy.org/bibtex/26a9cd2c22fdd69aaed512d5c05db020c/dblp},
booktitle = {STACS},
crossref = {conf/stacs/2014},
editor = {Mayr, Ernst W. and Portier, Natacha},
ee = {https://doi.org/10.4230/LIPIcs.STACS.2014.506},
interhash = {e07549f41a645c1cbeeb673b75eb9101},
intrahash = {6a9cd2c22fdd69aaed512d5c05db020c},
isbn = {978-3-939897-65-1},
keywords = {dblp},
pages = {506-517},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2020-02-12T11:48:21.000+0100},
title = {Space-Efficient String Indexing for Wildcard Pattern Matching.},
url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#LewensteinNV14},
volume = 25,
year = 2014
}
Categorical range maxima queries.
Patil, M.; Thankachan, S. V.; Shah, R.; Nekrich, Y.; and Vitter, J. S.
In Hull, R.; and Grohe, M., editor(s),
PODS, pages 266-277, 2014. ACM
Link
Paper
link
bibtex
@inproceedings{conf/pods/PatilTSNV14,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Patil, Manish and Thankachan, Sharma V. and Shah, Rahul and Nekrich, Yakov and Vitter, Jeffrey Scott},
biburl = {https://www.bibsonomy.org/bibtex/2a17326abd94f0b72b865eda767c1b052/dblp},
booktitle = {PODS},
crossref = {conf/pods/2014},
editor = {Hull, Richard and Grohe, Martin},
ee = {https://doi.org/10.1145/2594538.2594557},
interhash = {205e5366711c5002c9d29ef541824145},
intrahash = {a17326abd94f0b72b865eda767c1b052},
isbn = {978-1-4503-2375-8},
keywords = {dblp},
pages = {266-277},
publisher = {ACM},
timestamp = {2018-11-07T15:28:59.000+0100},
title = {Categorical range maxima queries.},
url = {http://dblp.uni-trier.de/db/conf/pods/pods2014.html#PatilTSNV14},
year = 2014
}
Efficient range searching for categorical and plain data.
Nekrich, Y.
ACM Trans. Database Syst., 39(1): 9:1-9:21. 2014.
Link
Paper
link
bibtex
@article{journals/tods/Nekrich14,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/274619326346bc27b3ed284e73dae719d/dblp},
ee = {https://doi.org/10.1145/2543924},
interhash = {91c39138839a650f9eb7e1285601bb36},
intrahash = {74619326346bc27b3ed284e73dae719d},
journal = {ACM Trans. Database Syst.},
keywords = {dblp},
number = 1,
pages = {9:1-9:21},
timestamp = {2018-11-07T11:50:07.000+0100},
title = {Efficient range searching for categorical and plain data.},
url = {http://dblp.uni-trier.de/db/journals/tods/tods39.html#Nekrich14},
volume = 39,
year = 2014
}
Optimal Dynamic Sequence Representations.
Navarro, G.; and Nekrich, Y.
SIAM J. Comput., 43(5): 1781-1806. 2014.
Link
Paper
link
bibtex
@article{journals/siamcomp/NavarroN14,
added-at = {2018-11-02T00:00:00.000+0100},
author = {Navarro, Gonzalo and Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/26e9376442bf5bc27fc2c1d08958cecc4/dblp},
ee = {https://doi.org/10.1137/130908245},
interhash = {13bf8012474e3f705a1f9270cf38de53},
intrahash = {6e9376442bf5bc27fc2c1d08958cecc4},
journal = {SIAM J. Comput.},
keywords = {dblp},
number = 5,
pages = {1781-1806},
timestamp = {2018-11-03T12:42:51.000+0100},
title = {Optimal Dynamic Sequence Representations.},
url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp43.html#NavarroN14},
volume = 43,
year = 2014
}
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing.
Huo, H.; Chen, L.; Vitter, J. S.; and Nekrich, Y.
In Bilgin, A.; Marcellin, M. W.; Serra-Sagristà, J.; and Storer, J. A., editor(s),
DCC, pages 292-301, 2014. IEEE
Link
Paper
link
bibtex
@inproceedings{conf/dcc/HuoCVN14,
added-at = {2018-11-02T00:00:00.000+0100},
author = {Huo, Hongwei and Chen, Longgang and Vitter, Jeffrey Scott and Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/212f83038263f25011f51248eccd57f0c/dblp},
booktitle = {DCC},
crossref = {conf/dcc/2014},
editor = {Bilgin, Ali and Marcellin, Michael W. and Serra-Sagristà, Joan and Storer, James A.},
ee = {https://doi.org/10.1109/DCC.2014.49},
interhash = {e50d1d38a19ed6169b93a2de3df89a09},
intrahash = {12f83038263f25011f51248eccd57f0c},
isbn = {978-1-4799-3882-7},
keywords = {dblp},
pages = {292-301},
publisher = {IEEE},
timestamp = {2019-10-17T21:02:10.000+0200},
title = {A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing.},
url = {http://dblp.uni-trier.de/db/conf/dcc/dcc2014.html#HuoCVN14},
year = 2014
}
Document Retrieval with One Wildcard.
Lewenstein, M.; Munro, J. I.; Nekrich, Y.; and Thankachan, S. V.
In Csuhaj-Varjú, E.; Dietzfelbinger, M.; and Ésik, Z., editor(s),
MFCS (2), volume 8635, of
Lecture Notes in Computer Science, pages 529-540, 2014. Springer
Link
Paper
link
bibtex
@inproceedings{conf/mfcs/LewensteinMNT14,
added-at = {2018-11-02T00:00:00.000+0100},
author = {Lewenstein, Moshe and Munro, J. Ian and Nekrich, Yakov and Thankachan, Sharma V.},
biburl = {https://www.bibsonomy.org/bibtex/2e6087012aec8d6ce6a0a593490ece6d1/dblp},
booktitle = {MFCS (2)},
crossref = {conf/mfcs/2014-2},
editor = {Csuhaj-Varjú, Erzsébet and Dietzfelbinger, Martin and Ésik, Zoltán},
ee = {https://doi.org/10.1007/978-3-662-44465-8_45},
interhash = {59b157d44f1b4a6b1ffddbafcf75c6ad},
intrahash = {e6087012aec8d6ce6a0a593490ece6d1},
isbn = {978-3-662-44464-1},
keywords = {dblp},
pages = {529-540},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T18:13:36.000+0200},
title = {Document Retrieval with One Wildcard.},
url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2014-2.html#LewensteinMNT14},
volume = 8635,
year = 2014
}
LZ77-Based Self-indexing with Faster Pattern Matching.
Gagie, T.; Gawrychowski, P.; Kärkkäinen, J.; Nekrich, Y.; and Puglisi, S. J.
In Pardo, A.; and Viola, A., editor(s),
LATIN, volume 8392, of
Lecture Notes in Computer Science, pages 731-742, 2014. Springer
Link
Paper
link
bibtex
@inproceedings{conf/latin/GagieGKNP14,
added-at = {2018-11-02T00:00:00.000+0100},
author = {Gagie, Travis and Gawrychowski, Pawel and Kärkkäinen, Juha and Nekrich, Yakov and Puglisi, Simon J.},
biburl = {https://www.bibsonomy.org/bibtex/289eaa388125a2b68722ce092d3221ac5/dblp},
booktitle = {LATIN},
crossref = {conf/latin/2014},
editor = {Pardo, Alberto and Viola, Alfredo},
ee = {https://doi.org/10.1007/978-3-642-54423-1_63},
interhash = {b14b71fdc9d188f70a766e5b62e243ab},
intrahash = {89eaa388125a2b68722ce092d3221ac5},
isbn = {978-3-642-54422-4},
keywords = {dblp},
pages = {731-742},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T20:17:33.000+0200},
title = {LZ77-Based Self-indexing with Faster Pattern Matching.},
url = {http://dblp.uni-trier.de/db/conf/latin/latin2014.html#GagieGKNP14},
volume = 8392,
year = 2014
}
Space-Efficient String Indexing for Wildcard Pattern Matching.
Lewenstein, M.; Nekrich, Y.; and Vitter, J. S.
CoRR, abs/1401.0625. 2014.
Link
Paper
link
bibtex
@article{journals/corr/LewensteinNV14,
added-at = {2018-08-13T00:00:00.000+0200},
author = {Lewenstein, Moshe and Nekrich, Yakov and Vitter, Jeffrey Scott},
biburl = {https://www.bibsonomy.org/bibtex/254921dfdfe6a8711822e9dd4dfe552ac/dblp},
ee = {http://arxiv.org/abs/1401.0625},
interhash = {e07549f41a645c1cbeeb673b75eb9101},
intrahash = {54921dfdfe6a8711822e9dd4dfe552ac},
journal = {CoRR},
keywords = {dblp},
timestamp = {2018-08-14T14:09:42.000+0200},
title = {Space-Efficient String Indexing for Wildcard Pattern Matching.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1401.html#LewensteinNV14},
volume = {abs/1401.0625},
year = 2014
}
Efficient and Compact Representations of Prefix Codes.
Gagie, T.; Navarro, G.; Nekrich, Y.; and Pereira, A. O.
CoRR, abs/1410.3438. 2014.
Link
Paper
link
bibtex
@article{journals/corr/GagieNNP14,
added-at = {2018-08-13T00:00:00.000+0200},
author = {Gagie, Travis and Navarro, Gonzalo and Nekrich, Yakov and Pereira, Alberto Ordóñez},
biburl = {https://www.bibsonomy.org/bibtex/2ebbbc935c4f594f19fab2fc3e1df409d/dblp},
ee = {http://arxiv.org/abs/1410.3438},
interhash = {470a27cb1317303e6bfc0a5d5c149ef1},
intrahash = {ebbbc935c4f594f19fab2fc3e1df409d},
journal = {CoRR},
keywords = {dblp},
timestamp = {2018-08-14T11:45:02.000+0200},
title = {Efficient and Compact Representations of Prefix Codes.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1410.html#GagieNNP14},
volume = {abs/1410.3438},
year = 2014
}
Fast Construction of Wavelet Trees.
Munro, J. I.; Nekrich, Y.; and Vitter, J. S.
In de Moura, E. S.; and Crochemore, M., editor(s),
SPIRE, volume 8799, of
Lecture Notes in Computer Science, pages 101-110, 2014. Springer
Link
Paper
link
bibtex
@inproceedings{conf/spire/MunroNV14,
added-at = {2017-05-24T00:00:00.000+0200},
author = {Munro, J. Ian and Nekrich, Yakov and Vitter, Jeffrey Scott},
biburl = {https://www.bibsonomy.org/bibtex/2f37ec3013c63ad665e88c6a3235b8734/dblp},
booktitle = {SPIRE},
crossref = {conf/spire/2014},
editor = {de Moura, Edleno Silva and Crochemore, Maxime},
ee = {https://doi.org/10.1007/978-3-319-11918-2_10},
interhash = {aa2d190196c3d1878f85f516e0d88953},
intrahash = {f37ec3013c63ad665e88c6a3235b8734},
isbn = {978-3-319-11917-5},
keywords = {dblp},
pages = {101-110},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T20:18:18.000+0200},
title = {Fast Construction of Wavelet Trees.},
url = {http://dblp.uni-trier.de/db/conf/spire/spire2014.html#MunroNV14},
volume = 8799,
year = 2014
}