Communication algorithms with advice (Q972382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1016/j.jcss.2009.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971694274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768347 / 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: The power of a pebble: Exploring and mapping directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing – IWDC 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting algorithms in radio networks with unknown topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in UDG radio networks with unknown topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effect of the deployment setting on broadcasting in Euclidean radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hundreds of impossibility results for distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration 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: Local MST computation with short advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster communication in known topology radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Radio Broadcasting with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic broadcasting in known topology radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Searching with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 20:17, 2 July 2024

scientific article
Language Label Description Also known as
English
Communication algorithms with advice
scientific article

    Statements

    Communication algorithms with advice (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    algorithm
    0 references
    broadcasting
    0 references
    wakeup
    0 references
    size of advice
    0 references
    message complexity
    0 references
    network
    0 references
    graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers