Exploration of High-Dimensional Grids by Finite State Machines (Q6492093): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-024-01207-6 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3796804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The return of the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of a pebble: Exploring and mapping directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the Problem of Searching on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless evacuation on \(m\) rays with \(k\) searchers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for semi-synchronous collaborative grid exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Search on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an Infinite Space with Finite Memory Scouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evacuating Robots via Unknown Exit in a Disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autonomous mobile robots with lights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many ants does it take to find the food? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the ANTS Problem with Asynchronous Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remembering without memory: tree exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for searching and exploration in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional cow search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs between selection complexity and performance when searching the plane without communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed algorithms in unlabeled tori and chordal rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cumulative Sums of Random Variables / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129247267 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-024-01207-6 / rank
 
Normal rank

Latest revision as of 19:50, 30 December 2024

scientific article; zbMATH DE number 7837708
Language Label Description Also known as
English
Exploration of High-Dimensional Grids by Finite State Machines
scientific article; zbMATH DE number 7837708

    Statements

    Exploration of High-Dimensional Grids by Finite State Machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 April 2024
    0 references

    Identifiers