( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime.

, , , , и . ITCS, том 185 из LIPIcs, стр. 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Anindya Kandi Mozumder

Amal Dé

Dennis De

Soumen De

Inessa De

 

Другие публикации лиц с тем же именем

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