Pages that link to "Item:Q2941485"
From MaRDI portal
The following pages link to Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (Q2941485):
Displaying 42 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Intersection joins under updates (Q2051850) (← links)
- Dynamic data structures for interval coloring (Q2197541) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Mind the gap! (Q2414857) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- New amortized cell-probe lower bounds for dynamic problems (Q2420582) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- (Q3305351) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4638059) (← links)
- (Q4638076) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (Q5002715) (← links)
- (Q5009600) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Counting Triangles under Updates in Worst-Case Optimal Time (Q5091114) (← links)
- (Q5091161) (← links)
- (Q5091170) (← links)
- (Q5111734) (← links)
- (Q5116497) (← links)
- (Q5140838) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- (Q5874528) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Range updates and range sum queries on multidimensional points with monoid weights (Q6110077) (← links)
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries (Q6135781) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Rewriting with Acyclic Queries: Mind Your Head (Q6178695) (← links)
