The following pages link to Elad Verbin (Q931715):
Displayed 24 items.
- Compact samples for data dissemination (Q931716) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model (Q2839177) (← links)
- Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance (Q2843306) (← links)
- The limits of buffering (Q2875172) (← links)
- (Q2934665) (← links)
- Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem (Q3013133) (← links)
- Sorting and Selection in Posets (Q3093615) (← links)
- Most Burrows-Wheeler Based Compressors Are Not Optimal (Q3506913) (← links)
- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals (Q3550834) (← links)
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm (Q3596724) (← links)
- (Q3601522) (← links)
- Efficient Colored Orthogonal Range Counting (Q3631900) (← links)
- (Q4633848) (← links)
- Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (Q4910937) (← links)
- Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings (Q4928577) (← links)
- Distance Oracles for Sparse Graphs (Q5171228) (← links)
- (Q5302087) (← links)
- A Simpler Analysis of Burrows-Wheeler Based Compression (Q5307513) (← links)
- (Q5365017) (← links)
- (Q5743415) (← links)