On the public citation graph

Logarithmic-Time Complete Visibility for Robots with Lights

0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11429647_16openalex-snapshot
Biangular Circle Formation by Asynchronous Mobile Robots
inferredcites →https://doi.org/10.1007/11603771_1openalex-snapshot
Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges
inferredcites →https://doi.org/10.1007/978-3-031-02008-7openalex-snapshot
Distributed Computing by Oblivious Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-319-03578-9_16openalex-snapshot
Rendezvous of Two Robots with Constant Memory
inferredcites →https://doi.org/10.1007/978-3-319-11764-5_11openalex-snapshot
Robots with Lights: Overcoming Obstructed Visibility Without Colliding
inferredcites →https://doi.org/10.1007/978-3-540-27796-5_8openalex-snapshot
Robot Convergence via Center-of-Gravity Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-49823-0_18openalex-snapshot
Circle Formation of Weak Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-540-69507-3_5openalex-snapshot
Distributed Models and Algorithms for Mobile Robot Systems
inferredcites →https://doi.org/10.1007/978-3-642-18381-2_15openalex-snapshot
Collisionless Gathering of Robots with an Extent
inferredcites →https://doi.org/10.1007/978-3-642-28073-3_8openalex-snapshot
Circle Formation by Asynchronous Fat Robots with Limited Visibility
inferredcites →https://doi.org/10.1007/978-3-642-29353-5_4openalex-snapshot
Gathering of Fat Robots with Limited Visibility and without Global Navigation
inferredcites →https://doi.org/10.1007/978-3-642-31104-8_27openalex-snapshot
Getting Close without Touching
inferredcites →https://doi.org/10.1007/978-3-642-45346-5_2openalex-snapshot
Autonomous Mobile Robots: A Distributed Computing Perspective
inferredcites →https://doi.org/10.1007/978-3-642-45346-5_21openalex-snapshot
Rendezvous of Two Robots with Visible Bits
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.050openalex-snapshot
Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
inferredcites →https://doi.org/10.1016/j.tcs.2008.10.005openalex-snapshot
Gathering few fat mobile robots in the plane
inferredcites →https://doi.org/10.1016/j.tcs.2010.01.037openalex-snapshot
Characterizing geometric patterns formable by oblivious anonymous mobile robots
inferredcites →https://doi.org/10.1109/icdcs.2012.71openalex-snapshot
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits
inferredcites →https://doi.org/10.1109/isic.1995.525098openalex-snapshot
Formation and agreement problems for synchronous mobile robots with limited visibility
inferredcites →https://doi.org/10.1109/tpds.2012.212openalex-snapshot
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots
inferredcites →https://doi.org/10.1137/060665257openalex-snapshot
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
inferredcites →https://doi.org/10.1137/s0097539704446475openalex-snapshot
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
inferredcites →https://doi.org/10.1145/1810479.1810523openalex-snapshot
A local O(n 2 ) gathering algorithm
inferredcites →https://doi.org/10.1145/1989493.1989515openalex-snapshot
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
inferredcites →https://doi.org/10.1145/2312005.2312009openalex-snapshot
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
inferredcites →https://doi.org/10.1145/2484239.2484266openalex-snapshot
A distributed algorithm for gathering many fat mobile robots in the plane
inferredcites →https://doi.org/10.1145/584490.584509openalex-snapshot
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
inferredcites →https://doi.org/10.2200/s00440ed1v01y201208dct010openalex-snapshot
Distributed Computing by Oblivious Mobile Robots

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_5openalex-snapshot
Complete Visibility for Oblivious Robots in $$\mathcal{O}(N)$$ Time
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_11openalex-snapshot
Robots with Lights
inferred← citeshttps://doi.org/10.1007/978-3-030-18126-0_13openalex-snapshot
Mutual Visibility by Robots with Persistent Memory
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_4openalex-snapshot
Optimum Algorithm for the Mutual Visibility Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_2openalex-snapshot
The Mutual Visibility Problem for Fat Robots
inferred← citeshttps://doi.org/10.1007/978-3-031-48882-5_4openalex-snapshot
Mutual Visibility with ASYNC Luminous Robots Having Inaccurate Movements
inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_25openalex-snapshot
Asynchronous Fault-Tolerant Mutual Visibility
inferred← citeshttps://doi.org/10.1007/978-3-319-19662-6_17openalex-snapshot
Computations by Luminous Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_15openalex-snapshot
Mutual Visibility with an Optimal Number of Colors
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_26openalex-snapshot
Complete Visibility for Robots with Lights in O(1) Time
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_18openalex-snapshot
Constant-Time Complete Visibility for Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_24openalex-snapshot
Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_15openalex-snapshot
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102161openalex-snapshot
Pattern formation for fat robots with lights
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102189openalex-snapshot
Pattern formation for fat robots with memory
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104699openalex-snapshot
On fast pattern formation by autonomous robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.033openalex-snapshot
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
inferred← citeshttps://doi.org/10.1063/5.0329975openalex-snapshot
Circle formation of fat mobile robots using memory
inferred← citeshttps://doi.org/10.1109/access.2020.2994052openalex-snapshot
Forming Sequences of Patterns With Luminous Robots
inferred← citeshttps://doi.org/10.1109/gcon58516.2023.10183479openalex-snapshot
Fault-tolerant Mutual Visibility for ASYNC Mobile Robots with Local Coordinate
inferred← citeshttps://doi.org/10.1109/icra.2018.8460899openalex-snapshot
How to Make Fat Autonomous Robots See all Others Fast?
inferred← citeshttps://doi.org/10.1109/ipdps.2017.51openalex-snapshot
O(log N)-Time Complete Visibility for Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00083openalex-snapshot
Complete Visitability for Autonomous Robots on Graphs
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00111openalex-snapshot
Optimal Convex Hull Formation on a Grid by Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00039openalex-snapshot
On Doorway Egress by Autonomous Robots
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.145openalex-snapshot
Complete Visibility for Mobile Agents with Lights Tolerating a Faulty Agent
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00130openalex-snapshot
Mutual Visibility for Robots with Lights Tolerating Light Faults
inferred← citeshttps://doi.org/10.1109/ipdpsw50202.2020.00103openalex-snapshot
Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.1109/tpds.2022.3158202openalex-snapshot
Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights
inferred← citeshttps://doi.org/10.1142/s0218195925500050openalex-snapshot
Shortest Paths of Mutually Visible Robots
inferred← citeshttps://doi.org/10.1145/3154273.3154319openalex-snapshot
The Complete Visibility Problem for Fat Robots with Lights
inferred← citeshttps://doi.org/10.1145/3288599.3288602openalex-snapshot
Sublinear-time mutual visibility for fat oblivious robots
inferred← citeshttps://doi.org/10.15803/ijnc.11.1_50openalex-snapshot
Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights
inferred← citeshttps://doi.org/10.15803/ijnc.8.1_32openalex-snapshot
Complete Visibility for Mobile Robots with Lights Tolerating Faults
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5809openalex-snapshot
Practical Considerations and Applications for Autonomous Robot Swarms
inferred← citeshttps://doi.org/10.3390/a14020056openalex-snapshot
Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.