ARTICLES PUBLIÉS DANS DES REVUES

2024

• D. Pattanayak, A. Pelc, Deterministic treasure hunt and rendezvous in arbitrary connected graphs, Information Processing Letters 185 (2024), 106455.
• S. Bhagat, A. Pelc, Deterministic rendezvous in infinite trees, Theoretical Computer Science 984 (2024), 114313.

• S. Bouchard, Y. Dieudonné, A. Pelc, Want to gather? No need to chatter!, SIAM Journal on Computing 52 (2023), 358-411.
• A. Ganczorz, T. Jurdzinski, M. Lewko, A. Pelc, Deterministic size discovery and topology recognition in radio networks with short labels, Information and Computation 292 (2023), 105010.
• S. Bouchard, Y. Dieudonné, A. Labourel, A. Pelc, Almost-optimal deterministic treasure hunt in unweighted graphs, ACM Transactions on Algorithms 19 (2023), 22:1 - 22:32.
• Y. Dieudonné, A. Pelc, F. Petit, Almost universal anonymous rendezvous in the plane, Algorithmica 85 (2023), 3110-3143.
• B. Gorain, A. Miller, A. Pelc, Four shades of deterministic leader election in anonymous networks, Distributed Computing 36 (2023), 419-449.

• A. Miller, A. Pelc, R. Yadav, Deterministic leader election in anonymous radio networks, ACM Transactions on Algorithms 18 (2022), 25:1 - 25:33.
• S. Bouchard, A. Labourel, A. Pelc, Impact of knowledge on the cost of treasure hunt in trees, Networks 80 (2022), 51-62.

• A. Pelc, R.N. Yadav, Advice complexity of treasure hunt in geometric terrains, Information and Computation 281 (2021), 104705.
• F. Ellen, B. Gorain, A. Miller, A. Pelc, Constant-length labeling schemes for deterministic radio broadcast, ACM Transactions on Parallel Computing 8 (2021), 14:1-14:17.
• B. Gorain, A. Pelc, Short labeling schemes for topology recognition in wireless tree networks, Theoretical Computer Science 861 (2021), 23-44.
• B. Gorain, A. Pelc, Finding the size and the diameter of a radio network using short labels, Theoretical Computer Science 864 (2021), 20-33.
• J. Czyzowicz, D. Dereniowski, A. Pelc, Building a nest by an automaton, Algorithmica 83 (2021), 144-176.

• S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit, Deterministic treasure hunt in the plane with angular hints, Algorithmica 82 (2020), 3250-3281.
• H. Arfaoui, P. Fraigniaud, D. Ilcinkas, F. Mathieu, A. Pelc, Deciding and verifying network properties locally with few output bits, Distributed Computing 33 (2020), 169-187.
• K. Hounkanli, A. Miller, A. Pelc, Global synchronization and consensus using beeps in a fault-prone MAC, Theoretical Computer Science 806 (2020), 567-576.

• B. Gorain, A. Pelc, Deterministic graph exploration with advice, ACM Transactions on Algorithms 15 (2019), 8:1-8:17.
• Y. Dieudonné, A. Pelc, Impact of knowledge on election time in anonymous networks, Algorithmica 81 (2019), 238-288.

• A. Pelc, Reaching a target in the plane with no information, Information Processing Letters 140 (2018), 13-17.
• A. Pelc, Deterministic gathering with crash faults, Networks 72 (2018), 182-199.
• S. Elouasbi, A. Pelc, Deterministic meeting of sniffing agents in the plane, Fundamenta Informaticae 160 (2018), 281-301.
• A. Pelc, Use of information, memory and randomization in asynchronous gathering, Journal of Computer and System Sciences 94 (2018), 193-205.
• S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit, Deterministic rendezvous at a node of agents with arbitrary velocities, Information Processing Letters 133 (2018), 39-43.

• P. Fraigniaud, A. Pelc, Decidability classes for mobile agents computing, Journal of Parallel and Distributed Computing 109 (2017), 117-128.
• C. Glacet, A. Miller, A. Pelc, Time vs. information tradeoffs for leader election in anonymous trees, ACM Transactions on Algorithms 13 (2017), 31:1-31:41.
• A. Miller, A. Pelc, Deterministic distributed construction of T-dominating sets in time T, Discrete Applied Mathematics 222 (2017), 172-178.
• S. Elouasbi, A. Pelc, Deterministic rendezvous with detection using beeps, International Journal of Foundations of Computer Science 28 (2017), 77-97.

• E. Fusco, A. Pelc, R. Petreschi, Topology recognition with advice, Information and Computation 247 (2016), 254-265.
• D. Caissy, A. Pelc, Exploration of faulty Hamiltonian graphs, International Journal of Foundations of Computer Science 27 (2016), 809-828.
• D. Dereniowski, A. Pelc, Topology recognition and leader election in colored networks, Theoretical Computer Science 621 (2016), 92-102.
• J. Chalopin, Y. Dieudonné, A. Labourel, A. Pelc, Rendezvous in networks in spite of delay faults, Distributed Computing 29 (2016), 187-205.
• A. Miller, A. Pelc, Time versus cost tradeoffs for deterministic rendezvous in networks, Distributed Computing 29 (2016), 51-64.
• Y. Dieudonné, A. Pelc, Anonymous meeting in networks, Algorithmica 74 (2016), 908-946 .
• J. Anaya, J. Chalopin, J. Czyzowicz, A. Labourel, A. Pelc, Y. Vaxès, Convergecast and broadcast by power-aware mobile agents, Algorithmica 74 (2016), 117-155.

