Search on a Line by Byzantine Robots (Q6114825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054121500209 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054121500209 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119678299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring unknown environments with obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Search by a Pair of Distinct-Speed Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Son of the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet more 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: A General Framework for Searching on a Line / 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: Group Search on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search on a Line with Faulty Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with turn cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Despite Mischief / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Searching Robots, some Faulty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0129054121500209 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:35, 30 December 2024

scientific article; zbMATH DE number 7726936
Language Label Description Also known as
English
Search on a Line by Byzantine Robots
scientific article; zbMATH DE number 7726936

    Statements

    Search on a Line by Byzantine Robots (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2023
    0 references
    cow-path problem
    0 references
    parallel search
    0 references
    mobile robots
    0 references
    wireless communication
    0 references
    Byzantine faults
    0 references

    Identifiers

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