Idempotent Ideals on Abelian Groups. - Andrzej Pelc (J. Symb. Log., 1984)

Lie Patterns in Search Procedures. - Andrzej Pelc (Theor. Comput. Sci., 1986)

Solution of Ulam's problem on searching with a lie. - Andrzej Pelc (J. Comb. Theory A, 1987)

Solution of Ulam's problem on binary search with two lies. - Jurek Czyzowicz; Andrzej Pelc; Daniele Mundici (J. Comb. Theory A, 1988)

Prefix search with a lie. - Andrzej Pelc (J. Comb. Theory A, 1988)

Ulam's searching game with lies. - Jurek Czyzowicz; Daniele Mundici; Andrzej Pelc (J. Comb. Theory A, 1989)

Detecting errors in searching games. - Andrzej Pelc (J. Comb. Theory A, 1989)

Searching with Known Error Probability. - Andrzej Pelc (Theor. Comput. Sci., 1989)

Weakly Adaptive Comparison Searching. - Andrzej Pelc (Theor. Comput. Sci., 1989)

Distributed probabilistic fault diagnosis for multiprocessor systems. - Piotr Berman; Andrzej Pelc (FTCS, 1990)

Reliable diagnosis and repair in constant-degree multiprocessor systems. - Douglas M. Blough; Andrzej Pelc (FTCS, 1990)

Drawing orders with few slopes. - Jurek Czyzowicz; Andrzej Pelc; Ivan Rival (Discret. Math., 1990)

Optimal Broadcasting in Faulty Hypercubes. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (FTCS, 1991)

Orders with Level Diagrams. - Andrzej Pelc; Ivan Rival (Eur. J. Comb., 1991)

Searching with a Forbidden Lie Pattern in Responses. - Jurek Czyzowicz; K. B. Lakshmanan; Andrzej Pelc (Inf. Process. Lett., 1991)

Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls. - Andrzej Pelc (Inf. Process. Lett., 1991)

Motion Planning, Two-Directional Point Representations, and Ordered Sets. - Fawzi Al-Thukair; Andrzej Pelc; Ivan Rival; Jorge Urrutia (SIAM J. Discret. Math., 1991)

Undirected Graph Models for System-Level Fault Diagnosis. - Andrzej Pelc (IEEE Trans. Computers, 1991)

Reliable communication in networks with Byzantine link failures. - Andrzej Pelc (Networks, 1992)

Broadcasting time in Sparse Networks with Faulty Transmissions. - Andrzej Pelc (Parallel Process. Lett., 1992)

Almost Safe Gossiping in Bounded Degree Networks. - Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1992)

Complexity of Fault Diagnosis in Comparison Models. - Douglas M. Blough; Andrzej Pelc (IEEE Trans. Computers, 1992)

Optimal Fault Diagnosis in Comparison Models. - Andrzej Pelc (IEEE Trans. Computers, 1992)

Efficient Distributed Diagnosis in the Presence of Random Faults. - Andrzej Pelc (FTCS, 1993)

Finding a Target Subnetwork in Sparse Networks with Random Faults. - Pierre Fraigniaud; Claire Kenyon; Andrzej Pelc (Inf. Process. Lett., 1993)

Fast Diagnosis of Multiprocessor Systems with Random Faults. - Krzysztof Diks; Andrzej Pelc (RAIRO Theor. Informatics Appl., 1993)

Optimal communication in networks with randomly distributed byzantine faults. - Douglas M. Blough; Andrzej Pelc (Networks, 1993)

Diagnosis and Repair in Multiprocessor Systems. - Douglas M. Blough; Andrzej Pelc (IEEE Trans. Computers, 1993)

A Clustered Failure Model for the Memory Array Reconfiguration Problem. - Douglas M. Blough; Andrzej Pelc (IEEE Trans. Computers, 1993)

Waking up an Anonymous Faulty Network from a Single Source. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (HICSS (2), 1994)

The Buffer Potential of a Network. - Krzysztof Diks; Evangelos Kranakis; A. Malinowsky; Andrzej Pelc (SIROCCO, 1994)

Almost Safe Group Testing with Few Tests. - Andrzej Pelc (Comb. Probab. Comput., 1994)

Fast gossiping with short unreliable messages. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Discret. Appl. Math., 1994)

Searching with Local Constraints on Error Patterns. - Jurek Czyzowicz; K. B. Lakshmanan; Andrzej Pelc (Eur. J. Comb., 1994)

Optimal Coteries and Voting Schemes. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Bernard Mans; Andrzej Pelc (Inf. Process. Lett., 1994)

Reliable distributed diagnosis for multiprocessor systems with random faults. - Piotr Berman; Andrzej Pelc (Networks, 1994)

Sparse Networks Supporting Efficient Reliable Broadcasting. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Nord. J. Comput., 1994)

Reliable Token Despersal with Random Faults. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (Parallel Process. Lett., 1994)

Sorting on a Mesh-Connected Computer with Delaying Links. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1994)

Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance. - Douglas M. Blough; Andrzej Pelc (IEEE Trans. Parallel Distributed Syst., 1994)

Fast Deterministic Simulation of Computations on Faulty Parallel Machines. - Bogdan S. Chlebus; Leszek Gasieniec; Andrzej Pelc (ESA, 1995)

Fast Fault-tolerant Broadcasting and Gossiping. - Andrzej Pelc (SIROCCO, 1995)

Token Transfer in a Faulty Network. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (RAIRO Theor. Informatics Appl., 1995)

Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults. - Andrzej Pelc (Parallel Process. Lett., 1995)

Anonymous Wireless Rings. - Krzysztof Diks; Evangelos Kranakis; Adam Malinowski; Andrzej Pelc (Theor. Comput. Sci., 1995)

The Complexity of Data Mining on the Web (Abstract). - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; David Peleg (PODC, 1996)

Efficient fault location with small risk. - Andrzej Pelc (SIROCCO, 1996)

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; David Peleg (WG, 1996)

Reliable Broadcasting in Hypercubes with Random Link and Node Failures. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Comb. Probab. Comput., 1996)

Broadcasting with universal lists. - Krzysztof Diks; Andrzej Pelc (Networks, 1996)

Fault-tolerant broadcasting and gossiping in communication networks. - Andrzej Pelc (Networks, 1996)

Fault-Tolerant Linear Broadcasting. - Krzysztof Diks; Andrzej Pelc (Nord. J. Comput., 1996)

Adaptive Broadcasting with Faulty Nodes. - Leszek Gasieniec; Andrzej Pelc (Parallel Comput., 1996)

Efficient Gossiping by Packets in Networks with Random Faults. - Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1996)

Reliable Computations on Faulty EREW PRAM. - Krzysztof Diks; Andrzej Pelc (Theor. Comput. Sci., 1996)

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). - Krzysztof Diks; Andrzej Pelc (ESA, 1997)

Universally Fault-Tolerant Broadcasting in Trees. - Petrisor Panaite; Andrzej Pelc (ICPADS, 1997)

Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). - Petrisor Panaite; Andrzej Pelc (ISAAC, 1997)

Power Consumption in Packet Radio Networks (Extended Abstract). - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (STACS, 1997)

Transition-Optimal Token Distribution. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Fundam. Informaticae, 1997)

Hop-Congestion Trade-Offs for High-Speed Networks. - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Int. J. Found. Comput. Sci., 1997)

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. - Piotr Berman; Krzysztof Diks; Andrzej Pelc (J. Algorithms, 1997)

Broadcasting with a Bounded Fraction of Faulty Nodes. - Leszek Gasieniec; Andrzej Pelc (J. Parallel Distributed Comput., 1997)

Globally Optimal Diagnosis in Systems with Random Faults. - Krzysztof Diks; Andrzej Pelc (IEEE Trans. Computers, 1997)

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (ESA, 1998)

Reliable Fault Diagnosis with Few Tests. - Andrzej Pelc; Eli Upfal (Comb. Probab. Comput., 1998)

Perfect Broadcasting in Unlabeled Networks. - Krzysztof Diks; Evangelos Kranakis; Andrzej Pelc (Discret. Appl. Math., 1998)

Minimum-time multidrop broadcast. - Arthur M. Farley; Andrzej Pelc; Andrzej Proskurowski (Discret. Appl. Math., 1998)

Broadcasting with linearly bounded transmission faults. - Leszek Gasieniec; Andrzej Pelc (Discret. Appl. Math., 1998)

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. - Krzysztof Diks; Stefan Dobrev; Evangelos Kranakis; Andrzej Pelc; Peter Ruzicka (Inf. Process. Lett., 1998)

Broadcasting in Unlabeled Tori. - Krzysztof Diks; Evangelos Kranakis; Andrzej Pelc (Parallel Process. Lett., 1998)

Time and Cost Trade-Offs in Gossiping. - Artur Czumaj; Leszek Gasieniec; Andrzej Pelc (SIAM J. Discret. Math., 1998)

Optimal Diagnosis of Heterogeneous Systems with Random Faults. - Andrzej Pelc (IEEE Trans. Computers, 1998)

System Diagnosis with Smallest Risk of Error. - Krzysztof Diks; Andrzej Pelc (Theor. Comput. Sci., 1998)

Approximate Maxima Finding of Continuous Functions under Restricted Budget. - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; David Peleg (Theor. Comput. Sci., 1998)

The Impact of Knowledge on Broadcasting Time in Radio Networks. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (ESA, 1999)

Minimizing Congestion of Layouts for ATM Networks with Faulty Links. - Leszek Gasieniec; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Int. J. Found. Comput. Sci., 1999)

