The following pages link to Ely Porat (Q294917):
Displaying 50 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- d-k-min-wise independent family of hash functions (Q340570) (← links)
- Addendum to: ``Exponential time improvement for min-wise based algorithms'' (Q342703) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- Mismatch sampling (Q418198) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Fast set intersection and two-patterns matching (Q708235) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Overlap matching. (Q1401926) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Higher Lower Bounds from the 3SUM Conjecture (Q4575670) (← links)
- The <i>k</i>-mismatch problem revisited (Q4575727) (← links)
- Distance labeling schemes for trees (Q4598274) (← links)
- Sublinear Distance Labeling (Q4606270) (← links)
- Streaming Pattern Matching with d Wildcards (Q4606315) (← links)
- (Q4606316) (← links)
- New Parameterized Algorithms for APSP in Directed Graphs (Q4606346) (← links)
- Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap (Q4636494) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Sharing Rewards in Cooperative Connectivity Games (Q4927422) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- (Q5009597) (← links)
- (Q5110892) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
- (Q5136259) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. (Q5369539) (← links)
- (Q5874443) (← links)
- (Q5875567) (← links)
- Incremental Edge Orientation in Forests (Q6075896) (← links)
- (Q6084405) (← links)
