A self-stabilizing Hashed Patricia Trie

DOI10.1016/J.IC.2021.104697OpenAlexW3119031877MaRDI QIDQ2139093FDOQ2139093

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

zbMATH Keywords

prefix searchdistributed data structureself-stabilizing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-stabilizing systems in spite of distributed control
• 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
• Self-stabilizing overlays for high-dimensional monotonic searchability
• Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
• SKIP ⁺
• Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
• Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures

Uses Software

• Pastry
• PATRICIA

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)