Search

Your search keyword '"Pelc, Andrzej"' showing total 1,192 results

Search Constraints

Start Over You searched for: Author "Pelc, Andrzej" Remove constraint Author: "Pelc, Andrzej"
1,192 results on '"Pelc, Andrzej"'

Search Results

101. Communication Complexity of Consensus in Anonymous Message Passing Systems

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

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

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

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

132. Waking Up Anonymous Ad Hoc Radio Networks

133. Asynchronous Deterministic Rendezvous in Graphs

135. Polynomial Deterministic Rendezvous in Arbitrary Graphs

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

146. Deterministic Rendezvous in Graphs

149. Transducers with Set Output

Catalog

Books, media, physical & digital resources