Tamalika Mukherjee

About Me

I am a final year Ph.D. candidate working with Elena Grigorescu and Jeremiah Blocki in the Department of Computer Science at Purdue University .
I am broadly interested in designing differentially-private algorithms in resource-constrained settings, where the resource can be time, space, communication etc.

Research

Publications.

Privately Estimating Graph Parameters in Sublinear time [arxiv] [ICALP 2022]
Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee
Differentially Private Sublinear-Time Clustering [arxiv] [ISIT 2021]
Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee
P4-free Partition and Cover numbers [ eprint ] [ITC 2021]
Alexander R. Block, Simina Branzei, Hemanta K. Maji, Himanshi Mehta, Tamalika Mukherjee, and Hai H. Nguyen
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP [eprint] [CRYPTO 2020]
Tamalika Mukherjee and Noah Stephens-Davidowitz
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness [arxiv] [TCC 2019]
Hamidreza Amini Khorasgani, Hemanta K. Maji, and Tamalika Mukherjee

Drafts/Preprints.

How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity [arxiv ]
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, and Samson Zhou

My Master's Thesis was on Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes [link]

Awards

Bilsland Dissertation Fellow, 2022-2023
Teaching Academy Graduate Teaching Award, 2021
Harris GTA Award for Supporting Women Students in Computer Science classes, 2017
RIT Outstanding Undergraduate Scholar, 2014
RIT John Wiley Jones Outstanding Student in Science Award, 2014

Presentations

How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity

Talk at Boston University Theory Seminar (October, 2022).

Differentially Private Sublinear Algorithms

Talk at Workshop on Local Algorithms (June, 2022).
Talk at 5th TCS Women Spotlight Workshop (June, 2022).

Privately Estimating Graph Parameters in Sublinear-time

Talk at ICALP (July 2022).
Talk at Rutgers/DIMACS Theory of Computing Seminar (March, 2022).

Differentially Private Sublinear-Time Clustering

Talk at ISIT (July 2021).
Poster presentation on at Scalable Algorithms for Semi-supervised and Unsupervised Learning Workshop (hosted by Google) (October 2021).
Poster presentation on Differentially Private Sublinear-Time Clustering at WALDO (August 2021).

Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP

Talk at Joint Online Crypto Seminar hosted by ENS Lyon, Royal Holloway London and CWI Amsterdam (February, 2021).
Talk at Midwest Theory Day hosted by Illinois Institute of Technology, Chicago, Illinois (November, 2019).

Estimating Gaps in Martingales and Applications to Coin-Tossing

Talk at Karlsruhe Institute of Technology (Germany), Ruhr-University Bochum (Germany), EPFL (Switzerland) (December, 2019).
Poster presentation at STOC in Phoenix, AZ, thanks to TCS Women (June, 2019).
Poster presentation at Midwest Theory Day hosted by Purdue University, West Lafayette, IN (April, 2019).

Teaching

Spring 2021: Head TA for CS381 - Introduction to Analysis of Algorithms
Fall 2020: Graduate TA for CS381 - Introduction to Analysis of Algorithms
Spring 2019, Fall 2018, Fall 2017: Graduate TA for CS355 - Introduction to Cryptography
Spring 2017: Course Coordinator for CS180- Problem-Solving and Object Oriented Programming in Java
Fall 2016: Graduate TA for CS180- Problem-Solving and Object Oriented Programming in Java

Engagement

I have organized the Theory Reading Group at Purdue University from 2021-2022. I have also served as the President of the Computer Science Graduate Student Association at Purdue University for the academic terms of 2018 and 2019.