default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Pelc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j201]Debasish Pattanayak
, Andrzej Pelc:
Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. 356: 149-160 (2024)- [j200]Debasish Pattanayak, Andrzej Pelc:
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Inf. Process. Lett. 185: 106455 (2024) - [j199]Subhash Bhagat, Andrzej Pelc:
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984: 114313 (2024) - [i57]Subhash Bhagat, Andrzej Pelc:
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR abs/2401.13044 (2024) - [i56]Younan Gao, Andrzej Pelc:
Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid. CoRR abs/2407.14969 (2024) - 2023
- [j198]Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. Algorithmica 85(10): 3110-3143 (2023) - [j197]Barun Gorain, Avery Miller, Andrzej Pelc:
Four shades of deterministic leader election in anonymous networks. Distributed Comput. 36(4): 419-449 (2023) - [j196]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. 292: 105010 (2023) - [j195]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! SIAM J. Comput. 52(2): 358-411 (2023) - [j194]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19(3): 22:1-22:32 (2023) - [c139]Avery Miller, Andrzej Pelc:
Fast Deterministic Rendezvous in Labeled Lines. DISC 2023: 29:1-29:22 - [i55]Subhash Bhagat, Andrzej Pelc:
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles. CoRR abs/2302.00052 (2023) - [i54]Andrzej Pelc:
Deterministic Rendezvous Algorithms. CoRR abs/2303.10391 (2023) - [i53]Andrzej Pelc:
Explorable families of graphs. CoRR abs/2303.10394 (2023) - [i52]Debasish Pattanayak, Andrzej Pelc:
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs. CoRR abs/2310.01136 (2023) - [i51]Debasish Pattanayak, Andrzej Pelc:
Computing Functions by Teams of Deterministic Finite Automata. CoRR abs/2310.01151 (2023) - [i50]Avery Miller, Andrzej Pelc:
Fast Deterministic Rendezvous in Labeled Lines. CoRR abs/2311.12976 (2023) - 2022
- [j193]Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc:
Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1): 51-62 (2022) - [j192]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. ACM Trans. Algorithms 18(3): 25:1-25:33 (2022) - [c138]Subhash Bhagat, Andrzej Pelc:
How to Meet at a Node of Any Connected Graph. DISC 2022: 11:1-11:16 - [i49]Subhash Bhagat, Andrzej Pelc:
Deterministic Rendezvous in Infinite Trees. CoRR abs/2203.05160 (2022) - 2021
- [j191]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. Algorithmica 83(1): 144-176 (2021) - [j190]Andrzej Pelc, Ram Narayan Yadav:
Advice complexity of treasure hunt in geometric terrains. Inf. Comput. 281: 104705 (2021) - [j189]Barun Gorain, Andrzej Pelc:
Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861: 23-44 (2021) - [j188]Barun Gorain, Andrzej Pelc:
Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864: 20-33 (2021) - [j187]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. 8(3): 14:1-14:17 (2021) - [c137]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP 2021: 36:1-36:20 - [c136]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - [c135]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA 2021: 265-274 - [c134]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. SPAA 2021: 432-434 - [c133]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. DISC 2021: 22:1-22:20 - [i48]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. CoRR abs/2105.10595 (2021) - 2020
- [j186]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11): 3250-3281 (2020) - [j185]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33(2): 169-187 (2020) - [j184]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. Theor. Comput. Sci. 806: 567-576 (2020) - [c132]Andrzej Pelc, Ram Narayan Yadav:
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. ICDCN 2020: 4:1-4:10 - [c131]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! PODC 2020: 253-262 - [c130]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. SPAA 2020: 117-127 - [c129]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. SPAA 2020: 407-417 - [i47]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. CoRR abs/2002.02641 (2020) - [i46]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR abs/2005.00875 (2020) - [i45]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. CoRR abs/2005.00880 (2020) - [i44]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR abs/2009.06149 (2020) - [i43]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR abs/2010.14916 (2020)
2010 – 2019
- 2019
- [j183]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. Algorithmica 81(1): 238-288 (2019) - [j182]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ACM Trans. Algorithms 15(1): 8:1-8:17 (2019) - [c128]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. ESA 2019: 35:1-35:14 - [c127]Andrzej Pelc, Ram Narayan Yadav:
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. SPAA 2019: 85-92 - [c126]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA 2019: 171-178 - [p1]Andrzej Pelc:
Deterministic Rendezvous Algorithms. Distributed Computing by Mobile Entities 2019: 423-454 - [i42]Andrzej Pelc, Ram Narayan Yadav:
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. CoRR abs/1902.06090 (2019) - [i41]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. CoRR abs/1904.10850 (2019) - [i40]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! CoRR abs/1908.11402 (2019) - 2018
- [j181]Samir Elouasbi, Andrzej Pelc:
Deterministic Meeting of Sniffing Agents in the Plane. Fundam. Informaticae 160(3): 281-301 (2018) - [j180]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133: 39-43 (2018) - [j179]Andrzej Pelc:
Reaching a target in the plane with no information. Inf. Process. Lett. 140: 13-17 (2018) - [j178]Andrzej Pelc:
Use of information, memory and randomization in asynchronous gathering. J. Comput. Syst. Sci. 94: 193-205 (2018) - [j177]Andrzej Pelc:
Deterministic gathering with crash faults. Networks 72(2): 182-199 (2018) - [c125]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. ICDCN 2018: 10:1-10:10 - [c124]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC 2018: 48:1-48:13 - [c123]Andrzej Pelc:
Explorable Families of Graphs. SIROCCO 2018: 165-177 - [i39]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. CoRR abs/1801.00237 (2018) - [i38]Andrzej Pelc, Ram Narayan Yadav:
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. CoRR abs/1810.03120 (2018) - [i37]Andrzej Pelc, Ram Narayan Yadav:
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. CoRR abs/1811.06420 (2018) - [i36]Andrzej Pelc, Ram Narayan Yadav:
Information Complexity of Treasure Hunt in Geometric Terrains. CoRR abs/1811.06823 (2018) - 2017
- [j176]Avery Miller, Andrzej Pelc:
Deterministic distributed construction of T-dominating sets in time T. Discret. Appl. Math. 222: 172-178 (2017) - [j175]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: 335 (2017) - [j174]Samir Elouasbi, Andrzej Pelc:
Deterministic Rendezvous with Detection Using Beeps. Int. J. Found. Comput. Sci. 28(1): 77- (2017) - [j173]Pierre Fraigniaud, Andrzej Pelc:
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109: 117-128 (2017) - [j172]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms 13(3): 31:1-31:41 (2017) - [c122]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ICALP 2017: 132:1-132:14 - [c121]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO 2017: 37-52 - [c120]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. SPAA 2017: 207-215 - [i35]Barun Gorain, Andrzej Pelc:
Leader Election in Trees with Customized Advice. CoRR abs/1702.03534 (2017) - [i34]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. CoRR abs/1704.01927 (2017) - [i33]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. CoRR abs/1704.08713 (2017) - [i32]Andrzej Pelc:
Deterministic Gathering with Crash Faults. CoRR abs/1704.08880 (2017) - [i31]Avery Miller, Andrzej Pelc:
Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$. CoRR abs/1705.01229 (2017) - [i30]Andrzej Pelc:
Use of Information, Memory and Randomization in Asynchronous Gathering. CoRR abs/1709.05869 (2017) - [i29]Samir Elouasbi, Andrzej Pelc:
Deterministic rendezvous with detection using beeps. CoRR abs/1709.06214 (2017) - [i28]Samir Elouasbi, Andrzej Pelc:
Deterministic meeting of sniffing agents in the plane. CoRR abs/1709.06217 (2017) - [i27]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR abs/1710.03178 (2017) - [i26]Andrzej Pelc:
Reaching a Target in the Plane with no Information. CoRR abs/1710.07145 (2017) - [i25]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR abs/1710.08291 (2017) - 2016
- [j171]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): 117-155 (2016) - [j170]Yoann Dieudonné, Andrzej Pelc:
Anonymous Meeting in Networks. Algorithmica 74(2): 908-946 (2016) - [j169]Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Comput. 29(1): 51-64 (2016) - [j168]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3): 187-205 (2016) - [j167]Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Topology recognition with advice. Inf. Comput. 247: 254-265 (2016) - [j166]David Caissy, Andrzej Pelc:
Exploration of Faulty Hamiltonian Graphs. Int. J. Found. Comput. Sci. 27(7): 809-828 (2016) - [j165]Dariusz Dereniowski, Andrzej Pelc:
Topology recognition and leader election in colored networks. Theor. Comput. Sci. 621: 92-102 (2016) - [c119]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. ALGOSENSORS 2016: 16-28 - [c118]Samir Elouasbi, Andrzej Pelc:
Deterministic Meeting of Sniffing Agents in the Plane. SIROCCO 2016: 212-227 - [c117]Kokouvi Hounkanli, Andrzej Pelc:
Asynchronous Broadcasting with Bivalent Beeps. SIROCCO 2016: 291-306 - [c116]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. SODA 2016: 600-609 - [c115]Avery Miller, Andrzej Pelc:
Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? SPAA 2016: 377-386 - [r2]Andrzej Pelc:
Broadcasting in Geometric Radio Networks. Encyclopedia of Algorithms 2016: 241-244 - [i24]Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi:
Topology recognition with advice. CoRR abs/1601.06040 (2016) - [i23]Dariusz Dereniowski, Andrzej Pelc:
Topology Recognition and Leader Election in Colored Networks. CoRR abs/1601.07790 (2016) - [i22]David Caissy, Andrzej Pelc:
Exploration of Faulty Hamiltonian Graphs. CoRR abs/1602.05136 (2016) - [i21]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234 (2016) - [i20]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. CoRR abs/1604.05023 (2016) - [i19]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. CoRR abs/1607.01657 (2016) - [i18]Kokouvi Hounkanli, Andrzej Pelc:
Asynchronous Broadcasting with Bivalent Beeps. CoRR abs/1611.08938 (2016) - 2015
- [j164]Yoann Dieudonné, Andrzej Pelc:
Deterministic polynomial approach in the plane. Distributed Comput. 28(2): 111-129 (2015) - [j163]Emanuele G. Fusco, Andrzej Pelc:
Knowledge, level of symmetry, and time of leader election. Distributed Comput. 28(4): 221-232 (2015) - [j162]Emanuele G. Fusco, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. Fundam. Informaticae 137(3): 305-322 (2015) - [j161]Avery Miller, Andrzej Pelc:
Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distributed Comput. 83: 159-167 (2015) - [j160]Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to Meet Asynchronously at Polynomial Cost. SIAM J. Comput. 44(3): 844-867 (2015) - [j159]Avery Miller, Andrzej Pelc:
Fast rendezvous with advice. Theor. Comput. Sci. 608: 190-198 (2015) - [c114]Samir Elouasbi, Andrzej Pelc:
Deterministic Rendezvous with Detection Using Beeps. ALGOSENSORS 2015: 85-97 - [e3]Andrzej Pelc, Alexander A. Schwarzmann:
Stabilization, Safety, and Security of Distributed Systems - 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings. Lecture Notes in Computer Science 9212, Springer 2015, ISBN 978-3-319-21740-6 [contents] - [i17]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. CoRR abs/1505.04308 (2015) - [i16]Avery Miller, Andrzej Pelc:
Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt. CoRR abs/1506.07952 (2015) - [i15]Emanuele G. Fusco, Andrzej Pelc:
Knowledge, Level of Symmetry, and Time of Leader Election. CoRR abs/1508.01300 (2015) - [i14]Avery Miller, Andrzej Pelc:
Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks. CoRR abs/1508.02471 (2015) - [i13]Kokouvi Hounkanli, Andrzej Pelc:
Deterministic Broadcasting and Gossiping with Beeps. CoRR abs/1508.06460 (2015) - [i12]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. CoRR abs/1508.06583 (2015) - 2014
- [j158]Dariusz Dereniowski, Andrzej Pelc:
Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Comput. 27(1): 21-38 (2014) - [j157]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time versus space trade-offs for rendezvous in trees. Distributed Comput. 27(2): 95-109 (2014) - [j156]Andrzej Pelc, Anas Tiane:
Efficient Grid Exploration with a stationary Token. Int. J. Found. Comput. Sci. 25(3): 247-262 (2014) - [j155]Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering Despite Mischief. ACM Trans. Algorithms 11(1): 1:1-1:28 (2014) - [j154]Yoann Dieudonné, Andrzej Pelc:
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ACM Trans. Algorithms 11(2): 10:1-10:29 (2014) - [j153]