The following pages link to Andrzej Pelc (Q235631):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Anonymous meeting in networks (Q262278) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Drawing maps with advice (Q433400) (← links)
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- Choosing the best among peers (Q441881) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Fault-tolerant strategies in the iterated prisoner's dilemma (Q656583) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- Adaptive broadcasting with faulty nodes (Q671453) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Optimal graph exploration without good maps (Q703557) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Drawing orders with few slopes (Q807654) (← links)
- Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract) (Q826079) (← links)
- Broadcasting with locally bounded byzantine faults (Q835004) (← links)
- Fault-tolerant sequential scan (Q841615) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q868959) (← links)
- Efficient exploration of faulty trees (Q870447) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Broadcasting in geometric radio networks (Q924558) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Tree exploration with advice (Q958304) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Acknowledged broadcasting in ad hoc radio networks (Q975548) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Lie patterns in search procedures (Q1090470) (← links)
- Solution of Ulam's problem on searching with a lie (Q1090471) (← links)
- Prefix search with a lie (Q1102755) (← links)
- Solution of Ulam's problem on binary search with two lies (Q1114408) (← links)
- Searching with known error probability (Q1115619) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- Weakly adaptive comparison searching (Q1124340) (← links)
- Broadcasting in complete networks with faulty nodes using unreliable calls (Q1183465) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Approximate maxima finding of continuous functions under restricted budget (Q1274326) (← links)
- System diagnosis with smallest risk of error (Q1274327) (← links)
- Optimal coteries and voting schemes (Q1328755) (← links)
- Searching with local constraints on error patterns (Q1329070) (← links)
- Finding a target subnetwork in sparse networks with random faults (Q1334631) (← links)
