Pith. sign in

An almost optimal algorithm for unbounded searching

1 Pith paper cite this work, alongside 312 external citations. Polarity classification is still indexing.

1 Pith paper citing it
312 external citations · OpenAlex

citation-role summary

background 1

citation-polarity summary

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Optimal antimatroid sorting

cs.DS · 2025-07-18 · conditional · novelty 7.0

Topological heapsort generalizes to antimatroids, yielding optimal running time and O(log|P|) comparisons for antimatroid-constrained sorting.

citing papers explorer

Showing 1 of 1 citing paper.

  • Optimal antimatroid sorting cs.DS · 2025-07-18 · conditional · none · ref 1

    Topological heapsort generalizes to antimatroids, yielding optimal running time and O(log|P|) comparisons for antimatroid-constrained sorting.