• Y. Dieudonné, A. Pelc, V. Villain, How to meet asynchronously at polynomial cost, SIAM Journal on Computing 44 (2015), 844-867.
• A. Miller, A. Pelc, Tradeoffs between cost and information for rendezvous and treasure hunt, Journal of Parallel and Distributed Computing 83 (2015), 159-167.
• A. Miller, A. Pelc, Fast rendezvous with advice, Theoretical Computer Science 608 (2015), 190-198.
• E. Fusco, A. Pelc, Knowledge, level of symmetry and time of leader election, Distributed Computing 28 (2015), 221-232.
• Y. Dieudonné, A. Pelc, Deterministic polynomial approach in the plane, Distributed Computing 28 (2015), 111-129.
• E. Fusco, A. Pelc, Communication complexity of consensus in anonymous message passing systems, Fundamenta Informaticae 137 (2015), 305-322.

• Y. Dieudonné, A. Pelc, Deterministic network exploration by anonymous silent agents with local traffic reports, ACM Transactions on Algorithms 11 (2014), 10:1-10:29.
• Y. Dieudonné, A. Pelc, D. Peleg, Gathering despite mischief, ACM Transactions on Algorithms 11 (2014), 1:1-1:28.
• J. Czyzowicz, A. Kosowski, A. Pelc, Time vs. space trade-offs for rendezvous in trees, Distributed Computing 27 (2014), 95-109.
• A. Pelc, A. Tiane, Efficient grid exploration with a stationary token, International Journal of Foundations of Computer Science 25 (2014), 247-262.
• D. Dereniowski, A. Pelc, Leader election for anonymous asynchronous agents in arbitrary networks, Distributed Computing 27 (2014), 21-38.
• Y. Dieudonné, A. Pelc, Price of asynchrony in mobile agents computing, Theoretical Computer Science 524 (2014), 59-67.

• S. Guilbault, A. Pelc, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Theoretical Computer Science 509 (2013), 86-96.
• D. Kowalski, A. Pelc, Leader election in ad hoc radio networks: a keen ear helps, Journal of Computer and System Sciences 79 (2013), 1164-1180.
• P. Fraigniaud, A. Pelc, Delays induce an exponential memory gap for rendezvous in trees, ACM Transactions on Algorithms 9 (2013), 17:1-17:24.
• J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc, Worst-case optimal exploration of terrains with obstacles, Information and Computation 225 (2013), 16-28.
• P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, Algorithmica 65 (2013), 562-583.
• J. Czyzowicz, A. Kosowski, A. Pelc, Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains, Theory of Computing Systems 52 (2013), 179-199.

• I. Benyahia, A Survey of Ant Colony Optimization Algorithms for Telecommunication Networks, International Journal of Applied Metaheuristic Computing (IJAMC) 3 (2012), 18-32.
• J. Czyzowicz, L. Gasieniec, A. Pelc, Choosing the best among peers, Theoretical Computer Science 440-441 (2012), 52-59.
• E. Fusco, A. Pelc, Distributed tree comparison with nodes of limited memory, Networks 60 (2012), 235-244.
• Y. Dieudonné, A. Pelc, Deterministic network exploration by a single agent with Byzantine tokens, Information Processing Letters 112 (2012), 467-470.
• D. Dereniowski, A. Pelc, Drawing maps with advice, Journal of Parallel and Distributed Computing 72 (2012), 132-143.
• J. Czyzowicz, A. Kosowski, A. Pelc, How to meet when you forget: Log-space rendezvous in arbitrary graphs, Distributed Computing 25 (2012), 165-178.
• J. Czyzowicz, A. Labourel, A. Pelc, How to meet asynchronously (almost) everywhere, ACM Transactions on Algorithms 8 (2012), 37:1-37:14.
• A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks 59 (2012), 331-347.

• E. Fusco, A. Pelc, How much memory is needed for leader election, Distributed Computing 24 (2011), 65-78.
• J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc, Asynchronous deterministic rendezvous in bounded terrains, Theoretical Computer Science 412 (2011), 6926-6937.
• P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, How many oblivious robots can explore a line, Information Processing Letters 111 (2011), 1027-1031.
• J. Czyzowicz, L. Gasieniec, D. Kowalski, A. Pelc, Consensus and mutual exclusion in a multiple access channel, IEEE Transactions on Parallel and Distributed Systems 22 (2011), 1092-1104.
• E. Fusco, A. Pelc, Trade-offs between the size of advice and broadcasting time in trees, Algorithmica 60 (2011), 719-734.
• C. Ambuehl, L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, ACM Transactions on Algorithms 7 (2011), 17:1-17:21.
• J. Czyzowicz, A. Labourel, A. Pelc, Optimality and competitiveness of exploring polygons by mobile robots, Information and Computation 209 (2011), 74-88.

• E. Fusco, A. Pelc, Broadcasting in UDG radio networks with missing and inaccurate information, Distributed Computing 22 (2010), 167-183.
• A. Pelc, Fault-tolerant strategies in the Iterated Prisoner's Dilemma, Information Processing Letters 110 (2010), 389-395.
• P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, Remembering without memory: tree exploration by asynchronous oblivious robots, Theoretical Computer Science 411 (2010), 1544-1557.
• D. Ilcinkas, D. Kowalski, A. Pelc, Fast radio broadcasting with advice, Theoretical Computer Science 411 (2010), 1583-1598.
• P. Fraigniaud, D. Ilcinkas, A. Pelc, Communication algorithms with advice, Journal of Computer and System Sciences 76 (2010), 222-232.
• E. Kranakis, M. Paquette, A.Pelc, The diameter and connectivity of networks with random dependent faults, Networks 56 (2010), 103-115.
• E. Kranakis, M. Paquette, A. Pelc, Communication in random geometric radio networks with positively correlated random faults, Ad Hoc & Sensor Wireless Networks 9 (2010), 23-52.
• V. Talbot, I. Benyahia, Complex application architecture dynamic reconfiguration based on multi-criteria decision making, International Journal of Software Engineering \& Applications (IJSEA) Vol.1. 4 (2010), 19-37.