Exploring Unknown Undirected Graphs. - Petrisor Panaite; Andrzej Pelc (J. Algorithms, 1999)

An Optimal Algorithm for Broadcasting Multiple Messages in Trees. - Krzysztof Diks; Andrzej Lingas; Andrzej Pelc (J. Parallel Distributed Comput., 1999)

Optimal adaptive fault diagnosis for simple multiprocessor systems. - Evangelos Kranakis; Andrzej Pelc; Anthony Spatharis (Networks, 1999)

Strategies for Hotlink Assignments. - Prosenjit Bose; Evangelos Kranakis; Danny Krizanc; Miguel Vargas Martin; Jurek Czyzowicz; Andrzej Pelc; Leszek Gasieniec (ISAAC, 2000)

Assigning labels in unknown anonymous networks (extended abstract). - Pierre Fraigniaud; Andrzej Pelc; David Peleg; Stephane Perennes (PODC, 2000)

The wakeup problem in synchronous broadcast systems (extended abstract). - Leszek Gasieniec; Andrzej Pelc; David Peleg (PODC, 2000)

Deterministic broadcasting in unknown radio networks. - Bogdan S. Chlebus; Leszek Gasieniec; Alan Gibbons; Andrzej Pelc; Wojciech Rytter (SODA, 2000)

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. - Krzysztof Diks; Andrzej Pelc (Algorithmica, 2000)

Reliable Minimum Finding Comparator Networks. - Piotr Denejko; Krzysztof Diks; Andrzej Pelc; Marek Piotrów (Fundam. Informaticae, 2000)

Optimal Broadcasting in Faulty Trees. - Petrisor Panaite; Andrzej Pelc (J. Parallel Distributed Comput., 2000)

Impact of topographic information on graph exploration efficiency. - Petrisor Panaite; Andrzej Pelc (Networks, 2000)

Better Adaptive Diagnosis of Hypercubes. - Evangelos Kranakis; Andrzej Pelc (IEEE Trans. Computers, 2000)

Power consumption in packet radio networks. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Theor. Comput. Sci., 2000)

Distributed coloring and communication in rings with local knowledge. - Anders Dessmark; Andrzej Pelc (IPDPS, 2001)

Fast distributed graph coloring with O(Delta) colors. - Gianluca De Marco; Andrzej Pelc (SODA, 2001)

Tradeoffs between knowledge and time of communication in geometric radio networks. - Anders Dessmark; Andrzej Pelc (SPAA, 2001)

Assigning labels in an unknown anonymous network with a leader. - Pierre Fraigniaud; Andrzej Pelc; David Peleg; Stephane Perennes (Distributed Comput., 2001)

Faster broadcasting in unknown radio networks. - Gianluca De Marco; Andrzej Pelc (Inf. Process. Lett., 2001)

Fault-Tolerant Broadcasting in Radio Networks. - Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (J. Algorithms, 2001)

Efficient communication in unknown networks. - Luisa Gargano; Andrzej Pelc; Stephane Perennes; Ugo Vaccaro (Networks, 2001)

The Wakeup Problem in Synchronous Broadcast Systems. - Leszek Gasieniec; Andrzej Pelc; David Peleg (SIAM J. Discret. Math., 2001)

Deterministic Broadcasting Time in Radio Networks of Unknown Topology. - Dariusz R. Kowalski; Andrzej Pelc (FOCS, 2002)

Prime Decompositions of Regular Prefix Codes. - Jurek Czyzowicz; Wojciech Fraczak; Andrzej Pelc; Wojciech Rytter (CIAA, 2002)

Deterministic broadcasting in ad hoc radio networks. - Bogdan S. Chlebus; Leszek Gasieniec; Alan Gibbons; Andrzej Pelc; Wojciech Rytter (Distributed Comput., 2002)

Deterministic radio broadcasting at low cost. - Anders Dessmark; Andrzej Pelc (Networks, 2002)

The impact of information on broadcasting time in linear radio networks. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Theor. Comput. Sci., 2002)

Searching games with errors - fifty years of coping with liars. - Andrzej Pelc (Theor. Comput. Sci., 2002)

Deterministic Rendezvous in Graphs. - Anders Dessmark; Pierre Fraigniaud; Andrzej Pelc (ESA, 2003)

Time of Radio Broadcasting. - Dariusz R. Kowalski; Andrzej Pelc (SIROCCO, 2003)

Labeling trees with a condition at distance two. - Tiziana Calamoneri; Rossella Petreschi; Andrzej Pelc (Electron. Notes Discret. Math., 2003)

Deterministic Computations on a PRAM with Static Processor and Memory Faults. - Bogdan S. Chlebus; Leszek Gasieniec; Andrzej Pelc (Fundam. Informaticae, 2003)

Linear-Time Prime Decomposition Of Regular Prefix Codes. - Jurek Czyzowicz; Wojciech Fraczak; Andrzej Pelc; Wojciech Rytter (Int. J. Found. Comput. Sci., 2003)

Enhancing Hyperlink Structure for Improving Web Performance. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; Mogiel V. Martin (J. Web Eng., 2003)

Trade-Offs Between Load and Degree in Virtual Path Layouts. - Anders Dessmark; Andrzej Lingas; Andrzej Pelc (Parallel Process. Lett., 2003)

Deterministic broadcasting time with partial knowledge of the network. - Gianluca De Marco; Andrzej Pelc (Theor. Comput. Sci., 2003)

Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. - Dariusz R. Kowalski; Andrzej Pelc (APPROX-RANDOM, 2004)

Deterministic M2M Multicast in Radio Networks: (Extended Abstract). - Leszek Gasieniec; Evangelos Kranakis; Andrzej Pelc; Qin Xin 001 (ICALP, 2004)

Polynomial Deterministic Rendezvous in Arbitrary Graphs. - Dariusz R. Kowalski; Andrzej Pelc (ISAAC, 2004)

Searching for a Black Hole in Tree Networks. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (OPODIS, 2004)

Distributed Colouring and Communication in Rings with Local Knowledge. - Anders Dessmark; Andrzej Pelc (Comb. Probab. Comput., 2004)

Leader Election in Rings with Nonunique Labels. - Stefan Dobrev; Andrzej Pelc (Fundam. Informaticae, 2004)

Tree exploration with little memory. - Krzysztof Diks; Pierre Fraigniaud; Evangelos Kranakis; Andrzej Pelc (J. Algorithms, 2004)

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. - Dariusz R. Kowalski; Andrzej Pelc (SIAM J. Comput., 2004)

Faster Deterministic Broadcasting in Ad Hoc Radio Networks. - Dariusz R. Kowalski; Andrzej Pelc (SIAM J. Discret. Math., 2004)

Optimal graph exploration without good maps. - Anders Dessmark; Andrzej Pelc (Theor. Comput. Sci., 2004)

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance - Juraj Hromkovic; Ralf Klasing; Andrzej Pelc; Peter Ruzicka; Walter Unger (Springer, 2005)

Waking Up Anonymous Ad Hoc Radio Networks. - Andrzej Pelc (DISC, 2005)

Broadcasting in undirected ad hoc radio networks. - Dariusz R. Kowalski; Andrzej Pelc (Distributed Comput., 2005)

Broadcasting with locally bounded Byzantine faults. - Andrzej Pelc; David Peleg (Inf. Process. Lett., 2005)

Transducers with Set Output. - Jurek Czyzowicz; Wojciech Fraczak; Andrzej Pelc (J. Autom. Lang. Comb., 2005)

Graph exploration by a finite automaton. - Pierre Fraigniaud; David Ilcinkas; Guy Peer; Andrzej Pelc; David Peleg (Theor. Comput. Sci., 2005)

Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. - Dariusz R. Kowalski; Andrzej Pelc (Theor. Comput. Sci., 2005)

Tree Exploration with an Oracle. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (MFCS, 2006)

Oracle size: a new measure of difficulty for communication tasks. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (PODC, 2006)

Deterministic Rendezvous in Graphs. - Anders Dessmark; Pierre Fraigniaud; Dariusz R. Kowalski; Andrzej Pelc (Algorithmica, 2006)

Randomized Algorithms for Determining the Majority on Graphs. - Gianluca De Marco; Andrzej Pelc (Comb. Probab. Comput., 2006)

Complexity of Searching for a Black Hole. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (Fundam. Informaticae, 2006)

Fast Broadcasting with Byzantine Faults. - Michel Paquette; Andrzej Pelc (Int. J. Found. Comput. Sci., 2006)

Exploring Planar Graphs Using Unoriented Maps. - Krzysztof Diks; Stefan Dobrev; Andrzej Pelc (J. Interconnect. Networks, 2006)

Optimal decision strategies in Byzantine environments. - Michel Paquette; Andrzej Pelc (J. Parallel Distributed Comput., 2006)

Collective tree exploration. - Pierre Fraigniaud; Leszek Gasieniec; Dariusz R. Kowalski; Andrzej Pelc (Networks, 2006)

Voting Mechanisms in Asynchronous Byzantine Environments. - Andrzej Pelc (Parallel Process. Lett., 2006)

Deterministic M2M multicast in radio networks. - Leszek Gasieniec; Evangelos Kranakis; Andrzej Pelc; Qin Xin 001 (Theor. Comput. Sci., 2006)

Asynchronous deterministic rendezvous in graphs. - Gianluca De Marco; Luisa Gargano; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; Ugo Vaccaro (Theor. Comput. Sci., 2006)

Fast Adaptive Diagnosis with a Minimum Number of Tests. - Samuel Guilbault; Andrzej Pelc (ISAAC, 2007)

