Pages that link to "Item:Q2509029"

The following pages link to Deterministic rendezvous in graphs (Q2509029):

Displaying 50 items.

• Anonymous meeting in networks (Q262278) (← links)
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
• Uniform multi-agent deployment on a ring (Q627178) (← links)
• Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
• Fast rendezvous with advice (Q896137) (← links)
• Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
• Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
• How to meet in anonymous network (Q930910) (← links)
• Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
• On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
• Use of information, memory and randomization in asynchronous gathering (Q1745729) (← links)
• How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
• The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
• Two-agent tree evacuation (Q2117727) (← links)
• Byzantine gathering in polynomial time (Q2146872) (← links)
• Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
• Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
• Gathering on rings under the look-compute-move model (Q2256947) (← links)
• Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
• Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
• Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
• Deterministic polynomial approach in the plane (Q2353250) (← links)
• Distributed graph searching with a sense of direction (Q2355324) (← links)
• Byzantine gathering in networks (Q2359766) (← links)
• Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
• Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
• Rendezvous in networks in spite of delay faults (Q2629214) (← links)
• Price of asynchrony in mobile agents computing (Q2637351) (← links)
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences (Q2799477) (← links)
• Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
• Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
• Ten Open Problems in Rendezvous Search (Q2961406) (← links)
• Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
• Byzantine Gathering in Networks with Authenticated Whiteboards (Q2980903) (← links)
• Collisionless Gathering of Robots with an Extent (Q3075515) (← links)
• Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
• On the probability of rendezvous in graphs (Q4680409) (← links)
• (Q5002836) (← links)
• Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
• Gathering Anonymous, Oblivious Robots on a Grid (Q5056061) (← links)
• Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
• Beyond Rings: Gathering in 1-Interval Connected Graphs (Q5087065) (← links)
• Linear rendezvous with asymmetric clocks (Q5091103) (← links)
• Deterministic Rendezvous in Restricted Graphs (Q5175104) (← links)
• How to meet asynchronously at polynomial cost (Q5176086) (← links)
• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)