Pages that link to "Item:Q4729345"

The following pages link to A Functional Approach to Data Structures and Its Use in Multidimensional Searching (Q4729345):

Displaying 50 items.

• Efficient algorithms for the temporal precedence problem (Q293412) (← links)
• Fast construction of wavelet trees (Q294942) (← links)
• Dynamic range majority data structures (Q306716) (← links)
• Compressed property suffix trees (Q386003) (← links)
• Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
• Space-efficient data-analysis queries on grids (Q390915) (← links)
• New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
• Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
• Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
• Filling gaps in the boundary of a polyhedron (Q673983) (← links)
• Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
• Selection from read-only memory with limited workspace (Q744087) (← links)
• An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
• Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
• Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
• Indexing text using the Ziv--Lempel trie (Q876708) (← links)
• Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
• Storing line segments in partition trees (Q911289) (← links)
• A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
• On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
• Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
• The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
• Approximate colored range and point enclosure queries (Q1018093) (← links)
• Fractional cascading. II: Applications (Q1099958) (← links)
• \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
• Discriminant analysis and density estimation on the finite d-dimensional grid (Q1351087) (← links)
• Orthogonal queries in segments (Q1355726) (← links)
• Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
• Finding pairwise intersections inside a query range (Q1755743) (← links)
• A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
• Extending range queries and nearest neighbors (Q1841241) (← links)
• A new bound for map labeling with uniform circle pairs (Q1847377) (← links)
• An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
• Hamiltonian orthogeodesic alternating paths (Q1932349) (← links)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Fast and longest rollercoasters (Q2118392) (← links)
• A data structure for substring-substring LCS length queries (Q2118872) (← links)
• Longest common rollercoasters (Q2146120) (← links)
• Shortest paths among transient obstacles (Q2156288) (← links)
• A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (Q2165031) (← links)
• Biased range trees (Q2428657) (← links)
• Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
• Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
• Wavelet trees for all (Q2442812) (← links)
• Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
• Rank and select revisited and extended (Q2465064) (← links)
• On the difficulty of range searching. (Q2482904) (← links)
• Clustering, classification and image segmentation on the grid (Q2563647) (← links)
• Chaining algorithms for multiple genome comparison (Q2569405) (← links)
• Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)