Pages that link to "Item:Q2875187"
From MaRDI portal
The following pages link to Towards polynomial lower bounds for dynamic problems (Q2875187):
Displayed 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Mind the gap! (Q2414857) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4612486) (← links)
- (Q4637980) (← links)
- (Q4638059) (← links)
- (Q4638076) (← links)
- (Q4993281) (← links)
- (Q4993299) (← links)
- The minrank of random graphs (Q5002652) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- Improved Time and Space Bounds for Dynamic Range Mode (Q5009582) (← links)
- (Q5009597) (← links)
- (Q5009638) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- (Q5116497) (← links)
- (Q5121902) (← links)
- (Q5136312) (← links)
- (Q5140838) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- (Q5743415) (← links)
- (Q5743425) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter (Q6051928) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← links)
- Internal masked prefix sums and its connection to fully internal measurement queries (Q6111587) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Communication and information complexity (Q6200329) (← links)