Pages that link to "Item:Q3766870"
From MaRDI portal
The following pages link to Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870):
Displaying 50 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Storing information with extractors. (Q1853081) (← links)
- Sparse sets and collapse of complexity classes (Q1854459) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Canonical density control (Q2380023) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- Substring Range Reporting (Q3011863) (← links)
- Dispersing hash functions (Q3055765) (← links)
- On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
- Optimal hitting sets for combinatorial shapes (Q3191583) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- A Table Compression Method for Extended Aho-Corasick Automaton (Q3637345) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- An Efficient Trie Construction for Natural Language Dictionaries (Q4551463) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- Simple fast parallel hashing (Q4632430) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002753) (← links)