Communication in Networks with Random Dependent Faults. - Evangelos Kranakis; Michel Paquette; Andrzej Pelc (MFCS, 2007)

Tree exploration with logarithmic memory. - Leszek Gasieniec; Andrzej Pelc; Tomasz Radzik; Xiaohui Zhang 004 (SODA, 2007)

Assigning Bookmarks in Perfect Binary Trees. - Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; Miguel Vargas Martin (Ars Comb., 2007)

Searching for a Black Hole in Synchronous Tree Networks. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (Comb. Probab. Comput., 2007)

Optimal Deterministic Broadcasting in Known Topology Radio Networks. - Dariusz R. Kowalski; Andrzej Pelc (Distributed Comput., 2007)

Activating anonymous ad hoc radio networks. - Andrzej Pelc (Distributed Comput., 2007)

Broadcasting in geometric radio networks. - Anders Dessmark; Andrzej Pelc (J. Discrete Algorithms, 2007)

Efficient Exploration of Faulty Trees. - Euripides Markou; Andrzej Pelc (Theory Comput. Syst., 2007)

Feasibility and complexity of broadcasting with random transmission failures. - Andrzej Pelc; David Peleg (Theor. Comput. Sci., 2007)

Preface. - Andrzej Pelc; David Peleg; Michel Raynal (Theor. Comput. Sci., 2007)

Algorithmic aspects of radio communication. - Andrzej Pelc (DIALM-POMC, 2008)

Impact of Information on the Complexity of Asynchronous Radio Broadcasting. - Tiziana Calamoneri; Emanuele G. Fusco; Andrzej Pelc (OPODIS, 2008)

Deterministic Rendezvous in Trees with Little Memory. - Pierre Fraigniaud; Andrzej Pelc (DISC, 2008)

Impact of memory size on graph exploration capability. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (Discret. Appl. Math., 2008)

Special issue on DISC 07. - Andrzej Pelc (Distributed Comput., 2008)

Impact of Asynchrony on the Behavior of Rational Selfish Agents. - David Ilcinkas; Andrzej Pelc (Fundam. Informaticae, 2008)

Tree exploration with advice. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (Inf. Comput., 2008)

Acknowledged broadcasting in ad hoc radio networks. - Emanuele G. Fusco; Andrzej Pelc (Inf. Process. Lett., 2008)

Gathering asynchronous oblivious mobile robots in a ring. - Ralf Klasing; Euripides Markou; Andrzej Pelc (Theor. Comput. Sci., 2008)

Broadcasting in Geometric Radio Networks. - Andrzej Pelc (Encyclopedia of Algorithms, 2008)

Broadcasting in UDG radio networks with unknown topology. - Yuval Emek; Leszek Gasieniec; Erez Kantor; Andrzej Pelc; David Peleg; Chang Su 008 (Distributed Comput., 2009)

Distributed computing with advice: information sensitivity of graph coloring. - Pierre Fraigniaud; Cyril Gavoille; David Ilcinkas; Andrzej Pelc (Distributed Comput., 2009)

Fault-Tolerant Sequential Scan. - Paola Flocchini; Andrzej Pelc; Nicola Santoro (Theory Comput. Syst., 2009)

Gathering few fat mobile robots in the plane. - Jurek Czyzowicz; Leszek Gasieniec; Andrzej Pelc (Theor. Comput. Sci., 2009)

Optimal Exploration of Terrains with Obstacles. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (SWAT, 2010)

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. - Evangelos Kranakis; Michel Paquette; Andrzej Pelc (Ad Hoc Sens. Wirel. Networks, 2010)

Broadcasting in UDG radio networks with missing and inaccurate information. - Emanuele G. Fusco; Andrzej Pelc (Distributed Comput., 2010)

Fault-tolerant strategies in the Iterated Prisoner's Dilemma. - Andrzej Pelc (Inf. Process. Lett., 2010)

Communication algorithms with advice. - Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc (J. Comput. Syst. Sci., 2010)

The diameter and connectivity of networks with random dependent faults. - Evangelos Kranakis; Michel Paquette; Andrzej Pelc (Networks, 2010)

Remembering without memory: Tree exploration by asynchronous oblivious robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Theor. Comput. Sci., 2010)

Fast radio broadcasting with advice. - David Ilcinkas; Dariusz R. Kowalski; Andrzej Pelc (Theor. Comput. Sci., 2010)

Efficient Distributed Communication in Ad-Hoc Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Andrzej Pelc; Mariusz A. Rokicki (ICALP (2), 2011)

Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. - Samuel Guilbault; Andrzej Pelc (OPODIS, 2011)

DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. - Andrzej Pelc (DISC, 2011)

Trade-offs Between the Size of Advice and Broadcasting Time in Trees. - Emanuele G. Fusco; Andrzej Pelc (Algorithmica, 2011)

