Untangled monotonic chains and adaptive range search
Authors:
- Diego ArroyueloDADiego Arroyuelo
- Francisco ClaudeFCFrancisco Claude
- Reza DorrigivRDReza Dorrigiv
- Stephane DurocherSDStephane Durocher
- Meng HeMHMeng He
- Alejandro López-OrtizALAlejandro López-Ortiz
- J. Ian MunroJMJ. Ian Munro
- Patrick K. NicholsonPNPatrick K. Nicholson
- Alejandro SalingerASAlejandro Salinger
- Matthew SkalaMSMatthew Skala
- 22 July 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (32) , 4200-4211
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Orthogonal range searching in linear and almost-linear spaceComputational Geometry, 2009
- On minimum k-modal partitions of permutationsJournal of Discrete Algorithms, 2008
- The priority R-treeACM Transactions on Algorithms, 2008
- Approximating minimum cocoloringsInformation Processing Letters, 2002
- Partitioning a sequence into few monotone subsequencesActa Informatica, 1998
- An lower bound for decomposing a set of points into chainsInformation Processing Letters, 1989
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Decomposing a set of points into chains, with applications to permutation and circle graphsInformation Processing Letters, 1985
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975