Currently we are looking for several PhD students in areas including but not limited to algorithms, graph
theory, complexity theory, cryptography, game theory, and quantum computing. We expect a candidate to be
proficient in high-school mathematics (linear algebra, probability), data structures (linked lists, stacks, queues, binary trees, heaps, graph and their traversals), discrete mathematics (propositional logic, sets, functions, countability, equivalence relations, partial orders, graphs, trees), and basic algorithm design
techniques (recursion, divide and conquer, dynamic programming, greedy). More importantly, we look for a passion for math and CS-theory, and willingness to learn and
pick up the required skills.
Useful links: