The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Anindya De" ( http://dblp.L3S.de/Authors/Anindya_De )

  Author page on DBLP  Author page in RDF  Community of Anindya De in ASPL-2

Publication years (Num. hits)
2008-2011 (15) 2012 (15) 2013-2014 (17) 2015-2017 (18) 2018-2019 (14)
Publication types (Num. hits)
article(51) inproceedings(28)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 6 keywords

Results
Found 80 publication records. Showing 79 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Anindya De, Elchanan Mossel, Joe Neeman Junta correlation is testable. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Xue Chen, Anindya De Reconstruction under outliers for Fourier-sparse functions. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Clément L. Canonne, Anindya De, Rocco A. Servedio Learning from satisfying assignments under continuous distributions. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Density Estimation for Shift-Invariant Multidimensional Distributions. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Is your function low dimensional? Search on Bibsonomy COLT The full citation details ... 2019 DBLP  BibTeX  RDF
1Eshan Chattopadhyay, Anindya De, Rocco A. Servedio Simple and Efficient Pseudorandom Generators from Gaussian Processes. Search on Bibsonomy CCC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eshan Chattopadhyay, Anindya De, Rocco A. Servedio Simple and efficient pseudorandom generators from Gaussian processes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Anindya De, Ryan O'Donnell, Rocco A. Servedio Learning sparse mixtures of rankings from noisy information. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Is your data low-dimensional? Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Density estimation for shift-invariant multidimensional distributions. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Learning Sums of Independent Random Variables with Sparse Collective Support. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Anindya De Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Non interactive simulation of correlated distributions is decidable. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Learning Sums of Independent Random Variables with Sparse Collective Support. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anindya De, Ryan O'Donnell, Rocco A. Servedio Sharp bounds for population recovery. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Non interactive simulation of correlated distributions is decidable. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anindya De Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Noise Stability is computable and low dimensional. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio The Inverse Shapley value problem. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anindya De, Ryan O'Donnell, Rocco A. Servedio Optimal mean-based algorithms for trace reconstruction. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Noise Stability Is Computable and Approximately Low-Dimensional. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Majority is Stablest: Discrete and SoS. Search on Bibsonomy Theory of Computing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anindya De, Michael E. Saks, Sijian Tang Noisy population recovery in polynomial time. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Anindya De, Ryan O'Donnell, Rocco A. Servedio Optimal mean-based algorithms for trace reconstruction. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Anindya De, Michael E. Saks, Sijian Tang Noisy population recovery in polynomial time. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Anindya De, Michael E. Saks, Sijian Tang Noisy Population Recovery in Polynomial Time. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Anindya De, Gautam Kamath 0001, Christos Tzamos A size-free CLT for poisson multinomials and its applications. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Anindya De, Gautam Kamath 0001, Christos Tzamos A Size-Free CLT for Poisson Multinomials and its Applications. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Learning from satisfying assignments. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anindya De Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Anindya De, Rocco A. Servedio, Li-Yang Tan Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. Search on Bibsonomy J. ACM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anindya De Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Xi Chen 0001, Anindya De, Rocco A. Servedio, Li-Yang Tan Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anindya De, Rocco A. Servedio Efficient deterministic approximate counting for low-degree polynomial threshold functions. Search on Bibsonomy STOC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Rocco A. Servedio Efficient deterministic approximate counting for low degree polynomial threshold functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Rocco A. Servedio Efficient deterministic approximate counting for low-degree polynomial threshold functions. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel Explicit Optimal Hardness via Gaussian Stability Results. Search on Bibsonomy TOCT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anindya De, Piyush P. Kurur, Chandan Saha 0001, Ramprasad Saptharishi Fast Integer Multiplication Using Modular Arithmetic. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Majority is stablest: discrete and SoS. Search on Bibsonomy STOC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel Explicit Optimal hardness via Gaussian stability results. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio The Inverse Shapley Value Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Inverse Problems in Approximate Uniform Generation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio The Inverse Shapley Value Problem Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio Inverse problems in approximate uniform generation Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel, Joe Neeman Majority is Stablest : Discrete and SoS Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Elchanan Mossel Explicit Optimal Hardness via Gaussian stability results Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry. Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Anindya De, Thomas Watson 0001 Extractors and Lower Bounds for Locally Samplable Sources. Search on Bibsonomy TOCT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner Trevisan's Extractor in the Presence of Quantum Side Information. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anindya De Lower Bounds in Differential Privacy. Search on Bibsonomy TCC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Rocco A. Servedio The Inverse Shapley Value Problem. Search on Bibsonomy ICALP (1) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anindya De, Thomas Watson 0001 Extractors and Lower Bounds for Locally Samplable Sources. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Anindya De Lower bounds in differential privacy Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Anindya De, Thomas Watson 0001 Extractors and Lower Bounds for Locally Samplable Sources. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anindya De Pseudorandomness for Permutation and Regular Branching Programs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anindya De, Thomas Vidick Near-optimal extractors against quantum storage. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF bounded quantum storage, random access codes, extractors
1Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani Improved Pseudorandom Generators for Depth 2 Circuits. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anindya De, Luca Trevisan, Madhur Tulsiani Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. Search on Bibsonomy CRYPTO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anindya De, Thomas Vidick Near-optimal extractors against quantum storage. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani Improved Pseudorandom Generators for Depth 2 Circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Anindya De, Luca Trevisan, Madhur Tulsiani Non-uniform attacks against one-way functions and PRGs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner Trevisan's extractor in the presence of quantum side information Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Anindya De, Luca Trevisan Extractors Using Hardness Amplification. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Extractors, Direct product theorems, Hardness amplification
1Anindya De, Piyush P. Kurur, Chandan Saha 0001, Ramprasad Saptharishi Fast Integer Multiplication using Modular Arithmetic. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Anindya De, Piyush P. Kurur, Chandan Saha 0001, Ramprasad Saptharishi Fast Integer Multiplication using Modular Arithmetic Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Anindya De, Piyush P. Kurur, Chandan Saha 0001, Ramprasad Saptharishi Fast integer multiplication using modular arithmetic. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computational algebra, modular arithmetic, integer multiplication
Displaying result #1 - #79 of 79 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license