The following pages link to Ely Porat (Q294917):
Displaying 50 items.
- (Q2904764) (← links)
- Cycle detection and correction (Q2933643) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Exponential Space Improvement for minwise Based Algorithms (Q2957482) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications (Q3012832) (← links)
- Preprocess, Set, Query! (Q3092264) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems (Q3399128) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Improved Sketching of Hamming Distance with Error Correcting (Q3506920) (← links)
- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications (Q3506921) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Explicit Non-adaptive Combinatorial Group Testing Schemes (Q3521963) (← links)
- k-Mismatch with Don’t Cares (Q3527207) (← links)
- Fast Set Intersection and Two-Patterns Matching (Q3557024) (← links)
- (Q3579401) (← links)
- Pattern matching with address errors (Q3581523) (← links)
- Cycle Detection and Correction (Q3587368) (← links)
- Range Non-overlapping Indexing (Q3652290) (← links)
- (Q4449229) (← links)
- (Q4449230) (← links)
- (Q4472453) (← links)
- Worst-case Optimal Join Algorithms (Q4561503) (← 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)
- (Q4633890) (← 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)
- Faster algorithms for string matching with k mismatches (Q4820884) (← links)
- Sharing Rewards in Cooperative Connectivity Games (Q4927422) (← links)
- (Q4952702) (← links)
- For-All Sparse Recovery in Near-Optimal Time (Q4962672) (← 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)
- Approximating text-to-pattern Hamming distances (Q5144951) (← links)
- Locally Consistent Parsing for Text Indexing in Small Space (Q5146805) (← links)
- Dictionary Matching with One Gap (Q5165586) (← links)
- An Improved Query Time for Succinct Dynamic Dictionary Matching (Q5165598) (← links)