• A. Pelc, K.J. Pelc, Same game, new tricks: what makes a good strategy in the Prisoner's Dilemma?, Journal of Conflict Resolution 53 (2009), 774-793.
• P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc, Distributed computing with advice: information sensitivity of graph coloring, Distributed Computing 21 (2009), 395-403.
• Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg, C. Su, Broadcasting time in UDG radio networks with unknown topology, Distributed Computing 21 (2009), 331-351.
• J. Czyzowicz, L. Gasieniec, A. Pelc, Gathering few fat mobile robots in the plane, Theoretical Computer Science 410 (2009), 481-499.
• P. Flocchini, A. Pelc, N. Santoro, Fault-tolerant sequential scan, Theory of Computing Systems 45 (2009), 1-26.
• A. Pelc, Why do we believe theorems?, Philosophia Mathematica III 17 (2009), 84-94.
  inclus dans:
  The Best Writing on Mathematics 2010, Mircea Pitici, Ed., Princeton University Press, 2010.

• E.G. Fusco, A. Pelc, Acknowledged broadcasting in ad hoc radio networks, Information Processing Letters 109 (2008), 136-141.
• P. Fraigniaud, D. Ilcinkas, A. Pelc, Tree exploration with an oracle, Information and Computation 206 (2008), 1276-1287.
• P. Fraigniaud, D. Ilcinkas, A. Pelc, Impact of memory size on graph exploration capability, Discrete Applied Mathematics 156 (2008), 2310-2319.
• R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science 390 (2008), 27-39.
• D. Ilcinkas, A. Pelc, Impact of asynchrony on the behavior of rational selfish agents, Fundamenta Informaticae 82 (2008), 113-125.

• A. Pelc, Activating anonymous ad hoc radio networks, Distributed Computing 19 (2007), 361-371.
• A. Pelc, D. Peleg, Feasibility and complexity of broadcasting with random transmission failures, Theoretical Computer Science 370 (2007), 279-292.
• D. Kowalski, A. Pelc, Optimal deterministic broadcasting in known topology radio networks, Distributed Computing 19 (2007), 185-195.
• J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in synchronous tree networks, Combinatorics, Probability & Computing 16 (2007), 595-619.
• A. Dessmark, A. Pelc, Broadcasting in geometric radio networks, Journal of Discrete Algorithms 5 (2007), 187-201.
• J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, M. Vargas Martin, Assigning bookmarks in perfect binary trees, Ars Combinatoria 82 (2007), 165-179.
• E. Markou, A. Pelc, Efficient exploration of faulty trees, Theory of Computing Systems 40 (2007), 225-247.

• M. Paquette, A. Pelc, Fast broadcasting with Byzantine faults, International Journal of Foundations of Computer Science 17 (2006), 1423-1439.
• L. Gasieniec, E. Kranakis, A. Pelc, Q. Xin, Deterministic M2M multicast in radio networks, Theoretical Computer Science 362 (2006), 196-206.
• P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective tree exploration, Networks 48 (2006), 166-177.
• G. De Marco, A. Pelc, Randomized algorithms for determining the majority on graphs, Combinatorics, Probability & Computing 15 (2006), 823-834.
• K. Diks, S. Dobrev, A. Pelc, Exploring planar graphs using unoriented maps, Journal of Interconnection Networks 7 (2006), 353-373.
• A. Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006), 69-96.
• J.-Y. Potvin, Y. Xu, I. Benyahia, Vehicle routing and scheduling with dynamic travel times, Computer & Operations Research 33 (2006) 1129-1137.
• G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science 355 (2006), 315-326.
• A. Pelc, Voting mechanisms in asynchronous Byzantine environments, Parallel Processing Letters 16 (2006), 93-99.
• J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae 71 (2006), 229-242.
• T. Calamoneri, A. Pelc, R. Petreschi, Labeling trees with a condition at distance two, Discrete Mathematics 306 (2006), 1534-1539.
• M. Paquette, A. Pelc, Optimal decision strategies in Byzantine environments, Journal of Parallel and Distributed Computing 66 (2006), 419-427.

• D. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, Distributed Computing 18 (2005), 43-57.
• P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science 345 (2005), 331-344.
• J. Czyzowicz, W. Fraczak, A. Pelc, Transducers with set outputs, Journal of Automata, Languages and Combinatorics 10 (2005), 37-49.
• A. Pelc, D. Peleg, Broadcasting with locally bounded Byzantine faults, Information Processing Letters 93 (2005), 109-115.
• D. Kowalski, A. Pelc, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, Theoretical Computer Science 333 (2005), 355-371.

• D. Kowalski, A. Pelc, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing 33 (2004), 870-891.
• A. Dessmark, A. Pelc, Optimal graph exploration without good maps, Theoretical Computer Science 326 (2004), 343-362.
• D. Kowalski, A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, SIAM Journal on Discrete Mathematics 18 (2004), 332-346.
• K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc, Tree exploration with little memory, Journal of Algorithms 51 (2004), 38-63.
• S. Dobrev, A. Pelc, Leader election in rings with nonunique labels, Fundamenta Informaticae 59 (2004), 333-347.
• A. Dessmark, A. Pelc, Distributed coloring and communication in rings with local knowledge, Combinatorics, Probability and Computing 13 (2004), 123-136.

