On the public citation graph
Gathering Despite Mischief
0 signed · 117 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.1002/nav.10011openalex-snapshot
Rendezvous search on labeled networks
inferredcites →https://doi.org/10.1002/nav.1044openalex-snapshot
Rendezvous search when marks are left at the starting points
inferredcites →https://doi.org/10.1002/net.21453openalex-snapshot
Deterministic rendezvous in networks: A comprehensive survey
inferredcites →https://doi.org/10.1007/3-540-61440-0_163openalex-snapshot
Agent rendezvous: A dynamic symmetry-breaking problem
inferredcites →https://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_17openalex-snapshot
Deterministic Rendezvous in Trees with Little Memory
inferredcites →https://doi.org/10.1007/978-3-642-17653-1_10openalex-snapshot
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
inferredcites →https://doi.org/10.1007/978-3-642-29344-3_31openalex-snapshot
Decidability Classes for Mobile Agents Computing
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
inferredcites →https://doi.org/10.1007/s00446-011-0141-9openalex-snapshot
How to meet when you forget: log-space rendezvous in arbitrary graphs
inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/j.ipl.2004.10.007openalex-snapshot
Broadcasting with locally bounded Byzantine faults
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.001openalex-snapshot
Gathering of asynchronous robots with limited visibility
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.016openalex-snapshot
Asynchronous deterministic rendezvous in graphs
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferredcites →https://doi.org/10.1017/s0021900200028011openalex-snapshot
The rendezvous problem on discrete locations
inferredcites →https://doi.org/10.1057/jors.1992.89openalex-snapshot
Finding Your Kids When They Are Lost
inferredcites →https://doi.org/10.1109/icdcs.2003.1203510openalex-snapshot
Mobile agent rendezvous in a ring
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/050645221openalex-snapshot
Fault-Tolerant Gathering Algorithms for Autonomous 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/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/100796534openalex-snapshot
Distributed Computing by Mobile Robots: Gathering
inferredcites →https://doi.org/10.1137/s0097539704446475openalex-snapshot
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
inferredcites →https://doi.org/10.1137/s0363012993249195openalex-snapshot
The Rendezvous Search Problem
inferredcites →https://doi.org/10.1137/s036301299427816xopenalex-snapshot
Minimax Rendezvous on the Line
inferredcites →https://doi.org/10.1137/s0363012996314130openalex-snapshot
Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
inferredcites →https://doi.org/10.1142/s0129626406002496openalex-snapshot
VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS
inferredcites →https://doi.org/10.1145/1294261.1294268openalex-snapshot
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
inferredcites →https://doi.org/10.1145/1294261.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/2332432.2332492openalex-snapshot
Byzantine broadcast in point-to-point networks using local linear coding
inferredcites →https://doi.org/10.1145/2438645.2438649openalex-snapshot
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
inferredcites →https://doi.org/10.1145/276884.276925openalex-snapshot
Asymmetric rendezvous on the plane
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion
inferredcites →https://doi.org/10.1287/opre.49.1.107.11191openalex-snapshot
Two Dimensional Rendezvous Search
inferredcites →https://doi.org/10.5555/1283383.1283448openalex-snapshot
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6123openalex-snapshot
Forgive and forget: Self‐stabilizing swarms in spite of Byzantine robots
inferred← citeshttps://doi.org/10.1002/cpe.8055openalex-snapshot
Fast gathering despite a linear number of weakly Byzantine agents†
inferred← citeshttps://doi.org/10.1002/net.21810openalex-snapshot
Deterministic gathering with crash faults
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_30openalex-snapshot
Gathering in the Plane of Location-Aware Robots in the Presence of Spies
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_6openalex-snapshot
Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_14openalex-snapshot
Gathering of Robots in a Grid with Mobile Faults
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_16openalex-snapshot
Graph Explorations with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_17openalex-snapshot
Deterministic Rendezvous Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_2openalex-snapshot
Moving and Computing Models: Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-34405-4_1openalex-snapshot
Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range
inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_9openalex-snapshot
Better Upper Bounds for Searching on a Line with Byzantine Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-62401-9_10openalex-snapshot
Fast Byzantine Gathering with Visibility in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-62401-9_11openalex-snapshot
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_6openalex-snapshot
Explicit Token-Based Communication for Mobile Entities
inferred← citeshttps://doi.org/10.1007/978-3-032-35251-4_35openalex-snapshot
An Event-Based Causality Model for Mobile Multiagent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_13openalex-snapshot
Byzantine Gathering in Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_16openalex-snapshot
Mobile Agents Rendezvous in Spite of a Malicious Agent
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_9openalex-snapshot
Byzantine Gathering in Networks with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_2openalex-snapshot
Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_10openalex-snapshot
Evacuation from a Disc in the Presence of a Faulty Robot
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_6openalex-snapshot
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_30openalex-snapshot
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
inferred← citeshttps://doi.org/10.1007/s00446-015-0259-2openalex-snapshot
Rendezvous in networks in spite of delay faults
inferred← citeshttps://doi.org/10.1007/s00446-016-0276-9openalex-snapshot
Byzantine gathering in networks
inferred← citeshttps://doi.org/10.1007/s00446-017-0293-3openalex-snapshot
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
inferred← citeshttps://doi.org/10.1007/s00446-017-0296-0openalex-snapshot
Search on a line with faulty robots
inferred← citeshttps://doi.org/10.1007/s00446-018-0338-2openalex-snapshot
Asynchronous approach in the plane: a deterministic polynomial algorithm
inferred← citeshttps://doi.org/10.1007/s00446-018-0345-3openalex-snapshot
The topology of look-compute-move robot wait-free algorithms with hard termination
inferred← citeshttps://doi.org/10.1007/s00446-022-00419-9openalex-snapshot
Byzantine gathering in polynomial time
inferred← citeshttps://doi.org/10.1007/s00453-015-9982-0openalex-snapshot
Anonymous Meeting in Networks
inferred← citeshttps://doi.org/10.1007/s00453-016-0233-9openalex-snapshot
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
inferred← citeshttps://doi.org/10.1007/s00453-023-01122-2openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.012openalex-snapshot
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.10.005openalex-snapshot
Use of information, memory and randomization in asynchronous gathering
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.06.001openalex-snapshot
Deterministic rendezvous with different maps
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.04.003openalex-snapshot
Exploration of dynamic networks: Tight bounds on the number of agents
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.04.003openalex-snapshot
Decidability classes for mobile agents computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.032openalex-snapshot
A really simple approximation of smallest grammar
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.002openalex-snapshot
Gathering of robots in a ring with mobile faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.029openalex-snapshot
Group search of the plane with faulty robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.034openalex-snapshot
Gathering in the plane of location-aware robots in the presence of spies
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.008openalex-snapshot
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114162openalex-snapshot
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114892openalex-snapshot
A further study on weak Byzantine gathering of mobile agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115553openalex-snapshot
Optimal gathering of robots in anonymous butterfly networks via leader election
inferred← citeshttps://doi.org/10.1109/candarw57323.2022.00067openalex-snapshot
Gathering despite a linear number of weakly Byzantine agents
inferred← citeshttps://doi.org/10.1109/icdcs63083.2025.00042openalex-snapshot
Exploring Dangerous Graphs with Byzantine Companions
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00103openalex-snapshot
Byzantine Dispersion on Graphs
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00015openalex-snapshot
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
inferred← citeshttps://doi.org/10.1137/20m1362899openalex-snapshot
Want to Gather? No Need to Chatter!
inferred← citeshttps://doi.org/10.1142/s0129054121500209openalex-snapshot
Search on a Line by Byzantine Robots
inferred← citeshttps://doi.org/10.1142/s1793830922500306openalex-snapshot
Optimal rendezvous on a line by location-aware robots in the presence of spies*
inferred← citeshttps://doi.org/10.1145/2484239.2484245openalex-snapshot
How to meet asynchronously at polynomial cost
inferred← citeshttps://doi.org/10.1145/2933057.2933102openalex-snapshot
Search on a Line with Faulty Robots
inferred← citeshttps://doi.org/10.1145/3154273.3154322openalex-snapshot
Gathering of Opaque Robots in 3D Space
inferred← citeshttps://doi.org/10.1145/3427796.3427799openalex-snapshot
Gathering with a strong team in weakly Byzantine environments
inferred← citeshttps://doi.org/10.1145/3631461.3631551openalex-snapshot
A Further Study on Weak Byzantine Gathering of Mobile Agents
inferred← citeshttps://doi.org/10.1145/3631461.3632310openalex-snapshot
Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
inferred← citeshttps://doi.org/10.1145/3700838.3700869openalex-snapshot
Black Hole Search in Dynamic Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0008openalex-snapshot
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.1587/transinf.2019edp7311openalex-snapshot
Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.1587/transinf.2021fcp0011openalex-snapshot
Weakly Byzantine Gathering with a Strong Team
inferred← citeshttps://doi.org/10.18130/v38v1sopenalex-snapshot
Guaranteeing Rendezvous of Mobile Agents Despite Noise
inferred← citeshttps://doi.org/10.22215/etd/2021-14519openalex-snapshot
Search and Rendezvous by Mobile Robots in Continuous Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0321openalex-snapshot
Anonymous Meeting in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7119openalex-snapshot
How to Meet Asynchronously at Polynomial Cost
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4772openalex-snapshot
Mobile Agents Rendezvous in spite of a Malicious Agent
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01623openalex-snapshot
Byzantine Gathering in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1709.00877openalex-snapshot
Crash tolerant gathering on grid by asynchronous oblivious robots
inferred← citeshttps://doi.org/10.48550/arxiv.1810.03120openalex-snapshot
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06420openalex-snapshot
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00880openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.70675/0920326ez9dd5z4d4bz983dz84d910d3fdb7openalex-snapshot
On the Deterministic Gathering of Mobile Agents
inferred← citeshttps://doi.org/10.70675/f1e1175fz2135z4a7bzba8cz07bb8651babfopenalex-snapshot
Graceful Degradation and Speculation for Robots in Highly Dynamic Environments
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.