Improved Algorithms for the Range Next Value Problem and Applications

Authors Costas S. Iliopoulos, Maxime Crochemore, Marcin Kubica, M. Sohel Rahman, Tomasz Walen



PDF
Thumbnail PDF

File

LIPIcs.STACS.2008.1359.pdf
  • Filesize: 206 kB
  • 12 pages

Document Identifiers

Author Details

Costas S. Iliopoulos
Maxime Crochemore
Marcin Kubica
M. Sohel Rahman
Tomasz Walen

Cite AsGet BibTex

Costas S. Iliopoulos, Maxime Crochemore, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen. Improved Algorithms for the Range Next Value Problem and Applications. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 205-216, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/LIPIcs.STACS.2008.1359

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.
Keywords
  • Algorithms
  • Data structures

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail