| Hyperprofile-based Computation Offloading for Mobile Edge Networks A Crutcher, C Koch, K Coleman, J Patman, F Esposito, P Calyam IEEE International Conference on Mobile Ad Hoc and Sensor Systems 14, 525-529, 2017 | 33 | 2017 |
| Superpolynomial lower bounds for decision tree learning and testing C Koch, C Strassle, LY Tan Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |
| Automata learning with an incomplete teacher M Moeller, T Wiener, A Solko-Breslin, C Koch, N Foster, A Silva 37th European Conference on Object-Oriented Programming (ECOOP 2023), 21: 1 …, 2023 | 9 | 2023 |
| Properly learning decision trees with queries is NP-hard C Koch, C Strassle, LY Tan 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 8 | 2023 |
| A strong direct sum theorem for distributional query complexity G Blanc, C Koch, C Strassle, LY Tan arXiv preprint arXiv:2405.16340, 2024 | 7 | 2024 |
| A query-optimal algorithm for finding counterfactuals G Blanc, C Koch, J Lange, LY Tan International Conference on Machine Learning, 2075-2090, 2022 | 7 | 2022 |
| The query complexity of certification G Blanc, C Koch, J Lange, LY Tan Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
| A strong composition theorem for junta complexity and the boosting of property testers G Blanc, C Koch, C Strassle, LY Tan 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 5 | 2023 |
| The sample complexity of smooth boosting and the tightness of the hardcore theorem G Blanc, A Hayderi, C Koch, LY Tan 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | 4 | 2024 |
| Automata learning with an incomplete teacher (artifact) M Moeller, T Wiener, A Solko-Breslin, C Koch, N Foster, A Silva Dagstuhl Artifacts Series 9 (2), 21: 1-21: 3, 2023 | 3 | 2023 |
| Superconstant inapproximability of decision tree learning C Koch, C Strassle, LY Tan The Thirty Seventh Annual Conference on Learning Theory, 2979-3010, 2024 | 2 | 2024 |
| Fast decision tree learning solves hard coding-theoretic problems C Koch, C Strassle, LY Tan 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | 1 | 2024 |
| Feature Selection and Junta Testing are Statistically Equivalent L Beretta, N Harms, C Koch Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2026 | | 2026 |
| Samplability makes learning easier G Blanc, C Koch, J Lange, C Strassle, LY Tan arXiv preprint arXiv:2512.01276, 2025 | | 2025 |
| The power of quantum circuits in sampling G Blanc, C Koch, J Lange, C Strassle, LY Tan arXiv preprint arXiv:2510.03645, 2025 | | 2025 |
| Computational-Statistical Tradeoffs from NP-hardness G Blanc, C Koch, C Strassle, LY Tan arXiv preprint arXiv:2507.13222, 2025 | | 2025 |
| Testing Juntas Optimally with Samples L Beretta, N Harms, C Koch arXiv preprint arXiv:2505.04604, 2025 | | 2025 |
| The Complexity of Learning Decision Trees C Koch Stanford University, 2025 | | 2025 |
| 37th European Conference on Object-Oriented Programming (ECOOP 2023) AD Barwell, P Hou, N Yoshida, F Zhou, J Bauwens, E Gonzalez Boix, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| Certification with an NP Oracle G Blanc, C Koch, J Lange, C Strassle, LY Tan arXiv preprint arXiv:2211.02257, 2022 | | 2022 |
Prasad CalyamCurators' Distinguished Professor, University of Missouri-ColumbiaVerified email at missouri.edu
