The following pages link to Raphaël Clifford (Q390878):
Displaying 44 items.
- The Classical Complexity of Boson Sampling (Q126355) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- (Q418194) (redirect page) (← links)
- Mismatch sampling (Q418198) (← links)
- (Q533410) (redirect page) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- The complexity of flood filling games (Q692938) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Simple deterministic wildcard matching (Q845893) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Permuted function matching (Q1675783) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- (Q1769661) (redirect page) (← links)
- Approximate string matching for music analysis (Q1769662) (← links)
- Dynamic and approximate pattern matching in 2D (Q1796841) (← links)
- Maximum subset intersection (Q1944892) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Pattern Matching under Polynomial Transformation (Q2840986) (← links)
- Pattern Matching in Multiple Streams (Q2904482) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model (Q3012835) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Self-normalised Distance with Don’t Cares (Q3506909) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- k-Mismatch with Don’t Cares (Q3527207) (← links)
- Distributed and Paged Suffix Trees for Large Genetic Databases (Q3550828) (← links)
- Pseudo-realtime Pattern Matching: Closing the Gap (Q3575240) (← links)
- Algorithms on Extended (δ, γ)-Matching (Q3600194) (← links)
- The <i>k</i>-mismatch problem revisited (Q4575727) (← links)
- Approximate Hamming Distance in a Stream (Q4598153) (← links)
- Cell-Probe Lower Bounds for Bit Stream Computation (Q4606300) (← links)
- (Q4633890) (← links)
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES (Q4907692) (← links)
- (Q5092429) (← links)
- (Q5204820) (← links)
- The streaming <i>k</i>-mismatch problem (Q5236252) (← links)
- Cell-probe bounds for online edit distance and other pattern matching problems (Q5362986) (← links)
- Fast Approximate Point Set Matching for Information Retrieval (Q5448774) (← links)
- Combinatorial Pattern Matching (Q5713570) (← links)
- Tight Cell-Probe Bounds for Online Hamming Distance Computation (Q5741756) (← links)
- The dynamic \(k\)-mismatch problem (Q6496847) (← links)