• B.S. Chlebus, L. Gasieniec, A. Pelc, Deterministic computations on a PRAM with static processor and memory faults, Fundamenta Informaticae 55 (2003), 285-306.
• J.Czyzowicz, E.Kranakis, D. Krizanc, A. Pelc, M.Vargas Martin, Enhancing hyperlink structure for improving Web performance, Journal of Web Engineering 1 (2003), 93-127.
• J. Czyzowicz, W. Fraczak, A. Pelc, W. Rytter, Linear time prime decomposition of regular prefix codes, International Journal of Foundations of Computer Science 14 (2003), 1019-1031.
• A. Dessmark, A. Lingas, A. Pelc, Tradeoffs between load and degree in virtual path layouts, Parallel Processing Letters13 (2003), 485-496.
• G. De Marco, A. Pelc, Deterministic broadcasting time with partial knowledge of the network, Theoretical Computer Science 290 (2003), 2009-2020.
• K. El Guemhioui, A framework for distributing object-oriented designs, International Journal on Software Tools for Technology Transfer 4 (2003), 381-396.

• K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact of information on broadcasting time in linear radio networks, Theoretical Computer Science 287 (2002), 449-471.
• A. Dessmark, A. Pelc, Deterministic radio broadcasting at low cost, Networks 39 (2002), 88-97.
• B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in ad hoc radio networks, Distributed Computing 15 (2002), 27-38.
• A. Pelc, Searching games with errors - Fifty years of coping with liars, Theoretical Computer Science 270 (2002), 71-109.

• L. Gargano, A. Pelc, S. Perennes, U. Vaccaro, Efficient communication in unknown networks, Networks 38 (2001), 39-49.
• P. Fraigniaud, A. Pelc, D. Peleg, S. Perennes, Assigning labels in an unknown anonymous network with a leader, Distributed Computing 14 (2001), 163-183.
• L. Gasieniec, A. Pelc, D. Peleg, The wakeup problem in synchronous broadcast systems, SIAM Journal on Discrete Mathematics 14 (2001), 207-222.
• E. Kranakis, D. Krizanc, A. Pelc, Fault-tolerant broadcasting in radio networks, Journal of Algorithms 39 (2001), 47-67.
• G. De Marco, A. Pelc, Faster broadcasting in unknown radio networks, Information Processing Letters 79 (2001), 53-56.

ARTICLES PUBLIÉS DANS DES ACTES DE CONFÉRENCES

2023

• A. Miller, A. Pelc, Fast deterministic rendezvous in labeled lines, Proc. 37th International Symposium on Distributed Computing (DISC 2023) 29:1 - 29:22.

• S. Bhagat, A. Pelc, How to meet at a node of any connected graph, Proc. 36th International Symposium on Distributed Computing (DISC 2022), 11:1 - 11:16.

• A. Ganczorz, T. Jurdzinski, M. Lewko, A. Pelc, Deterministic size discovery and topology recognition in radio networks with short labels, Proc. 35th International Symposium on Distributed Computing (DISC 2021), 22:1-22:20.
• B. Gorain, A. Miller, A. Pelc, Four shades of deterministic leader election in anonymous networks, Proc. 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), 265-274.
• A. Ganczorz, T. Jurdzinski, M. Lewko, A. Pelc, Brief Announcement: Deterministic size discovery and topology recognition in radio networks with short labels, Proc. 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), 432-434.
• S. Bouchard, Y. Dieudonné, A. Labourel, A. Pelc, Almost-optimal deterministic treasure hunt in arbitrary graphs, Proc. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 36:1-36:20.

• S. Bouchard, Y. Dieudonné, A. Pelc, Want to gather? No need to chatter!, Proc. 39th Annual ACM Symposium on Principles of Distributed Computing (PODC 2020), août 2020, 253-262.
• S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit, Almost universal anonymous rendezvous in the plane, Proc. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), juillet 2020, 117-127.
• A. Miller, A. Pelc, R. Yadav, Deterministic leader election in anonymous radio networks, Proc. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), juillet 2020, 407-417.
• A. Pelc, R. Yadav, Latecomers help to meet: Deterministic anonymous gathering in the plane, Proc. 21st International Conference on Distributed Computing and Networking (ICDCN 2020), janvier 2020, Kolkata, Inde, 4:1-4:10.

• J. Czyzowicz, D. Dereniowski, A. Pelc, Building a nest by an automaton, Proc. 27th Annual European Symposium on Algorithms (ESA 2019), septembre 2019, Munich, Allemagne, 35:1-35:14.
• F. Ellen, B. Gorain, A. Miller, A. Pelc, Constant-length labeling schemes for deterministic radio broadcast, Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), juin 2019, Phoenix, AZ, USA, 171-178. (Best Paper Award)
• A. Pelc, R.N. Yadav, Using time to break symmetry: universal deterministic anonymous rendezvous, Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), juin 2019, Phoenix, AZ, USA, 85-92.

• S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit, Deterministic treasure hunt in the plane with angular hints, Proc. 29th International Symposium on Algorithms and Computation (ISAAC 2018), décembre 2018, Jiaoxi, Taiwan, 48:1 - 48:13.
• A. Pelc, Explorable families of graphs, Proc. 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018), juin 2018, Ma'ale HaHamisha, Israel, 165-177.
• B. Gorain, A. Pelc, Finding the size of a radio network with short labels, Proc. 19th International Conference on Distributed Computing and Networking (ICDCN 2018), janvier 2018, Varanasi, Inde, 10:1-10:10.

• Y. Dieudonné, A. Pelc, Impact of knowledge on election time in anonymous networks, Proc. 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017), juillet 2017, Washington, DC, USA, 207-215.
• B. Gorain, A. Pelc, Deterministic graph exploration with advice, Proc. 44th International Colloquium on Automata, Languages and Programming (ICALP 2017), juillet 2017, Varsovie, Pologne, 132:1-132:14.
• B. Gorain, A. Pelc, Short labeling schemes for topology recognition in wireless tree networks, Proc. 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017), juin 2017, Porquerolles, France, 37-52.

