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)
- Preprocess, set, query! (Q2017874) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Dynamic dictionary matching in the online model (Q2285108) (← links)
- Approximate cover of strings (Q2326399) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Efficient pebbling for list traversal synopses with application to program rollback (Q2373729) (← links)
- Approximate matching in the \(L_{\infty }\) metric (Q2380061) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
- Conditional lower bounds for space/time tradeoffs (Q2405302) (← links)
- Mind the gap! (Q2414857) (← links)
- Efficient one-dimensional real scaled matching (Q2457290) (← links)
- Improved algorithms for polynomial-time decay and time-decay with additive error (Q2481557) (← links)
- (Q2768267) (← links)
- (Q2768306) (← links)
- (Q2768309) (← links)
- Pattern Matching under Polynomial Transformation (Q2840986) (← links)
- Efficient Sampling of Non-strict Turnstile Data Streams (Q2842772) (← links)
- Approximate sparse recovery (Q2875175) (← links)
- Approximate Sparse Recovery: Optimizing Time and Measurements (Q2903525) (← links)
- Pattern Matching in Multiple Streams (Q2904482) (← links)
