The following pages link to Kasper Green Larsen (Q359872):
Displaying 50 items.
- (Approximate) uncertain skylines (Q359874) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Yes, there is an oblivious RAM lower bound! (Q1784105) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Lower bounds for multi-server oblivious RAMs (Q2055732) (← links)
- Secret sharing lower bound: either reconstruction is hard or shares are long (Q2106669) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Communication lower bounds for statistically secure MPC, with or without preprocessing (Q2304978) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
- Improved range searching lower bounds (Q2874579) (← links)
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (Q2874593) (← links)
- (Q2904770) (← links)
- Optimal Planar Orthogonal Skyline Counting Queries (Q3188886) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- (Q3467513) (← links)
- Faster Online Matrix-Vector Multiplication (Q4575890) (← links)
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction (Q4598222) (← links)
- Towards Tight Lower Bounds for Range Reporting on the RAM. (Q4598233) (← links)
- DecreaseKeys are expensive for external memory priority queues (Q4978049) (← links)
- (Q5090499) (← links)
- Lower Bounds for Multiplication via Network Coding (Q5091158) (← links)
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Q5130847) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- Lower Bounds for Oblivious Near-Neighbor Search (Q5146839) (← links)
- Lower Bounds for External Memory Integer Sorting via Network Coding (Q5157396) (← links)
- On Hardness of Several String Indexing Problems (Q5165610) (← links)
- Lower bounds for external memory integer sorting via network coding (Q5212840) (← links)
- Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds (Q5230355) (← links)
- Tight cell probe bounds for succinct Boolean matrix-vector multiplication (Q5230382) (← links)
- A Faster External Memory Priority Queue with DecreaseKeys (Q5236265) (← links)
- Lower Bounds for Oblivious Data Structures (Q5236338) (← links)
- Approximate Range Emptiness in Constant Time and Optimal Space (Q5362992) (← links)
- (Q5365082) (← links)
- Near-optimal labeling schemes for nearest common ancestors (Q5384034) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- The cell probe complexity of dynamic range counting (Q5415467) (← links)
- On Range Searching in the Group Model and Combinatorial Discrepancy (Q5494934) (← links)
- On Range Searching in the Group Model and Combinatorial Discrepancy (Q5494985) (← links)
- Succinct sampling from discrete distributions (Q5495848) (← links)
- Near-Optimal Range Reporting Structures for Categorical Data (Q5741728) (← links)
- (Q5743422) (← links)
- (Q6107259) (← links)
- Constructive Discrepancy Minimization with Hereditary L2 Guarantees (Q6293660) (← links)
- Existence of an equilibrium with limited stock market participation and power utilities (Q6521309) (← links)
- Fast discrepancy minimization with hereditary guarantees (Q6538537) (← links)
- Stronger 3SUM-indexing lower bounds (Q6538547) (← links)
- Further unifying the landscape of cell probe lower bounds (Q6538764) (← links)
- Optimality of the Johnson-Lindenstrauss dimensionality reduction for practical measures (Q6539530) (← links)
