( en | de | ru )

 

Disambiguation of "De, Anindya"

Author of the publication

copydeleteadd this publication to your clipboard
The Inverse Shapley Value Problem.

, , and . Electron. Colloquium Comput. Complex., (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anindya Kandi Mozumder

Amal Dé

Dennis De

Inessa De

Soumen De

 

Other publications of authors with the same name

Majority is Stablest: Discrete and SoS., , and . Theory of Computing, 12 (1): 1-50 (2016)Time Space Tradeoffs for Attacks against One-Way Functions and PRGs., , and . CRYPTO, volume 6223 of Lecture Notes in Computer Science, page 649-665. Springer, (2010)Noise Stability is Computable and Approximately Low-Dimensional., , and . Theory Comput., (2019)Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions., , and . Electron. Colloquium Comput. Complex., (2013)Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces., , , , and . SODA, page 779-821. SIAM, (2022)Non interactive simulation of correlated distributions is decidable., , and . SODA, page 2728-2746. SIAM, (2018)Noise Stability Is Computable and Approximately Low-Dimensional., , and . CCC, volume 79 of LIPIcs, page 10:1-10:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved Pseudorandom Generators for Depth 2 Circuits., , , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 504-517. Springer, (2010)Testing noisy linear functions for sparsity., , and . STOC, page 610-623. ACM, (2020)Noisy Population Recovery in Polynomial Time., , and . FOCS, page 675-684. IEEE Computer Society, (2016)