• A. Miller, A. Pelc, Election vs. selection: How much advice is needed to find the largest node in a graph?, Proc. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), juillet 2016, Asilomar State Beach, USA, 377-386.
• C. Glacet, A. Miller, A. Pelc, Time vs. information tradeoffs for leader election in anonymous trees, Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), janvier 2016, Arlington, USA, 600-609.
• K. Hounkanli, A. Pelc, Asynchronous broadcasting with bivalent beeps, Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), juillet 2016, Helsinki, Finlande, 291-306.
• S. Elouasbi, A. Pelc, Deterministic meeting of sniffing agents in the plane, Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), juillet2016, Helsinki, Finlande, 212-227.
• K. Hounkanli, A. Miller, A. Pelc, Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC, Proc. 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2016), août 2016, Aarhus, Danemark, 16-28.

• S. Elouasbi, A. Pelc, Deterministic rendezvous with detection using beeps, Proc. 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2015), septembre 2015, Patras, Grèce, LNCS 9536, 85-97.

• A. Miller, A. Pelc, Tradeoffs between cost and information for rendezvous and treasure hunt, Proc. 18th International Conference on Principles of Distributed Systems (OPODIS 2014), décembre 2014, Cortina d'Ampezzo, Italie, LNCS 8878, 263-276.
• A. Miller, A. Pelc, Fast rendezvous with advice, Proc. 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2014), septembre 2014, Wroclaw, Pologne, LNCS 8847, 75-87.
• A. Miller, A. Pelc, Time versus cost tradeoffs for deterministic rendezvous in networks, Proc. 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014), juillet 2014, Paris, France, 282-290.
• J. Chalopin, Y. Dieudonné, A. Labourel, A. Pelc, Fault-tolerant rendezvous in networks, Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP 2014), juillet 2014, Copenhague, Danmark, LNCS 8573, 411-422.

• E. Fusco, A. Pelc, R. Petreschi, Use knowledge to learn faster: Topology recognition with advice, Proc. 27th International Symposium on Distributed Computing (DISC 2013), octobre 2013, Jerusalem, Israel, LNCS 8205, 31-45.
• Y. Dieudonné, A. Pelc, V. Villain, How to meet asynchronously at polynomial cost, Proc. 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), juillet 2013, Montreal, Canada, 92-99.
• E. Fusco, A. Pelc, R. Petreschi, Learning a ring cheaply and fast, Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), juillet 2013, Riga, Letonie, LNCS 7966, 557-568.
• Y. Dieudonné, A. Pelc, Deterministic polynomial approach in the plane, Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), juillet 2013, Riga, Letonie, LNCS 7966, 533-544.
• Y. Dieudonné, A. Pelc, Anonymous meeting in networks, Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), janvier 2013, New Orleans, USA, 737-747.
• H. Arfaoui, P. Fraigniaud, A. Pelc, Local decision and verification with bounded-size outputs, Proc. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), novembre 2013, Osaka, Japon, LNCS 8255, 133-147 (Best Paper Award).
• S. Guilbault, A. Pelc, Gathering asynchronous oblivious agents with restricted vision in an infinite line, Proc. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), novembre 2013, Osaka, Japon, LNCS 8255, 296-310.

• B.S. Chlebus, D. Kowalski, A. Pelc, Electing a leader in multi-hop radio networks, Proc. 16th International Conference on Principles of Distributed Systems (OPODIS 2012), décembre 2012, Rome, Italie, LNCS 7702, 106-120.
• J. Czyzowicz, A. Pelc, M. Roy, Tree exploration by a swarm of mobile agents, Proc. 16th International Conference on Principles of Distributed Systems (OPODIS 2012), décembre 2012, Rome, Italie, LNCS 7702, 121-134.
• J. Anaya, J. Chalopin, J. Czyzowicz, A. Labourel, A. Pelc, Y. Vaxès, Collecting information by power-aware mobile agents, Proc. 26th International Symposium on Distributed Computing (DISC 2012), octobre 2012, Salvador, Brésil, LNCS 7611, 46-60.
• E. Fusco, A. Pelc, Knowledge, level of symmetry, and time of leader election, Proc. 20th Annual European Symposium on Algorithms (ESA 2012), septembre 2012, Ljubljana, Slovénie, LNCS 7501, 479-490.
• Y. Dieudonné, A. Pelc, Deterministic network exploration by anonymous silent agents with local traffic reports, Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), juillet 2012, Warwick, Royaume Uni, LNCS 7392, 500-512.
• J. Czyzowicz, A. Kosowski, A. Pelc, Time vs. space trade-offs for rendezvous in trees, Proc. 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012), juin 2012, Pittsburgh, USA, 1-10.
• S. Elouasbi, A. Pelc, Time of anonymous rendezvous in trees: Determinism vs. randomization, Proc. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), juin 2012, Reykjavik, Islande, LNCS 7355, 291-302.
• Y. Dieudonné, A. Pelc, D. Peleg, Gathering despite mischief, Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), janvier 2012, Kyoto, Japan, 527-540.
• P. Fraigniaud, A. Pelc, Decidability classes for mobile agents computing, Proc. 10th Latin American Theoretical Informatics Symposium (LATIN 2012), avril 2012, Arequipa, Pérou, LNCS 7256, 362-374.
• I. Benyahia, Y. Ahadjitse, M. Shawky, Dynamic Optimisation of VANET Routing for Trip Delays Minimisation. ITS Canada - ACGM 2012, Québec. CD-ROM, 11pp. (2012).

• E. Fusco, A. Pelc, Communication complexity of consensus in anonymous message passing systems, Proc. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), décembre 2011, Toulouse, France, LNCS 7109, 191-206.
• S. Guilbault, A. Pelc, Asynchronous rendezvous of anonymous agents in arbitrary graphs, Proc. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), décembre 2011, Toulouse, France, LNCS 7109, 162-173.
• A. Pelc, DISC 2011 Invited Lecture: Deterministic rendezvous in networks: Survey of models and results, Proc. 25th International Symposium on Distributed Computing (DISC 2011), septembre 2011, Rome, Italie, LNCS 6950, 1-15.
• B. Chlebus, D. Kowalski, A. Pelc, M. Rokicki, Efficient distributed communication in ad-hoc radio networks, Proc. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), juillet 2011, Zurich, Suisse, LNCS 6756, Part 2, 613-624.
• S. Guilbault, A. Pelc, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Proc. 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2011), juin 2011, Gdansk, Pologne, LNCS 6796, 162-173.

• J. Czyzowicz, A. Labourel, A. Pelc, How to meet asynchronously (almost) everywhere, Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), janvier 2010, Austin, Texas, U.S.A., 22-30.
• P. Fraigniaud, A. Pelc, Delays induce an exponential memory gap for rendezvous in trees, Proc. 22nd Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA 2010), juin 2010, Santorini, Grèce, 224-232.
• J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc, Optimal exploration of terrains with obstacles, Proc. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), juin 2010, Bergen, Norvège, LNCS 6139, 1-12.
• E. Fusco, A. Pelc, Distributed tree comparison with nodes of limited memory, Proc. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010), juin 2010, Sirince, Turquie, LNCS 6058, 142-156.
• J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc, Asynchronous deterministic rendezvous in bounded terrains, Proc. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010), juin 2010, Sirince, Turquie, LNCS 6058, 72-85.
• J. Czyzowicz, A. Kosowski, A. Pelc, How to meet when you forget: Log-space rendezvous in arbitrary graphs, Proc. 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), juillet 2010, Zurich, Suisse, 450-459.
• J. Czyzowicz, A. Kosowski, A. Pelc, Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains, Proc. 35th International Symposiums on Mathematical Foundations of Computer Science (MFCS 2010), août 2010, Brno, République Tchèque, LNCS 6281, 294-305.
• D. Dereniowski, A. Pelc, Drawing maps with advice, Proc. 24th International Symposium on Distributed Computing (DISC 2010), septembre 2010, Boston, U.S.A., LNCS 6343, 328-342.
• E. Fusco, A. Pelc, How much memory is needed for leader election, Proc. 24th International Symposium on Distributed Computing (DISC 2010), septembre 2010, Boston, U.S.A., LNCS 6343, 251-266.
• I. Benyahia, J.-F. Perrot, M. Peters, Strategy for teaching programming languages to heterogeneous classes, The Canadian Network For Innovation in Education Conference, mai 2010, Saint John, New Brunswick, Canada, CD-ROM, 5 pages.
• K. El Guemhioui, N. Baaziz, Integrating sustainable development into the engineering curriculum, Proc. First Canadian Engineering Education Association (CEEA) Conference, juin 2010, Kingston, Canada.
• A. Petrowski, F. Aissanou, I. Benyahia, S. Houcke, Multi-criteria reinforcement learning based on a russian doll method for network routing, IEEE Conference on Intelligent Systems, juillet 2010, London, Royaume Uni, 321-326.
• V. Talbot, I. Benyahia, Road safety information processing using multi-criteria decision-making reconfigurable architecture, ITS Canada Intelligent Transportation Systems Conference, juin 2010, Ottawa Canada, CD-ROM 14 pages.

• J. Czyzowicz, L. Gasieniec, D. Kowalski, A. Pelc, Consensus and mutual exclusion in a multiple access channel, Proc. 23rd International Symposium on Distributed Computing (DISC 2009), septembre 2009, Elche, Espagne, LNCS 5805, 512-526.
• J. Czyzowicz, A. Labourel, A. Pelc, Optimality and competitiveness of exploring polygons by mobile robots, Proc. 17th European Symposium on Algorithms (ESA 2009), septembre 2009, Copenhagen, Danemark, LNCS 5757, 263-274.
• D. Kowalski, A. Pelc, Leader election in ad hoc radio networks: a keen ear helps, Proc. 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), juillet 2009, Rhodes, Grèce, LNCS 5556, 521-533.

• I. Benyahia, V. Talbot, Optimizing the Architecture of Adaptive Complex Applications Using Genetic Programming, Proc. 14th International Conference on Distributed Multimedia Systems, Boston, Massachusetts, USA, 27-31. (2008).
• T. Legault, I. Benyahia, Use of Data Mining for Incremental Modeling of Network Environment Components, Proc. of the 2008 International Conference On Data Mining, Las Vegas (Nevada) USA, 342-347. (2008).
• T. Calamoneri, E. G. Fusco, A. Pelc, Impact of information on the complexity of asynchronous radio broadcasting, Proc. 12th International Conference on Principles of Distributed Systems (OPODIS 2008), décembre 2008, Luxor, Egypte, LNCS 5401, 311-330.
• A. Pelc, Algorithmic aspects of radio communication, Proc. 5th ACM International Workshop on Foundations of Mobile Computing (DIALM-POMC 2008), août 2008, Toronto, Canada, 1-2. (keynote address).
• E. Fusco, A. Pelc, Broadcasting in UDG radio networks with missing and inaccurate information, Proc. 22nd International Symposium on Distributed Computing (DISC 2008), septembre 2008, Arcachon, France, LNCS 5218, 257-273.
• P. Fraigniaud, A. Pelc, Deterministic rendezvous in trees with little memory, Proc. 22nd International Symposium on Distributed Computing (DISC 2008), septembre 2008, Arcachon, France, LNCS 5218, 242-256.
• E. Kranakis, M. Paquette, A. Pelc, Communication in random geometric radio networks with positively correlated random faults, Proc. 7th International Conference on AD-HOC Networks & Wireless (ADHOC-NOW 2008), septembre 2008, Sophia Antipolis, France, LNCS 5198, 108-121.
• E. Fusco, A. Pelc, Trade-offs between the size of advice and broadcasting time in trees, Proc. 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), juin 2008, Munich, Allemagne, 77-84.
• P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, Remembering without memory: tree exploration by asynchronous oblivious robots, Proc. 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008) juin 2008, Villars-sur-Ollon, Suisse, LNCS 5058, 33-47.
• D. Ilcinkas, D. Kowalski, A. Pelc, Fast radio broadcasting with advice, Proc. 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008) juin 2008, Villars-sur-Ollon, Suisse, LNCS 5058, 291-305.

