Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Fibonacci heaps and their uses in improved network optimization algorithms
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Pointer-machine working-set heaps achieve amortized O(1) Push and O(α(n)) DecreaseKey, yielding Dijkstra with only additive O(m α(m)) overhead over optimal distance ordering.
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
citing papers explorer
-
A Coalgebraic Dijkstra Algorithm
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
-
Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines
Pointer-machine working-set heaps achieve amortized O(1) Push and O(α(n)) DecreaseKey, yielding Dijkstra with only additive O(m α(m)) overhead over optimal distance ordering.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.