( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower bounds for adaptive locally decodable codes.

, , , , и . Random Struct. Algorithms, 27 (3): 358-378 (2005)

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.

Chitkala Satyanarayana

Ande Satyanarayana

Satyanarayana Kondapalli

Satyanarayana Narra

V Saile

 

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

Weight enumerators and higher support weights of maximally recoverable codes., и . Allerton, стр. 835-842. IEEE, (2015)Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity.. FOCS, стр. 6-15. IEEE Computer Society, (1995)Simultaneous Messages vs. Communication., , и . STACS, том 900 из Lecture Notes in Computer Science, стр. 361-372. Springer, (1995)Efficient Reconstruction of Random Multilinear Formulas., , и . FOCS, стр. 778-787. IEEE Computer Society, (2011)Lower bounds for adaptive locally decodable codes., , , , и . Random Struct. Algorithms, 27 (3): 358-378 (2005)Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions., , , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 275-289. Springer, (2018)On-Line/Off-Line Leakage Resilient Secure Computation Protocols., , и . INDOCRYPT, том 7668 из Lecture Notes in Computer Science, стр. 100-119. Springer, (2012)Logspace Verifiers, NC, and NP., , и . ISAAC, том 1004 из Lecture Notes in Computer Science, стр. 52-61. Springer, (1995)Reconstruction of depth-4 multilinear circuits with top fan-in 2., , и . STOC, стр. 625-642. ACM, (2012)Remarks on Graph Complexity.. FSTTCS, том 1530 из Lecture Notes in Computer Science, стр. 307-318. Springer, (1998)