Distributed computing with advice: information sensitivity of graph coloring (Q2377267): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing – IWDC 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Exploration with an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local MST computation with short advice / 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: Locality in Distributed Graph Algorithms / 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: Coloring unstructured radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: What can be computed locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Searching with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / rank
 
Normal rank

Latest revision as of 14:55, 6 July 2024

scientific article
Language Label Description Also known as
English
Distributed computing with advice: information sensitivity of graph coloring
scientific article

    Statements

    Distributed computing with advice: information sensitivity of graph coloring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    amount of information
    0 references
    advice
    0 references
    network algorithm
    0 references
    graph coloring
    0 references
    distributed computing
    0 references
    0 references