211 results on '"Pelc, Andrzej"'
Search Results
2. Deterministic Rendezvous Algorithms
3. Explorable Families of Graphs
4. Short Labeling Schemes for Topology Recognition in Wireless Tree Networks
5. Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
6. Broadcasting in Geometric Radio Networks
7. Deterministic Meeting of Sniffing Agents in the Plane
8. Asynchronous Broadcasting with Bivalent Beeps
9. Deterministic Rendezvous with Detection Using Beeps
10. Fast Rendezvous with Advice
11. Broadcasting in Geometric Radio Networks
12. Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
13. Fault-Tolerant Rendezvous in Networks
14. Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line
15. Local Decision and Verification with Bounded-Size Outputs
16. Learning a Ring Cheaply and Fast
17. Deterministic Polynomial Approach in the Plane
18. Use Knowledge to Learn Faster: Topology Recognition with Advice
19. Decidability Classes for Mobile Agents Computing
20. Electing a Leader in Multi-hop Radio Networks
21. Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
22. Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization
23. Knowledge, Level of Symmetry, and Time of Leader Election
24. Tree Exploration by a Swarm of Mobile Agents
25. Collecting Information by Power-Aware Mobile Agents
26. Why Do We Believe Theorems
27. Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs
28. Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs
29. DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results
30. Communication Complexity of Consensus in Anonymous Message Passing Systems
31. Efficient Distributed Communication in Ad-Hoc Radio Networks
32. Distributed Tree Comparison with Nodes of Limited Memory
33. How Much Memory Is Needed for Leader Election
34. Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
35. Drawing Maps with Advice
36. Asynchronous Deterministic Rendezvous in Bounded Terrains
37. Optimal Exploration of Terrains with Obstacles
38. Consensus and Mutual Exclusion in a Multiple Access Channel
39. Optimality and Competitiveness of Exploring Polygons by Mobile Robots
40. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
41. Impact of Information on the Complexity of Asynchronous Radio Broadcasting
42. Broadcasting in Geometric Radio Networks
43. Deterministic Rendezvous in Trees with Little Memory
44. Tree Exploration with an Oracle
45. Gathering Few Fat Mobile Robots in the Plane
46. Gathering Asynchronous Oblivious Mobile Robots in a Ring
47. Searching for a Black Hole in Tree Networks
48. Asynchronous Deterministic Rendezvous in Graphs
49. Waking Up Anonymous Ad Hoc Radio Networks
50. Collective Tree Exploration
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.