The following pages link to Dominik Pająk (Q269496):
Displaying 31 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- (Q393044) (redirect page) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- On location hiding in distributed systems (Q1742768) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- On simple back-off in unreliable radio networks (Q2285148) (← links)
- Fast size approximation of a radio network in beeping model (Q2292914) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Collision-free network exploration (Q2396820) (← links)
- Time and space optimality of rotor-router graph exploration (Q2398496) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- Bounds on the Cover Time of Parallel Rotor Walks (Q2965489) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- Maximum Matching in Multi-Interface Networks (Q3167345) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← links)
- (Q4636644) (← links)
- (Q5091105) (← links)
- (Q5092353) (← links)
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (Q5167868) (← links)
- The multi-agent rotor-router on the ring (Q5176115) (← links)
- Fast Collaborative Graph Exploration (Q5327462) (← links)
- Collision-Free Network Exploration (Q5405053) (← links)
- Patrolling by Robots Equipped with Visibility (Q5496161) (← links)
- Evacuating Robots via Unknown Exit in a Disk (Q5498697) (← links)
- Tree exploration in dual-memory model (Q6584016) (← links)
