Subject: High Dimensional Geometric Algorithms
Supervised by: Daniel DadushPhD Student Position
I am looking for a talented and motivated student with a strong interest in any of the subjects below (detailed descriptions): • Algorithms for lattice problems and their applications to integer programming, cryptography and wireless communications.
• High dimensional convex geometry and the geometry of numbers.
• Discrepancy minimization and its applications to approximation algorithms.
• Algorithms for linear programming, analysis of the simplex method and the geometry of polyhedra.
The student will conduct research on the subject of High Dimensional Geometric Algorithms, present the fruits of this research at top conferences and publish them in quality peer-reviewed journals of the field, culminating in a PhD thesis to be defended in public.