| 2026 | SPAA | Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks. | Bibhuti Das, Andrzej Pelc |
| 2025 | ICDCN | Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. | Subhash Bhagat, Andrzej Pelc |
| 2025 | OPODIS | Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. | Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc |
| 2025 | SIROCCO | Exploration of Convex Terrains by a Deterministic Automaton with Pebbles. | Mohamed Anouar Baaziz, Andrzej Pelc |
| 2024 | OPODIS | Gathering Teams of Deterministic Finite Automata on a Line. | Younan Gao, Andrzej Pelc |
| 2021 | ICALP | Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. | Sbastien Bouchard, Yoann Dieudonn, Arnaud Labourel, Andrzej Pelc |
| 2021 | PODC | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | SPAA | Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. | Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc |
| 2021 | SPAA | Four Shades of Deterministic Leader Election in Anonymous Networks. | Barun Gorain, Avery Miller, Andrzej Pelc |
| 2020 | ICDCN | Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. | Andrzej Pelc, Ram Narayan Yadav |
| 2020 | PODC | Want to Gather? No Need to Chatter! | Sbastien Bouchard, Yoann Dieudonn, Andrzej Pelc |
| 2020 | SPAA | Almost Universal Anonymous Rendezvous in the Plane. | Sbastien Bouchard, Yoann Dieudonn, Andrzej Pelc, Franck Petit |
| 2020 | SPAA | Deterministic Leader Election in Anonymous Radio Networks. | Avery Miller, Andrzej Pelc, Ram Narayan Yadav |
| 2019 | ESA | Building a Nest by an Automaton. | Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc |
| 2019 | SPAA | Constant-Length Labeling Schemes for Deterministic Radio Broadcast. | Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc |
| 2019 | SPAA | Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. | Andrzej Pelc, Ram Narayan Yadav |
| 2018 | ICDCN | Finding the Size of a Radio Network with Short Labels. | Barun Gorain, Andrzej Pelc |
| 2018 | ISAAC | Deterministic Treasure Hunt in the Plane with Angular Hints. | Sbastien Bouchard, Yoann Dieudonn, Andrzej Pelc, Franck Petit |
| 2018 | SIROCCO | Explorable Families of Graphs. | Andrzej Pelc |
| 2017 | ICALP | Deterministic Graph Exploration with Advice. | Barun Gorain, Andrzej Pelc |
| 2017 | SPAA | Impact of Knowledge on Election Time in Anonymous Networks. | Yoann Dieudonn, Andrzej Pelc |
| 2017 | SIROCCO | Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. | Barun Gorain, Andrzej Pelc |
| 2016 | Algosensors | Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. | Kokouvi Hounkanli, Avery Miller, Andrzej Pelc |
| 2016 | SODA | Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. | Christian Glacet, Avery Miller, Andrzej Pelc |
| 2016 | SPAA | Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? | Avery Miller, Andrzej Pelc |
| 2016 | SIROCCO | Deterministic Meeting of Sniffing Agents in the Plane. | Samir Elouasbi, Andrzej Pelc |
| 2016 | SIROCCO | Asynchronous Broadcasting with Bivalent Beeps. | Kokouvi Hounkanli, Andrzej Pelc |
| 2015 | Algosensors | Deterministic Rendezvous with Detection Using Beeps. | Samir Elouasbi, Andrzej Pelc |
| 2014 | Algosensors | Fast Rendezvous with Advice. | Avery Miller, Andrzej Pelc |
| 2014 | ICALP | Fault-Tolerant Rendezvous in Networks. | Jrmie Chalopin, Yoann Dieudonn, Arnaud Labourel, Andrzej Pelc |
| 2014 | OPODIS | Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt. | Avery Miller, Andrzej Pelc |
| 2014 | PODC | Time versus cost tradeoffs for deterministic rendezvous in networks. | Avery Miller, Andrzej Pelc |
| 2013 | ICALP | Deterministic Polynomial Approach in the Plane. | Yoann Dieudonn, Andrzej Pelc |
| 2013 | ICALP | Learning a Ring Cheaply and Fast. | Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi |
| 2013 | PODC | How to meet asynchronously at polynomial cost. | Yoann Dieudonn, Andrzej Pelc, Vincent Villain |
| 2013 | SODA | Anonymous Meeting in Networks. | Yoann Dieudonn, Andrzej Pelc |
| 2013 | SSS | Local Decision and Verification with Bounded-Size Outputs. | Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc |
| 2013 | SSS | Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line. | Samuel Guilbault, Andrzej Pelc |
| 2012 | ESA | Knowledge, Level of Symmetry, and Time of Leader Election. | Emanuele G. Fusco, Andrzej Pelc |
| 2012 | ICALP | Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. | Yoann Dieudonn, Andrzej Pelc |
| 2012 | LATIN | Decidability Classes for Mobile Agents Computing. | Pierre Fraigniaud, Andrzej Pelc |
| 2012 | OPODIS | Electing a Leader in Multi-hop Radio Networks. | Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc |
| 2012 | OPODIS | Tree Exploration by a Swarm of Mobile Agents. | Jurek Czyzowicz, Andrzej Pelc, Mlanie Roy |
| 2012 | SODA | Gathering despite mischief. | Yoann Dieudonn, Andrzej Pelc, David Peleg |
| 2012 | SPAA | Time vs. space trade-offs for rendezvous in trees. | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
| 2012 | SIROCCO | Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization. | Samir Elouasbi, Andrzej Pelc |
| 2011 | ICALP | Efficient Distributed Communication in Ad-Hoc Radio Networks. | Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki |
| 2011 | OPODIS | Communication Complexity of Consensus in Anonymous Message Passing Systems. | Emanuele G. Fusco, Andrzej Pelc |
| 2011 | OPODIS | Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. | Samuel Guilbault, Andrzej Pelc |
| 2011 | SIROCCO | Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs. | Samuel Guilbault, Andrzej Pelc |
| 2010 | MFCS | Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
| 2010 | PODC | How to meet when you forget: log-space rendezvous in arbitrary graphs. | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
| 2010 | SODA | How to Meet Asynchronously (Almost) Everywhere. | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc |
| 2010 | SPAA | Delays induce an exponential memory gap for rendezvous in trees. | Pierre Fraigniaud, Andrzej Pelc |
| 2010 | SIROCCO | Asynchronous Deterministic Rendezvous in Bounded Terrains. | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc |
| 2010 | SIROCCO | Distributed Tree Comparison with Nodes of Limited Memory. | Emanuele G. Fusco, Andrzej Pelc |
| 2009 | ESA | Optimality and Competitiveness of Exploring Polygons by Mobile Robots. | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc |
| 2009 | ICALP | Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. | Dariusz R. Kowalski, Andrzej Pelc |
| 2008 | OPODIS | Impact of Information on the Complexity of Asynchronous Radio Broadcasting. | Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc |
| 2008 | SPAA | Trade-offs between the size of advice and broadcasting time in trees. | Emanuele G. Fusco, Andrzej Pelc |
| 2008 | SIROCCO | Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
| 2008 | SIROCCO | Fast Radio Broadcasting with Advice. | David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc |
| 2007 | ICALP | Distributed Computing with Advice: Information Sensitivity of Graph Coloring. | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
| 2007 | ISAAC | Fast Adaptive Diagnosis with a Minimum Number of Tests. | Samuel Guilbault, Andrzej Pelc |
| 2007 | MFCS | Communication in Networks with Random Dependent Faults. | Evangelos Kranakis, Michel Paquette, Andrzej Pelc |
| 2007 | OPODIS | Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro |
| 2007 | PODC | Broadcasting in udg radio networks with unknown topology. | Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su |
| 2007 | SODA | Tree exploration with logarithmic memory. | Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang |
| 2006 | ISAAC | Gathering Asynchronous Oblivious Mobile Robots in a Ring. | Ralf Klasing, Euripides Markou, Andrzej Pelc |
| 2006 | MFCS | Tree Exploration with an Oracle. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2006 | OPODIS | Gathering Few Fat Mobile Robots in the Plane. | Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc |
| 2006 | PODC | Oracle size: a new measure of difficulty for communication tasks. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2005 | MFCS | Asynchronous Deterministic Rendezvous in Graphs. | Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro |
| 2005 | PODC | Feasibility and complexity of broadcasting with random transmission failures. | Andrzej Pelc, David Peleg |
| 2004 | ICALP | Deterministic M2M Multicast in Radio Networks: (Extended Abstract). | Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin |
| 2004 | ISAAC | Polynomial Deterministic Rendezvous in Arbitrary Graphs. | Dariusz R. Kowalski, Andrzej Pelc |
| 2004 | LATIN | Collective Tree Exploration. | Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc |
| 2004 | MFCS | Graph Exploration by a Finite Automaton. | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
| 2004 | OPODIS | Searching for a Black Hole in Tree Networks. | Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc |
| 2004 | SIROCCO | Optimal Decision Strategies in Byzantine Environments. | Michel Paquette, Andrzej Pelc |
| 2003 | ESA | Deterministic Rendezvous in Graphs. | Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc |
| 2003 | MFCS | Randomized Algorithms for Determining the Majority on Graphs. | Gianluca De Marco, Andrzej Pelc |
| 2003 | PDPTA | Leader Election in Rings with Nonunique Labels. | Stefan Dobrev, Andrzej Pelc |
| 2003 | PODC | Broadcasting in undirected ad hoc radio networks. | Dariusz R. Kowalski, Andrzej Pelc |
| 2003 | STACS | Faster Deterministic Broadcasting in Ad Hoc Radio Networks. | Dariusz R. Kowalski, Andrzej Pelc |
| 2003 | SIROCCO | Time of Radio Broadcasting. | Dariusz R. Kowalski, Andrzej Pelc |
| 2002 | COCOON | Transducers with Set Output. | Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc |
| 2002 | ESA | Optimal Graph Exploration without Good Maps. | Anders Dessmark, Andrzej Pelc |
| 2002 | FOCS | Deterministic Broadcasting Time in Radio Networks of Unknown Topology. | Dariusz R. Kowalski, Andrzej Pelc |
| 2002 | SODA | Tree exploration with little memory. | Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc |
| 2001 | SODA | Fast distributed graph coloring with O(Delta) colors. | Gianluca De Marco, Andrzej Pelc |
| 2001 | STACS | Deterministic Radio Broadcasting at Low Cost. | Anders Dessmark, Andrzej Pelc |
| 2001 | SPAA | Tradeoffs between knowledge and time of communication in geometric radio networks. | Anders Dessmark, Andrzej Pelc |
| 2000 | ISAAC | Strategies for Hotlink Assignments. | Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec |
| 2000 | ISAAC | Deterministic Broadcasting Time with Partial Knowledge of the Network. | Gianluca De Marco, Andrzej Pelc |
| 2000 | PODC | Assigning labels in unknown anonymous networks (extended abstract). | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes |
| 2000 | PODC | The wakeup problem in synchronous broadcast systems (extended abstract). | Leszek Gasieniec, Andrzej Pelc, David Peleg |
| 2000 | SODA | Deterministic broadcasting in unknown radio networks. | Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter |
| 2000 | WG | Efficient Communication in Unknown Networks. | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro |
| 1999 | ESA | The Impact of Knowledge on Broadcasting Time in Radio Networks. | Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1998 | ESA | Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1998 | SODA | Exploring Unknown Undirected Graphs. | Petrisor Panaite, Andrzej Pelc |
| 1998 | SIROCCO | Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. | Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis |
| 1997 | ESA | Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). | Krzysztof Diks, Andrzej Pelc |
| 1997 | ICPADS | Universally Fault-Tolerant Broadcasting in Trees. | Petrisor Panaite, Andrzej Pelc |
| 1997 | ISAAC | Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). | Petrisor Panaite, Andrzej Pelc |
| 1997 | STACS | Power Consumption in Packet Radio Networks (Extended Abstract). | Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1997 | SIROCCO | An Optimal Algorithm for Broadcasting Multiple Messages in Trees. | Krzysztof Diks, Andrzej Lingas, Andrzej Pelc |
| 1996 | MFCS | Minimizing Congestion of Layouts for ATM Networks with Faulty Links. | Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1996 | PODC | The Complexity of Data Mining on the Web (Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1996 | SIROCCO | Efficient fault location with small risk. | Andrzej Pelc |
| 1996 | WG | System Diagnosis with Smallest Risk of Error. | Krzysztof Diks, Andrzej Pelc |
| 1996 | WG | Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1995 | ESA | Fast Deterministic Simulation of Computations on Faulty Parallel Machines. | Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc |
| 1995 | SIROCCO | Fast Fault-tolerant Broadcasting and Gossiping. | Andrzej Pelc |
| 1994 | MFCS | Reliable Minimum Finding Comparator Networks. | Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrw |
| 1994 | SIROCCO | The Buffer Potential of a Network. | Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc |
| 1993 | ICALP | Sparse Networks Supporting Efficient Reliable Broadcasting. | Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc |