Andrzej Pelc

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 102

Top Venues

Publications

Subhash Bhagat, Andrzej Pelc
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR (2024)
Debasish Pattanayak, Andrzej Pelc
Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. 356 (2024)
Debasish Pattanayak, Andrzej Pelc
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Inf. Process. Lett. 185 (2024)
Subhash Bhagat, Andrzej Pelc
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984 (2024)
Younan Gao, Andrzej Pelc
Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid. CoRR (2024)
Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. 292 (2023)
Avery Miller, Andrzej Pelc
Fast Deterministic Rendezvous in Labeled Lines. CoRR (2023)
Subhash Bhagat, Andrzej Pelc
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles. CoRR (2023)
Andrzej Pelc
Deterministic Rendezvous Algorithms. CoRR (2023)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
Want to Gather? No Need to Chatter! SIAM J. Comput. 52 (2) (2023)
Yoann Dieudonné, Andrzej Pelc, Franck Petit
Almost Universal Anonymous Rendezvous in the Plane. Algorithmica 85 (10) (2023)
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19 (3) (2023)
Barun Gorain, Avery Miller, Andrzej Pelc
Four shades of deterministic leader election in anonymous networks. Distributed Comput. 36 (4) (2023)
Avery Miller, Andrzej Pelc
Fast Deterministic Rendezvous in Labeled Lines. DISC (2023)
Debasish Pattanayak, Andrzej Pelc
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs. CoRR (2023)
Andrzej Pelc
Explorable families of graphs. CoRR (2023)
Debasish Pattanayak, Andrzej Pelc
Computing Functions by Teams of Deterministic Finite Automata. CoRR (2023)
Subhash Bhagat, Andrzej Pelc
How to Meet at a Node of Any Connected Graph. DISC (2022)
Avery Miller, Andrzej Pelc, Ram Narayan Yadav
Deterministic Leader Election in Anonymous Radio Networks. ACM Trans. Algorithms 18 (3) (2022)
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
Impact of knowledge on the cost of treasure hunt in trees. Networks 80 (1) (2022)
Subhash Bhagat, Andrzej Pelc
Deterministic Rendezvous in Infinite Trees. CoRR (2022)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. Algorithmica 83 (1) (2021)
Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. SPAA (2021)
Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. DISC (2021)
Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2021)
Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. CoRR (2021)
Barun Gorain, Avery Miller, Andrzej Pelc
Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA (2021)
Barun Gorain, Andrzej Pelc
Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864 (2021)
Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. 8 (3) (2021)
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP (2021)
Andrzej Pelc, Ram Narayan Yadav
Advice complexity of treasure hunt in geometric terrains. Inf. Comput. 281 (2021)
Barun Gorain, Andrzej Pelc
Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861 (2021)
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33 (2) (2020)
Andrzej Pelc, Ram Narayan Yadav
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. ICDCN (2020)
Avery Miller, Andrzej Pelc, Ram Narayan Yadav
Deterministic Leader Election in Anonymous Radio Networks. SPAA (2020)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR (2020)
Barun Gorain, Avery Miller, Andrzej Pelc
Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR (2020)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Almost Universal Anonymous Rendezvous in the Plane. CoRR (2020)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
Want to Gather? No Need to Chatter! PODC (2020)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82 (11) (2020)
Kokouvi Hounkanli, Avery Miller, Andrzej Pelc
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. Theor. Comput. Sci. 806 (2020)
Avery Miller, Andrzej Pelc, Ram Narayan Yadav
Deterministic Leader Election in Anonymous Radio Networks. CoRR (2020)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Almost Universal Anonymous Rendezvous in the Plane. SPAA (2020)
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR (2020)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. CoRR (2019)
Andrzej Pelc, Ram Narayan Yadav
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. CoRR (2019)
Andrzej Pelc, Ram Narayan Yadav
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. SPAA (2019)
Yoann Dieudonné, Andrzej Pelc
Impact of Knowledge on Election Time in Anonymous Networks. Algorithmica 81 (1) (2019)
Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA (2019)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc
Want to Gather? No Need to Chatter! CoRR (2019)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. ESA (2019)
Barun Gorain, Andrzej Pelc
Deterministic Graph Exploration with Advice. ACM Trans. Algorithms 15 (1) (2019)
Andrzej Pelc
Deterministic gathering with crash faults. Networks 72 (2) (2018)
Samir Elouasbi, Andrzej Pelc
Deterministic Meeting of Sniffing Agents in the Plane. Fundam. Informaticae 160 (3) (2018)
Andrzej Pelc
Explorable Families of Graphs. SIROCCO (2018)
Andrzej Pelc, Ram Narayan Yadav
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. CoRR (2018)
Barun Gorain, Andrzej Pelc
Finding the Size of a Radio Network with Short Labels. ICDCN (2018)
Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
Deterministic Computations on a PRAM with Static Processor and Memory Faults. CoRR (2018)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC (2018)
Andrzej Pelc
Use of information, memory and randomization in asynchronous gathering. J. Comput. Syst. Sci. 94 (2018)
Andrzej Pelc
Reaching a target in the plane with no information. Inf. Process. Lett. 140 (2018)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133 (2018)
Andrzej Pelc, Ram Narayan Yadav
Information Complexity of Treasure Hunt in Geometric Terrains. CoRR (2018)
Andrzej Pelc, Ram Narayan Yadav
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. CoRR (2018)
Andrzej Pelc
Deterministic Gathering with Crash Faults. CoRR (2017)
Barun Gorain, Andrzej Pelc
Deterministic Graph Exploration with Advice. ICALP (2017)
Pierre Fraigniaud, Andrzej Pelc
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109 (2017)
Andrzej Pelc
Use of Information, Memory and Randomization in Asynchronous Gathering. CoRR (2017)
Barun Gorain, Andrzej Pelc
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. CoRR (2017)
Christian Glacet, Avery Miller, Andrzej Pelc
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms 13 (3) (2017)
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR (2017)
Samir Elouasbi, Andrzej Pelc
Deterministic meeting of sniffing agents in the plane. CoRR (2017)
Barun Gorain, Andrzej Pelc
Leader Election in Trees with Customized Advice. CoRR (2017)
Samir Elouasbi, Andrzej Pelc
Deterministic rendezvous with detection using beeps. CoRR (2017)
Barun Gorain, Andrzej Pelc
Finding the Size of a Radio Network with Short Labels. CoRR (2017)
Barun Gorain, Andrzej Pelc
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO (2017)
Samir Elouasbi, Andrzej Pelc
Deterministic Rendezvous with Detection Using Beeps. Int. J. Found. Comput. Sci. 28 (1) (2017)
Avery Miller, Andrzej Pelc
Deterministic distributed construction of T-dominating sets in time T. Discret. Appl. Math. 222 (2017)
Yoann Dieudonné, Andrzej Pelc
Impact of Knowledge on Election Time in Anonymous Networks. SPAA (2017)
Avery Miller, Andrzej Pelc
Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$. CoRR (2017)
Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR (2017)
Andrzej Pelc
Reaching a Target in the Plane with no Information. CoRR (2017)
Andrzej Pelc, Alexander A. Schwarzmann
Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015). Inf. Comput. 255 (2017)
Kokouvi Hounkanli, Andrzej Pelc
Asynchronous Broadcasting with Bivalent Beeps. SIROCCO (2016)
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
Topology recognition with advice. Inf. Comput. 247 (2016)
Yoann Dieudonné, Andrzej Pelc
Anonymous Meeting in Networks. Algorithmica 74 (2) (2016)
David Caissy, Andrzej Pelc
Exploration of Faulty Hamiltonian Graphs. Int. J. Found. Comput. Sci. 27 (7) (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74 (1) (2016)
David Caissy, Andrzej Pelc
Exploration of Faulty Hamiltonian Graphs. CoRR (2016)
Barun Gorain, Andrzej Pelc
Deterministic Graph Exploration with Advice. CoRR (2016)
Dariusz Dereniowski, Andrzej Pelc
Topology Recognition and Leader Election in Colored Networks. CoRR (2016)
Kokouvi Hounkanli, Andrzej Pelc
Asynchronous Broadcasting with Bivalent Beeps. CoRR (2016)
Samir Elouasbi, Andrzej Pelc
Deterministic Meeting of Sniffing Agents in the Plane. SIROCCO (2016)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Rendezvous in networks in spite of delay faults. Distributed Comput. 29 (3) (2016)
Yoann Dieudonné, Andrzej Pelc
Impact of Knowledge on Election Time in Anonymous Networks. CoRR (2016)
Avery Miller, Andrzej Pelc
Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Comput. 29 (1) (2016)
Avery Miller, Andrzej Pelc
Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? SPAA (2016)
Kokouvi Hounkanli, Avery Miller, Andrzej Pelc
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. ALGOSENSORS (2016)
Dariusz Dereniowski, Andrzej Pelc
Topology recognition and leader election in colored networks. Theor. Comput. Sci. 621 (2016)

Andrzej Pelc.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrzej Pelc