Synthical
Your space
Profile
Activity
Favorites
Folders
Feeds
All articles
Simple
Original
Articles by
Karl Bringmann
Tight Fine-Grained Bounds for Direct Access on Join Queries
12 December 2024 by
Karl Bringmann
and
others
Databases
,
Computational Complexity
Beating Bellman's Algorithm for Subset Sum
29 October 2024 by
Karl Bringmann
and
others
Data Structures and Algorithms
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
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
29 July 2024 by
Karl Bringmann
and
Nofar Carmeli
Databases
,
Data Structures and Algorithms
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
1 July 2024 by
Karl Bringmann
and
others
Data Structures and Algorithms
A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
5 April 2024 by
Karl Bringmann
and
Egor Gorbachev
Data Structures and Algorithms
Fine-Grained Complexity of Earth Mover's Distance under Translation
7 March 2024 by
Karl Bringmann
and
others
Computational Geometry
Knapsack with Small Items in Near-Quadratic Time
26 February 2024 by
Karl Bringmann
Data Structures and Algorithms
Faster Sublinear-Time Edit Distance
4 December 2023 by
Karl Bringmann
and
others
Data Structures and Algorithms
Dynamic Dynamic Time Warping
1
13 November 2023 by
Karl Bringmann
and
others
at
Saarland University
Computational Geometry
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
23 October 2023 by
Amir Abboud
and
others
Data Structures and Algorithms
Approximating Subset Sum Ratio faster than Subset Sum
11 October 2023 by
Karl Bringmann
Data Structures and Algorithms
The Time Complexity of Fully Sparse Matrix Multiplication
12 September 2023 by
Amir Abboud
and
others
Data Structures and Algorithms
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution
2 May 2023 by
Karl Bringmann
and
Alejandro Cassis
Data Structures and Algorithms
Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum
23 April 2023 by
Karl Bringmann
and
Vasileios Nakos
Data Structures and Algorithms
,
Discrete Mathematics
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
11 April 2023 by
Karl Bringmann
and
others
Data Structures and Algorithms
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
16 March 2023 by
Karl Bringmann
and
others
Data Structures and Algorithms
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms
22 January 2023 by
Karl Bringmann
and
others
Data Structures and Algorithms
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond
15 October 2022 by
Amir Abboud
and
others
Data Structures and Algorithms
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution
17 May 2022 by
Karl Bringmann
and
Alejandro Cassis
Data Structures and Algorithms
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
16 May 2022 by
Bahareh Banyassady
and
others
Computational Geometry
,
Robotics
Improved Sublinear-Time Edit Distance for Preprocessed Strings
29 April 2022 by
Karl Bringmann
and
others
Data Structures and Algorithms
A Structural Investigation of the Approximability of Polynomial-Time Problems
25 April 2022 by
Karl Bringmann
and
others
Data Structures and Algorithms
,
Computational Complexity
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves
16 March 2022 by
Karl Bringmann
and
others
Computational Geometry
,
Data Structures and Algorithms
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs
10 March 2022 by
Karl Bringmann
and
others
Computational Geometry
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
3 November 2021 by
Karl Bringmann
and
others
Computational Geometry
,
Computational Complexity
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry
19 October 2021 by
Karl Bringmann
at
Saarland University
Computational Geometry
,
Data Structures and Algorithms
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution
15 July 2021 by
Karl Bringmann
and
others
Data Structures and Algorithms
Fine-Grained Completeness for Optimization in P
4 July 2021 by
Karl Bringmann
and
others
Data Structures and Algorithms
,
Computational Complexity
Load more