Being corrupt requires being clever, but detecting corruption doesn't

DOI10.4230/LIPICS.ITCS.2019.45MaRDI QIDQ5090422zbMATH OpenFDO

Authors Yan Jin, Elchanan Mossel, Govind Ramnarayan

Publication date 18 July 2022

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

zbMATH Keywords

corruption detectionhardness of approximationPMC modelsmall set expansion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Distributed corruption detection in networks
• Noisy corruption detection
• Three Thresholds for a Liar
• Partners in crime? Corruption as a criminal network
• Detecting a Network Failure

Cites work

• A diagnosing algorithm for networks
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Characterization of Connection Assignment of Diagnosable Systems
• Disconnecting graphs by removing vertices: a polyhedral approach
• Distributed corruption detection in networks
• Graph expansion and the unique games conjecture
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Inapproximability of treewidth, one-shot pebbling, and related layout problems
• On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Partitioning a graph into small pieces with applications to path transversal
• Sequentially t-diagnosable systems: a characterization and its applications
• The k-separator problem: polyhedra, complexity and approximation results

This page was built for publication: Being corrupt requires being clever, but detecting corruption doesn't

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