The following pages link to Jurek Czyzowicz (Q203739):
Displayed 50 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Choosing the best among peers (Q441881) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Position discovery for a system of bouncing robots (Q498402) (← links)
- Localization for a system of colliding robots (Q498669) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Illuminating rectangles and triangles on the plane (Q757841) (← links)
- Drawing orders with few slopes (Q807654) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Equivalence of simple functions (Q880171) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Computing the throughput of concatenation state machines (Q954952) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Solution of Ulam's problem on binary search with two lies (Q1114408) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments (Q1128998) (← links)
- Separating convex sets in the plane (Q1184162) (← links)
- (Q1326751) (redirect page) (← links)
- Guarding rectangular art galleries (Q1326753) (← links)
- Searching with local constraints on error patterns (Q1329070) (← links)
- Separation of convex sets (Q1329792) (← links)
- Protecting convex sets (Q1343224) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Patrolling trees with mobile robots (Q1631946) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Broadcast with energy-exchanging mobile agents distributed on a tree (Q1713913) (← links)
- Priority evacuation from a disk using mobile robots (extended abstract) (Q1713933) (← links)
- Evacuation from a disc in the presence of a faulty robot (Q1742766) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Crooked diagrams with few slopes (Q1814184) (← links)
- Illuminating high-dimensional convex sets (Q1900056) (← 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)
- Convex tours of bounded curvature (Q1961381) (← links)
- Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- The bike sharing problem (Q2232233) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)