Deterministic gathering of anonymous agents in arbitrary networks - Yoann Dieudonné; Andrzej Pelc (CoRR, 2011)

How much memory is needed for leader election. - Emanuele G. Fusco; Andrzej Pelc (Distributed Comput., 2011)

Optimality and competitiveness of exploring polygons by mobile robots. - Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc (Inf. Comput., 2011)

How many oblivious robots can explore a line. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Inf. Process. Lett., 2011)

Tree exploration with logarithmic memory. - Christoph Ambühl; Leszek Gasieniec; Andrzej Pelc; Tomasz Radzik; Xiaohui Zhang 004 (ACM Trans. Algorithms, 2011)

Asynchronous deterministic rendezvous in bounded terrains. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (Theor. Comput. Sci., 2011)

Consensus and Mutual Exclusion in a Multiple Access Channel. - Jurek Czyzowicz; Leszek Gasieniec; Dariusz R. Kowalski; Andrzej Pelc (IEEE Trans. Parallel Distributed Syst., 2011)

Electing a Leader in Multi-hop Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Andrzej Pelc (OPODIS, 2012)

Tree Exploration by a Swarm of Mobile Agents. - Jurek Czyzowicz; Andrzej Pelc; Mélanie Roy (OPODIS, 2012)

Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization. - Samir Elouasbi; Andrzej Pelc (SIROCCO, 2012)

Time vs. space trade-offs for rendezvous in trees. - Jurek Czyzowicz; Adrian Kosowski; Andrzej Pelc (SPAA, 2012)

Collecting Information by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (DISC, 2012)

How to meet when you forget: log-space rendezvous in arbitrary graphs. - Jurek Czyzowicz; Adrian Kosowski; Andrzej Pelc (Distributed Comput., 2012)

Deterministic network exploration by a single agent with Byzantine tokens. - Yoann Dieudonné; Andrzej Pelc (Inf. Process. Lett., 2012)

Drawing maps with advice. - Dariusz Dereniowski; Andrzej Pelc (J. Parallel Distributed Comput., 2012)

Distributed tree comparison with nodes of limited memory. - Emanuele G. Fusco; Andrzej Pelc (Networks, 2012)

Deterministic rendezvous in networks: A comprehensive survey. - Andrzej Pelc (Networks, 2012)

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. - Marcos K. Aguilera; Dahlia Malkhi; Keith Marzullo; Alessandro Panconesi; Andrzej Pelc; Roger Wattenhofer (SIGARCH Comput. Archit. News, 2012)

How to meet asynchronously (almost) everywhere. - Jurek Czyzowicz; Andrzej Pelc; Arnaud Labourel (ACM Trans. Algorithms, 2012)

Choosing the best among peers. - Jurek Czyzowicz; Leszek Gasieniec; Andrzej Pelc (Theor. Comput. Sci., 2012)

Learning a Ring Cheaply and Fast. - Emanuele G. Fusco; Andrzej Pelc; Rossella Petreschi (ICALP (2), 2013)

Local Decision and Verification with Bounded-Size Outputs. - Heger Arfaoui; Pierre Fraigniaud; Andrzej Pelc (SSS, 2013)

Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line. - Samuel Guilbault; Andrzej Pelc (SSS, 2013)

Use Knowledge to Learn Faster: Topology Recognition with Advice. - Emanuele Guido Fusco; Andrzej Pelc; Rossella Petreschi (DISC, 2013)

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Algorithmica, 2013)

Worst-case optimal exploration of terrains with obstacles. - Jurek Czyzowicz; David Ilcinkas; Arnaud Labourel; Andrzej Pelc (Inf. Comput., 2013)

Leader election in ad hoc radio networks: A keen ear helps. - Dariusz R. Kowalski; Andrzej Pelc (J. Comput. Syst. Sci., 2013)

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. - Jurek Czyzowicz; Adrian Kosowski; Andrzej Pelc (Theory Comput. Syst., 2013)

Delays Induce an Exponential Memory Gap for Rendezvous in Trees. - Pierre Fraigniaud; Andrzej Pelc (ACM Trans. Algorithms, 2013)

Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. - Samuel Guilbault; Andrzej Pelc (Theor. Comput. Sci., 2013)

Fault-Tolerant Rendezvous in Networks. - Jérémie Chalopin; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ICALP (2), 2014)

Election vs. Selection: Two Ways of Finding the Largest Node in a Graph. - Avery Miller; Andrzej Pelc (CoRR, 2014)

Time versus space trade-offs for rendezvous in trees. - Jurek Czyzowicz; Adrian Kosowski; Andrzej Pelc (Distributed Comput., 2014)

Leader election for anonymous asynchronous agents in arbitrary networks. - Dariusz Dereniowski; Andrzej Pelc (Distributed Comput., 2014)

