Articles by Kasper Green Larsen | Synthical

Synthical

Your space

Profile

Activity

Favorites

Folders

Feeds

Contacts

About

Claim page

Kasper Green Larsen

Follow

Activity

Upvotes

Folders

Articles

16

Boosting, Voting Classifiers and Randomized Sample Compression Schemes

20 December 2024 by Arthur Cunha and others

Machine Learning

Invertible Bloom Lookup Tables with Less Memory and Randomness

26 November 2024 by Nils Fleischhacker and others

Data Structures and Algorithms, Cryptography and Security

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Machine Learning

5 November 2024 by Allan Grønlund and Kasper Green Larsen at

Aarhus University

Quantum Physics, Computational Complexity

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

3 October 2024 by Karl Bringmann and others

Computational Complexity, Data Structures and Algorithms

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation

1 October 2024 by Karl Bringmann and others

Computational Geometry, Computational Complexity

Derandomizing Multi-Distribution Learning

26 September 2024 by Kasper Green Larsen and others

Machine Learning, Computational Complexity

The Many Faces of Optimal Weak-to-Strong Learning

30 August 2024 by Mikael Møller Høgsgaard and others

Machine Learning, Data Structures and Algorithms

Optimal Parallelization of Boosting

29 August 2024 by Arthur Cunha and others

Machine Learning

Revisiting Agnostic PAC Learning

29 July 2024 by Steve Hanneke and others

Machine Learning, Data Structures and Algorithms

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing

19 April 2024 by Kasper Green Larsen and others

Data Structures and Algorithms

Majority-of-Three: The Simplest Optimal Learner?

12 March 2024 by Ishaq Aden-Ali and others

Machine Learning, Statistics Theory

Replicable Learning of Large-Margin Halfspaces

21 February 2024 by Alkis Kalavasis and others

Machine Learning

Compressing Encrypted Data Over Small Fields

15 June 2023 by Nils Fleischhacker and others

Cryptography and Security, Cryptology Foundations

Invertible Bloom Lookup Tables with Less Memory and Randomness

11 June 2023 by Nils Fleischhacker and others

Cryptography and Security, Cryptology Foundations

How to Compress Encrypted Data

22 February 2023 by Nils Fleischhacker and others

Cryptography and Security, Cryptology Foundations

Distributed Shuffling in Adversarial Environments

11 October 2022 by Kasper Green Larsen and others

Cryptography and Security, Cryptology Foundations

Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions

7 June 2022 by Nils Fleischhacker and others

Cryptography and Security, Cryptology Foundations

Broadcast Secret-Sharing, Bounds and Applications

9 February 2021 by Ivan Damgård and others

Cryptography and Security, Cryptology Foundations

Lower Bounds for Multi-Server Oblivious RAMs

12 November 2020 by Kasper Green Larsen and others

Cryptography and Security, Cryptology Foundations

Optimal Oblivious Priority Queues

26 September 2019 by Zahra Jafargholi and others

Cryptography and Security, Cryptology Foundations

Towards an Exponential Lower Bound for Secret Sharing

18 September 2019 by Kasper Green Larsen and Michael Simkin

Cryptography and Security, Cryptology Foundations

Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing

31 May 2019 by Ivan Damgård and others

Cryptography and Security, Cryptology Foundations

Lower Bounds for Oblivious Near-Neighbor Search

15 April 2019 by Kasper Green Larsen and others

Cryptography and Security, Cryptographic Protocols

Yes, There is an Oblivious RAM Lower Bound!

28 May 2018 by Kasper Green Larsen and Jesper Buus Nielsen

Cryptography and Security, Cryptographic Protocols

This is an AI-generated summary

Key points

Topics

We have not analyzed this profile yet, please check back later