• P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, Proc. 11th International Conference on Principles of Distributed Systems (OPODIS 2007), décembre 2007, Guadeloupe, LNCS 4878, 105-118.
• S. Guilbault, A. Pelc, Fast adaptive diagnosis with a minimum number of tests, Proc. 18th International Symposium on Algorithms and Computation (ISAAC 2007), décembre 2007, Sendai, Japon, LNCS 4835, 415-426.
• E. Kranakis, M. Paquette, A. Pelc, Communication in networks with random dependent faults, Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, (MFCS 2007), ao\^{u}t 2007, Cesky Krumlov, République Tchèque, LNCS 4708, 418-429.
• Y. Emek, L. Gasieniec, E. Kantor, A. Pelc, D. Peleg, C. Su, Broadcasting time in UDG radio networks with unknown topology, Proc. 26th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2007), août 2007, Portland, Oregon, USA, 195-204.
• P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc, Distributed computing with advice: information sensitivity of graph coloring, Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), juillet 2007, Wroclaw, Pologne, LNCS 4596, 231-242.
• L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), janvier 2007, New Orleans, Louisiana, USA, 585-594.

• J. Czyzowicz, L. Gasieniec, A. Pelc, Gathering few fat mobile robots in the plane, Proc. 10th International Conference on Principles of Distributed Systems (OPODIS'2006), décembre 2006, Saint-Emilion, France, LNCS 4305, 350-364.
• R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006), décembre 2006, Kolkata, India, LNCS 4288, 744-753.
• P. Fraigniaud, D. Ilcinkas, A. Pelc, Tree exploration with an oracle,\\ Proc. 31st International Symposium on Mathematical Foundations of Computer Science, (MFCS 2006), août/septembre 2006, Stara Lesna, Slovakia, LNCS 4162, 24-37.
• P. Fraigniaud, D. Ilcinkas, A. Pelc, Oracle size: a new measure of difficulty for communication problems, Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2006), juillet 2006, Denver, Colorado, USA, 179-187.
• I. Benyahia, J.-Y. Potvin, Y. Xu, A Complex Applications Framework Supporting Tolerant Dynamic Vehicle Dispatching, Proc. 4th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA-06), mars 2006.
• I. Benyahia, D. Lapointe, A Complex Applications Framework Supporting Adaptive Routing Strategy for Ad-hoc Networks, Proc. IEEE Advanced International Conference on Telecommunications AICT'06, février 2006.

• I. Benyahia, D. Lapointe, Adaptive Routing Strategies to Optimize the QoS of Adhoc Networks, Proc. International Conference On Cutting Edge Wireless and IT Technologies, décembre 2005, New York, U.S.A.
• J. Abd-Ali, K. El Guemhioui, Horizontal transformation of PSMs, Proc. First European Conference on Model Driven Architecture - Foundations and Applications (ECMDA-FA 2005), novembre 2005, Nuremberg, Allemagne, LNCS 3748, 299-315.
• A. Pelc, Waking up anonymous ad hoc radio networks, Proc. 19th International Symposium on Distributed Computing (DISC 2005), septembre 2005, Cracovie, Pologne, LNCS 3724, 260-272.
• J. Abd-Ali, K. El Guemhioui, An MDA-Oriented .NET Metamodel, Proc. 9th IEEE International Enterprise Distributed Object Computing Conference(EDOC 2005), septembre 2005, Enschede, Pays-Bas, 142-153.
• K. El Guemhioui, A. Nys, A Transparent and Evolvable Licensing Object Service, Proc. 3rd ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2005), août 2005, Mount-Pleasant, Michigan, U.S.A., 298-305.
• G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, 30th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2005), août 2005, Gdansk, Pologne, LNCS 3618, 271-282.
• A. Pelc, D. Peleg, Feasibility and complexity of broadcasting with random transmission failures, Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PODC'2005), juillet 2005, Las Vegas, U.S.A., 334-341.
• A. Nys, K. El Guemhioui, Design of a CORBA licensing service, Proc. IADIS International Conference on Applied Computing, février 2005, Algarve, Portugal.

