Catalytic space enables exact multi-pass algorithms for frequency moments F_k and induced subgraph counting using O(k log m) clean space, while single-pass catalytic algorithms add no power.
Faster Weighted and Unweighted Tree Edit Distance and
3 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
3
Pith papers citing it
1
external citations · external index
years
2026 3representative citing papers
Protocol learns k-local Lindbladians to ε accuracy with Õ(n^{2k}/ε²) samples and projects to valid generators; improves to log n under sparsity assumptions.
Deterministic O(n^{2.686})-time algorithm for Monotone Min-Plus Product and n^{1.5+o(1)}-time algorithm for Monotone Min-Plus Convolution, derandomizing prior randomized results.
citing papers explorer
-
Computing over Data Streams using Catalytic Space
Catalytic space enables exact multi-pass algorithms for frequency moments F_k and induced subgraph counting using O(k log m) clean space, while single-pass catalytic algorithms add no power.
-
Robust Structure Learning of $k$-local Lindbladians
Protocol learns k-local Lindbladians to ε accuracy with Õ(n^{2k}/ε²) samples and projects to valid generators; improves to log n under sparsity assumptions.
-
Deterministic Monotone Min-Plus Product and Convolution
Deterministic O(n^{2.686})-time algorithm for Monotone Min-Plus Product and n^{1.5+o(1)}-time algorithm for Monotone Min-Plus Convolution, derandomizing prior randomized results.