Andrzej Pelc - RankMe

418 papers A* 27A 28B 63C 7Misc 5Journal 266Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Exploration of convex terrains by a deterministic automaton with pebbles. Theor. Comput. Sci. Mohamed Anouar Baaziz, Andrzej Pelc
2026	J	`jnl`	Exploring wedges of an oriented grid by an automaton with pebbles. J. Comput. Syst. Sci. Subhash Bhagat, Andrzej Pelc
2026	J	`jnl`	Gathering teams of bounded memory agents on a line. Distributed Comput. Younan Gao, Andrzej Pelc
2025	A	`conf`	Approach of Agents with Restricted Fuel Tanks. DISC Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, Grzegorz Stachowiak
2025	A	`conf`	Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. DISC Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc
2025	Misc	`conf`	Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. ICDCN Subhash Bhagat, Andrzej Pelc
2025	B	`conf`	Exploration of Convex Terrains by a Deterministic Automaton with Pebbles. SIROCCO Mohamed Anouar Baaziz, Andrzej Pelc
2025	J	`jnl`	Fast deterministic rendezvous in labeled lines. Distributed Comput. Avery Miller, Andrzej Pelc
2025	J	`jnl`	Gathering Teams of Bounded Memory Agents on a Line. CoRR Younan Gao, Andrzej Pelc
2025	J	`jnl`	Impact of Knowledge on the Cost of Treasure Hunt in Trees. CoRR Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
2025	B	`conf`	Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. OPODIS Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc
2025	J	`jnl`	Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid. Theor. Comput. Sci. Younan Gao, Andrzej Pelc
2024	J	`jnl`	Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR Subhash Bhagat, Andrzej Pelc
2024	J	`jnl`	Deterministic rendezvous in infinite trees. Theor. Comput. Sci. Subhash Bhagat, Andrzej Pelc
2024	J	`jnl`	Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Inf. Process. Lett. Debasish Pattanayak, Andrzej Pelc
2024	B	`conf`	Gathering Teams of Deterministic Finite Automata on a Line. OPODIS Younan Gao, Andrzej Pelc
2024	J	`jnl`	Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. Debasish Pattanayak, Andrzej Pelc
2024	J	`jnl`	Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. CoRR Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc
2024	J	`jnl`	Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid. CoRR Younan Gao, Andrzej Pelc
2023	J	`jnl`	Almost Universal Anonymous Rendezvous in the Plane. Algorithmica Yoann Dieudonné, Andrzej Pelc, Franck Petit
2023	J	`jnl`	Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2023	J	`jnl`	Computing Functions by Teams of Deterministic Finite Automata. CoRR Debasish Pattanayak, Andrzej Pelc
2023	J	`jnl`	Deterministic Rendezvous Algorithms. CoRR Andrzej Pelc
2023	J	`jnl`	Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs. CoRR Debasish Pattanayak, Andrzej Pelc
2023	J	`jnl`	Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
2023	J	`jnl`	Explorable families of graphs. CoRR Andrzej Pelc
2023	J	`jnl`	Exploring Wedges of an Oriented Grid by an Automaton with Pebbles. CoRR Subhash Bhagat, Andrzej Pelc
2023	A	`conf`	Fast Deterministic Rendezvous in Labeled Lines. DISC Avery Miller, Andrzej Pelc
2023	J	`jnl`	Fast Deterministic Rendezvous in Labeled Lines. CoRR Avery Miller, Andrzej Pelc
2023	J	`jnl`	Four shades of deterministic leader election in anonymous networks. Distributed Comput. Barun Gorain, Avery Miller, Andrzej Pelc
2023	J	`jnl`	Want to Gather? No Need to Chatter! SIAM J. Comput. Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
2022	J	`jnl`	Deterministic Leader Election in Anonymous Radio Networks. ACM Trans. Algorithms Avery Miller, Andrzej Pelc, Ram Narayan Yadav
2022	J	`jnl`	Deterministic Rendezvous in Infinite Trees. CoRR Subhash Bhagat, Andrzej Pelc
2022	A	`conf`	How to Meet at a Node of Any Connected Graph. DISC Subhash Bhagat, Andrzej Pelc
2022	J	`jnl`	Impact of knowledge on the cost of treasure hunt in trees. Networks Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
2021	A*	`conf`	2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021	J	`jnl`	Advice complexity of treasure hunt in geometric terrains. Inf. Comput. Andrzej Pelc, Ram Narayan Yadav
2021	A*	`conf`	Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2021	J	`jnl`	Building a Nest by an Automaton. Algorithmica Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
2021	J	`jnl`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2021	B	`conf`	Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. SPAA Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
2021	A	`conf`	Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. DISC Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
2021	J	`jnl`	Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. CoRR Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
2021	J	`jnl`	Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. Barun Gorain, Andrzej Pelc
2021	B	`conf`	Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA Barun Gorain, Avery Miller, Andrzej Pelc
2021	J	`jnl`	Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. Barun Gorain, Andrzej Pelc
2020	B	`conf`	Almost Universal Anonymous Rendezvous in the Plane. SPAA Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2020	J	`jnl`	Almost Universal Anonymous Rendezvous in the Plane. CoRR Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2020	J	`jnl`	Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2020	J	`jnl`	Deciding and verifying network properties locally with few output bits. Distributed Comput. Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
2020	B	`conf`	Deterministic Leader Election in Anonymous Radio Networks. SPAA Avery Miller, Andrzej Pelc, Ram Narayan Yadav
2020	J	`jnl`	Deterministic Leader Election in Anonymous Radio Networks. CoRR Avery Miller, Andrzej Pelc, Ram Narayan Yadav
2020	J	`jnl`	Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2020	J	`jnl`	Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2020	J	`jnl`	Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR Barun Gorain, Avery Miller, Andrzej Pelc
2020	J	`jnl`	Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. Theor. Comput. Sci. Kokouvi Hounkanli, Avery Miller, Andrzej Pelc
2020	Misc	`conf`	Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. ICDCN Andrzej Pelc, Ram Narayan Yadav
2020	A*	`conf`	Want to Gather? No Need to Chatter! PODC Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
2019	A	`conf`	Building a Nest by an Automaton. ESA Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
2019	J	`jnl`	Building a Nest by an Automaton. CoRR Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
2019	B	`conf`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2019	J	`jnl`	Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. CoRR Andrzej Pelc, Ram Narayan Yadav
2019	J	`jnl`	Deterministic Graph Exploration with Advice. ACM Trans. Algorithms Barun Gorain, Andrzej Pelc
2019	—	`ch.`	Deterministic Rendezvous Algorithms. Distributed Computing by Mobile Entities Andrzej Pelc
2019	J	`jnl`	Impact of Knowledge on Election Time in Anonymous Networks. Algorithmica Yoann Dieudonné, Andrzej Pelc
2019	B	`conf`	Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. SPAA Andrzej Pelc, Ram Narayan Yadav
2019	J	`jnl`	Want to Gather? No Need to Chatter! CoRR Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
2018	J	`jnl`	Deterministic Computations on a PRAM with Static Processor and Memory Faults. CoRR Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
2018	J	`jnl`	Deterministic Meeting of Sniffing Agents in the Plane. Fundam. Informaticae Samir Elouasbi, Andrzej Pelc
2018	B	`conf`	Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2018	J	`jnl`	Deterministic gathering with crash faults. Networks Andrzej Pelc
2018	B	`conf`	Explorable Families of Graphs. SIROCCO Andrzej Pelc
2018	Misc	`conf`	Finding the Size of a Radio Network with Short Labels. ICDCN Barun Gorain, Andrzej Pelc
2018	J	`jnl`	Information Complexity of Treasure Hunt in Geometric Terrains. CoRR Andrzej Pelc, Ram Narayan Yadav
2018	J	`jnl`	Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. CoRR Andrzej Pelc, Ram Narayan Yadav
2018	J	`jnl`	On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2018	J	`jnl`	Reaching a target in the plane with no information. Inf. Process. Lett. Andrzej Pelc
2018	J	`jnl`	Use of information, memory and randomization in asynchronous gathering. J. Comput. Syst. Sci. Andrzej Pelc
2018	J	`jnl`	Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. CoRR Andrzej Pelc, Ram Narayan Yadav
2017	J	`jnl`	Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
2017	J	`jnl`	Decidability classes for mobile agents computing. J. Parallel Distributed Comput. Pierre Fraigniaud, Andrzej Pelc
2017	J	`jnl`	Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$. CoRR Avery Miller, Andrzej Pelc
2017	J	`jnl`	Deterministic Gathering with Crash Faults. CoRR Andrzej Pelc
2017	A*	`conf`	Deterministic Graph Exploration with Advice. ICALP Barun Gorain, Andrzej Pelc
2017	J	`jnl`	Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
2017	J	`jnl`	Deterministic Rendezvous with Detection Using Beeps. Int. J. Found. Comput. Sci. Samir Elouasbi, Andrzej Pelc
2017	J	`jnl`	Deterministic distributed construction of T-dominating sets in time T. Discret. Appl. Math. Avery Miller, Andrzej Pelc
2017	J	`jnl`	Deterministic meeting of sniffing agents in the plane. CoRR Samir Elouasbi, Andrzej Pelc
2017	J	`jnl`	Deterministic rendezvous with detection using beeps. CoRR Samir Elouasbi, Andrzej Pelc
2017	J	`jnl`	Finding the Size of a Radio Network with Short Labels. CoRR Barun Gorain, Andrzej Pelc
2017	B	`conf`	Impact of Knowledge on Election Time in Anonymous Networks. SPAA Yoann Dieudonné, Andrzej Pelc
2017	J	`jnl`	Leader Election in Trees with Customized Advice. CoRR Barun Gorain, Andrzej Pelc
2017	J	`jnl`	Reaching a Target in the Plane with no Information. CoRR Andrzej Pelc
2017	B	`conf`	Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO Barun Gorain, Andrzej Pelc
2017	J	`jnl`	Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. CoRR Barun Gorain, Andrzej Pelc
2017	J	`jnl`	Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015). Inf. Comput. Andrzej Pelc, Alexander A. Schwarzmann
2017	J	`jnl`	Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms Christian Glacet, Avery Miller, Andrzej Pelc
2017	J	`jnl`	Use of Information, Memory and Randomization in Asynchronous Gathering. CoRR Andrzej Pelc
2016	J	`jnl`	Anonymous Meeting in Networks. Algorithmica Yoann Dieudonné, Andrzej Pelc
2016	B	`conf`	Asynchronous Broadcasting with Bivalent Beeps. SIROCCO Kokouvi Hounkanli, Andrzej Pelc
2016	J	`jnl`	Asynchronous Broadcasting with Bivalent Beeps. CoRR Kokouvi Hounkanli, Andrzej Pelc
2016	—	`ch.`	Broadcasting in Geometric Radio Networks. Encyclopedia of Algorithms Andrzej Pelc
2016	J	`jnl`	Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2016	J	`jnl`	Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2016	J	`jnl`	Deterministic Graph Exploration with Advice. CoRR Barun Gorain, Andrzej Pelc
2016	B	`conf`	Deterministic Meeting of Sniffing Agents in the Plane. SIROCCO Samir Elouasbi, Andrzej Pelc
2016	B	`conf`	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? SPAA Avery Miller, Andrzej Pelc
2016	J	`jnl`	Exploration of Faulty Hamiltonian Graphs. CoRR David Caissy, Andrzej Pelc
2016	J	`jnl`	Exploration of Faulty Hamiltonian Graphs. Int. J. Found. Comput. Sci. David Caissy, Andrzej Pelc
2016	C	`conf`	Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. ALGOSENSORS Kokouvi Hounkanli, Avery Miller, Andrzej Pelc
2016	J	`jnl`	Impact of Knowledge on Election Time in Anonymous Networks. CoRR Yoann Dieudonné, Andrzej Pelc
2016	J	`jnl`	Rendezvous in networks in spite of delay faults. Distributed Comput. Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2016	J	`jnl`	Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Comput. Avery Miller, Andrzej Pelc
2016	A*	`conf`	Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. SODA Christian Glacet, Avery Miller, Andrzej Pelc
2016	J	`jnl`	Topology Recognition and Leader Election in Colored Networks. CoRR Dariusz Dereniowski, Andrzej Pelc
2016	J	`jnl`	Topology recognition and leader election in colored networks. Theor. Comput. Sci. Dariusz Dereniowski, Andrzej Pelc
2016	J	`jnl`	Topology recognition with advice. CoRR Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
2016	J	`jnl`	Topology recognition with advice. Inf. Comput. Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
2015	J	`jnl`	Communication Complexity of Consensus in Anonymous Message Passing Systems. Fundam. Informaticae Emanuele G. Fusco, Andrzej Pelc
2015	J	`jnl`	Deterministic Broadcasting and Gossiping with Beeps. CoRR Kokouvi Hounkanli, Andrzej Pelc
2015	C	`conf`	Deterministic Rendezvous with Detection Using Beeps. ALGOSENSORS Samir Elouasbi, Andrzej Pelc
2015	J	`jnl`	Deterministic polynomial approach in the plane. Distributed Comput. Yoann Dieudonné, Andrzej Pelc
2015	J	`jnl`	Fast rendezvous with advice. Theor. Comput. Sci. Avery Miller, Andrzej Pelc
2015	J	`jnl`	Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. CoRR Kokouvi Hounkanli, Avery Miller, Andrzej Pelc
2015	J	`jnl`	How to Meet Asynchronously at Polynomial Cost. SIAM J. Comput. Yoann Dieudonné, Andrzej Pelc, Vincent Villain
2015	J	`jnl`	Knowledge, Level of Symmetry, and Time of Leader Election. CoRR Emanuele G. Fusco, Andrzej Pelc
2015	J	`jnl`	Knowledge, level of symmetry, and time of leader election. Distributed Comput. Emanuele G. Fusco, Andrzej Pelc
2015	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings SSS Andrzej Pelc, Alexander A. Schwarzmann
2015	J	`jnl`	Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks. CoRR Avery Miller, Andrzej Pelc
2015	J	`jnl`	Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. CoRR Christian Glacet, Avery Miller, Andrzej Pelc
2015	J	`jnl`	Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt. CoRR Avery Miller, Andrzej Pelc
2015	J	`jnl`	Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distributed Comput. Avery Miller, Andrzej Pelc
2014	J	`jnl`	Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ACM Trans. Algorithms Yoann Dieudonné, Andrzej Pelc
2014	J	`jnl`	Efficient Grid Exploration with a stationary Token. Int. J. Found. Comput. Sci. Andrzej Pelc, Anas Tiane
2014	J	`jnl`	Election vs. Selection: Two Ways of Finding the Largest Node in a Graph. CoRR Avery Miller, Andrzej Pelc
2014	C	`conf`	Fast Rendezvous with Advice. ALGOSENSORS Avery Miller, Andrzej Pelc
2014	J	`jnl`	Fast Rendezvous with Advice. CoRR Avery Miller, Andrzej Pelc
2014	—	`conf`	Fault-Tolerant Rendezvous in Networks. ICALP (2) Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2014	J	`jnl`	Fault-Tolerant Rendezvous in Networks. CoRR Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2014	J	`jnl`	Gathering Despite Mischief. ACM Trans. Algorithms Yoann Dieudonné, Andrzej Pelc, David Peleg
2014	J	`jnl`	Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Comput. Dariusz Dereniowski, Andrzej Pelc
2014	J	`jnl`	Price of asynchrony in mobile agents computing. Theor. Comput. Sci. Yoann Dieudonné, Andrzej Pelc
2014	A*	`conf`	Time versus cost tradeoffs for deterministic rendezvous in networks. PODC Avery Miller, Andrzej Pelc
2014	J	`jnl`	Time versus space trade-offs for rendezvous in trees. Distributed Comput. Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2014	B	`conf`	Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt. OPODIS Avery Miller, Andrzej Pelc
2013	A*	`conf`	Anonymous Meeting in Networks. SODA Yoann Dieudonné, Andrzej Pelc
2013	J	`jnl`	Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2013	J	`jnl`	Delays Induce an Exponential Memory Gap for Rendezvous in Trees. ACM Trans. Algorithms Pierre Fraigniaud, Andrzej Pelc
2013	—	`conf`	Deterministic Polynomial Approach in the Plane. ICALP (2) Yoann Dieudonné, Andrzej Pelc
2013	J	`jnl`	Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2013	C	`conf`	Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line. SSS Samuel Guilbault, Andrzej Pelc
2013	J	`jnl`	Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. Samuel Guilbault, Andrzej Pelc
2013	J	`jnl`	How to Meet Asynchronously at Polynomial Cost CoRR Yoann Dieudonné, Andrzej Pelc, Vincent Villain
2013	A*	`conf`	How to meet asynchronously at polynomial cost. PODC Yoann Dieudonné, Andrzej Pelc, Vincent Villain
2013	J	`jnl`	Leader election in ad hoc radio networks: A keen ear helps. J. Comput. Syst. Sci. Dariusz R. Kowalski, Andrzej Pelc
2013	—	`conf`	Learning a Ring Cheaply and Fast. ICALP (2) Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
2013	C	`conf`	Local Decision and Verification with Bounded-Size Outputs. SSS Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc
2013	A	`conf`	Use Knowledge to Learn Faster: Topology Recognition with Advice. DISC Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
2013	J	`jnl`	Worst-case optimal exploration of terrains with obstacles. Inf. Comput. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2012	J	`jnl`	Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. SIGARCH Comput. Archit. News Marcos K. Aguilera, Dahlia Malkhi, Keith Marzullo, Alessandro Panconesi, Andrzej Pelc, Roger Wattenhofer
2012	J	`jnl`	Choosing the best among peers. Theor. Comput. Sci. Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
2012	A	`conf`	Collecting Information by Power-Aware Mobile Agents. DISC Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2012	B	`conf`	Decidability Classes for Mobile Agents Computing. LATIN Pierre Fraigniaud, Andrzej Pelc
2012	—	`conf`	Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ICALP (2) Yoann Dieudonné, Andrzej Pelc
2012	J	`jnl`	Deterministic network exploration by a single agent with Byzantine tokens. Inf. Process. Lett. Yoann Dieudonné, Andrzej Pelc
2012	J	`jnl`	Deterministic rendezvous in networks: A comprehensive survey. Networks Andrzej Pelc
2012	J	`jnl`	Distributed tree comparison with nodes of limited memory. Networks Emanuele G. Fusco, Andrzej Pelc
2012	J	`jnl`	Drawing maps with advice. J. Parallel Distributed Comput. Dariusz Dereniowski, Andrzej Pelc
2012	B	`conf`	Electing a Leader in Multi-hop Radio Networks. OPODIS Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc
2012	A*	`conf`	Gathering despite mischief. SODA Yoann Dieudonné, Andrzej Pelc, David Peleg
2012	J	`jnl`	How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel
2012	J	`jnl`	How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Comput. Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2012	A	`conf`	Knowledge, Level of Symmetry, and Time of Leader Election. ESA Emanuele G. Fusco, Andrzej Pelc
2012	J	`jnl`	Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks CoRR Dariusz Dereniowski, Andrzej Pelc
2012	B	`conf`	Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization. SIROCCO Samir Elouasbi, Andrzej Pelc
2012	B	`conf`	Time vs. space trade-offs for rendezvous in trees. SPAA Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2012	B	`conf`	Tree Exploration by a Swarm of Mobile Agents. OPODIS Jurek Czyzowicz, Andrzej Pelc, Mélanie Roy
2011	B	`conf`	Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. OPODIS Samuel Guilbault, Andrzej Pelc
2011	J	`jnl`	Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2011	B	`conf`	Communication Complexity of Consensus in Anonymous Message Passing Systems. OPODIS Emanuele G. Fusco, Andrzej Pelc
2011	J	`jnl`	Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE Trans. Parallel Distributed Syst. Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2011	A	`conf`	DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. DISC Andrzej Pelc
2011	J	`jnl`	Delays Induce an Exponential Memory Gap for Rendezvous in Trees CoRR Pierre Fraigniaud, Andrzej Pelc
2011	J	`jnl`	Deterministic gathering of anonymous agents in arbitrary networks CoRR Yoann Dieudonné, Andrzej Pelc
2011	—	`conf`	Efficient Distributed Communication in Ad-Hoc Radio Networks. ICALP (2) Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki
2011	B	`conf`	Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs. SIROCCO Samuel Guilbault, Andrzej Pelc
2011	J	`jnl`	How many oblivious robots can explore a line. Inf. Process. Lett. Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2011	J	`jnl`	How much memory is needed for leader election. Distributed Comput. Emanuele G. Fusco, Andrzej Pelc
2011	J	`jnl`	Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2011	J	`jnl`	Trade-offs Between the Size of Advice and Broadcasting Time in Trees. Algorithmica Emanuele G. Fusco, Andrzej Pelc
2011	J	`jnl`	Tree exploration with logarithmic memory. ACM Trans. Algorithms Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2010	B	`conf`	Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Asynchronous deterministic rendezvous in bounded terrains CoRR Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Broadcasting in UDG radio networks with missing and inaccurate information. Distributed Comput. Emanuele G. Fusco, Andrzej Pelc
2010	J	`jnl`	Communication algorithms with advice. J. Comput. Syst. Sci. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2010	J	`jnl`	Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. Ad Hoc Sens. Wirel. Networks Evangelos Kranakis, Michel Paquette, Andrzej Pelc
2010	J	`jnl`	Decidability Classes for Mobile Agents Computing CoRR Pierre Fraigniaud, Andrzej Pelc
2010	B	`conf`	Delays induce an exponential memory gap for rendezvous in trees. SPAA Pierre Fraigniaud, Andrzej Pelc
2010	B	`conf`	Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2010	B	`conf`	Distributed Tree Comparison with Nodes of Limited Memory. SIROCCO Emanuele G. Fusco, Andrzej Pelc
2010	A	`conf`	Drawing Maps with Advice. DISC Dariusz Dereniowski, Andrzej Pelc
2010	J	`jnl`	Fast radio broadcasting with advice. Theor. Comput. Sci. David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2010	J	`jnl`	Fault-tolerant strategies in the Iterated Prisoner's Dilemma. Inf. Process. Lett. Andrzej Pelc
2010	A	`conf`	How Much Memory Is Needed for Leader Election. DISC Emanuele G. Fusco, Andrzej Pelc
2010	A*	`conf`	How to Meet Asynchronously (Almost) Everywhere. SODA Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	How to meet asynchronously (almost) everywhere CoRR Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2010	A*	`conf`	How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
2010	J	`jnl`	Optimal Exploration of Terrains with Obstacles CoRR Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	—	`conf`	Optimal Exploration of Terrains with Obstacles. SWAT Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2010	J	`jnl`	The diameter and connectivity of networks with random dependent faults. Networks Evangelos Kranakis, Michel Paquette, Andrzej Pelc
2009	J	`jnl`	Broadcasting in UDG radio networks with unknown topology. Distributed Comput. Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2009	A	`conf`	Consensus and Mutual Exclusion in a Multiple Access Channel. DISC Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2009	J	`jnl`	Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2009	J	`jnl`	Fault-Tolerant Sequential Scan. Theory Comput. Syst. Paola Flocchini, Andrzej Pelc, Nicola Santoro
2009	J	`jnl`	Gathering few fat mobile robots in the plane. Theor. Comput. Sci. Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
2009	—	`conf`	Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. ICALP (2) Dariusz R. Kowalski, Andrzej Pelc
2009	A	`conf`	Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2008	J	`jnl`	Acknowledged broadcasting in ad hoc radio networks. Inf. Process. Lett. Emanuele G. Fusco, Andrzej Pelc
2008	—	`conf`	Algorithmic aspects of radio communication. DIALM-POMC Andrzej Pelc
2008	—	`ch.`	Broadcasting in Geometric Radio Networks. Encyclopedia of Algorithms Andrzej Pelc
2008	A	`conf`	Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. DISC Emanuele G. Fusco, Andrzej Pelc
2008	—	`conf`	Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. ADHOC-NOW Evangelos Kranakis, Michel Paquette, Andrzej Pelc
2008	A	`conf`	Deterministic Rendezvous in Trees with Little Memory. DISC Pierre Fraigniaud, Andrzej Pelc
2008	B	`conf`	Fast Radio Broadcasting with Advice. SIROCCO David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2008	J	`jnl`	Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. Ralf Klasing, Euripides Markou, Andrzej Pelc
2008	J	`jnl`	Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Informaticae David Ilcinkas, Andrzej Pelc
2008	B	`conf`	Impact of Information on the Complexity of Asynchronous Radio Broadcasting. OPODIS Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc
2008	J	`jnl`	Impact of memory size on graph exploration capability. Discret. Appl. Math. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008	B	`conf`	Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2008	J	`jnl`	Special issue on DISC 07. Distributed Comput. Andrzej Pelc
2008	B	`conf`	Trade-offs between the size of advice and broadcasting time in trees. SPAA Emanuele G. Fusco, Andrzej Pelc
2008	J	`jnl`	Tree exploration with advice. Inf. Comput. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2007	J	`jnl`	Activating anonymous ad hoc radio networks. Distributed Comput. Andrzej Pelc
2007	J	`jnl`	Assigning Bookmarks in Perfect Binary Trees. Ars Comb. Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Miguel Vargas Martin
2007	J	`jnl`	Broadcasting in geometric radio networks. J. Discrete Algorithms Anders Dessmark, Andrzej Pelc
2007	A*	`conf`	Broadcasting in udg radio networks with unknown topology. PODC Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2007	B	`conf`	Communication in Networks with Random Dependent Faults. MFCS Evangelos Kranakis, Michel Paquette, Andrzej Pelc
2007	B	`conf`	Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2007	A*	`conf`	Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2007	A	`ed.`	Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings DISC Andrzej Pelc
2007	J	`jnl`	Efficient Exploration of Faulty Trees. Theory Comput. Syst. Euripides Markou, Andrzej Pelc
2007	B	`conf`	Fast Adaptive Diagnosis with a Minimum Number of Tests. ISAAC Samuel Guilbault, Andrzej Pelc
2007	J	`jnl`	Feasibility and complexity of broadcasting with random transmission failures. Theor. Comput. Sci. Andrzej Pelc, David Peleg
2007	J	`jnl`	Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Comput. Dariusz R. Kowalski, Andrzej Pelc
2007	J	`jnl`	Preface. Theor. Comput. Sci. Andrzej Pelc, David Peleg, Michel Raynal
2007	J	`jnl`	Searching for a Black Hole in Synchronous Tree Networks. Comb. Probab. Comput. Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
2007	A*	`conf`	Tree exploration with logarithmic memory. SODA Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2006	J	`jnl`	Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
2006	J	`jnl`	Collective tree exploration. Networks Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2006	J	`jnl`	Complexity of Searching for a Black Hole. Fundam. Informaticae Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
2006	J	`jnl`	Deterministic M2M multicast in radio networks. Theor. Comput. Sci. Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
2006	J	`jnl`	Deterministic Rendezvous in Graphs. Algorithmica Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
2006	J	`jnl`	Exploring Planar Graphs Using Unoriented Maps. J. Interconnect. Networks Krzysztof Diks, Stefan Dobrev, Andrzej Pelc
2006	J	`jnl`	Fast Broadcasting with Byzantine Faults. Int. J. Found. Comput. Sci. Michel Paquette, Andrzej Pelc
2006	B	`conf`	Gathering Asynchronous Oblivious Mobile Robots in a Ring. ISAAC Ralf Klasing, Euripides Markou, Andrzej Pelc
2006	B	`conf`	Gathering Few Fat Mobile Robots in the Plane. OPODIS Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
2006	J	`jnl`	Labeling trees with a condition at distance two. Discret. Math. Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
2006	J	`jnl`	Optimal decision strategies in Byzantine environments. J. Parallel Distributed Comput. Michel Paquette, Andrzej Pelc
2006	A*	`conf`	Oracle size: a new measure of difficulty for communication tasks. PODC Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006	J	`jnl`	Randomized Algorithms for Determining the Majority on Graphs. Comb. Probab. Comput. Gianluca De Marco, Andrzej Pelc
2006	B	`conf`	Tree Exploration with an Oracle. MFCS Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006	J	`jnl`	Voting Mechanisms in Asynchronous Byzantine Environments. Parallel Process. Lett. Andrzej Pelc
2005	B	`conf`	Asynchronous Deterministic Rendezvous in Graphs. MFCS Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
2005	J	`jnl`	Broadcasting in undirected ad hoc radio networks. Distributed Comput. Dariusz R. Kowalski, Andrzej Pelc
2005	J	`jnl`	Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. Andrzej Pelc, David Peleg
2005	—	`book`	Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger
2005	A*	`conf`	Feasibility and complexity of broadcasting with random transmission failures. PODC Andrzej Pelc, David Peleg
2005	J	`jnl`	Graph exploration by a finite automaton. Theor. Comput. Sci. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005	B	`ed.`	Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings SIROCCO Andrzej Pelc, Michel Raynal
2005	J	`jnl`	Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. Dariusz R. Kowalski, Andrzej Pelc
2005	J	`jnl`	Transducers with Set Output. J. Autom. Lang. Comb. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
2005	A	`conf`	Waking Up Anonymous Ad Hoc Radio Networks. DISC Andrzej Pelc
2004	—	`conf`	Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. APPROX-RANDOM Dariusz R. Kowalski, Andrzej Pelc
2004	B	`conf`	Collective Tree Exploration. LATIN Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2004	A*	`conf`	Deterministic M2M Multicast in Radio Networks: (Extended Abstract). ICALP Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
2004	J	`jnl`	Distributed Colouring and Communication in Rings with Local Knowledge. Comb. Probab. Comput. Anders Dessmark, Andrzej Pelc
2004	J	`jnl`	Faster Deterministic Broadcasting in Ad Hoc Radio Networks. SIAM J. Discret. Math. Dariusz R. Kowalski, Andrzej Pelc
2004	B	`conf`	Graph Exploration by a Finite Automaton. MFCS Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004	J	`jnl`	Leader Election in Rings with Nonunique Labels. Fundam. Informaticae Stefan Dobrev, Andrzej Pelc
2004	B	`conf`	Optimal Decision Strategies in Byzantine Environments. SIROCCO Michel Paquette, Andrzej Pelc
2004	J	`jnl`	Optimal graph exploration without good maps. Theor. Comput. Sci. Anders Dessmark, Andrzej Pelc
2004	B	`conf`	Polynomial Deterministic Rendezvous in Arbitrary Graphs. ISAAC Dariusz R. Kowalski, Andrzej Pelc
2004	B	`conf`	Searching for a Black Hole in Tree Networks. OPODIS Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
2004	J	`jnl`	Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. SIAM J. Comput. Dariusz R. Kowalski, Andrzej Pelc
2004	J	`jnl`	Tree exploration with little memory. J. Algorithms Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2003	A*	`conf`	Broadcasting in undirected ad hoc radio networks. PODC Dariusz R. Kowalski, Andrzej Pelc
2003	J	`jnl`	Deterministic Computations on a PRAM with Static Processor and Memory Faults. Fundam. Informaticae Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
2003	A	`conf`	Deterministic Rendezvous in Graphs. ESA Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
2003	J	`jnl`	Deterministic broadcasting time with partial knowledge of the network. Theor. Comput. Sci. Gianluca De Marco, Andrzej Pelc
2003	J	`jnl`	Enhancing Hyperlink Structure for Improving Web Performance. J. Web Eng. Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Mogiel V. Martin
2003	A	`conf`	Faster Deterministic Broadcasting in Ad Hoc Radio Networks. STACS Dariusz R. Kowalski, Andrzej Pelc
2003	J	`jnl`	Labeling trees with a condition at distance two. Electron. Notes Discret. Math. Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc
2003	Misc	`conf`	Leader Election in Rings with Nonunique Labels. PDPTA Stefan Dobrev, Andrzej Pelc
2003	J	`jnl`	Linear-Time Prime Decomposition Of Regular Prefix Codes. Int. J. Found. Comput. Sci. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
2003	B	`conf`	Randomized Algorithms for Determining the Majority on Graphs. MFCS Gianluca De Marco, Andrzej Pelc
2003	B	`conf`	Time of Radio Broadcasting. SIROCCO Dariusz R. Kowalski, Andrzej Pelc
2003	J	`jnl`	Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. Anders Dessmark, Andrzej Lingas, Andrzej Pelc
2002	A*	`conf`	Deterministic Broadcasting Time in Radio Networks of Unknown Topology. FOCS Dariusz R. Kowalski, Andrzej Pelc
2002	J	`jnl`	Deterministic broadcasting in ad hoc radio networks. Distributed Comput. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2002	J	`jnl`	Deterministic radio broadcasting at low cost. Networks Anders Dessmark, Andrzej Pelc
2002	A	`conf`	Optimal Graph Exploration without Good Maps. ESA Anders Dessmark, Andrzej Pelc
2002	C	`conf`	Prime Decompositions of Regular Prefix Codes. CIAA Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
2002	J	`jnl`	Searching games with errors - fifty years of coping with liars. Theor. Comput. Sci. Andrzej Pelc
2002	J	`jnl`	The impact of information on broadcasting time in linear radio networks. Theor. Comput. Sci. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
2002	Misc	`conf`	Transducers with Set Output. COCOON Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
2002	A*	`conf`	Tree exploration with little memory. SODA Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2001	J	`jnl`	Assigning labels in an unknown anonymous network with a leader. Distributed Comput. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2001	A	`conf`	Deterministic Radio Broadcasting at Low Cost. STACS Anders Dessmark, Andrzej Pelc
2001	A	`conf`	Distributed coloring and communication in rings with local knowledge. IPDPS Anders Dessmark, Andrzej Pelc
2001	J	`jnl`	Efficient communication in unknown networks. Networks Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
2001	A*	`conf`	Fast distributed graph coloring with O(Delta) colors. SODA Gianluca De Marco, Andrzej Pelc
2001	J	`jnl`	Faster broadcasting in unknown radio networks. Inf. Process. Lett. Gianluca De Marco, Andrzej Pelc
2001	J	`jnl`	Fault-Tolerant Broadcasting in Radio Networks. J. Algorithms Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
2001	J	`jnl`	The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discret. Math. Leszek Gasieniec, Andrzej Pelc, David Peleg
2001	B	`conf`	Tradeoffs between knowledge and time of communication in geometric radio networks. SPAA Anders Dessmark, Andrzej Pelc
2000	A*	`conf`	Assigning labels in unknown anonymous networks (extended abstract). PODC Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2000	J	`jnl`	Better Adaptive Diagnosis of Hypercubes. IEEE Trans. Computers Evangelos Kranakis, Andrzej Pelc
2000	B	`conf`	Deterministic Broadcasting Time with Partial Knowledge of the Network. ISAAC Gianluca De Marco, Andrzej Pelc
2000	A*	`conf`	Deterministic broadcasting in unknown radio networks. SODA Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2000	B	`conf`	Efficient Communication in Unknown Networks. WG Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
2000	J	`jnl`	Impact of topographic information on graph exploration efficiency. Networks Petrisor Panaite, Andrzej Pelc
2000	J	`jnl`	Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. Algorithmica Krzysztof Diks, Andrzej Pelc
2000	J	`jnl`	Optimal Broadcasting in Faulty Trees. J. Parallel Distributed Comput. Petrisor Panaite, Andrzej Pelc
2000	J	`jnl`	Power consumption in packet radio networks. Theor. Comput. Sci. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
2000	J	`jnl`	Reliable Minimum Finding Comparator Networks. Fundam. Informaticae Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
2000	B	`conf`	Strategies for Hotlink Assignments. ISAAC Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
2000	A*	`conf`	The wakeup problem in synchronous broadcast systems (extended abstract). PODC Leszek Gasieniec, Andrzej Pelc, David Peleg
1999	J	`jnl`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1999	J	`jnl`	Exploring Unknown Undirected Graphs. J. Algorithms Petrisor Panaite, Andrzej Pelc
1999	J	`jnl`	Minimizing Congestion of Layouts for ATM Networks with Faulty Links. Int. J. Found. Comput. Sci. Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1999	J	`jnl`	Optimal adaptive fault diagnosis for simple multiprocessor systems. Networks Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
1999	A	`conf`	The Impact of Knowledge on Broadcasting Time in Radio Networks. ESA Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1998	J	`jnl`	Approximate Maxima Finding of Continuous Functions under Restricted Budget. Theor. Comput. Sci. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1998	J	`jnl`	Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. Inf. Process. Lett. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
1998	J	`jnl`	Broadcasting in Unlabeled Tori. Parallel Process. Lett. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
1998	J	`jnl`	Broadcasting with linearly bounded transmission faults. Discret. Appl. Math. Leszek Gasieniec, Andrzej Pelc
1998	A*	`conf`	Exploring Unknown Undirected Graphs. SODA Petrisor Panaite, Andrzej Pelc
1998	A	`conf`	Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). ESA Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1998	J	`jnl`	Minimum-time multidrop broadcast. Discret. Appl. Math. Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
1998	B	`conf`	Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. SIROCCO Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
1998	J	`jnl`	Optimal Diagnosis of Heterogeneous Systems with Random Faults. IEEE Trans. Computers Andrzej Pelc
1998	J	`jnl`	Perfect Broadcasting in Unlabeled Networks. Discret. Appl. Math. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
1998	J	`jnl`	Reliable Fault Diagnosis with Few Tests. Comb. Probab. Comput. Andrzej Pelc, Eli Upfal
1998	J	`jnl`	System Diagnosis with Smallest Risk of Error. Theor. Comput. Sci. Krzysztof Diks, Andrzej Pelc
1998	J	`jnl`	Time and Cost Trade-Offs in Gossiping. SIAM J. Discret. Math. Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
1997	B	`conf`	An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
1997	J	`jnl`	Broadcasting with a Bounded Fraction of Faulty Nodes. J. Parallel Distributed Comput. Leszek Gasieniec, Andrzej Pelc
1997	J	`jnl`	Globally Optimal Diagnosis in Systems with Random Faults. IEEE Trans. Computers Krzysztof Diks, Andrzej Pelc
1997	J	`jnl`	Hop-Congestion Trade-Offs for High-Speed Networks. Int. J. Found. Comput. Sci. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1997	A	`conf`	Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). ESA Krzysztof Diks, Andrzej Pelc
1997	B	`conf`	Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). ISAAC Petrisor Panaite, Andrzej Pelc
1997	A	`conf`	Power Consumption in Packet Radio Networks (Extended Abstract). STACS Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1997	J	`jnl`	Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms Piotr Berman, Krzysztof Diks, Andrzej Pelc
1997	J	`jnl`	Transition-Optimal Token Distribution. Fundam. Informaticae Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1997	B	`conf`	Universally Fault-Tolerant Broadcasting in Trees. ICPADS Petrisor Panaite, Andrzej Pelc
1996	J	`jnl`	Adaptive Broadcasting with Faulty Nodes. Parallel Comput. Leszek Gasieniec, Andrzej Pelc
1996	B	`conf`	Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). WG Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1996	J	`jnl`	Broadcasting with universal lists. Networks Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Efficient Gossiping by Packets in Networks with Random Faults. SIAM J. Discret. Math. Krzysztof Diks, Andrzej Pelc
1996	B	`conf`	Efficient fault location with small risk. SIROCCO Andrzej Pelc
1996	J	`jnl`	Fault-Tolerant Linear Broadcasting. Nord. J. Comput. Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Fault-tolerant broadcasting and gossiping in communication networks. Networks Andrzej Pelc
1996	B	`conf`	Minimizing Congestion of Layouts for ATM Networks with Faulty Links. MFCS Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1996	J	`jnl`	Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Comb. Probab. Comput. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1996	J	`jnl`	Reliable Computations on Faulty EREW PRAM. Theor. Comput. Sci. Krzysztof Diks, Andrzej Pelc
1996	B	`conf`	System Diagnosis with Smallest Risk of Error. WG Krzysztof Diks, Andrzej Pelc
1996	A*	`conf`	The Complexity of Data Mining on the Web (Abstract). PODC Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
1995	J	`jnl`	Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults. Parallel Process. Lett. Andrzej Pelc
1995	J	`jnl`	Anonymous Wireless Rings. Theor. Comput. Sci. Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc
1995	—	`conf`	Broadcasting with universal lists. HICSS (2) Krzysztof Diks, Andrzej Pelc
1995	A	`conf`	Fast Deterministic Simulation of Computations on Faulty Parallel Machines. ESA Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
1995	B	`conf`	Fast Fault-tolerant Broadcasting and Gossiping. SIROCCO Andrzej Pelc
1995	—	`conf`	Hop-congestion trade-offs for high-speed networks. SPDP Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1995	J	`jnl`	Token Transfer in a Faulty Network. RAIRO Theor. Informatics Appl. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
1994	J	`jnl`	Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance. IEEE Trans. Parallel Distributed Syst. Douglas M. Blough, Andrzej Pelc
1994	J	`jnl`	Almost Safe Group Testing with Few Tests. Comb. Probab. Comput. Andrzej Pelc
1994	J	`jnl`	Fast gossiping with short unreliable messages. Discret. Appl. Math. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	—	`conf`	Fault-Tolerant Linear Broadcasting. Canada-France Conference on Parallel and Distributed Computing Krzysztof Diks, Andrzej Pelc
1994	J	`jnl`	Optimal Coteries and Voting Schemes. Inf. Process. Lett. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc
1994	B	`conf`	Reliable Minimum Finding Comparator Networks. MFCS Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
1994	J	`jnl`	Reliable Token Despersal with Random Faults. Parallel Process. Lett. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
1994	J	`jnl`	Reliable distributed diagnosis for multiprocessor systems with random faults. Networks Piotr Berman, Andrzej Pelc
1994	J	`jnl`	Searching with Local Constraints on Error Patterns. Eur. J. Comb. Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
1994	J	`jnl`	Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	J	`jnl`	Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1994	B	`conf`	The Buffer Potential of a Network. SIROCCO Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc
1994	—	`conf`	Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1993	J	`jnl`	A Clustered Failure Model for the Memory Array Reconfiguration Problem. IEEE Trans. Computers Douglas M. Blough, Andrzej Pelc
1993	J	`jnl`	Diagnosis and Repair in Multiprocessor Systems. IEEE Trans. Computers Douglas M. Blough, Andrzej Pelc
1993	—	`conf`	Efficient Distributed Diagnosis in the Presence of Random Faults. FTCS Andrzej Pelc
1993	J	`jnl`	Fast Diagnosis of Multiprocessor Systems with Random Faults. RAIRO Theor. Informatics Appl. Krzysztof Diks, Andrzej Pelc
1993	J	`jnl`	Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
1993	J	`jnl`	Optimal communication in networks with randomly distributed byzantine faults. Networks Douglas M. Blough, Andrzej Pelc
1993	A*	`conf`	Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1992	J	`jnl`	Almost Safe Gossiping in Bounded Degree Networks. SIAM J. Discret. Math. Krzysztof Diks, Andrzej Pelc
1992	J	`jnl`	Broadcasting time in Sparse Networks with Faulty Transmissions. Parallel Process. Lett. Andrzej Pelc
1992	J	`jnl`	Complexity of Fault Diagnosis in Comparison Models. IEEE Trans. Computers Douglas M. Blough, Andrzej Pelc
1992	J	`jnl`	Optimal Fault Diagnosis in Comparison Models. IEEE Trans. Computers Andrzej Pelc
1992	J	`jnl`	Reliable communication in networks with Byzantine link failures. Networks Andrzej Pelc
1991	J	`jnl`	Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls. Inf. Process. Lett. Andrzej Pelc
1991	J	`jnl`	Motion Planning, Two-Directional Point Representations, and Ordered Sets. SIAM J. Discret. Math. Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia
1991	—	`conf`	Optimal Broadcasting in Faulty Hypercubes. FTCS Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
1991	J	`jnl`	Orders with Level Diagrams. Eur. J. Comb. Andrzej Pelc, Ivan Rival
1991	J	`jnl`	Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
1991	J	`jnl`	Undirected Graph Models for System-Level Fault Diagnosis. IEEE Trans. Computers Andrzej Pelc
1990	—	`conf`	Distributed probabilistic fault diagnosis for multiprocessor systems. FTCS Piotr Berman, Andrzej Pelc
1990	J	`jnl`	Drawing orders with few slopes. Discret. Math. Jurek Czyzowicz, Andrzej Pelc, Ivan Rival
1990	—	`conf`	Reliable diagnosis and repair in constant-degree multiprocessor systems. FTCS Douglas M. Blough, Andrzej Pelc
1989	J	`jnl`	Detecting errors in searching games. J. Comb. Theory A Andrzej Pelc
1989	J	`jnl`	Searching with Known Error Probability. Theor. Comput. Sci. Andrzej Pelc
1989	J	`jnl`	Ulam's searching game with lies. J. Comb. Theory A Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc
1989	J	`jnl`	Weakly Adaptive Comparison Searching. Theor. Comput. Sci. Andrzej Pelc
1988	J	`jnl`	Prefix search with a lie. J. Comb. Theory A Andrzej Pelc
1988	J	`jnl`	Solution of Ulam's problem on binary search with two lies. J. Comb. Theory A Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici
1987	J	`jnl`	Solution of Ulam's problem on searching with a lie. J. Comb. Theory A Andrzej Pelc
1986	J	`jnl`	Lie Patterns in Search Procedures. Theor. Comput. Sci. Andrzej Pelc
1984	J	`jnl`	Idempotent Ideals on Abelian Groups. J. Symb. Log. Andrzej Pelc