Hyperprofile-Based Computation Offloading for Mobile Edge Networks. - Andrew Crutcher; Caleb Koch 001; Kyle Coleman; Jon Patman; Flavio Esposito; Prasad Calyam (MASS, 2017)

A query-optimal algorithm for finding counterfactuals. - Guy Blanc; Caleb Koch 001; Jane Lange; Li-Yang Tan (ICML, 2022)

The query complexity of certification. - Guy Blanc; Caleb Koch 001; Jane Lange; Li-Yang Tan (STOC, 2022)

Automata Learning with an Incomplete Teacher. - Mark Moeller; Thomas Wiener; Alaia Solko-Breslin; Caleb Koch 001; Nate Foster; Alexandra Silva 001 (ECOOP, 2023)

A strong composition theorem for junta complexity and the boosting of property testers. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (FOCS, 2023)

Properly learning decision trees with queries is NP-hard. - Caleb Koch 001; Carmen Strassle; Li-Yang Tan (FOCS, 2023)

Certification with an NP Oracle. - Guy Blanc; Caleb Koch 001; Jane Lange; Carmen Strassle; Li-Yang Tan (ITCS, 2023)

Superpolynomial lower bounds for decision tree learning and testing. - Caleb Koch 001; Carmen Strassle; Li-Yang Tan (SODA, 2023)

Automata Learning with an Incomplete Teacher (Artifact). - Mark Moeller; Thomas Wiener; Alaia Solko-Breslin; Caleb Koch 001; Nate Foster; Alexandra Silva 001 (Dagstuhl Artifacts Ser., 2023)

A Strong Direct Sum Theorem for Distributional Query Complexity. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (CCC, 2024)

Superconstant Inapproximability of Decision Tree Learning. - Caleb Koch 001; Carmen Strassle; Li-Yang Tan (COLT, 2024)

Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems. - Caleb Koch 001; Carmen Strassle; Li-Yang Tan (FOCS, 2024)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. - Guy Blanc; Alexandre Hayderi; Caleb Koch 001; Li-Yang Tan (FOCS, 2024)

Computational-Statistical Tradeoffs from NP-hardness. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (CoRR, 2025)