Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 50 results in range #51 to #100.
- Selfish Routing with Oblivious Users: Label: en
- Optimal Conclusive Sets for Comparator Networks: Label: en
- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents: Label: en
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots: Label: en
- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions: Label: en
- Rapid Almost-Complete Broadcasting in Faulty Networks: Label: en
- Edge Fault-Diameter of Cartesian Product of Graphs: Label: en
- Location Oblivious Distributed Unit Disk Graph Coloring: Label: en
- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers: Label: en
- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs: Label: en
- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots: Label: en
- Swing Words to Make Circle Formation Quiescent: Label: en
- Optimal Moves for Gossiping Among Mobile Agents: Label: en
- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs: Label: en
- A Simple Optimistic Skiplist Algorithm: Label: en
- Labeling Schemes with Queries: Label: en
- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives: Label: en
- From Renaming to Set Agreement: Label: en
- Graph Searching with Advice: Label: en
- Why Robots Need Maps: Label: en
- Fast Periodic Graph Exploration with Constant Memory: Label: en
- Treewidth: Structure and Algorithms: Label: en
- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract): Label: en
- The Value of Information in Selfish Routing: Label: en
- Network Creation Games with Local Information and Edge Swaps: Label: en
- Multi-winner Election Control via Social Influence: Label: en
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs: Label: en
- Communication Complexity of Wait-Free Computability in Dynamic Networks: Label: en
- Distributed Testing of Distance-k Colorings: Label: en
- Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions: Label: en
- The Power of Global Knowledge on Self-stabilizing Population Protocols: Label: en
- Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents: Label: en
- Cops and Robbers on Dynamic Graphs: Offline and Online Case: Label: en
- Stateless Information Dissemination Algorithms: Label: en
- Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks: Label: en
- Exploration of Time-Varying Connected Graphs with Silent Agents: Label: en
- Non-strict Temporal Exploration: Label: en
- Random Walks on Randomly Evolving Graphs: Label: en
- Guarding a Polygon Without Losing Touch: Label: en
- Improved Lower Bounds for Shoreline Search: Label: en
- Local Gathering of Mobile Robots in Three Dimensions: Label: en
- ANTS on a Plane: Label: en
- Resource Burning for Permissionless Systems (Invited Paper): Label: en
- Network Decomposition and Distributed Derandomization (Invited Paper): Label: en
- Fast Deterministic Distributed Algorithms for Sparse Spanners: Label: en
- Election in the Qualitative World: Label: en
- Distributed Chasing of Network Intruders: Label: en
- Setting Port Numbers for Fast Graph Exploration: Label: en
- How to Meet in Anonymous Network: Label: en
- Local Algorithms for Autonomous Robot Systems: Label: en