Venkatesh Medabalimi

According to our database, Venkatesh Medabalimi authored at least 4 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Branching Program Lower Bounds.

Venkatesh Medabalimi

PhD thesis, 2018

Hardness of Function Composition for Semantic Read once Branching Programs.

Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi

Proceedings of the 33rd Computational Complexity Conference, 2018

2016

Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs.

Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

On the Expressive Efficiency of Sum Product Networks.

James Martens, Venkatesh Medabalimi

CoRR, 2014