Mathematical Foundations of Computer Science 2005
From MaRDI portal
(Redirected from Publication:5492864)
Mathematical Foundations of Computer Science 2005 (scientific article; zbMATH DE number 5065392)
Mathematical Foundations of Computer Science 2005 (scientific article; zbMATH DE number 5065392)
Recommendations
Cited in
(36)- On asynchronous rendezvous in general graphs
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Rendezvous of two robots with visible bits
- Asynchronous rendezvous with different maps
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Rendezvous in planar environments with obstacles and unknown initial distance
- Deterministic rendezvous with different maps
- Fast rendezvous on a cycle by agents with different speeds
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Price of asynchrony in mobile agents computing
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- Synchronous rendezvous for location-aware agents
- Asymptotically optimal deterministic rendezvous
- How to meet asynchronously (almost) everywhere
- Black hole search in directed graphs
- Rendezvous of mobile agents in directed graphs
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Asynchronous Deterministic Rendezvous on the Line
- Limit Set Reachability in Asynchronous Graph Dynamical Systems
- scientific article; zbMATH DE number 2102782 (Why is no real title available?)
- Self-stabilizing rendezvous of synchronous mobile agents in graphs
- Linear rendezvous with asymmetric clocks
- Deterministic Rendezvous in Restricted Graphs
- Random Node-Asynchronous Updates on Graphs
- How to meet asynchronously (almost) everywhere
- Rendezvous of distance-aware mobile agents in unknown graphs
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- Algorithms and Computation
- Deterministic rendezvous in graphs
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Uniform multi-agent deployment on a ring
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Title not available (Why is no real title available?)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- How to meet in anonymous network
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492864)
