1,192 results on '"Pelc, Andrzej"'
Search Results
102. DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results
103. Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs
104. Efficient Distributed Communication in Ad-Hoc Radio Networks
105. How Much Memory Is Needed for Leader Election
106. Drawing Maps with Advice
107. Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
108. Distributed Tree Comparison with Nodes of Limited Memory
109. Price of asynchrony in mobile agents computing
110. Consensus and Mutual Exclusion in a Multiple Access Channel
111. Optimality and Competitiveness of Exploring Polygons by Mobile Robots
112. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
113. Broadcasting in Geometric Radio Networks : 2001; Dessmark, Pelc 2001; Dessmark, Pelc
114. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
115. Fast Radio Broadcasting with Advice
116. Impact of Information on the Complexity of Asynchronous Radio Broadcasting
117. Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
118. Deterministic Rendezvous in Trees with Little Memory
119. Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
120. Short Labeling Schemes for Topology Recognition in Wireless Tree Networks
121. Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
122. Communication in Networks with Random Dependent Faults
123. Distributed Computing with Advice: Information Sensitivity of Graph Coloring
124. Fast Adaptive Diagnosis with a Minimum Number of Tests
125. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
126. Gathering Few Fat Mobile Robots in the Plane
127. Gathering Asynchronous Oblivious Mobile Robots in a Ring
128. Tree Exploration with an Oracle
129. Rendezvous in networks in spite of delay faults
130. Time versus cost tradeoffs for deterministic rendezvous in networks
131. Anonymous Meeting in Networks
132. Waking Up Anonymous Ad Hoc Radio Networks
133. Asynchronous Deterministic Rendezvous in Graphs
134. Searching for a Black Hole in Tree Networks
135. Polynomial Deterministic Rendezvous in Arbitrary Graphs
136. Deterministic Leader Election in Anonymous Radio Networks
137. Graph Exploration by a Finite Automaton
138. Deterministic M2M Multicast in Radio Networks
139. Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks
140. Optimal Decision Strategies in Byzantine Environments
141. Collective Tree Exploration
142. Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
143. Worst-case optimal exploration of terrains with obstacles
144. Randomized Algorithms for Determining the Majority on Graphs
145. Prime Decompositions of Regular Prefix Codes
146. Deterministic Rendezvous in Graphs
147. Faster Deterministic Broadcasting in Ad Hoc Radio Networks
148. Optimal Graph Exploration without Good Maps
149. Transducers with Set Output
150. Deterministic Radio Broadcasting at Low Cost
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.