Some lower bounds in dynamic networks with oblivious adversaries (Q2174250): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Information spreading in dynamic networks under oblivious adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast byzantine agreement in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Byzantine leader election in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHARP INEQUALITIES FOR FACTORIAL n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Dynamic Distributed MIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cost of Fault Tolerance in Multi-Party Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of oblivious message adversaries for which consensus is solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification and hardness of distributed approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Information Spreading in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of radio network broadcast for different models of unreliable links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in unreliable radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated consensus in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Data Aggregation in Directed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility Results and Lower Bounds for Consensus under Link Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to nonparametric estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cost of Unknown Diameter in Dynamic Networks / rank
 
Normal rank

Revision as of 10:14, 22 July 2024

scientific article
Language Label Description Also known as
English
Some lower bounds in dynamic networks with oblivious adversaries
scientific article

    Statements

    Some lower bounds in dynamic networks with oblivious adversaries (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    dynamic networks
    0 references
    oblivious adversary
    0 references
    adaptive adversary
    0 references
    lower bounds
    0 references
    communication complexity
    0 references

    Identifiers

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