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."
Paper 1:
T. Dueholm Hansen, H. Kaplan, O. Zamir, U. Zwick, Faster k-SAT algorithms using biased-PPSZ, STOC '19.
Link to PDFPaper 2:
J. Holm, V. King, M. Thorup, O. Zamir, U. Zwick, Random k-out subgraph leaves only (n/k) inter-component edges, FOCS '19.
Link to PDFPaper 3:
H. Kaplan, O. Zamir, U. Zwick, The amortized cost of finding the minimum, SODA '15.
Link to PDFKeywords: algorithms, data structures, graph theory, graph algorithms, combinatorics