The epistemic gossip problem (Q1712508): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2018.10.041 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2902151307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem with Telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial gossiping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epistemic protocols for dynamic gossip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical broadcast and gossip networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of minimum gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cure for the Telephone Disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share knowledge by gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further gossip problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reordered gossip schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some minimum gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossip is synteny: Incomplete gossip and the syntenic distance between genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632576 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128872977 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2018.10.041 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:29, 11 December 2024

scientific article
Language Label Description Also known as
English
The epistemic gossip problem
scientific article

    Statements

    The epistemic gossip problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2019
    0 references
    communication protocol
    0 references
    epistemic logic
    0 references
    graph theory
    0 references

    Identifiers

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