# Venkatesh Ganesan

> Staff Software Engineer @ Meta

Location: Mountain View, California, United States
Profile: https://flows.cv/venkateshganesan

## Work Experience
### Staff Software Engineer @ Meta
Jan 2022 – Present | Menlo Park, CA

### Senior Software Engineer @ Google
Jan 2015 – Jan 2022 | Mountain View, California, United States

### Research Intern @ Chennai Mathematical Institute
Jan 2015 – Jan 2015
Showed that the problem of counting Eulerian Tours in undirected bounded-treewidth graphs is
tractable even in parallel by proving a #SAC^1 upper bound. This is in stark contrast to the #P-completeness of the same problem in general graphs.
The areas primarily dealt with were Combinatorics and Complexity Theory in Theoretical
Computer Science.
arXiv link to the paper: https://arxiv.org/abs/1510.04035


## Education
### Birla Institute of Technology and Science, Pilani


## Contact & Social
- LinkedIn: https://linkedin.com/in/venkatesh-ganesan-09a6215b
- Portfolio: https://sigsegv.substack.com/

---
Source: https://flows.cv/venkateshganesan
JSON Resume: https://flows.cv/venkateshganesan/resume.json
Last updated: 2026-04-12