How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Rendezvous Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search on labeled networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rendezvous problem on discrete locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Rendezvous Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search when marks are left at the starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing anonymously with arbitrary knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Lower Bounds for Maze Threadability on Restricted Machines / 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: Tree exploration with little memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Rendezvous in Trees with Little Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delays Induce an Exponential Memory Gap for Rendezvous in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous Search on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences with backtracking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet in anonymous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Boolean functions on anonymous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Rendez-Vous with Limited Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Rendezvous on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the Intrinsic Equations of Twisted Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Your Kids When They Are Lost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818870 / rank
 
Normal rank

Latest revision as of 04:48, 6 July 2024

scientific article
Language Label Description Also known as
English
How to meet when you forget: log-space rendezvous in arbitrary graphs
scientific article

    Statements

    How to meet when you forget: log-space rendezvous in arbitrary graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    rendezvous
    0 references
    graph exploration
    0 references
    compact data structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references