Postdoctoral Researcher
Department of Computer Science
University of Warwick, UK
[FirstName].[LastName]@warwick.ac.uk
Hello!
I am a postdoctoral researcher at the University of Warwick, hosted by Igor Carboni Oliveira.
Previously, I held positions as a postdoctoral researcher at the University of Oxford, hosted by Rahul Santhanam, and as a Research Fellow for the Meta-Complexity program at the Simons Institute for the Theory of Computing. I obtained my Ph.D. from Simon Fraser University, where I was advised by Valentine Kabanets and Andrei Bulatov. I did my Bachelor's in Computer Science at the University of British Columbia.
Computational Complexity
Circuit Complexity
Randomness and Pseudorandomness in Computation
Kolmogorov Complexity
Connections between Lower Bounds and Algorithms
Exact Search-to-Decision Reductions for Time-Bounded Kolmogorov Complexity
with Shuichi Hirahara, Valentine Kabanets, and Igor C. Oliveira2024
Polynomial-Time Pseudodeterministic Construction of Primes
[ECCC] [Quanta] [Computational Complexity Blog] [Oded's Choices]
with Lijie Chen, Igor C. Oliveira, Hanlin Ren, and Rahul SanthanamFOCS 2023
Bounded Relativization
with Shuichi Hirahara and Hanlin RenCCC 2023
A Duality Between One-Way Functions and Average-Case Symmetry of Information
with Shuichi Hirahara, Rahul Ilango, Mikito Nanashima, and Igor C. OliveiraSTOC 2023
Theory and Applications of Probabilistic Kolmogorov Complexity
with Igor C. OliveiraThe Computational Complexity Column - Bulletin of EATCS No 137, 2022
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity
with Halley Goldberg, Valentine Kabanets, and Igor C. OliveiraCCC 2022
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity
with Igor C. Oliveira and Marius ZimandICALP 2022
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
with Bruno P. CavalarITCS 2022
Majority vs. Approximate Linear Sum and Average-Case Complexity below NC1
with Lijie Chen, Xin Lyu, and Igor C. OliveiraICALP 2021
An Efficient Coding Theorem via Probabilistic Representations and its Applications
with Igor C. OliveiraICALP 2021
Pseudodeterministic Algorithms and the Structure of Probabilistic Time
with Igor C. Oliveira and Rahul SanthanamSTOC 2021
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
with Valentine Kabanets, Sajin Koroth, Dimitrios Myrisiotis, and Igor C. OliveiraCCC 2020
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators
with Mahdi Cheraghchi, Valentine Kabanets, and Dimitrios MyrisiotisICALP 2019
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
with Valentine KabanetsRANDOM 2018
A Polynomial Restriction Lemma with Applications
with Valentine Kabanets and Daniel KaneSTOC 2017