Robust self-ordering versus local self-ordering

DOI10.1007/978-3-031-88946-2_14MaRDI QIDQ6877274zbMATH OpenFDO

Authors Oded Goldreich

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• Computational complexity and local algorithms. On the interplay between randomness and computation
• Introduction to Property Testing
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Three theorems regarding testing graph properties

This page was built for publication: Robust self-ordering versus local self-ordering

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