Invited talk: Resilient distributed algorithms (Q831782): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3124115049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Expected Constant-Round Protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant broadcasting and gossiping in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms Made Secure: A Graph Theoretic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Congestion Cycle Covers and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Distributed Computing Made (Nearly) Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time is not a healer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing in asynchronous networks with byzantine edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cuts and connectivity certificates: a fault tolerant approach / rank
 
Normal rank

Latest revision as of 12:14, 4 December 2024

scientific article
Language Label Description Also known as
English
Invited talk: Resilient distributed algorithms
scientific article

    Statements

    Invited talk: Resilient distributed algorithms (English)
    0 references
    0 references
    24 March 2022
    0 references
    CONGEST
    0 references
    resilient computation
    0 references
    secure computation
    0 references

    Identifiers