A self-stabilizing hashed Patricia trie
From MaRDI portal
Publication:2139093
Recommendations
- A self-stabilizing hashed Patricia trie
- Self-stabilizing prefix tree based overlay networks
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- HyperTree for self-stabilizing peer-to-peer systems
- Towards establishing monotonic searchability in self-stabilizing data structures
Cites work
- scientific article; zbMATH DE number 4209563 (Why is no real title available?)
- scientific article; zbMATH DE number 2080852 (Why is no real title available?)
- A self-stabilizing and local Delaunay graph construction
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- HyperTree for self-stabilizing peer-to-peer systems
- Linearization: locally self-stabilizing sorting in graphs
- Re-Chord: a self-stabilizing chord overlay network
- Self-stabilizing depth-first search
- Self-stabilizing overlays for high-dimensional monotonic searchability
- Self-stabilizing systems in spite of distributed control
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
- Towards establishing monotonic searchability in self-stabilizing data structures
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
Cited in
(4)
This page was built for publication: A self-stabilizing hashed Patricia trie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139093)