Deterministic network exploration by a single agent with Byzantine tokens (Q436569): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with logarithmic memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecemeal graph exploration by a mobile robot. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Agent Rendezvous in a Ring Using Faulty Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map construction of unknown graphs by multiple agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with little memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences with backtracking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934643 / rank
 
Normal rank

Latest revision as of 11:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Deterministic network exploration by a single agent with Byzantine tokens
scientific article

    Statements

    Deterministic network exploration by a single agent with Byzantine tokens (English)
    0 references
    0 references
    0 references
    25 July 2012
    0 references
    analysis of algorithms
    0 references
    deterministic algorithm
    0 references
    exploration
    0 references
    mobile agent
    0 references
    network
    0 references

    Identifiers