Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Using persistent data structures for adding range restrictions to searching problems

Hans-Peter Lenhof, Michiel Smid

RAIRO-Theor. Inf. Appl., 28 1 (1994) 25-49

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1994280100251

This article has been cited by the following article(s):

Generalized substring compression

Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish and Moshe Lewenstein
Theoretical Computer Science 525 42 (2014)
https://doi.org/10.1016/j.tcs.2013.10.010

Space-Efficient Data Structures, Streams, and Algorithms

Moshe Lewenstein
Lecture Notes in Computer Science, Space-Efficient Data Structures, Streams, and Algorithms 8066 267 (2013)
https://doi.org/10.1007/978-3-642-40273-9_18

Algorithm Theory – SWAT 2012

Yakov Nekrich and Gonzalo Navarro
Lecture Notes in Computer Science, Algorithm Theory – SWAT 2012 7357 271 (2012)
https://doi.org/10.1007/978-3-642-31155-0_24

Improved data structures for the orthogonal range successor problem

Chih-Chiang Yu, Wing-Kai Hon and Biing-Feng Wang
Computational Geometry 44 (3) 148 (2011)
https://doi.org/10.1016/j.comgeo.2010.09.001

Combinatorial Pattern Matching

Orgad Keller, Tsvi Kopelowitz, Shir Landau and Moshe Lewenstein
Lecture Notes in Computer Science, Combinatorial Pattern Matching 5577 26 (2009)
https://doi.org/10.1007/978-3-642-02441-2_3

Computing and Combinatorics

Chih-Chiang Yu, Wing-Kai Hon and Biing-Feng Wang
Lecture Notes in Computer Science, Computing and Combinatorics 5609 96 (2009)
https://doi.org/10.1007/978-3-642-02882-3_11

Algorithms and Data Structures

Orgad Keller, Tsvi Kopelowitz and Moshe Lewenstein
Lecture Notes in Computer Science, Algorithms and Data Structures 4619 625 (2007)
https://doi.org/10.1007/978-3-540-73951-7_54

A technique for adding range restrictions to generalized searching problems

Prosenjit Gupta, Ravi Janardan and Michiel Smid
Information Processing Letters 64 (5) 263 (1997)
https://doi.org/10.1016/S0020-0190(97)00183-X