Boolean Function Monotonicity Testing Requires (Almost) n1/2 Queries
This work gives a nearly tight n1/2−ε lowerbound for adaptive monotonicity testing, resolving a longstanding problem in property testing.
I am a fourth-year undergraduate at Columbia University
double-majoring in Mathematics and Computer Science. I
am mainly interested in theoretical computer science, and
in particular in algorithms and complexity theory.
This work gives a nearly tight n1/2−ε lowerbound for adaptive monotonicity testing, resolving a longstanding problem in property testing.
This work gives novel lower bounds for graph-avoiding colorings of high-dimensional Euclidean space using an algebraic technique, the polynomial method.
This work resolves the complexity of mixed equilibria in discrete first-price auctions with correlated priors by introducing the hypergraph discrete first-price auction.
A research project for COMS6998 Fine-Grained Complexity with Prof. Josh Alman. We introduce a novel rank-based framework for a class of triangle-counting problems and an algorithm for min-weight triangles.
A research project for COMS6998 Algorithms for Massive Data with Prof. Alexandr Andoni. We study approximate nearest neighbor search for convex combinations and flats, generalizing the result of Mahabadi.
A tool for visualizing and applying operations to tensors for applications in fast matrix multiplication algorithmic research.
A research project for CBMF4761 Computational Genomics with Cassandra Burdziak. We created NICHEM-
An interactive website that takes the user from the theory behind programming languages to an implementation of a simple programming language.
An educational experience designed to teach automata theory through interactive puzzles, combat, and llamas.
Columbia University (Fall 2026)
Columbia University (Spring 2025)
President (2025-present); Organizer/Participant (2023-present)
I also make art and videogames!