License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1359
URN: urn:nbn:de:0030-drops-13596
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1359/
Iliopoulos, Costas S. ;
Crochemore, Maxime ;
Kubica, Marcin ;
Rahman, M. Sohel ;
Walen, Tomasz
Improved Algorithms for the Range Next Value Problem and Applications
Abstract
The Range Next Value problem (Problem RNV) is a recent interesting
variant of the range search problems, where the query is for the
immediate next (or equal) value of a given number within a given
interval of an array. Problem RNV was introduced and studied very
recently by Crochemore et. al [Finding Patterns In Given
Intervals, MFCS 2007]. In this paper, we present improved
algorithms for Problem RNV. We also show how this problem can be
used to achieve optimal query time for a number of interesting
variants of the classic pattern matching problems.
BibTeX - Entry
@InProceedings{iliopoulos_et_al:LIPIcs:2008:1359,
author = {Costas S. Iliopoulos and Maxime Crochemore and Marcin Kubica and M. Sohel Rahman and Tomasz Walen},
title = {{Improved Algorithms for the Range Next Value Problem and Applications}},
booktitle = {25th International Symposium on Theoretical Aspects of Computer Science},
pages = {205--216},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-06-4},
ISSN = {1868-8969},
year = {2008},
volume = {1},
editor = {Susanne Albers and Pascal Weil},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1359},
URN = {urn:nbn:de:0030-drops-13596},
doi = {10.4230/LIPIcs.STACS.2008.1359},
annote = {Keywords: Algorithms, Data structures}
}
Keywords: |
|
Algorithms, Data structures |
Collection: |
|
25th International Symposium on Theoretical Aspects of Computer Science |
Issue Date: |
|
2008 |
Date of publication: |
|
06.02.2008 |