1,192 results on '"Pelc, Andrzej"'
Search Results
152. Strategies for Hotlink Assignments
153. Deterministic Broadcasting Time with Partial Knowledge of the Network
154. Efficient Communication in Unknown Networks
155. The Impact of Knowledge on Broadcasting Time in Radio Networks : (Extended Abstract)
156. Deterministic polynomial approach in the plane
157. Choosing the best among peers
158. Drawing maps with advice
159. Deterministic Meeting of Sniffing Agents in the Plane
160. Asynchronous Broadcasting with Bivalent Beeps
161. Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)
162. Same Game, New Tricks: What Makes a Good Strategy in the Prisoner's Dilemma?
163. Optimal fault-tolerant broadcasting in trees : Extended abstract
164. Optimal adaptive broadcasting with a bounded fraction of faulty nodes : Extended abstract
165. Power consumption in packet radio networks : Extended abstract
166. Approximate maxima finding of continuous functions under restricted budget (Extended abstract)
167. System diagnosis with smallest risk of error
168. Minimizing congestion of layouts for ATM networks with faulty links
169. Optimality and competitiveness of exploring polygons by mobile robots
170. Asynchronous deterministic rendezvous in bounded terrains
171. Fast deterministic simulation of computations on faulty parallel machines
172. Reliable minimum finding comparator networks
173. Fault-tolerant linear broadcasting
174. Time versus space trade-offs for rendezvous in trees
175. Leader election for anonymous asynchronous agents in arbitrary networks
176. Sparse networks supporting efficient reliable broadcasting
177. Deterministic Rendezvous with Detection Using Beeps
178. Fast Rendezvous with Advice
179. Broadcasting in Geometric Radio Networks
180. Fast radio broadcasting with advice
181. Remembering without memory: Tree exploration by asynchronous oblivious robots
182. Constant-Length Labeling Schemes for Deterministic Radio Broadcast
183. Gathering few fat mobile robots in the plane
184. Idempotent Ideals on Abelian Groups
185. Invariant Ideals and Borel Sets
186. Semiregular Invariant Measures on Abelian Groups
187. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
188. Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
189. Fault-Tolerant Rendezvous in Networks
190. Impact of knowledge on the cost of treasure hunt in trees
191. 2021 Edsger W. Dijkstra Prize in Distributed Computing
192. Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels
193. Four Shades of Deterministic Leader Election in Anonymous Networks
194. Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels
195. Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
196. How to meet when you forget: log-space rendezvous in arbitrary graphs
197. How much memory is needed for leader election
198. Trade-offs Between the Size of Advice and Broadcasting Time in Trees
199. Tree exploration with advice
200. Gathering asynchronous oblivious mobile robots in a ring
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.