The following pages link to Ilias Diakonikolas (Q371198):
Displayed 50 items.
- Improved approximation of linear threshold functions (Q371200) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Testing shape restrictions of discrete distributions (Q1702847) (← links)
- Learning Poisson binomial distributions (Q2345953) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (Q2808162) (← links)
- How Good is the Chord Algorithm? (Q2816293) (← links)
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (Q2875180) (← links)
- Efficiency-Revenue Trade-Offs in Auctions (Q3167037) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- (Q3191611) (← links)
- (Q3466401) (← links)
- Efficiently Testing Sparse GF(2) Polynomials (Q3521943) (← links)
- (Q3579439) (← links)
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems (Q3586183) (← links)
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems (Q3603457) (← links)
- Playing Anonymous Games using Simple Strategies (Q4575777) (← links)
- Sample-Optimal Density Estimation in Nearly-Linear Time (Q4575826) (← links)
- (Q4601877) (← links)
- Robustly Learning a Gaussian: Getting Optimal Error, Efficiently (Q4608066) (← links)
- Robust Estimators in High-Dimensions Without the Computational Intractability (Q4634036) (← links)
- Optimal Identity Testing with High Probability (Q5002714) (← links)
- Robust High-Dimensional Statistics (Q5027283) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- Near-Optimal Closeness Testing of Discrete Histogram Distributions (Q5111337) (← links)
- Testing Bayesian Networks (Q5123918) (← links)
- Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs (Q5130515) (← links)
- Bounded Independence Fools Halfspaces (Q5171173) (← links)
- Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications) (Q5212820) (← links)
- Testing conditional independence of discrete distributions (Q5230334) (← links)
- List-decodable robust mean estimation and learning mixtures of spherical gaussians (Q5230361) (← links)
- Learning geometric concepts with nasty noise (Q5230362) (← links)
- Collision-based Testers are Optimal for Uniformity and Closeness (Q5232537) (← links)
- Disjoint-Path Facility Location: Theory and Practice (Q5233698) (← links)
- Efficient Algorithms and Lower Bounds for Robust Linear Regression (Q5236361) (← links)
- High-Dimensional Robust Mean Estimation in Nearly-Linear Time (Q5236362) (← links)
- Efficient density estimation via piecewise polynomial approximation (Q5259596) (← links)
- The fourier transform of poisson multinomial distributions and its algorithmic applications (Q5361902) (← links)
- Learning from satisfying assignments (Q5363037) (← links)
- Testing Identity of Structured Distributions (Q5363068) (← links)
- (Q5365141) (← links)
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009) (← links)
- Optimal Algorithms for Testing Closeness of Discrete Distributions (Q5384050) (← links)
- The Complexity of Optimal Multidimensional Pricing (Q5384059) (← links)
- Bounded Independence Fools Halfspaces (Q5390601) (← links)
- (Q5417682) (← links)
- Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions (Q5419037) (← links)
- Learning $k$-Modal Distributions via Testing (Q5497115) (← links)
- Learning mixtures of structured distributions over discrete domains (Q5741809) (← links)