scientific article; zbMATH DE number 7724191

DOI10.4230/LIPICS.MFCS.2021.18MaRDI QIDQ6168428zbMATH OpenFDO

Authors D. Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck

Publication date 8 August 2023

Full work available at URL https://arxiv.org/abs/2107.03485

zbMATH Keywords

derandomizationdiameterdistance sensitivity oraclefault-tolerant data structurespace lower bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• An Efficient Byzantine-Resilient Tuple Space
• The space-stretch-time tradeoff in distance oracles
• A polynomial-time approximation scheme for fault-tolerant distributed storage
• Space-efficient path-reporting approximate distance oracles
• scientific article; zbMATH DE number 1979527
• Two-server distributed ORAM with sublinear computation and constant rounds
• Improved distance sensitivity oracles with subcubic preprocessing time
• Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
• Fault-tolerant computation of distributed regular path queries

Cited in

(4)

• Simple and efficient two-server ORAM
• Approximate distance sensitivity oracles in subquadratic space
• Approximate distance sensitivity oracles in subquadratic space
• Fault-tolerant ST-diameter oracles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168428)