On the public citation graph
O(log N)-Time Complete Visibility for Asynchronous Robots with Lights
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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-319-11764-5_11openalex-snapshot
Robots with Lights: Overcoming Obstructed Visibility Without Colliding
inferredcites →https://doi.org/10.1007/978-3-319-28472-9_15openalex-snapshot
Mutual Visibility with an Optimal Number of Colors
inferredcites →https://doi.org/10.1007/978-3-319-49259-9_26openalex-snapshot
Complete Visibility for Robots with Lights in O(1) Time
inferredcites →https://doi.org/10.1007/978-3-642-16023-3_27openalex-snapshot
Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility
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/s00446-015-0248-5openalex-snapshot
Getting close without touching: near-gathering for autonomous mobile robots
inferredcites →https://doi.org/10.1016/j.ic.2016.09.005openalex-snapshot
Mutual visibility by luminous robots without collisions
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.007openalex-snapshot
Local spreading algorithms for autonomous robot systems
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.1016/j.tcs.2015.09.018openalex-snapshot
Autonomous mobile robots with lights
inferredcites →https://doi.org/10.1109/ipdps.2015.52openalex-snapshot
Logarithmic-Time Complete Visibility for Robots with Lights
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.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.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-03232-6_14openalex-snapshot
On Fast Pattern Formation by Autonomous Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_21openalex-snapshot
Uniform Circle Formation for Swarms of Opaque Robots with Lights
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-14094-6_6openalex-snapshot
Mutual Visibility by Asynchronous Robots on Infinite Grid
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_8openalex-snapshot
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
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-030-62401-9_8openalex-snapshot
Asynchronous Filling by Myopic Luminous Robots
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.1109/access.2020.2994052openalex-snapshot
Forming Sequences of Patterns With Luminous Robots
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/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.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.22215/etd/2022-15176openalex-snapshot
Connected Line Recovery and Maintenance by Programmable Matter
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
inferred← citeshttps://doi.org/10.3390/app13137991openalex-snapshot
Uniform Circle Formation for Fully, Semi-, and Asynchronous Opaque Robots with Lights
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.