Pages that link to "Item:Q1317486"

The following pages link to Surpassing the information theoretic bound with fusion trees (Q1317486):

Displaying 50 items.

• Computing minimal and maximal suffixes of a substring (Q294952) (← links)
• Dynamic range majority data structures (Q306716) (← links)
• Palindrome pattern matching (Q390901) (← links)
• A correction to Andersson's fusion tree construction (Q391775) (← links)
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
• Simple and efficient fully-functional succinct trees (Q507389) (← links)
• Compressed subsequence matching and packed tree coloring (Q513266) (← links)
• On Cartesian trees and range minimum queries (Q528853) (← links)
• I/O-efficient 2-d orthogonal range skyline and attrition priority queues (Q827322) (← links)
• Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
• Adjacency queries in dynamic sparse graphs (Q846004) (← links)
• On data structures and asymmetric communication complexity (Q1273860) (← links)
• Sorting in linear time? (Q1273863) (← links)
• Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156) (← links)
• A constant update time finger search tree (Q1338781) (← links)
• When can we sort in \(o(n\log n)\) time? (Q1356890) (← links)
• Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
• The range 1 query (R1Q) problem (Q1659997) (← links)
• Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
• Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
• Improved fast integer sorting in linear space (Q1854461) (← links)
• Lower bounds for dynamic algebraic problems (Q1854488) (← links)
• Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
• An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
• Dynamic nested brackets (Q1882928) (← links)
• Improved bounds for finger search on a RAM (Q1950391) (← links)
• Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
• Data structures for categorical path counting queries (Q2089697) (← links)
• Space-efficient Huffman codes revisited (Q2094355) (← links)
• Computing the maximum exponent in a stream (Q2118207) (← links)
• Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
• Rank and select operations on a word (Q2234779) (← links)
• Dynamic interpolation search revisited (Q2288214) (← links)
• Ranked document selection (Q2297857) (← links)
• Finding median in read-only memory on integer input (Q2342680) (← links)
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
• A fast algorithm for adaptive prefix coding (Q2391182) (← links)
• Fingerprints in compressed strings (Q2396828) (← links)
• Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
• On the succinct representation of equivalence classes (Q2408100) (← links)
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
• Parallel construction of succinct trees (Q2410360) (← links)
• Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
• Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
• Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
• Subquadratic algorithms for 3SUM (Q2482729) (← links)