{"total":15,"rows":[{"id":"2312.04027","title":"The sample complexity of multi-distribution learning","created":"2023-12-07","cited_by_count":12,"area":null},{"id":"2402.07443","title":"The I/O Complexity of Attention, or How Optimal is Flash Attention?","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"area":null},{"id":"2405.19752","title":"Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits","created":"2024-05-30","cited_by_count":4,"area":null},{"id":"2406.02357","title":"The complexity of approximate (coarse) correlated equilibrium for incomplete information games","created":"2024-06-04","cited_by_count":4,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2605.30324","title":"On Language Generation in the Limit with Bounded Memory","created":"2026-05-28","cited_by_count":3,"area":null},{"id":"2608.09538","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","created":"2026-08-10","cited_by_count":3,"area":null},{"id":"2404.06720","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2501.03132","title":"Communication Bounds for the Distributed Experts Problem","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2603.00803","title":"Lookahead identification in adversarial bandits: accuracy and memory bounds","created":"2026-02-28","cited_by_count":0,"area":null},{"id":"2603.09168","title":"Better Bounds for the Distributed Experts Problem","created":"2026-03-10","cited_by_count":0,"area":null},{"id":"2607.24827","title":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2608.07922","title":"Memory--Batch Tradeoffs in Lipschitz Bandits","created":"2026-08-08","cited_by_count":0,"area":null}],"next_cursor":null}