Anindya De

From MaRDI portal
Person:1656544

Available identifiers

zbMath Open de.anindya-kMaRDI QIDQ1656544

List of research outcomes





PublicationDate of PublicationType
Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas2024-11-28Paper
Near-optimal average-case approximate trace reconstruction from few traces2024-07-19Paper
Approximating sumset size2024-07-19Paper
Approximate trace reconstruction from a single trace2024-05-14Paper
Nearly tight bounds for discrete search under outlier noise2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61472512024-01-15Paper
Robust testing of low dimensional functions2023-11-14Paper
Gaussian Approximation of Convex Sets by Intersections of Halfspaces2023-11-14Paper
Testing Convex Truncation2023-05-04Paper
Simple and efficient pseudorandom generators from gaussian processes2022-07-27Paper
https://portal.mardi4nfdi.de/entity/Q50904022022-07-18Paper
Quantitative correlation inequalities via extremal power series2022-05-20Paper
Approximating Sumset Size2021-07-26Paper
https://portal.mardi4nfdi.de/entity/Q51492482021-02-08Paper
Reconstruction under outliers for Fourier-sparse functions2021-02-02Paper
Learning from satisfying assignments under continuous distributions2021-02-02Paper
Testing noisy linear functions for sparsity2021-01-19Paper
Quantitative Correlation Inequalities via Semigroup Interpolation2020-12-22Paper
Sharp bounds for population recovery2020-12-17Paper
Reconstructing weighted voting schemes from partial information about their power indices2020-07-19Paper
Noise stability is computable and approximately low-dimensional2020-05-26Paper
https://portal.mardi4nfdi.de/entity/Q52048242019-12-05Paper
Kruskal-Katona for convex sets, with applications2019-10-31Paper
A polynomial-time approximation scheme for fault-tolerant distributed storage2019-06-20Paper
Optimal mean-based algorithms for trace reconstruction2019-04-24Paper
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting2018-08-10Paper
Learning Sums of Independent Random Variables with Sparse Collective Support2018-07-18Paper
Non interactive simulation of correlated distributions is decidable2018-03-15Paper
Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack2018-03-15Paper
The inverse Shapley value problem2017-10-24Paper
Learning from satisfying assignments2017-10-05Paper
A size-free CLT for Poisson multinomials and its applications2017-09-29Paper
Optimal mean-based algorithms for trace reconstruction2017-08-17Paper
Noise Stability is computable and low dimensional2017-01-05Paper
Majority is stablest: discrete and SoS2016-07-29Paper
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry2016-05-26Paper
Explicit optimal hardness via Gaussian stability results2015-09-24Paper
Boolean function monotonicity testing requires (almost) \(n^{1/2}\) non-adaptive queries2015-08-21Paper
Efficient deterministic approximate counting for low-degree polynomial threshold functions2015-06-26Paper
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces2014-09-12Paper
Near-optimal extractors against quantum storage2014-08-13Paper
Majority is stablest: discrete and SoS2014-08-07Paper
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces2014-05-13Paper
Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions2013-11-27Paper
Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions2013-11-27Paper
The inverse Shapley value problem2013-08-12Paper
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry2013-08-06Paper
Fast integer multiplication using modular arithmetic2013-07-24Paper
Trevisan's extractor in the presence of quantum side information2012-11-29Paper
Lower bounds in differential privacy2012-06-15Paper
Improved pseudorandom generators for depth 2 circuits2010-09-10Paper
Time space tradeoffs for attacks against one-way functions and PRGs2010-08-24Paper
Single magnetic particle dynamics in a microchannel2010-03-18Paper
Extractors Using Hardness Amplification2009-10-28Paper
https://portal.mardi4nfdi.de/entity/Q53020732009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43840651998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q47185551997-03-23Paper

Research outcomes over time

This page was built for person: Anindya De