PhD Student
Department of Computer Science
Theory Group
Stanford University
Advisor: Li-Yang Tan
Office: 165 Gates
Email: ckoch at stanford dot edu
CV
|
Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems
|
FOCS 24 |
|
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
Invited to FOCS 2024 special issue |
FOCS 24 |
|
A Strong Direct Sum Theorem for Distributional Query Complexity
Invited to CCC 2024 special issue |
CCC 24 |
|
Superconstant Inapproximability of Decision Tree Learning
|
COLT 24 |
|
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers
|
FOCS 23 |
|
Properly Learning Decision Trees with Queries Is NP-Hard
|
FOCS 23 |
|
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
|
SODA 23 |
|
Certification with an NP Oracle
|
ITCS 23 |
|
A Query-Optimal Algorithm for Finding Counterfactuals
|
ICML 22 |
|
The Query Complexity of Certification
|
STOC 22 |