Kasper Green Larsen | Academic Influence

Kasper Green Larsen's AcademicInfluence.com Rankings

Kasper Green Larsen

Computer Science

#2105

World Rank

#2187

Historical Rank

Data Mining

#290

World Rank

#291

Historical Rank

Machine Learning

#5588

World Rank

#5662

Historical Rank

Database

#9235

World Rank

#9718

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Kasper Green Larsen's Degrees

PhD Computer Science Aarhus University
Masters Computer Science Aarhus University
Bachelors Computer Science Aarhus University

Similar Degrees You Can Earn

Why Is Kasper Green Larsen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Kasper Green Larsen is a Danish theoretical computer scientist. He is currently full professor at Aarhus University. Biography Larsen earned his doctorate from Aarhus University in 2013 under the supervision of Lars Arge.

(See a Problem?)

Kasper Green Larsen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Orthogonal range searching on the RAM, revisited (2011) (199)
Optimality of the Johnson-Lindenstrauss Lemma (2016) (105)
Mental models and programming aptitude (2007) (92)
Yes, There is an Oblivious RAM Lower Bound! (2018) (80)
The cell probe complexity of dynamic range counting (2011) (78)
Heavy Hitters via Cluster-Preserving Clustering (2016) (72)
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction (2014) (63)
Faster Online Matrix-Vector Multiplication (2016) (58)
Higher Cell Probe Lower Bounds for Evaluating Polynomials (2012) (52)
Range selection and median: tight cell probe lower bounds and adaptive data structures (2011) (50)
Linear-Space Data Structures for Range Mode Query in Arrays (2011) (46)
Orthogonal Range Reporting in Three and Higher Dimensions (2009) (45)
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D (2017) (43)
A Dichotomy for Regular Expression Membership Testing (2016) (42)
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements (2010) (42)
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (2012) (39)
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds (2017) (38)
(Approximate) Uncertain Skylines (2011) (38)
On Range Searching in the Group Model and Combinatorial Discrepancy (2011) (38)
How to Prove Knowledge of Small Secrets (2016) (35)
Cell Probe Lower Bounds and Approximations for Range Mode (2010) (32)
The Query Complexity of Finding a Hidden Permutation (2013) (31)
Near-Optimal Range Reporting Structures for Categorical Data (2013) (28)
I/O-efficient data structures for colored range and prefix reporting (2011) (27)
New Unconditional Hardness Results for Dynamic and Online Problems (2015) (26)
Lower Bounds for Oblivious Data Structures (2018) (26)
Tight cell probe bounds for succinct Boolean matrix-vector multiplication (2017) (26)
Fully Understanding the Hashing Trick (2018) (23)
Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures (2012) (23)
Near-optimal labeling schemes for nearest common ancestors (2013) (22)
On hardness of several string indexing problems (2014) (21)
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing (2019) (19)
Approximate Range Emptiness in Constant Time and Optimal Space (2014) (18)
Succinct sampling from discrete distributions (2013) (18)
Towards optimal lower bounds for k-median and k-means coresets (2022) (18)
Cleaning massive sonar point clouds (2010) (17)
Lower bounds for external memory integer sorting via network coding (2018) (16)
Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms (2014) (15)
The Query Complexity of a Permutation-Based Variant of Mastermind (2018) (14)
Lower Bounds for Multi-Server Oblivious RAMs (2019) (13)
Lower Bounds for Multiplication via Network Coding (2019) (13)
Lower Bounds for Oblivious Near-Neighbor Search (2019) (12)
Optimal Planar Orthogonal Skyline Counting Queries (2013) (12)
On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms (2017) (11)
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines (2020) (11)
Upper and lower bounds for dynamic data structures on strings (2018) (11)
Optimal Oblivious Priority Queues and Offline Oblivious RAM (2019) (10)
Margin-Based Generalization Lower Bounds for Boosted Classifiers (2019) (9)
Constructive Discrepancy Minimization with Hereditary L2 Guarantees (2017) (9)
A Faster External Memory Priority Queue with DecreaseKeys (2018) (9)
DecreaseKeys are expensive for external memory priority queues (2016) (8)
Improved Coresets for Euclidean k-Means (2022) (6)
Clustering with a faulty oracle (2020) (6)
Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long (2020) (5)
I/O-efficient spatial data structures for range queries (2012) (5)
Optimal Minimal Margin Maximization with Boosting (2019) (5)
CountSketches, Feature Hashing and the Median of Three (2021) (4)
Bagging is an Optimal PAC Learner (2022) (4)
Optimal Oblivious Priority Queues (2021) (4)
Linear-Space Data Structures for Range Mode Query in Arrays (2013) (3)
Improved range searching lower bounds (2012) (3)
Margins are Insufficient for Explaining Gradient Boosting (2020) (3)
Optimal Weak to Strong Learning (2022) (3)
Towards Tight Lower Bounds for Range Reporting on the RAM (2014) (3)
The Fast Johnson-Lindenstrauss Transform is Even Faster (2022) (3)
Property-Preserving Hash Functions from Standard Assumptions (2021) (3)
Lower bounds for external memory integer sorting via network coding (2020) (2)
Stronger 3SUM-Indexing Lower Bounds (2022) (2)
Further Unifying the Landscape of Cell Probe Lower Bounds (2020) (2)
Optimal Learning of Joint Alignments with a Faulty Oracle (2019) (2)
Exponential Lower Bounds for Secret Sharing (2019) (1)
Towards an Exponential Lower Bound for Secret Sharing (2019) (1)
Logarithmic Cell Probe Lower Bounds for Non-Deterministic Static Data Structures (2011) (1)
How to Compress Encrypted Data (2022) (1)
On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms (2019) (1)
The Deterministic and Randomized Query Complexity of a Simple Guessing Game (2012) (1)
Fast Discrepancy Minimization with Hereditary Guarantees (2022) (1)
Distributed Shuffling in Adversarial Environments (2022) (1)
Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions (2022) (1)
Optimal Learning of Joint Alignments with a Faulty Oracle (2020) (1)
Broadcast Secret-Sharing, Bounds and Applications (2021) (1)
(Approximate) Uncertain Skylines (2012) (1)
The Impossibility of Parallelizing Boosting (2023) (0)
Diagonalization Games (2023) (0)
AdaBoost is not an Optimal Weak to Strong Learner (2023) (0)
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures (2021) (0)
Barriers for Faster Dimensionality Reduction (2022) (0)
Communication Complexity and Data Structures (2014) (0)
Dimension Reduction (2019) (0)
Compression Implies Generalization (2021) (0)
Log-squared Lower Bounds for Dynamic Data Structures (2014) (0)
Hierarchical Categories in Colored Searching (2022) (0)
D S ] 9 A pr 2 01 9 Lower Bounds for Oblivious Near-Neighbor Search (2019) (0)
2 Lecture 1 : Secret Sharing Lecture Summary (2020) (0)
Super-Logarithmic Lower Bounds for Dynamic Graph Problems (2023) (0)
Sparse Dimensionality Reduction Revisited (2023) (0)
Optimal Oblivious Priority Queues and Offline (2019) (0)

This paper list is powered by the following services:

Other Resources About Kasper Green Larsen

What Schools Are Affiliated With Kasper Green Larsen?

Kasper Green Larsen is affiliated with the following schools:

Aarhus University