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 in Computation

Meta-Complexity

Connections between Lower Bounds and Algorithms

**One-Way Functions and pKt Complexity**
with Shuichi Hirahara and Igor C. Oliveira
**Optimal Coding for Randomized Kolmogorov Complexity and Its Applications**
with Shuichi Hirahara and Mikito Nanashima
**On the Complexity of Avoiding Heavy Elements**
with Igor C. Oliveira, Hanlin Ren, and Rahul Santhanam
**Exact Search-to-Decision Reductions for Time-Bounded Kolmogorov Complexity**
with Shuichi Hirahara, Valentine Kabanets, and Igor C. Oliveira
**Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity**
with Rahul Santhanam
**Polynomial-Time Pseudodeterministic Construction of Primes****Bounded Relativization**
with Shuichi Hirahara and Hanlin Ren
**A Duality Between One-Way Functions and Average-Case Symmetry of Information**
with Shuichi Hirahara, Rahul Ilango, Mikito Nanashima, and Igor C. Oliveira
**Theory and Applications of Probabilistic Kolmogorov Complexity**
with Igor C. Oliveira
**Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity**
with Halley Goldberg, Valentine Kabanets, and Igor C. Oliveira
**Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity**
with Igor C. Oliveira and Marius Zimand
**Algorithms and Lower Bounds for Comparator Circuits from Shrinkage**
with Bruno P. Cavalar
**Majority vs. Approximate Linear Sum and Average-Case Complexity below NC1**
with Lijie Chen, Xin Lyu, and Igor C. Oliveira
**An Efficient Coding Theorem via Probabilistic Representations and its Applications**
with Igor C. Oliveira
**Pseudodeterministic Algorithms and the Structure of Probabilistic Time**
with Igor C. Oliveira and Rahul Santhanam
**Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates**
with Valentine Kabanets, Sajin Koroth, Dimitrios Myrisiotis, and Igor C. Oliveira
**Circuit Lower Bounds for MCSP from Local Pseudorandom Generators**
with Mahdi Cheraghchi, Valentine Kabanets, and Dimitrios Myrisiotis
**Satisfiability and Derandomization for Small Polynomial Threshold Circuits**
with Valentine Kabanets
**A Polynomial Restriction Lemma with Applications**
with Valentine Kabanets and Daniel Kane

TCC 2024

FOCS 2024

FOCS 2024

CCC 2024

ICALP 2024

[ECCC] [Quanta] [Computational Complexity Blog] [Oded's Choices]

with Lijie Chen, Igor C. Oliveira, Hanlin Ren, and Rahul SanthanamFOCS 2023

CCC 2023

STOC 2023

The Computational Complexity Column - Bulletin of EATCS No 137, 2022

CCC 2022

ICALP 2022

ITCS 2022

ICALP 2021

ICALP 2021

STOC 2021

CCC 2020

ICALP 2019

RANDOM 2018

STOC 2017