Efficient Grid Exploration with a stationary Token. - Andrzej Pelc; Anas Tiane (Int. J. Found. Comput. Sci., 2014)

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. - Yoann Dieudonné; Andrzej Pelc (ACM Trans. Algorithms, 2014)

Gathering Despite Mischief. - Yoann Dieudonné; Andrzej Pelc; David Peleg (ACM Trans. Algorithms, 2014)

Price of asynchrony in mobile agents computing. - Yoann Dieudonné; Andrzej Pelc (Theor. Comput. Sci., 2014)

Deterministic Broadcasting and Gossiping with Beeps. - Kokouvi Hounkanli; Andrzej Pelc (CoRR, 2015)

Deterministic polynomial approach in the plane. - Yoann Dieudonné; Andrzej Pelc (Distributed Comput., 2015)

Knowledge, level of symmetry, and time of leader election. - Emanuele G. Fusco; Andrzej Pelc (Distributed Comput., 2015)

Communication Complexity of Consensus in Anonymous Message Passing Systems. - Emanuele G. Fusco; Andrzej Pelc (Fundam. Informaticae, 2015)

Tradeoffs between cost and information for rendezvous and treasure hunt. - Avery Miller; Andrzej Pelc (J. Parallel Distributed Comput., 2015)

How to Meet Asynchronously at Polynomial Cost. - Yoann Dieudonné; Andrzej Pelc; Vincent Villain (SIAM J. Comput., 2015)

Fast rendezvous with advice. - Avery Miller; Andrzej Pelc (Theor. Comput. Sci., 2015)

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. - Kokouvi Hounkanli; Avery Miller; Andrzej Pelc (ALGOSENSORS, 2016)

Asynchronous Broadcasting with Bivalent Beeps. - Kokouvi Hounkanli; Andrzej Pelc (SIROCCO, 2016)

Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? - Avery Miller; Andrzej Pelc (SPAA, 2016)

Convergecast and Broadcast by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (Algorithmica, 2016)

Anonymous Meeting in Networks. - Yoann Dieudonné; Andrzej Pelc (Algorithmica, 2016)

Rendezvous in networks in spite of delay faults. - Jérémie Chalopin; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (Distributed Comput., 2016)

Time versus cost tradeoffs for deterministic rendezvous in networks. - Avery Miller; Andrzej Pelc (Distributed Comput., 2016)

Topology recognition with advice. - Emanuele G. Fusco; Andrzej Pelc; Rossella Petreschi (Inf. Comput., 2016)

Exploration of Faulty Hamiltonian Graphs. - David Caissy; Andrzej Pelc (Int. J. Found. Comput. Sci., 2016)

Topology recognition and leader election in colored networks. - Dariusz Dereniowski; Andrzej Pelc (Theor. Comput. Sci., 2016)

Broadcasting in Geometric Radio Networks. - Andrzej Pelc (Encyclopedia of Algorithms, 2016)

Leader Election in Trees with Customized Advice. - Barun Gorain; Andrzej Pelc (CoRR, 2017)

Deterministic distributed construction of T-dominating sets in time T. - Avery Miller; Andrzej Pelc (Discret. Appl. Math., 2017)

Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015). - Andrzej Pelc; Alexander A. Schwarzmann (Inf. Comput., 2017)

Deterministic Rendezvous with Detection Using Beeps. - Samir Elouasbi; Andrzej Pelc (Int. J. Found. Comput. Sci., 2017)

Decidability classes for mobile agents computing. - Pierre Fraigniaud; Andrzej Pelc (J. Parallel Distributed Comput., 2017)

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. - Christian Glacet; Avery Miller; Andrzej Pelc (ACM Trans. Algorithms, 2017)

Finding the Size of a Radio Network with Short Labels. - Barun Gorain; Andrzej Pelc (ICDCN, 2018)

Explorable Families of Graphs. - Andrzej Pelc (SIROCCO, 2018)

Information Complexity of Treasure Hunt in Geometric Terrains. - Andrzej Pelc; Ram Narayan Yadav (CoRR, 2018)

Deterministic Meeting of Sniffing Agents in the Plane. - Samir Elouasbi; Andrzej Pelc (Fundam. Informaticae, 2018)

On deterministic rendezvous at a node of agents with arbitrary velocities. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (Inf. Process. Lett., 2018)

Reaching a target in the plane with no information. - Andrzej Pelc (Inf. Process. Lett., 2018)

Use of information, memory and randomization in asynchronous gathering. - Andrzej Pelc (J. Comput. Syst. Sci., 2018)

Deterministic gathering with crash faults. - Andrzej Pelc (Networks, 2018)

Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. - Andrzej Pelc; Ram Narayan Yadav (SPAA, 2019)

Impact of Knowledge on Election Time in Anonymous Networks. - Yoann Dieudonné; Andrzej Pelc (Algorithmica, 2019)

Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. - Andrzej Pelc; Ram Narayan Yadav (CoRR, 2019)

