| 2026 | COLT | Actively Learning Halfspaces without Synthetic Data. | Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So |
| 2026 | STOC | The Sample Complexity of Replicable Realizable PAC Learning. | Kasper Green Larsen, Markus Engelund Mathiasen, Chirag Pabbaraju, Clement Svendsen |
| 2025 | ALT | Boosting, Voting Classifiers and Randomized Sample Compression Schemes. | Arthur da Cunha, Kasper Green Larsen, Martin Ritzert |
| 2025 | COLT | Improved Margin Generalization Bounds for Voting Classifiers. | Mikael Mller Hgsgaard, Kasper Green Larsen |
| 2025 | SAGT | A New Lower Bound for Multicolor Discrepancy with Applications to Fair Division. | Ioannis Caragiannis, Kasper Green Larsen, Sudarshan Shyam |
| 2025 | TCC | Time/Space Tradeoffs for Generic Attacks on Delay Functions. | Kasper Green Larsen, Mark Simkin |
| 2024 | ALT | The Impossibility of Parallelizing Boosting. | Amin Karbasi, Kasper Green Larsen |
| 2024 | COLT | Majority-of-Three: The Simplest Optimal Learner? | Ishaq Aden-Ali, Mikael Mller Handgsgaard, Kasper Green Larsen, Nikita Zhivotovskiy |
| 2024 | ESA | Invertible Bloom Lookup Tables with Less Memory and Randomness. | Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin |
| 2024 | FOCS | Revisiting Agnostic PAC Learning. | Steve Hanneke, Kasper Green Larsen, Nikita Zhivotovskiy |
| 2024 | ICALP | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. | Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2024 | ICML | Sparse Dimensionality Reduction Revisited. | Mikael Mller Hgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn |
| 2024 | ICML | Replicable Learning of Large-Margin Halfspaces. | Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou |
| 2024 | IJCAI | Bagging is an Optimal PAC Learner (Extended Abstract). | Kasper Green Larsen |
| 2024 | MFCS | Sublinear Time Shortest Path in Expander Graphs. | Noga Alon, Allan Grnlund, Sren Fuglede Jrgensen, Kasper Green Larsen |
| 2024 | MFCS | From TCS to Learning Theory (Invited Paper). | Kasper Green Larsen |
| 2023 | COLT | Bagging is an Optimal PAC Learner. | Kasper Green Larsen |
| 2023 | EuroCrypt | How to Compress Encrypted Data. | Nils Fleischhacker, Kasper Green Larsen, Mark Simkin |
| 2023 | FOCS | Super-Logarithmic Lower Bounds for Dynamic Graph Problems. | Kasper Green Larsen, Huacheng Yu |
| 2023 | ICML | The Fast Johnson-Lindenstrauss Transform Is Even Faster. | Ora Nova Fandina, Mikael Mller Hgsgaard, Kasper Green Larsen |
| 2023 | ICML | AdaBoost is not an Optimal Weak to Strong Learner. | Mikael Mller Hgsgaard, Kasper Green Larsen, Martin Ritzert |
| 2023 | SODA | Stronger 3SUM-Indexing Lower Bounds. | Eldon Chung, Kasper Green Larsen |
| 2023 | SODA | Fast Discrepancy Minimization with Hereditary Guarantees. | Kasper Green Larsen |
| 2023 | STACS | Barriers for Faster Dimensionality Reduction. | Ora Nova Fandina, Mikael Mller Hgsgaard, Kasper Green Larsen |
| 2022 | EuroCrypt | Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. | Nils Fleischhacker, Kasper Green Larsen, Mark Simkin |
| 2022 | ISAAC | Hierarchical Categories in Colored Searching. | Peyman Afshani, Rasmus Killmann, Kasper Green Larsen |
| 2022 | STOC | Towards optimal lower bounds for k-median and k-means coresets. | Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn |
| 2021 | ICML | CountSketches, Feature Hashing and the Median of Three. | Kasper Green Larsen, Rasmus Pagh, Jakub Tetek |
| 2021 | SODA | Optimal Oblivious Priority Queues. | Zahra Jafargholi, Kasper Green Larsen, Mark Simkin |
| 2020 | ICML | Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. | Allan Grnlund, Lior Kamma, Kasper Green Larsen |
| 2020 | ISIT | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | ITA | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | WWW | Clustering with a faulty oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | SODA | Lower Bounds for Oblivious Near-Neighbor Search. | Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo |
| 2020 | SCN | Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long. | Kasper Green Larsen, Mark Simkin |
| 2020 | TCC | Lower Bounds for Multi-server Oblivious RAMs. | Kasper Green Larsen, Mark Simkin, Kevin Yeo |
| 2019 | CRYPTO | Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. | Ivan Damgrd, Kasper Green Larsen, Jesper Buus Nielsen |
| 2019 | ICALP | Lower Bounds for Multiplication via Network Coding. | Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen |
| 2019 | ICML | Optimal Minimal Margin Maximization with Boosting. | Alexander Mathiasen, Kasper Green Larsen, Allan Grnlund |
| 2019 | SODA | Lower Bounds for Oblivious Data Structures. | Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen |
| 2019 | SODA | A Faster External Memory Priority Queue with DecreaseKeys. | Shunhua Jiang, Kasper Green Larsen |
| 2019 | STOC | Lower bounds for external memory integer sorting via network coding. | Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi |
| 2019 | STACS | Constructive Discrepancy Minimization with Hereditary L2 Guarantees. | Kasper Green Larsen |
| 2018 | CRYPTO | Yes, There is an Oblivious RAM Lower Bound! | Kasper Green Larsen, Jesper Buus Nielsen |
| 2018 | ITA | Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2018 | STOC | Tight cell probe bounds for succinct Boolean matrix-vector multiplication. | Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen |
| 2018 | STOC | Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2018 | STACS | Upper and Lower Bounds for Dynamic Data Structures on Strings. | Raphal Clifford, Allan Grnlund, Kasper Green Larsen, Tatiana Starikovskaya |
| 2017 | FOCS | A Dichotomy for Regular Expression Membership Testing. | Karl Bringmann, Allan Grnlund, Kasper Green Larsen |
| 2017 | FOCS | Optimality of the Johnson-Lindenstrauss Lemma. | Kasper Green Larsen, Jelani Nelson |
| 2017 | ISAAC | On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. | Casper Benjamin Freksen, Kasper Green Larsen |
| 2017 | SODA | Faster Online Matrix-Vector Multiplication. | Kasper Green Larsen, R. Ryan Williams |
| 2017 | STOC | DecreaseKeys are expensive for external memory priority queues. | Kasper Eenberg, Kasper Green Larsen, Huacheng Yu |
| 2016 | CRYPTO | How to Prove Knowledge of Small Secrets. | Carsten Baum, Ivan Damgrd, Kasper Green Larsen, Michael Nielsen |
| 2016 | FOCS | Heavy Hitters via Cluster-Preserving Clustering. | Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup |
| 2016 | ICALP | Towards Tight Lower Bounds for Range Reporting on the RAM. | Allan Grnlund, Kasper Green Larsen |
| 2016 | ICALP | The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. | Kasper Green Larsen, Jelani Nelson |
| 2015 | FOCS | New Unconditional Hardness Results for Dynamic and Online Problems. | Raphal Clifford, Allan Grnlund, Kasper Green Larsen |
| 2015 | SODA | Approximate Range Emptiness in Constant Time and Optimal Space. | Mayank Goswami, Allan Grnlund Jrgensen, Kasper Green Larsen, Rasmus Pagh |
| 2015 | STOC | Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. | Kasper Green Larsen, Jelani Nelson, Huy L. Nguyn |
| 2014 | CPM | On Hardness of Several String Indexing Problems. | Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan |
| 2014 | SODA | Near-optimal labeling schemes for nearest common ancestors. | Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen |
| 2013 | SODA | Near-Optimal Range Reporting Structures for Categorical Data. | Kasper Green Larsen, Freek van Walderveen |
| 2013 | STOC | Succinct sampling from discrete distributions. | Karl Bringmann, Kasper Green Larsen |
| 2012 | FOCS | Higher Cell Probe Lower Bounds for Evaluating Polynomials. | Kasper Green Larsen |
| 2012 | SODA | I/O-efficient data structures for colored range and prefix reporting. | Kasper Green Larsen, Rasmus Pagh |
| 2012 | STOC | The cell probe complexity of dynamic range counting. | Kasper Green Larsen |
| 2012 | STACS | Linear-Space Data Structures for Range Mode Query in Arrays. | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
| 2011 | FOCS | On Range Searching in the Group Model and Combinatorial Discrepancy. | Kasper Green Larsen |
| 2011 | ICDT | (Approximate) uncertain skylines. | Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips |
| 2011 | SODA | Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures. | Allan Grnlund Jrgensen, Kasper Green Larsen |