Time-optimal construction of overlay networks (Q6096036): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-023-00442-4 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00446-023-00442-4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in a Hybrid Network Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Computation of Matching and MIS in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building self-stabilizing overlay networks with the transitive closure framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Maximal Independent Set using Small Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Monitoring of Network Properties: The Power of Hybrid Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster construction of overlay networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: SKIP <sup>+</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts in near-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Shortest Paths and Diameter in the Hybrid Network Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking randomly, massively, and efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-way spectral partitioning and higher-order cheeger inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed PageRank computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank

Latest revision as of 18:23, 30 December 2024

scientific article; zbMATH DE number 7736001
Language Label Description Also known as
English
Time-optimal construction of overlay networks
scientific article; zbMATH DE number 7736001

    Statements

    Time-optimal construction of overlay networks (English)
    0 references
    Time-Optimal Construction of Overlay Networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2023
    0 references
    26 March 2024
    0 references
    distributed protocol
    0 references
    peer-to-peer network
    0 references
    randomized algorithm
    0 references
    expander
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references