Dr Navid Talebanfard
School of Computer Science
Lecturer in Algorithms
International Student Liaison (including USIC)
Full contact details
School of Computer Science
Regent Court (DCS)
211 Portobello
91Ö±²¥
S1 4DP
- Profile
-
Navid Talebanfard works on computational complexity and through a combinatorial lense he attempts to tackle fundamental problems in circuit complexity and Boolean satisfiability. He has a PhD degree in computer science from Aarhus University and has held postdoctoral positions at Tokyo Institute of Technology, Saarland University, and the Czech Academy of Sciences. He has been a member of various projects including ERC Advanced project FEALORA focusing on logical foundations of complexity theory and randomness.
- Research interests
-
Complexity Theory
Combinatorics
Algorithms
- Publications
-
There has been a problem showing this information. Please try again later.
- Research group
-
Foundations of Computation research group