The following pages link to Omri Weinstein (Q343866):
Displayed 28 items.
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- An Interactive Information Odometer and Applications (Q2941524) (← links)
- Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Welfare and Revenue Guarantees for Competitive Bundling Equilibrium (Q3460797) (← links)
- The Minrank of Random Graphs (Q4559572) (← links)
- ETH Hardness for Densest-<i>k</i>-Subgraph with Perfect Completeness (Q4575829) (← links)
- (Q4606312) (← links)
- Information Lower Bounds via Self-reducibility (Q4928483) (← links)
- The minrank of random graphs (Q5002652) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Q5130847) (← links)
- Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs (Q5145258) (← links)
- How to Store a Random Walk (Q5146792) (← links)
- Lower Bounds for Oblivious Near-Neighbor Search (Q5146839) (← links)
- Local decodability of the Burrows-Wheeler transform (Q5212815) (← links)
- Static data structure lower bounds imply rigidity (Q5212837) (← links)
- Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds (Q5230355) (← links)
- Toward better formula lower bounds (Q5259555) (← links)
- Direct Product via Round-Preserving Compression (Q5326564) (← links)
- Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis (Q5363042) (← links)
- From information to exact communication (Q5495785) (← links)
- (Q5874540) (← links)
- A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
- A faster algorithm for solving general LPs (Q6087047) (← links)