A self-stabilizing hashed Patricia trie
From MaRDI portal
Publication:2139093
DOI10.1016/J.IC.2021.104697OpenAlexW3119031877MaRDI QIDQ2139093FDOQ2139093
Authors: Till Knollmann, Christian Scheideler 
Publication date: 17 May 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.04923
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
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- HyperTree for self-stabilizing peer-to-peer systems
- A self-stabilizing and local Delaunay graph construction
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Linearization: locally self-stabilizing sorting in graphs
- Re-Chord: a self-stabilizing chord overlay network
- Self-stabilizing depth-first search
- Title not available (Why is that?)
- Self-stabilizing overlays for high-dimensional monotonic searchability
- Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Towards establishing monotonic searchability in self-stabilizing data structures
Cited In (4)
Uses Software
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)
