Travelled to:1 × Canada
1 × Latvia
1 × United Kingdom
5 × USA
Collaborated with:R.A.Servedio I.Diakonikolas T.Vidick E.Mossel J.Neeman X.Chen L.Tan V.Feldman P.P.Kurur C.Saha R.Saptharishi
Talks about:optim (3) function (2) approxim (2) problem (2) near (2) low (2) determinist (1) threshold (1) khintchin (1) extractor (1)
Person: Anindya De
DBLP: De:Anindya
Contributed to:
20152014
201320132012201220102008Wrote 8 papers:
- STOC-2015-ChenDST #adaptation #query #testing
- Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (XC, AD, RAS, LYT), pp. 519–528.
- STOC-2014-DeS #approximate #performance #polynomial
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (AD, RAS), pp. 832–841.
- ICALP-v1-2013-DeDS #algorithm #analysis #difference #fourier #geometry #robust
- A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (AD, ID, RAS), pp. 376–387.
- STOC-2013-DeMN
- Majority is stablest: discrete and SoS (AD, EM, JN), pp. 477–486.
- ICALP-v1-2012-DeDS #problem
- The Inverse Shapley Value Problem (AD, ID, RAS), pp. 266–277.
- STOC-2012-DeDFS #approximate #parametricity #problem
- Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces (AD, ID, VF, RAS), pp. 729–746.
- STOC-2010-DeV #quantum
- Near-optimal extractors against quantum storage (AD, TV), pp. 161–170.
- STOC-2008-DeKSS #composition #integer #multi #performance #using
- Fast integer multiplication using modular arithmetic (AD, PPK, CS, RS), pp. 499–506.