FrontierCS: Evolving Challenges for Evolving Intelligence
Published in ICML 2026, 2026
Open-ended, verifiable computer science challenges for evaluating frontier language models.
Research
Ongoing Projects
LLM-assisted Research Problem Generation
Adapted and refined an existing LLM-assisted research problem generation pipeline for theoretical computer science, with a focus on online algorithms. Designed domain-specific criteria for problem formulation and evaluation.
Publications
Conference Papers
An Optimal Online Algorithm for Robust Flow Time Scheduling
Published in SODA 2026, 2026
Robust flow time scheduling.
Online Makespan Minimization: Beat LPT by Dynamic Locking
Published in WINE 2025, 2025
A dynamic-locking approach that improves on LPT for online makespan minimization with any fixed number of identical machines.
The Long Arm of Nashian Allocation in Online p-Mean Welfare Maximization
Published in ICALP 2025, 2025
Optimal competitive ratios for online p-mean welfare maximization across the full range of p.
Manuscripts
Robust Flow Time Scheduling for Related Machines
Manuscript, 2026
Robust flow-time scheduling in the related-machines setting.
Distributed Load Balancing on Unrelated Machines
arXiv preprint, 2026
Polylog-round distributed approximation algorithms for load balancing on unrelated machines in the CONGEST model.