• J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in tree networks, Proc. 8th International Conference on Principles of Distributed Systems (OPODIS'2004), décembre 2004, Grenoble, France, LNCS 3544, 67-80.
• D. Kowalski, A. Pelc, Polynomial deterministic rendezvous in arbitrary graphs, Proc. 15th Annual Symposium on Algorithms and Computation (ISAAC'2004), décembre 2004, Hong Kong, LNCS 3341, 644-656.
• D. Kowalski, A. Pelc, Centralized deterministic broadcasting in undirected multi-hop radio networks, Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2004), août 2004, Harvard University, Cambridge, U.S.A., LNCS 3122, 171-182.
• P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg, Graph exploration by a finite automaton, Proc. 29th International Symposium on Mathematical Foundations of Computer Science (MFCS'2004), août 2004, Prague, République Tchèque, LNCS 3153, 451-462.
• K. Diks, S. Dobrev, A. Pelc, Exploring planar graphs using unoriented maps, Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'2004), juillet 2004, Ballina Beach Resort, New South Wales, Australie, 85-96.
• E. Markou, A. Pelc, Efficient exploration of faulty trees, Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'2004), juillet 2004, Ballina Beach Resort, New South Wales, Australie, 52-63.
• L. Gasieniec, E. Kranakis, A. Pelc, Q. Xin, Deterministic M2M multicast in radio networks, Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), juillet 2004, Turku, Finlande, LNCS 3142, 670-682.
• M. Paquette, A. Pelc, Optimal decision strategies in Byzantine environments, Proc. 11th Colloquium on Structural Information and Communication Complexity (SIROCCO'2004), juin 2004, Smolenice Castle, Slovaquie, LNCS 3104, 245-254.
• I. Benyahia, P. Kouame, Design methodology for an adaptive ATM switch, Proc. 7th IFAC Symposium on Cost Oriented Automation, juin 2004, Gatineau-Ottawa, Canada, 301-304.
• M. Paquette, A. Pelc, Fast broadcasting with Byzantine faults, Proc. 7th IFAC Symposium on Cost Oriented Automation, juin 2004, Gatineau-Ottawa, Canada, 311-316.
• P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective tree exploration, Proc. Latin American Theoretical Informatics (LATIN'2004), avril 2004, Buenos Aires, Argentine, LNCS 2976, 141-151.

• T. Calamoneri, A. Pelc, R. Petreschi, Labeling trees with a condition at distance two, Proc. R.C. Bose Centenary Symposium on Discrete Mathematics and Applications, décembre 2002, Kolkata, Inde, Electronic Notes in Discrete Mathematics 15 (2003), 57-60.
• A. Dessmark, P. Fraigniaud, A. Pelc, Deterministic rendezvous in graphs, Proc. 11th Annual European Symposium on Algorithms (ESA'2003), septembre 2003, Budapest, Hongrie, LNCS 2832, 184-195.
• G. De Marco, A. Pelc, Randomized algorithms for determining the majority on graphs, Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'2003), août 2003, Bratislava, Slovaquie, LNCS 2747, 368-377.
• D. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, Proc. 22nd Ann. ACM Symposium on Principles of Distributed Computing (PODC'2003), juillet 2003, Boston, U.S.A., 73-82.
• D. Kowalski, A. Pelc, Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, Proc. 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), juin 2003, Umea, Suède, 195-210.
• S. Dobrev, A. Pelc, Leader election in rings with nonunique labels, Proc. 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'03), juin 2003, Las Vegas, U.S.A., 1400-1406.
• D. Kowalski, A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), février/mars 2003, Berlin, Allemagne, LNCS 2607, 109-120.

• D. Kowalski, A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), novembre 2002, Vancouver, Canada, 63-72.
• A. Dessmark, A. Pelc, Optimal graph exploration without good maps, Proc. 10th European Symposium on Algorithms (ESA 2002), septembre 2002, Rome, Italie, LNCS 2461, 374-386.
• J. Czyzowicz, W. Fraczak, A. Pelc, Transducers with set outputs, Proc. 8th Annual International Computing and Combinatorics Conference (COCOON 2002), Singapore, août 2002, 300-309.
• J. Czyzowicz, W. Fraczak, A. Pelc, W. Rytter, Prime decompositions of regular prefix codes, Proc. 7th International Conference on Implementation and Application of Automata (CIAA'2002), Tours, France, juillet 2002, LNCS 2608, 85-94.
• K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc, Tree exploration with little memory, Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), San Francisco, U.S.A., janvier 2002, 588-597.

• A. Dessmark, A. Pelc, Tradeoffs between knowledge and time of communication in geometric radio networks, Proc. 13th Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crète, Grèce, juillet 2001, 59-66.
• J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, M. Vargas Martin, Evaluation of hotlink assignments heuristics for improving web access, Proc. 2nd International Conference on Internet Computing (IC'2001), Las Vegas, Nevada, USA, juin 2001, 793-799.
• A. Dessmark, A. Pelc, Distributed coloring and communication in rings with local knowledge, Proc. International Parallel and Distributed Processing Symposium (IPDPS 2001), San Francisco, U.S.A., avril 2001.
• A. Dessmark, A. Pelc, Deterministic radio broadcasting at low cost, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), février 2001, Dresden, Germany, LNCS 2010, 158-169.
• G. De Marco, A. Pelc, Fast distributed graph coloring with O(Delta) colors, Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2001), janvier 2001, Washington, D.C., U.S.A., 630-635.

LIVRES

2005

• J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, W. Unger, Information Dissemination in Communication Networks, Springer 2005, 361 p., ISBN: 3-540-00846-2.

CHAPITRES DANS DES LIVRES

2019

• A. Pelc, Deterministic Rendezvous Algorithms, in: Distributed Computing by Mobile Entities, P. Flocchini, G. Prencipe, N. Santoro, Eds., Springer 2019, LNCS 11340.

2008

• A. Pelc, Broadcasting in geometric radio networks, dans: Encyclopedia of Algorithms, Ming-Yang Kao, Ed., Springer 2008.

2007

• K. El Guemhioui, Model-Driven Engineering of Distributed Applications, dans: Encyclopedia of Internet Technologies and Applications, M. Freire et M. Pereira (Eds.), IGI Global, Hershey, Pennsylvania, 2007 (ISBN 978-1-59140-993-9).

2002

• A. Pelc, Broadcasting in radio networks, dans: Handbook of Wireless Networks and Mobile Computing, I. Stojmenovic (Ed.), John Wiley and Sons, Inc., New York 2002, 509-528.

EDITIONS

2007

• A. Pelc, D. Peleg, M. Raynal (Eds.), Structural Information and Communication Complexity (SIROCCO 2005), Theoretical Computer Science (Fasc. spécial), Volume 384, Fasc. 2-3, octobre 2007, 137-286.
• A. Pelc (Ed.), Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Chypre, septembre 2007, Springer, LNCS 4731, 1-508.

2005

• A. Pelc, M. Raynal (Eds.), Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005. Mont Saint-Michel, France, mai 2005. Springer, LNCS 3499, 1-322.