Carmen Strassle
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
7
Venues
3
Active years
2023–2025
Best venue rank
A*
Where they publish
Papers
7 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | COLT | A Distributional-Lifting Theorem for PAC Learning. | Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan |
| 2025 | FOCS | Computational-Statistical Tradeoffs from NP-hardness. | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2024 | COLT | Superconstant Inapproximability of Decision Tree Learning. | Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2024 | FOCS | Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems. | Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | FOCS | A strong composition theorem for junta complexity and the boosting of property testers. | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | FOCS | Properly learning decision trees with queries is NP-hard. | Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | SODA | Superpolynomial lower bounds for decision tree learning and testing. | Caleb Koch, Carmen Strassle, Li-Yang Tan |