Pages that link to "Item:Q3495640"
From MaRDI portal
The following pages link to The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions (Q3495640):
Displaying 29 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Improved bounds for dictionary look-up with one error (Q294796) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Perfect hashing (Q1391123) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Polynomial hash functions are reliable (Q5204320) (← links)
- (Q5743440) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Bounds for \(c\)-ideal hashing (Q6546593) (← links)
- The limits of local search for weighted \(k\)-set packing (Q6589755) (← links)
