Pages that link to "Item:Q3766870"

The following pages link to Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870):

Displaying 50 items.

• On two continuum armed bandit problems in high dimensions (Q260274) (← links)
• Improved bounds for dictionary look-up with one error (Q294796) (← links)
• Certifying equality with limited interaction (Q343864) (← links)
• Succinct encoding of arbitrary graphs (Q391972) (← links)
• Low-contention data structures (Q433458) (← links)
• Smaller representation of finite state automata (Q442137) (← links)
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
• Substring range reporting (Q517792) (← links)
• Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
• Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
• Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
• Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
• Flash memory efficient LTL model checking (Q617930) (← links)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
• An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
• On the cell probe complexity of polynomial evaluation (Q673647) (← links)
• Index structures for fast similarity search for binary vectors (Q681740) (← links)
• More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
• Fast set intersection and two-patterns matching (Q708235) (← links)
• Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
• \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
• Analysis of parallel uniform hashing (Q750157) (← links)
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
• A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
• ANN for time series under the Fréchet distance (Q832871) (← links)
• A simple optimal representation for balanced parentheses (Q859854) (← links)
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Minimal perfect hashing in polynomial time (Q911304) (← links)
• Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
• Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
• Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
• Cuckoo hashing: Further analysis (Q1007604) (← links)
• Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
• Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
• Two results on tables (Q1069703) (← links)
• Information compression and Varshamov-Gilbert bound (Q1099128) (← links)
• The problem of space invariance for sequential machines (Q1102112) (← links)
• A practical method for implementing string pattern matching machines (Q1193694) (← links)
• On a compaction theorem of Ragde (Q1195502) (← links)
• The effect of table expansion on the program complexity of perfect hash functions (Q1198971) (← links)
• An optimal algorithm for generating minimal perfect hash functions (Q1199953) (← links)
• Point location in fat subdivisions (Q1209353) (← links)
• Attribute-efficient learning in query and mistake-bound models (Q1271616) (← links)
• On data structures and asymmetric communication complexity (Q1273860) (← links)
• Perfect hashing (Q1391123) (← links)
• Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
• Permuted function matching (Q1675783) (← links)
• Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
• The nearest colored node in a tree (Q1698706) (← links)