Distributed Corruption Detection in Networks (Q5140835): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4086/toc.2020.v016a001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerance in Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-Everywhere Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Connection Assignment of Diagnosable Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A diagnosing algorithm for networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of fault localization techniques in computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Concentrators from Generalized <i>N</i>-Gons / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4086/TOC.2020.V016A001 / rank
 
Normal rank

Latest revision as of 16:05, 30 December 2024

scientific article; zbMATH DE number 7286911
Language Label Description Also known as
English
Distributed Corruption Detection in Networks
scientific article; zbMATH DE number 7286911

    Statements

    0 references
    0 references
    0 references
    17 December 2020
    0 references
    distributed computing
    0 references
    expander graphs
    0 references
    PMC model
    0 references
    graph separators
    0 references
    network testing
    0 references
    math.CO
    0 references
    cs.DS
    0 references
    cs.MA
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references