Deterministic Graph Exploration with Advice. - Barun Gorain; Andrzej Pelc (ACM Trans. Algorithms, 2019)

Deterministic Rendezvous Algorithms. - Andrzej Pelc (Distributed Computing by Mobile Entities, 2019)

Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. - Andrzej Pelc; Ram Narayan Yadav (ICDCN, 2020)

Almost Universal Anonymous Rendezvous in the Plane. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (SPAA, 2020)

Deterministic Treasure Hunt in the Plane with Angular Hints. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (Algorithmica, 2020)

Deciding and verifying network properties locally with few output bits. - Heger Arfaoui; Pierre Fraigniaud; David Ilcinkas; Fabien Mathieu; Andrzej Pelc (Distributed Comput., 2020)

Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. - Kokouvi Hounkanli; Avery Miller; Andrzej Pelc (Theor. Comput. Sci., 2020)

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. - Sébastien Bouchard; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ICALP, 2021)

2021 Edsger W. Dijkstra Prize in Distributed Computing. - Keren Censor-Hillel; Pierre Fraigniaud; Cyril Gavoille; Seth Gilbert; Andrzej Pelc; David Peleg (PODC, 2021)

Building a Nest by an Automaton. - Jurek Czyzowicz; Dariusz Dereniowski; Andrzej Pelc (Algorithmica, 2021)

Advice complexity of treasure hunt in geometric terrains. - Andrzej Pelc; Ram Narayan Yadav (Inf. Comput., 2021)

Short labeling schemes for topology recognition in wireless tree networks. - Barun Gorain; Andrzej Pelc (Theor. Comput. Sci., 2021)

Finding the size and the diameter of a radio network using short labels. - Barun Gorain; Andrzej Pelc (Theor. Comput. Sci., 2021)

Constant-Length Labeling Schemes for Deterministic Radio Broadcast. - Faith Ellen; Barun Gorain; Avery Miller; Andrzej Pelc (ACM Trans. Parallel Comput., 2021)

How to Meet at a Node of Any Connected Graph. - Subhash Bhagat; Andrzej Pelc (DISC, 2022)

Impact of knowledge on the cost of treasure hunt in trees. - Sébastien Bouchard; Arnaud Labourel; Andrzej Pelc (Networks, 2022)

Deterministic Leader Election in Anonymous Radio Networks. - Avery Miller; Andrzej Pelc; Ram Narayan Yadav (ACM Trans. Algorithms, 2022)

Fast Deterministic Rendezvous in Labeled Lines. - Avery Miller; Andrzej Pelc (DISC, 2023)

Deterministic Rendezvous Algorithms. - Andrzej Pelc (CoRR, 2023)

Computing Functions by Teams of Deterministic Finite Automata. - Debasish Pattanayak; Andrzej Pelc (CoRR, 2023)

Want to Gather? No Need to Chatter! - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc (SIAM J. Comput., 2023)

Deterministic size discovery and topology recognition in radio networks with short labels. - Adam Ganczorz; Tomasz Jurdzinski; Mateusz Lewko; Andrzej Pelc (Inf. Comput., 2023)

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. - Sébastien Bouchard; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ACM Trans. Algorithms, 2023)

Almost Universal Anonymous Rendezvous in the Plane. - Yoann Dieudonné; Andrzej Pelc; Franck Petit (Algorithmica, 2023)

Four shades of deterministic leader election in anonymous networks. - Barun Gorain; Avery Miller; Andrzej Pelc (Distributed Comput., 2023)

Gathering Teams of Deterministic Finite Automata on a Line. - Younan Gao; Andrzej Pelc (OPODIS, 2024)

Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. - Adam Ganczorz; Tomasz Jurdzinski; Andrzej Pelc (CoRR, 2024)

Graph exploration by a deterministic memoryless automaton with pebbles. - Debasish Pattanayak; Andrzej Pelc (Discret. Appl. Math., 2024)

Deterministic rendezvous in infinite trees. - Subhash Bhagat; Andrzej Pelc (Theor. Comput. Sci., 2024)

Deterministic treasure hunt and rendezvous in arbitrary connected graphs. - Debasish Pattanayak; Andrzej Pelc (Inf. Process. Lett., 2024)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. - Subhash Bhagat; Andrzej Pelc (ICDCN, 2025)

Exploration of Convex Terrains by a Deterministic Automaton with Pebbles. - Mohamed Anouar Baaziz; Andrzej Pelc (SIROCCO, 2025)

Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid. - Younan Gao; Andrzej Pelc (Theor. Comput. Sci., 2025)

Gathering Teams of Bounded Memory Agents on a Line. - Younan Gao; Andrzej Pelc (CoRR, 2025)

Exploring wedges of an oriented grid by an automaton with pebbles. - Subhash Bhagat; Andrzej Pelc (J. Comput. Syst. Sci., 2026)