Job Candidates
Aditya Potukuchi
Thesis Information
Title: Combinatorial methods in Theoretical Computer Science
Adviser: Swastik Kopparty
Institution: Rutgers University
Graduation Date: May 2020
Contact Information
Email Candidate
Candidate Website
Candidate Bio:
I am a 5th year graduate student at Rutgers University, and my advisor is Swastik Kopparty. My interests lie broadly in Discrete mathematics, probability, combinatorics, and coding theory. Before Rutgers, I received my master's degree in Computer Science from Chennai Mathematical Institute.
Keywords: Discrete mathematics
Tal Wagner
Thesis Information
Title: Algorithms for Large and High-Dimensional Data: Compression, Sketching and Quantization
Adviser: Piotr Indyk
Institution: MIT
Graduation Date: June 2020
Contact Information
Email Candidate
Candidate Website
SIGACT Membership No.: 8157902
Candidate Bio:
I am a PhD candidate in CSAIL, MIT, advised by Piotr Indyk. During my PhD I completed summer internships in Microsoft Research Redmond (2019), Amazon Core Machine Learning Group (2017), and VMware Research Group (2015). I received my MSc from the Weizmann Institute, and BSc in Computer Science and Mathematics from the Technion, Israel.
Keywords: metric spaces
Di Wang
Thesis Information
Title: Foundamental Machine Learning Problems In Differential Privacy Model
Adviser: Jinhui Xu
Institution: State University of New York at Buffalo
Graduation Date: June 2020
Contact Information
Email Candidate
Candidate Website
Candidate Bio:
I am a fifth (final) year PHD student in the Department of Computer Science and Engineering at The State University of New York (SUNY) at Buffalo under supervision of Dr. Jinhui Xu . Before that I got my Master degree in Mathematics at University of Western Ontario in 2015, and I got my Bachelor degree in Mathematics and Applied Mathematics at Shandong University in 2014.
Keywords: Differential Privacy
Sumegha Garg
Thesis Information
Title: Understanding the Limits of Computational Models and Learning Algorithms
Adviser: Mark Braverman
Institution: Princeton University
Graduation Date: June 2020
Contact Information
Email Candidate
Candidate Website
SIGACT Membership No.: 6721778
Candidate Bio:
Sumegha Garg is a graduate student in Computer Science at Princeton University, where she is advised by Professor Mark Braverman. Before coming to Princeton, she received her Bachelor’s degree in Computer Science and Engineering from Indian Institute of Technology, Delhi. She is broadly interested in theoretical computer science, with a focus on complexity theory and algorithmic fairness. The primary aim of her research has been studying the computation limits of and the role of randomness in space-bounded computational models. Another aim of her research has been understanding the sources of unfairness in machine learning algorithms.
Keywords: Computational complexity
Ariel Schvartzman Cohenca
Thesis Information
Title: Circumventing Lower Bounds in Mechanism Design
Adviser: S. Matthew Weinberg
Institution: Princeton University
Graduation Date: July 2020
Contact Information
Email Candidate
Candidate Website
SIGACT Membership No.: 0644007
Candidate Bio:
Ariel Schvartzman Cohenca is a PhD candidate at Princeton University advised by S. Matthew Weinberg. Ariel's work focuses in understanding the trade-off between optimality and simplicity in the design of multi-dimensional auctions. He was awarded the Department of Computer Science's Graduate Student Teaching Award in 2017, and the School of Engineering and Applied Science's Award for Excellence in 2018. During the summer of 2018, Ariel was a research intern at Google-Mountain View. He obtained his B.S. in Mathematics with Computer Science from MIT in 2015.
Keywords: economics and computation
Or Zamir
Thesis Information
Title: Faster k-SAT Algorithms
Adviser: Uri Zwick and Haim Kaplan
Institution: Tel Aviv University
Graduation Date: August 2020
Contact Information
Email Candidate
Candidate Website
SIGACT Membership No.: 2142011
Candidate Bio:
"I have completed my bachelor and masters degrees in Mathematics and Computer Science in Tel Aviv University when I was an high school student.
After high-school, I have enlisted to a research unit in the army for three years (as military service is mandatory in Israel).
Simultaneously, I was working on my PhD under the advising of Uri Zwick and Haim Kaplan.
I am usually interested in classical graph algorithms, data structures and graph theory.
I am currently 23 years old and expect finishing the PhD by the end of the current academic year."
Keywords: algorithms