Tight bounds for distributed minimum-weight spanning tree verification (Q372968): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 5999536
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1230.68143 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.STACS.2011.69 / rank
 
Normal rank
Property / publication date
 
23 January 2012
Timestamp+2012-01-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 January 2012 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7b9c.html / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M14 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5999536 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006444174 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.04832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local detection paradigm and its applications to self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the natural random walk on the Burnside group \(B(3,n)\) / 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: A tight unconditional lower bound on distributed randomwalk computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel verification of minimum spanning trees in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory requirements for silent stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distributed Decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized distributed decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Schemes for Flow and Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler minimum spanning tree verification algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal EREW PRAM algorithm for minimum spanning tree verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear verification for spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification of minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear bounds for randomized leader election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST for constant diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Path Compression on Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 22:53, 6 July 2024

scientific article; zbMATH DE number 5999536
Language Label Description Also known as
English
Tight bounds for distributed minimum-weight spanning tree verification
scientific article; zbMATH DE number 5999536

    Statements

    Tight bounds for distributed minimum-weight spanning tree verification (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2013
    0 references
    23 January 2012
    0 references
    distributed algorithms
    0 references
    distributed verification
    0 references
    labeling schemes
    0 references
    minimum-weight spanning tree
    0 references
    0 references
    0 references

    Identifiers

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