The following pages link to Andrzej Pelc (Q235631):
Displaying 50 items.
- Fast gossiping with short unreliable messages (Q1339876) (← links)
- Minimum-time multidrop broadcast (Q1392528) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- (Q1575644) (redirect page) (← links)
- Power consumption in packet radio networks (Q1575645) (← links)
- Optimal broadcasting in faulty trees (Q1577006) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
- Explorable families of graphs (Q1713907) (← links)
- Use of information, memory and randomization in asynchronous gathering (Q1745729) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. (Q1773296) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Reaching a target in the plane with no information (Q1799599) (← links)
- Crooked diagrams with few slopes (Q1814184) (← links)
- The impact of information on broadcasting time in linear radio networks. (Q1853489) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Optimal deterministic broadcasting in known topology radio networks (Q1954200) (← links)
- Activating anonymous ad hoc radio networks (Q1954211) (← links)
- An optimal algorithm for broadcasting multiple messages in trees (Q1970213) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Optimal decision strategies in Byzantine environments (Q2369688) (← links)
- Broadcasting in UDG radio networks with missing and inaccurate information (Q2377136) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Deterministic rendezvous in graphs (Q2509029) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Broadcasting in unlabeled hypercubes with a linear number of messages. (Q2583557) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Orders with level diagrams (Q2640624) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- The Wakeup Problem in Synchronous Broadcast Systems (Q2719162) (← links)
- Fault-Tolerant Broadcasting in Radio Networks (Q2731601) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
