scientific article; zbMATH DE number 6297698

zbMath1288.68105MaRDI QIDQ5417615

Timothy M. Chan, Mihai Pǎtraşcu

Publication date: 22 May 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (29)

Dynamic layers of maxima with applications to dominating queries ⋮ Fast construction of wavelet trees ⋮ Order-preserving indexing ⋮ Fast algorithms for the rooted triplet distance between caterpillars ⋮ The range 1 query (R1Q) problem ⋮ Entropy-bounded representation of point grids ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Absent Subsequences in Words ⋮ Klee's measure problem made oblivious ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Longest bordered and periodic subsequences ⋮ Unnamed Item ⋮ Biased range trees ⋮ An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem ⋮ Flexible level-1 consensus ensuring stable social choice: analysis and algorithms ⋮ Constructing the R* consensus tree of two trees in subcubic time ⋮ Unnamed Item ⋮ Top-\(k\) Manhattan spatial skyline queries ⋮ Linear-space data structures for range mode query in arrays ⋮ Discrete coalescent trees ⋮ The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications ⋮ Faster algorithms for computing the R* consensus tree ⋮ Internal dictionary matching ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Unnamed Item ⋮ Smallest k-enclosing rectangle revisited ⋮ Persistent homology in \(\ell_\infty\) metric ⋮ Counting inversions adaptively

This page was built for publication: