# Makrand Sinha

According to our database

^{1}, Makrand Sinha## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Lower Bounds for Approximating the Matching Polytope.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Edge Estimation with Independent Set Oracles.

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Lower Bounds for Approximating the Matching Polytope.

Electronic Colloquium on Computational Complexity (ECCC), 2017

Lower Bounds for Approximating the Matching Polytope.

CoRR, 2017

Edge Estimation with Independent Set Oracles.

CoRR, 2017

2016

Fooling Pairs in Randomized Communication Complexity.

Proceedings of the Structural Information and Communication Complexity, 2016

A Direct-Sum Theorem for Read-Once Branching Programs.

Proceedings of the Approximation, 2016

2015

Simplified Separation of Information and Communication.

Electronic Colloquium on Computational Complexity (ECCC), 2015

On Parallelizing Streaming Algorithms.

Electronic Colloquium on Computational Complexity (ECCC), 2015

On the communication complexity of greater-than.

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Fooling Pairs in Randomized Communication Complexity.

Electronic Colloquium on Computational Complexity (ECCC), 2014

2012

Vertices of degree

*k*in random unlabeled trees.
Journal of Graph Theory, 2012

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls

CoRR, 2012

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2009

Vertices of Degree k in Random Unlabeled Trees.

Electronic Notes in Discrete Mathematics, 2009