An O(n log log n) time O(n) space algorithm for anchored edit distance chaining is obtained by merging gap-cost computation from Chao and Miller (1995) with overlap-cost computation from Baker and Giancarlo (1998), plus a practical O(n log n) implementation.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Introduces PIN priority queue and neighbor-aware tree operations claiming 32 million order messages per second on one CPU core for trading matching engines.
Presents the Cascade Log, a reference-stable tiered append structure using a coalescing interval map for handles, with Θ(A) space, O(log A) point resolution, and sublinear cost on append-dominated histories where A is the fragmentation measure.
citing papers explorer
-
Revisiting $O(n \log \log n)$ chaining for anchored edit distance
An O(n log log n) time O(n) space algorithm for anchored edit distance chaining is obtained by merging gap-cost computation from Chao and Miller (1995) with overlap-cost computation from Baker and Giancarlo (1998), plus a practical O(n log n) implementation.
-
The World's Fastest Matching Engine Algorithm
Introduces PIN priority queue and neighbor-aware tree operations claiming 32 million order messages per second on one CPU core for trading matching engines.
-
The Cascade Log: Reference-Stable Windowing over Tiered Append Sequences
Presents the Cascade Log, a reference-stable tiered append structure using a coalescing interval map for handles, with Θ(A) space, O(log A) point resolution, and sublinear cost on append-dominated histories where A is the fragmentation measure.