Skip to content

feat(Algorithms/Lean/Dijkstra): Dijkstra with a binary heap over the memory oracle #2238

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
SamuelSchlesinger merged 27 commits into from
Nov 2, 2026
Merged

feat(Algorithms/Lean/Dijkstra): Dijkstra with a binary heap over the memory oracle #2238

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
27 commits
Select commit Hold shift + click to select a range
5909d1b
feat(DataStructure/Memory): word-addressed memory oracle and named fi…
SamuelSchlesinger Nov 1, 2026
412f614
doc(bib): add Guéneau, Charguéraud and Pottier (ESOP 2018)
SamuelSchlesinger Nov 1, 2026
16a647f
feat(DataStructure/StateTransition): refinements by abstraction funct…
SamuelSchlesinger Nov 1, 2026
2f12c49
feat(DataStructure/StateTransition): weaken and rescale amortized ref…
SamuelSchlesinger Nov 1, 2026
fba5208
Merge the memory-oracle branch (#2211) into the queue slice
SamuelSchlesinger Nov 1, 2026
98e3290
fix(DataStructure/StateTransition): place productCharge beside produc…
SamuelSchlesinger Nov 1, 2026
02ba9f7
Merge the refinement branch (#2212) into the queue slice
SamuelSchlesinger Nov 1, 2026
56232f9
refactor(DataStructure/StateTransition): make Refinement.Amortized a …
SamuelSchlesinger Nov 1, 2026
1b4e2ea
Merge the refinement branch (#2212) into the queue slice
SamuelSchlesinger Nov 1, 2026
fe7d60d
wip: array stack over memory and queue method lemmas
SamuelSchlesinger Nov 1, 2026
aad5f3e
feat(Foundations): affine cost bounds are O(size)
SamuelSchlesinger Nov 1, 2026
78cf872
Merge the refinement branch (#2212) into the queue slice
SamuelSchlesinger Nov 1, 2026
6698e86
wip: queue over memory
SamuelSchlesinger Nov 1, 2026
7dda248
refactor(DataStructure/StateTransition): product answer types via Sum…
SamuelSchlesinger Nov 1, 2026
93adf90
Merge the refinement branch (#2212) into the queue slice
SamuelSchlesinger Nov 1, 2026
412ad37
feat(DataStructure): queue over two array stacks over the memory oracle
SamuelSchlesinger Nov 1, 2026
ad9fa15
feat(Algorithms/Lean/Dijkstra): Dijkstra as a client of the priority-…
SamuelSchlesinger Nov 1, 2026
b2ebc4a
feat(Algorithms/Lean/Dijkstra): count operations by edges as well as …
SamuelSchlesinger Nov 1, 2026
f40fe1c
feat(DataStructure): products over one memory, and glue charges for h…
SamuelSchlesinger Nov 1, 2026
524056b
feat(DataStructure/PriorityQueue): indexed binary heap over the memor…
SamuelSchlesinger Nov 2, 2026
8c5cd8e
test(DataStructure/PriorityQueue): allow #guard in the binary-heap me…
SamuelSchlesinger Nov 2, 2026
4d59fe8
Merge #2220 (Dijkstra client) onto the binary heap (#2237)
SamuelSchlesinger Nov 2, 2026
b417144
fix(Algorithms/Lean/Dijkstra): evaluate client calls under Sum.elim p…
SamuelSchlesinger Nov 1, 2026
9fd04ae
feat(Algorithms/Lean/Dijkstra): Dijkstra with a binary heap over the …
SamuelSchlesinger Nov 2, 2026
a9e0b2e
test(Dijkstra): allow #guard in the memory test
SamuelSchlesinger Nov 2, 2026
9a20b2f
refactor(Algorithms/Lean/Dijkstra): state the allocated structures se…
SamuelSchlesinger Nov 2, 2026
5ca02f1
Merge origin/main into feat/ram-dijkstra-memory (after #2237, #2220)
SamuelSchlesinger Nov 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions Complexity.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ public import Complexity.Algorithms.ExactTriangle.Weights
public import Complexity.Algorithms.ExactTriangle.Witnesses
public import Complexity.Algorithms.Lean.Dijkstra.Client
public import Complexity.Algorithms.Lean.Dijkstra.Cost
public import Complexity.Algorithms.Lean.Dijkstra.Memory
public import Complexity.Algorithms.Lean.Huffman.Basic
public import Complexity.Algorithms.Lean.Huffman.Kraft
public import Complexity.Algorithms.Lean.Huffman.Optimality
Expand Down Expand Up @@ -2878,13 +2879,15 @@ public import Complexity.Crypto.Protocols.Signature.RandomOracle
public import Complexity.DataStructure.AVLTree.Basic
public import Complexity.DataStructure.AVLTree.Erase
public import Complexity.DataStructure.AVLTree.Impl
public import Complexity.DataStructure.AdjacencyList.Memory
public import Complexity.DataStructure.AdjacencyList.Spec
public import Complexity.DataStructure.CountMin.Basic
public import Complexity.DataStructure.CountMin.LinearHash
public import Complexity.DataStructure.CountMin.Probability
public import Complexity.DataStructure.CountMin.Program
public import Complexity.DataStructure.Dictionary.CuckooHashing
public import Complexity.DataStructure.Dictionary.DoubleHashing
public import Complexity.DataStructure.Dictionary.Memory
public import Complexity.DataStructure.Dictionary.Spec
public import Complexity.DataStructure.Dictionary.UniformProbing
public import Complexity.DataStructure.Dictionary.WordRAM.ChainedHash
Expand Down
Loading
Loading