default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCaleb Koch 0001
Person information
- affiliation: Stanford University, Department of Computer Science, CA, USA
Other persons with the same name
- Caleb Koch — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
A Strong Direct Sum Theorem for Distributional Query Complexity. CCC 2024: 16:1-16:30- [c9]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Superconstant Inapproximability of Decision Tree Learning. COLT 2024: 2979-3010 - [i11]Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
A Strong Direct Sum Theorem for Distributional Query Complexity. CoRR abs/2405.16340 (2024) - [i10]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Superconstant Inapproximability of Decision Tree Learning. CoRR abs/2407.01402 (2024) - [i9]Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan:
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. CoRR abs/2409.11597 (2024) - [i8]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Fast decision tree learning solves hard coding-theoretic problems. CoRR abs/2409.13096 (2024) - 2023
- [j1]Mark Moeller, Thomas Wiener, Alaia Solko-Breslin, Caleb Koch, Nate Foster, Alexandra Silva:
Automata Learning with an Incomplete Teacher (Artifact). Dagstuhl Artifacts Ser. 9(2): 21:1-21:3 (2023) - [c8]Mark Moeller, Thomas Wiener, Alaia Solko-Breslin, Caleb Koch, Nate Foster
, Alexandra Silva:
Automata Learning with an Incomplete Teacher. ECOOP 2023: 21:1-21:30 - [c7]Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
A strong composition theorem for junta complexity and the boosting of property testers. FOCS 2023: 1757-1777 - [c6]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Properly learning decision trees with queries is NP-hard. FOCS 2023: 2383-2407 - [c5]Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan:
Certification with an NP Oracle. ITCS 2023: 18:1-18:22 - [c4]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Superpolynomial lower bounds for decision tree learning and testing. SODA 2023: 1962-1994 - [i7]Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers. CoRR abs/2307.04039 (2023) - [i6]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Properly Learning Decision Trees with Queries Is NP-Hard. CoRR abs/2307.04093 (2023) - 2022
- [c3]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
A query-optimal algorithm for finding counterfactuals. ICML 2022: 2075-2090 - [c2]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
The query complexity of certification. STOC 2022: 623-636 - [i5]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
The Query Complexity of Certification. CoRR abs/2201.07736 (2022) - [i4]Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan:
A Query-Optimal Algorithm for Finding Counterfactuals. CoRR abs/2207.07072 (2022) - [i3]Caleb Koch, Carmen Strassle, Li-Yang Tan:
Superpolynomial Lower Bounds for Decision Tree Learning and Testing. CoRR abs/2210.06375 (2022) - [i2]Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan:
Certification with an NP Oracle. CoRR abs/2211.02257 (2022)
2010 – 2019
- 2017
- [c1]Andrew Crutcher, Caleb Koch, Kyle Coleman, Jon Patman, Flavio Esposito, Prasad Calyam:
Hyperprofile-Based Computation Offloading for Mobile Edge Networks. MASS 2017: 525-529 - [i1]Andrew Crutcher, Caleb Koch, Kyle Coleman, Jon Patman, Flavio Esposito, Prasad Calyam:
Hyperprofile-based Computation Offloading for Mobile Edge Networks. CoRR abs/1707.09422 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
