Similar Items: Smallest suffixient set maintenance in near-real-time
- Constructing Suffixient Arrays Revisited
- Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
- Nearly Optimal Attention Coresets
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- Nearly-Tight Bounds for Zonotope Containment and Beyond
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth