S
Satyanarayana V. Lokam
Researcher at Microsoft
Publications - 34
Citations - 701
Satyanarayana V. Lokam is an academic researcher from Microsoft. The author has contributed to research in topics: Boolean function & Matrix (mathematics). The author has an hindex of 13, co-authored 34 publications receiving 668 citations. Previous affiliations of Satyanarayana V. Lokam include University of Michigan & Tata Institute of Fundamental Research.
Papers
More filters
Book
Complexity Lower Bounds using Linear Algebra
TL;DR: This work surveys several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches to study robustness measures of matrix rank that capture the complexity in a given model.
Book ChapterDOI
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
Jürgen Forster,Matthias Krause,Satyanarayana V. Lokam,Rustam Mubarakzjanov,Niels Schmitt,Hans Ulrich Simon +5 more
TL;DR: In this paper, the authors exploit the various relations between communication complexity of distributed Boolean functions, geometric questions related to half space representations of these functions, and the computational complexity of the functions in various restricted models of computation.
Journal ArticleDOI
Communication Complexity of Simultaneous Messages
TL;DR: This paper studies the SIMULTANEOUS MESSAGES (SM) model of multiparty communication complexity, a restricted version of the CFL game in which the players are not allowed to communicate with each other, and proves lower and upper bounds on the SM complexity of several classes of explicit functions.
Book ChapterDOI
Improved Bounds on Security Reductions for Discrete Log Based Signatures
TL;DR: This paper improves the negative result from Paillier and Vergnaud (PV05), showing that any algebraic reduction in the ROM from discrete log to forging a Schnorr signature must lose a factor of at least $q_h^{2/3}$, assuming the one-more discrete log assumption.
Proceedings ArticleDOI
Better lower bounds for locally decodable codes
TL;DR: This paper improves the results of Katz and Trevisan (2000) and proves that m = /spl Omega/((n/log|/spl Sigma/|)/sup q/(q-1)/) even if the decoding algorithm is adaptive.