Pages that link to "Item:Q4305355"
From MaRDI portal
The following pages link to Dynamic Perfect Hashing: Upper and Lower Bounds (Q4305355):
Displayed 49 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- An old sub-quadratic algorithm for finding extremal sets (Q287109) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Order-preserving indexing (Q294954) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Cuckoo hashing: Further analysis (Q1007604) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Clocked adversaries for hashing (Q1209734) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors (Q1662475) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Dynamic space efficient hashing (Q1999966) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- CuCoTrack: cuckoo filter based connection tracking (Q2414050) (← links)
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- ON THE PERFORMANCE AND COST OF SOME PRAM MODELS ON CMP HARDWARE (Q3569283) (← links)
- Simple fast parallel hashing (Q4632430) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- Stochastic analysis of dynamic processes (Q5055922) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- Lower bounds for dynamic algorithms (Q5056175) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Dynamic Space Efficient Hashing. (Q5111747) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Polynomial hash functions are reliable (Q5204320) (← links)
- Fast incremental planarity testing (Q5204329) (← links)
- TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS (Q5249029) (← links)
- Two-way chaining for non-uniform distributions (Q5852152) (← links)
- (Q6065457) (← links)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
- On-line graph algorithms for incremental compilation (Q6184394) (← links)
- (Q6191006) (← links)