Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989134823 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.03306 / 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: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (δ+1)-coloring in linear (in δ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed vertex coloring in polylogarithmic time / 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: Distributed deterministic edge coloring using bounded neighborhood independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost optimal algorithm for unbounded searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label-guided graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of distributed sparse spanner construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Maps with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing with advice: information sensitivity of graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication algorithms with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local MST computation with short advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distributed Decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distributed Complexity of Computing Maximal Matchings / 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: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Fault Locality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximate Matching / 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: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal maximal independent set algorithm for bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality based graph coloring / rank
 
Normal rank

Latest revision as of 12:20, 7 July 2024

scientific article
Language Label Description Also known as
English
Toward more localized local algorithms: removing assumptions concerning global knowledge
scientific article

    Statements

    Toward more localized local algorithms: removing assumptions concerning global knowledge (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2014
    0 references
    distributed algorithm
    0 references
    global knowledge
    0 references
    parameters
    0 references
    MIS
    0 references
    coloring
    0 references
    maximal matching
    0 references
    0 references
    0 references

    Identifiers

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