Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (Q5387786): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W1756362187 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.5442 / 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: 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: Asynchronous deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Meet in Anonymous Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934643 / rank
 
Normal rank

Latest revision as of 09:55, 28 June 2024

scientific article; zbMATH DE number 5279479
Language Label Description Also known as
English
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
scientific article; zbMATH DE number 5279479

    Statements

    Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (English)
    0 references
    0 references
    27 May 2008
    0 references
    design and analysis of algorithms
    0 references
    distributed computing
    0 references
    networks
    0 references
    rendezvous
    0 references
    strongly universal exploration sequences
    0 references

    Identifiers

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