Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2601068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114858735 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62398446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meeting times for independent Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collisions Among Random Walks on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences with backtracking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet in anonymous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Treasure Hunt and Better Strongly Universal Exploration Sequences / rank
 
Normal rank

Latest revision as of 18:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
scientific article

    Statements

    Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (English)
    0 references
    0 references
    0 references
    11 April 2016
    0 references
    mobile robots
    0 references
    rendezvous
    0 references
    treasure hunt
    0 references
    universal exploration sequences
    0 references
    universal traversal sequences
    0 references

    Identifiers

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