O. Weinstein

Available identifiers

zbMath Open weinstein.omriMaRDI QIDQ343866

List of research outcomes

Publication	Date of Publication	Type
A faster interior-point method for sum-of-squares optimization	2024-06-24	Paper
A faster algorithm for solving general LPs	2023-11-14	Paper
A faster interior-point method for sum-of-squares optimization	2023-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q5874540	2023-02-07	Paper
Polynomial Data Structure Lower Bounds in the Group Model	2022-04-01	Paper
The minrank of random graphs	2021-07-28	Paper
Lower Bounds for Oblivious Near-Neighbor Search	2021-02-02	Paper
How to Store a Random Walk	2021-02-02	Paper
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs	2021-01-20	Paper
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds	2020-10-29	Paper
Local decodability of the Burrows-Wheeler transform	2020-01-30	Paper
Static data structure lower bounds imply rigidity	2020-01-30	Paper
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds	2019-08-22	Paper
The Minrank of Random Graphs	2018-12-04	Paper
ETH Hardness for Densest-k-Subgraph with Perfect Completeness	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4606312	2018-03-02	Paper
Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis	2017-10-05	Paper
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation	2017-03-10	Paper
Information lower bounds via self-reducibility	2017-01-18	Paper
A discrepancy lower bound for information complexity	2016-11-29	Paper
Scale dependence of contact line computations	2016-02-19	Paper
Welfare and Revenue Guarantees for Competitive Bundling Equilibrium	2016-01-08	Paper
The Simultaneous Communication of Disjointness with Applications to Data Streams	2015-10-27	Paper
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity	2015-09-24	Paper
An Interactive Information Odometer and Applications	2015-08-21	Paper
Toward better formula lower bounds	2015-06-26	Paper
From information to exact communication	2014-08-07	Paper
Direct Product via Round-Preserving Compression	2013-08-06	Paper
Information Lower Bounds via Self-reducibility	2013-06-14	Paper
A discrepancy lower bound for information complexity	2012-11-02	Paper
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity	2011-08-17	Paper

Research outcomes over time

This page was built for person: O. Weinstein