Hi, I am Himanshi Mehta!
I am a Master’s student at Purdue University. I have completed my undergraduate degree at Purdue as well. Before transferring to Purdue, I was a B.tech. student at IIT Bombay in the Department of Electrical Engineering. I am interested in design and analysis of algorithms, and more broadly theoretical computer science. In the past, I have worked on algorithms, cryptography, and applied machine learning.
Here is my CV. Last updated Nov 2020.
M.S. in Computer Science, Purdue University, Jan 2020 – Dec2021
B.S. in Computer Science, Purdue university, Aug 2018 – Dec 2019
Graduated with Highest Distinction
Dept. of Electrical Engineering, Indian Institute of Technology Bombay, Aug 2017 – May 2018
Transferred to Purdue after one year.
P4-free partition and cover numbers
Simina Branzei, Hemanta K. Maji, Himanshi Mehta, and Tamalika Mukherjee
In submission. pdf here.
On Efficient Distributed Coin-tossing Protocols
Hemanta K. Maji, Himanshi Mehta, Mingyuan Wang
In Submission. pdf here.
Selected Class Projects
PCP Theorem: Proof and Applications
CS 584: Complexity Theory, Fall 2020, Instructor: Simina Branzei.
Final report pdf here.
On Computing and Approximating Depth Reducing Sets in DAGs
CS 590: Passwords and Human Authentication, Spring 2020, Instructor: Jeremiah Blocki.
Project partner: Shubhang Kulkarni. Final report pdf here. Follow up work in progress.
Graduate TA, CS 580: Graduate Algorithms
Fall 2020, Instructor: Alexandros (Alex) Psomas
Graduate Research Assisstantship
Summer 2020, Advisor: Kent Quanrud
Graduate TA, CS 381: Undergraduate Algorithms
Spring 2020, Instructor: Mikhail (Mike) Atallah
Undergraduate TA, CS 381: Undergraduate Algorithms
Fall 2019, Instructor: Jeremiah Blocki
Software Engineering Intern, Salesforce
Talks and Presentations
- October 2020, Purdue Theory CS Reading Group. Presented the paper “Near-Optimal Fully Dynamic Densest Subgraph” in the Purdue Theory CS Reading Group.
Presentations in Purdue Algorithms Reading group
- Analysis of Boolean Functions, Slides.
- Local search and greedy approximation algorithms.
- PCP theorem and connection to hardness of approximation.
- Algorithmic results in inclusion-exclusion, Slides.
- Randomized algorithms for SAT, Slides.
- LPs using multiplicative weights, fast exponential time algorithms, Slides.
- Linear Probing with 5, 7-wise independence, Slides.
- Hashing: Cuckoo hashing, power of two choices, Bloomier filters, Slides.
- April 2020, CS 590: Passwords and Human Authentication. Presented approximation algorithms and hardness results for the depth reducing set problem.
- April 2020, CS 560: Reasoning about Programs. Presented algorithms used in SAT Solvers and some applications to Program Verification.
- November 2019, CS 590: Randomized Algorithms. Presented algorithms for the Multi-armed Bandit problem. Slides.
Master’s student, Purdue University