List of publications

• D. Pattanayak, A. Pelc, Graph exploration by a deterministic memoryless automaton with pebbles, Discrete Applied Mathematics 356 (2024), 149-160.
• 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.

• 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.

• 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.
  reprinted in:
  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.
• 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.
• L. Gasieniec, E. Kranakis, A. Pelc, Q. Xin, Deterministic M2M multicast in radio networks, Theoretical Computer Science 362 (2006), 196-206.
• 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.
• 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 Letters 13 (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. 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.

• P. Panaite, A. Pelc, Optimal broadcasting in faulty trees, Journal of Parallel and Distributed Computing 60 (2000), 566-584.
• K. Diks, A. Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes, Algorithmica 28 (2000), 37-50.
• L.M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000), 289-305.
• P. Denejko, K. Diks, A. Pelc, M. Piotrow, Reliable minimum finding comparator networks, Fundamenta Informaticae 42 (2000), 235-249.
• P. Panaite, A. Pelc, Impact of topographic information on graph exploration efficiency, Networks 36 (2000), 96-103.
• E. Kranakis, A. Pelc, Better adaptive diagnosis of hypercubes, IEEE Transactions on Computers 49 (2000), 1013-1020.

• P. Panaite, A. Pelc, Exploring unknown undirected graphs, Journal of Algorithms 33 (1999), 281-295.
• K. Diks, A. Lingas, A. Pelc, An optimal algorithm for broadcasting multiple messages in trees, Journal of Parallel and Distributed Computing 59 (1999), 465-474.
• E. Kranakis, A. Pelc, A. Spatharis, Optimal adaptive fault diagnosis for simple multiprocessor systems, Networks 34 (1999), 206-214.
• L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, Minimizing congestion of layouts for ATM networks with faulty links, International Journal of Foundations of Computer Science 10 (1999), 503-512.

• K. Diks, E. Kranakis, A. Pelc, Perfect broadcasting in unlabeled networks, Discrete Applied Mathematics 87 (1998), 33-47.
• A. Pelc, E. Upfal, Reliable fault diagnosis with few tests, Combinatorics, Probability & Computing 7 (1998), 323-333.
• A. Czumaj, L. Gasieniec, A. Pelc, Time and cost trade-offs in gossiping, SIAM Journal on Discrete Mathematics 11 (1998), 400-413.
• K. Diks, A. Pelc, System diagnosis with smallest risk of error, Theoretical Computer Science 203 (1998), 163-173.
• E. Kranakis, D. Krizanc, A. Pelc, D.Peleg, Approximate maxima finding of continuous functions under restricted budget, Theoretical Computer Science 203 (1998), 151-162.
• K. Diks, E. Kranakis, A. Pelc, Broadcasting in unlabeled tori, Parallel Processing Letters 8 (1998), 177-188.
• K. Diks, S. Dobrev, E. Kranakis, A. Pelc and P. Ruzicka, Broadcasting in unlabeled hypercubes with linear number of messages, Information Processing Letters 66 (1998), 181-186.
• A. Pelc, Optimal diagnosis of heterogeneous systems with random faults, IEEE Transactions on Computers 47 (1998), 298-304.
• A.Farley, A. Pelc, A.Proskurowski, Minimum-time multidrop broadcast, Discrete Applied Mathematics 83 (1998), 61-77.
• L. Gasieniec, A. Pelc, Broadcasting with linearly bounded transmission faults, Discrete Applied Mathematics 83 (1998), 121-133.

• L. Gasieniec, A. Pelc, Broadcasting with a bounded fraction of faulty nodes, Journal of Parallel and Distributed Computing 42 (1997), 11-20.
• E.Kranakis, D.Krizanc, A. Pelc, Hop-congestion tradeoffs for high speed networks, International Journal of Foundations of Computer Science 8 (1997), 117-126.
• P. Berman, K. Diks, A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures, Journal of Algorithms 22 (1997), 199-211.
• B. Chlebus, K. Diks, A. Pelc, Transition-optimal token distribution, Fundamenta Informaticae 32 (1997), 313-328.
• K. Diks, A. Pelc, Globally optimal diagnosis in systems with random faults, IEEE Transactions on Computers 46 (1997), 200-204.

• L. Gasieniec, A. Pelc, Adaptive broadcasting with faulty nodes, Parallel Computing 22 (1996), 903-912.
• A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143-156.
• B. S. Chlebus, K. Diks, A. Pelc, Reliable broadcasting in hypercubes with random link and node failures, Combinatorics, Probability & Computing 5 (1996), 337-350.
• K. Diks, A. Pelc, Fault-tolerant linear broadcasting, Nordic Journal of Computing 3 (1996), 188-201.
• K. Diks, A. Pelc, Reliable computations on faulty EREW PRAM, Theoretical Computer Science 164 (1996), 107-122.
• B. S. Chlebus, K. Diks, A. Pelc, Broadcasting in synchronous networks with dynamic faults, Networks 27 (1996), 309-318.
• K. Diks, A. Pelc, Broadcasting with universal lists, Networks 27 (1996), 183-196.
• K. Diks, A. Pelc, Efficient gossiping by packets in networks with random faults, SIAM Journal on Discrete Mathematics 9 (1996), pp. 8-17.

• A. Pelc, Almost safe Byzantine Agreement in sparse networks with random faults, Parallel Processing Letters 5 (1995), pp. 489-497.
• K. Diks, A. Malinowski, A. Pelc, Token transfer in a faulty network, RAIRO, Theoretical Informatics and Applications 29 (1995), pp.383-400.
• K. Diks, E. Kranakis, A. Malinowski, A.Pelc, Anonymous wireless rings, Theoretical Computer Science 145 (1995), pp. 95-109.

• K. Diks, A. Malinowski, A. Pelc, Reliable token dispersal with random faults, Parallel Processing Letters 4 (1994), pp. 417-427.
• B. S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Nordic Journal of Computing 1 (1994), pp. 332-345.
• P. Berman, A. Pelc, Reliable distributed diagnosis for multiprocessor systems with random faults, Networks 24 (1994), pp. 417-427.
• K. Diks, E. Kranakis, D. Krizanc, B. Mans, A.Pelc, Optimal coteries and voting schemes, Information Processing Letters 51 (1994), pp. 1-6.
• A. Pelc, Almost safe group testing with few tests, Combinatorics, Probability & Computing 3 (1994), pp. 411-419.
• D. Blough, A. Pelc, Almost certain fault diagnosis through algorithm-based fault tolerance, IEEE Transactions on Parallel and Distributed Systems 5 (1994), pp. 532-539.
• J. Czyzowicz, K. B. Lakshmanan, A. Pelc, Searching with local constraints on error patterns, European Journal of Combinatorics 15 (1994), pp. 217-222.
• B. S. Chlebus, K. Diks, A. Pelc, Sorting on a mesh-connected computer with delaying links, SIAM Journal on Discrete Mathematics 7 (1994), pp. 119-132.
• B. S. Chlebus, K. Diks, A. Pelc, Fast gossiping with short unreliable messages, Discrete Applied Mathematics 53 (1994), pp. 15-24.
• A. Pelc, Searching with permanently faulty tests, Ars Combinatoria 38 (1994), pp. 65-76.

• D. Blough, A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults, Networks 23 (1993), pp. 691-701.
• C. Kenyon, P. Fraigniaud, A. Pelc, Finding a target subnetwork in sparse networks with random faults, Information Processing Letters 48 (1993), pp. 297-303.
• K. Diks, A. Pelc, Fast diagnosis of multiprocessor systems with random faults, RAIRO, Theoretical Informatics and Applications 27 (1993), pp. 391-401.
• D. Blough, A. Pelc, A clustered failure model for the memory array reconfiguration problem, IEEE Transactions on Computers 42 (1993), pp. 518-528.
• D. Blough, A. Pelc, Diagnosis and repair in multiprocessor systems, IEEE Transactions on Computers 42 (1993), pp. 205-217.

• A. Pelc, Broadcasting time in sparse networks with faulty transmissions, Parallel Processing Letters 2 (1992), pp. 355-361.
• K. Diks, A. Pelc, Almost safe gossiping in bounded degree networks, SIAM Journal on Discrete Mathematics 5 (1992), pp. 338-344.
• A. Pelc, Reliable communication in networks with Byzantine link failures, Networks 22 (1992), pp. 441-459.
• D. Blough, A. Pelc, Complexity of fault diagnosis in comparison models, IEEE Transactions on Computers 41 (1992), pp. 318-324.
• A. Pelc, Optimal fault diagnosis in comparison models, IEEE Transactions on Computers 41 (1992), pp. 779-786.

• A. Pelc, I. Rival, Orders with level diagrams, European Journal of Combinatorics 12 (1991), pp. 61-68.
• J. Czyzowicz, K. B. Lakshmanan, A. Pelc, Searching with a forbidden lie pattern in responses, Information Processing Letters 37 (1991), pp. 127-132.
• A. Pelc, Broadcasting in complete networks with faulty nodes using unreliable calls, Information Processing Letters 40 (1991), pp. 169-174.
• A. Pelc, Undirected graph models for system-level fault diagnosis, IEEE Transactions on Computers 40 (1991), pp. 1271-1276.
• F. Al-Thukair, A. Pelc, I. Rival, J. Urrutia, Motion-planning, two-directional point representations and ordered sets, SIAM Journal on Discrete Mathematics 4 (1991), pp. 151-163.

• J. Czyzowicz, A. Pelc, I. Rival, J. Urrutia, Crooked diagrams with few slopes, Order 7 (1990), pp. 133-143.
• J. Czyzowicz, A. Pelc, I. Rival, Planar ordered sets of width two, Mathematica Slovaca 40 (1990), pp. 375-388.
• J. Czyzowicz, A. Pelc, I. Rival, Drawing orders with few slopes, Discrete Mathematics 82 (1990), pp. 233-250.

• A. Pelc, Weakly adaptive comparison searching, Theoretical Computer Science 66 (1989), pp. 105-111.
• A. Pelc, Detecting a counterfeit coin with unreliable weighings, Ars Combinatoria 27 (1989), pp. 181-192.
• J. Czyzowicz, D. Mundici, A. Pelc, Ulam's searching game with lies, Journal of Combinatorial Theory, Series A, 52 (1989), pp. 62-76.
• A. Pelc, Detecting errors in searching games, Journal of Combinatorial Theory, Series A, 51 (1989), pp. 43-54.
• A. Pelc, Searching with known error probability, Theoretical Computer Science 63 (1989), pp. 185-202.

• J. Czyzowicz, D. Mundici, A. Pelc, Solution of Ulam's problem on binary search with two lies, Journal of Combinatorial Theory, Series A, 49 (1988), pp. 384-388.
• A. Pelc, Prefix search with a lie, Journal of Combinatorial Theory, Series A, 48 (1988), pp. 165-173.

• A. Pelc, Coding with bounded error fraction, Ars Combinatoria 24 (1987), pp. 17-22.
• A. Pelc, Invariant measures on abelian metric groups, Colloquium Mathematicum 54 (1987), pp. 95-101.
• A. Pelc, Solution of Ulam's problem on searching with a lie, Journal of Combinatorial Theory, Series A, 44 (1987), pp. 129-140.

• A. Pelc, Lie patterns in search procedures, Theoretical Computer Science 47 (1986), pp. 61-69.
• A. Pelc, Invariant ideals and Borel sets, Proceedings of the American Mathematical Society 97 (1986), pp. 503-506.
• A. Pelc, Invariant measures and ideals on discrete groups, Dissertationes Mathematicae 255 (1986), pp. 1-52.

• A. Pelc, K. Prikry, On the existence of measures on sigma-algebras, Fundamenta Mathematicae 125 (1985), pp. 115-123.
• K. Ciesielski, A. Pelc, Extensions of invariant measures on Euclidean spaces, Fundamenta Mathematicae 125 (1985), pp. 1-10.

• A. Pelc, Measure theory from the point of view of set theory, Wiadomosci Matematyczne 26 (1984), pp. 33-46 (in Polish).
• A. Pelc, Idempotent ideals on abelian groups, Journal of Symbolic Logic 49 (1984), pp. 813-817.
• A. Pelc, The nonexistence of maximal invariant measures on abelian groups, Proceedings of the American Mathematical Society 92 (1984), pp. 55-57.
• A. Pelc, Combinatorics on sigma-algebras and a problem of Banach, Fundamenta Mathematicae 123 (1984), pp. 1-9.

• A. Pelc, K. Prikry, On a problem of Banach, Proceedings of the American Mathematical Society 89 (1983), pp. 608-610.

• A. Pelc, Semiregular invariant measures on abelian groups, Proceedings of the American Mathematical Society 86 (1982), pp. 423-426.

• A. Pelc, Solution of a problem of Ulam on countable sequences of sets, Fundamenta Mathematicae 114 (1981), pp. 113-118.
• A. Pelc, Ideals on the real line and Ulam's problem, Fundamenta Mathematicae 112 (1981), pp. 165-170.

• A. Pelc, An example of formalizing some intensional expressions, Studia Filozoficzne 5 (1980), pp. 105-109 (in Polish).
• A. Pelc, On degrees of uncertainty in mathematics, Studia Filozoficzne 3 (1980), pp. 91-94 (in Polish).
• A. Krawczyk, A. Pelc, On families of sigma-complete ideals, Fundamenta Mathematicae 109 (1980), pp. 155-161.

• A. Pelc, On some weak forms of the axiom of choice in set theory, Bulletin de l'Academie Polonaise des Sciences, Serie des Sciences math., astr. et phys. Vol.26, No.7 (1978), pp. 585-589.

• S. Bhagat, A. Pelc, Deterministic collision-free exploration of unknown anonymous graphs, Proc. 26th International Conference on Distributed Computing and Networking (ICDCN 2025).

• Y. Gao, A. Pelc, Gathering teams of deterministic finite automata on a line, Proc. 28th Conference on Principles of Distributed Computing (OPODIS 2024).

• 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), August 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), July 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), July 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), January 2020, Kolkata, India, 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), September 2019, Munich, Germany, 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), June 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), June 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), December 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), June 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), January 2018, Varanasi, India, 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), July 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), July 2017, Warsaw, Poland, 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), June 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), July 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), January 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), July 2016, Helsinki, Finland, 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), July 2016, Helsinki, Finland, 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), August 2016, Aarhus, Denmark, 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), September 2015, Patras, Greece, 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), December 2014, Cortina d'Ampezzo, Italy, 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), September 2014, Wroclaw, Poland, 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), July 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), July 2014, Copenhagen, Denmark, 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), October 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), July 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), July 2013, Riga, Latvia, 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), July 2013, Riga, Latvia, LNCS 7966, 533-544.
• Y. Dieudonn?, A. Pelc, Anonymous meeting in networks, Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), January 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), November 2013, Osaka, Japan, 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), November 2013, Osaka, Japan, 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), December 2012, Rome, Italy, 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), December 2012, Rome, Italy, 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), October 2012, Salvador, Brazil, 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), September 2012, Ljubljana, Slovenia, 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), July 2012, Warwick,UK, 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), June 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), June 2012, Reykjavik, Iceland, LNCS 7355, 291-302.
• Y. Dieudonn?, A. Pelc, D. Peleg, Gathering despite mischief, Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), January 2012, Kyoto, Japan, 527-540.
• P. Fraigniaud, A. Pelc, Decidability classes for mobile agents computing, Proc. 10th Latin American Theoretical Informatics Symposium (LATIN 2012), April 2012, Arequipa, Peru, LNCS 7256, 362-374.

• E. Fusco, A. Pelc, Communication complexity of consensus in anonymous message passing systems, Proc. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), December 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), December 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), September 2011, Rome, Italy, 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), July 2011, Zurich, Switzerland, 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), June 2011, Gdansk, Poland, 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), January 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), June 2010, Santorini, Greece, 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), June 2010, Bergen, Norway, 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), June 2010, Sirince, Turkey, 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), June 2010, Sirince, Turkey, 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), July 2010, Zurich, Switzerland, 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), August 2010, Brno, Czech Republic, LNCS 6281, 294-305.
• D. Dereniowski, A. Pelc, Drawing maps with advice, Proc. 24th International Symposium on Distributed Computing (DISC 2010), September 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), September 2010, Boston, U.S.A., LNCS 6343, 251-266.

• 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), September 2009, Elche, Spain, 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), September 2009, Copenhagen, Denmark, 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), July 2009, Rhodes, Greece, LNCS 5556, 521-533.

• 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), December 2008, Luxor, Egypt, LNCS 5401, 311-330.
• A. Pelc, Algorithmic aspects of radio communication, Proc. 5th ACM International Workshop on Foundations of Mobile Computing (DIALM-POMC 2008), August 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), September 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), June 2008, Munich, Germany, 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) June 2008, Villars-sur-Ollon, Switzerland, 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) June 2008, Villars-sur-Ollon, Switzerland, 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), December 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), December 2007, Sendai, Japan, 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), August 2007, Cesky Krumlov, Czech Republic, 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), August 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), July 2007, Wroclaw, Poland, 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), January 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), December 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), December 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), August/September 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), July 2006, Denver, Colorado, USA, 179-187.

• A. Pelc, Waking up anonymous ad hoc radio networks, Proc. 19th International Symposium on Distributed Computing (DISC 2005), September 2005, Cracow, Poland, LNCS 3724, 260-272.
• 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), August 2005, Gdansk, Poland, 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), July 2005, Las Vegas, U.S.A., 334-341.

• 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), December 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), December 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), August 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), August 2004, Prague, Czech Republic, 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), July 2004, Ballina Beach Resort, New South Wales, Australia, 85-96.
• E. Markou, A. Pelc, Efficient exploration of faulty trees, Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'2004), July 2004, Ballina Beach Resort, New South Wales, Australia, 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), July 2004, Turku, Finland, 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), June 2004, Smolenice Castle, Slovakia, LNCS 3104, 245-254.
• M. Paquette, A. Pelc, Fast broadcasting with Byzantine faults, Proc. 7th IFAC Symposium on Cost Oriented Automation, June 2004, Gatineau-Ottawa, Canada, 311-316.
• P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective tree exploration, Proc. Latin American Theoretical Informatics (LATIN'2004), April 2004, Buenos Aires, Argentina, 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, December 2002, Kolkata, India, 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), September 2003, Budapest, Hungary, 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), August 2003, Bratislava, Slovakia, 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), July 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), June 2003, Umea, Sweden, 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), June 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), February/March 2003, Berlin, Germany, 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), November 2002, Vancouver, Canada.
• A. Dessmark, A. Pelc, Optimal graph exploration without good maps, Proc. 10th European Symposium on Algorithms (ESA 2002), September 2002, Rome, Italy, 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, August 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, July 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., January 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), Crete, Greece, 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, June 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., April 2001.
• A. Dessmark, A. Pelc, Deterministic radio broadcasting at low cost, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), February 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), January 2001, Washington, D.C., U.S.A., 630-635.

• B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2000), San Francisco, USA, January 2000, 861-870.
• P. Fraigniaud, A. Pelc, D. Peleg and S. Perennes, Assigning labels in unknown anonymous networks, Proc. 19th Ann. ACM Symposium on Principles of Distributed Computing (PODC'2000), Portland, Oregon, U.S.A., July 2000, 101-112.
• L. Gasieniec, A. Pelc, D. Peleg, The wakeup problem in synchronous broadcast systems, Proc. 19th Ann. ACM Symposium on Principles of Distributed Computing (PODC'2000), Portland, Oregon, U.S.A., July 2000, 113-122.
• L. Gargano, A. Pelc, S. Perennes, U. Vaccaro, Efficient communication in unknown networks, Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'2000), June 2000, Konstanz, Germany, LNCS 1928, 172-183.
• G. De Marco, A. Pelc, Deterministic broadcasting time with partial knowledge of the network, Proc. 11th Annual International Symposium on Algorithms And Computation (ISAAC 2000), Taipei, Taiwan, December 2000, LNCS 1969, 374-385.
• P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, M. Vargas Martin, Strategies for hotlink assignment, Proc. 11th Annual International Symposium on Algorithms And Computation (ISAAC 2000), Taipei, Taiwan, December 2000, LNCS 1969, 23-34.

• K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact of knowledge on broadcasting time in radio networks, Proc. 7th Annual European Symposium on Algorithms, ESA'99, Prague, Czech Republic, July 1999, LNCS 1643, 41-52.

• E. Kranakis, D. Krizanc, A. Pelc, Fault-tolerant broadcasting in radio networks, Proc. 6th Annual European Symposium on Algorithms, ESA'98, Venice, Italy, August 1998, LNCS 1461, 283-294.
• E. Kranakis, A. Pelc, A. Spatharis, Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems, Proc. 5th Int. Coll. on Structural Information and Communication Complexity, SIROCCO'98, Amalfi, Italy, June 1998, 82-97.
• P. Panaite, A. Pelc, Exploring unknown undirected graphs, Proc. 9th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'98), San Francisco, USA, January 1998, pp. 316-322.

• K. Diks, A. Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes, Proc. Fifth Annual European Symposium on Algorithms, ESA'97, Graz, Austria, September 1997, LNCS 1284, pp. 118-129.
• K. Diks, A. Lingas, A. Pelc, Broadcasting multiple messages in trees, Proc. 4th Coll. on Structural Information and Communication Complexity, SIROCCO'97, Ascona, Switzerland, July 1997, 69-80.
• P. Panaite, A. Pelc, Optimal fault-tolerant broadcasting in trees, Proc. 8th Annual International Symposium on Algorithms and Computation, ISAAC'97, Singapore, December 1997, LNCS 1350, pp. 143-152.
• P. Panaite, A. Pelc, Universally fault-tolerant broadcasting in trees, Proc. International Conference on Parallel and Distributed Systems, ICPADS'97, Seoul, Korea, December 1997, pp. 724-729.
• L. Kirousis, E. Kranakis, D. Krizanc, A. Pelc, Power consumption in packet radio networks, Proc. 14th Symposium on Theoretical Aspects of Computer Science, STACS'97, Lubeck, Germany, February/March 1997, LNCS 1200, pp. 363-374.

• L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, Minimizing congestion of layouts for ATM networks with faulty links, Proc. 21st International Symposium on Mathematical Foundations of Computer Science MFCS'96, Cracow, Poland, September 1996, LNCS 1113, pp.372-381.
• E. Kranakis, D. Krizanc, A. Pelc, D. Peleg, The complexity of data mining on the Web, Proc. 15th ACM Symp. on Principles of Distributed Computing PODC'96, Philadelphia, Pennsylvania, USA, (short paper), p. 153.
• A. Pelc, Efficient fault location with small risk, Proc. 3rd Coll. on Structural Information and Communication Complexity, SIROCCO'96, Certosa di Pontignano, Siena, June 1996, p. 292-300.
• K. Diks, A. Pelc, System diagnosis with smallest risk of error, Proc. 22nd International Workshop on Graph Theoretic Concepts in Computer Science WG'96, Cadenabbia, Italy, June 1996, LNCS 1197, p. 141-150.
• E. Kranakis, D. Krizanc, A. Pelc, D. Peleg, Approximate maxima finding of continuous functions under restricted budget, Proc. 22nd International Workshop on Graph-Theoretic Concepts in Computer Science WG '96, Cadenabbia, Italy, June 1996, LNCS 1197, p. 268-278.

• E. Kranakis, D. Krizanc, A. Pelc, Hop-congestion trade-offs for high-speed networks, Proc. Seventh IEEE Symposium on Parallel and Distributed Processing, San Antonio, Texas, October 1995, pp. 662-668.
• B. S. Chlebus, L. Gasieniec, A. Pelc, Fast deterministic simulation of computations on faulty parallel machines, Proc. Third Annual European Symposium on Algorithms ESA'95, Corfu, Greece, September 1995, LNCS 979, pp. 89-101.
• A. Pelc, Fast fault-tolerant broadcasting and gossiping (invited paper), Proc. 2nd Colloquium on Structural Information and Communication Complexity, SIROCCO'95, June 1995, Olympia, Greece, pp. 159-172.
• K. Diks, A. Pelc, Broadcasting with universal lists, Proc. 28th Annual Hawaii International Conference on System Sciences, January 1995, Vol.2, pp. 564-573.

• K. Diks, E. Kranakis, A. Malinowski, A. Pelc, The buffer potential of a network, Proc. 1st Colloquium on Structural Information and Communication Complexity, SIROCCO'94, May 1994, Ottawa, Canada, pp. 149-150.
• P. Denejko, K. Diks, A. Pelc, M. Piotrow, Reliable minimum finding comparator networks, Proc. 19th Int. Symp. Mathematical Foundations of Computer Science MFCS-94, Kosice, Slovakia, August 1994, LNCS 841, pp. 306-315.
• K. Diks, A. Pelc, Fault-tolerant linear broadcasting, Proc. First Canada-France Conference on Parallel and Distributed Computing, Theory and Practice, Montreal, Canada, May 1994, LNCS 805, pp. 207-217.
• B. S. Chlebus, K. Diks, A. Pelc, Waking up an anonymous faulty network from a single source, Proc. 27th Annual Hawaii International Conference on System Sciences, January 1994, Vol.2, pp. 187-193.

• A. Pelc, Efficient distributed diagnosis in the presence of random faults, Proc. 23rd Annual International Symposium on Fault-Tolerant Computing, Toulouse, France, June 1993, pp. 462-469.
• B. S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proc. 20th International Colloquium on Automata, Languages and Programming ICALP'93, Lund, Sweden, July 1993, LNCS 700, pp. 388-397.

• D. Blough, A. Pelc, Some results and open problems concerning memory reconfiguration under clustered fault models, Proc. IEEE International Workshop on Defect and Fault Tolerance on VLSI Systems, Hidden Valley, Pennsylvania, November 1991, pp. 292-295.
• B. S. Chlebus, K. Diks, A. Pelc, Optimal broadcasting in faulty hypercubes, Proc. 21st Annual International Symposium on Fault-Tolerant Computing, Montreal, Canada, June 1991, pp. 266-273.

• K. Diks, A. Pelc, Reliable gossip schemes with random link failures, Proc. 28th Annual Allerton Conference on Communication, Control and Computing, Allerton, Illinois, October 1990, pp. 978-987.
• P. Berman, A. Pelc, Distributed probabilistic fault diagnosis for multiprocessor systems, Proc. 20th Annual International Symposium on Fault-Tolerant Computing, Newcastle upon Tyne, UK, June 1990, pp. 340-346.
• D. Blough, A. Pelc, Reliable diagnosis and repair in constant-degree multiprocessor systems, Proc. 20-th Annual International Symposium on Fault-Tolerant Computing, Newcastle upon Tyne, UK, June 1990, pp. 316-323.

• A. Pelc, Invariant measures on commutative semigroups, Proc. "Open Days in Model Theory and Set Theory", Jadwisin, Poland, September 1981, pp. 249-258.

BOOKS

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.

BOOK CHAPTERS

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, in: Encyclopedia of Algorithms, Ming-Yang Kao, Ed., Springer 2008.

2002

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

1990

• J. Czyzowicz, A. Pelc, I. Rival, Unfolding weighted consensus orders into consistent numerical scales, in: Topics in Combinatorics and Graph Theory, Essays in honour of Gerhard Ringel, R. Bodendiek and R. Henn (Eds.), Physica-Verlag, Heidelberg 1990, pp. 207-217.

1984

• A. Pelc, On cardinal numbers, School and Educational Editors, Warsaw 1984 (in Polish).

EDITORSHIPS

2007

• A. Pelc, D. Peleg, M. Raynal (Eds.), Structural Information and Communication Complexity (SIROCCO 2005), Theoretical Computer Science (Special Issue), Volume 384, Issues 2-3, October 2007, pp. 137-286.
• A. Pelc (Ed.), Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Springer, LNCS 4731, pp. 1-508.

2005

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

List of co-authors

Al-Thukair, Fawzi
Ambuehl, Christoph
Anaya, Julian
Arfaoui, Heger
Berman, Piotr
Bhagat, Subhash
Blough, Douglas
Bose, Prosenjit
Bouchard, S?bastien
Caissy, David
Calamoneri Tiziana
Chalopin, J?r?mie
Chlebus, Bogdan
Ciesielski, Krzysztof
Czumaj, Artur
Czyzowicz, Jurek
De Marco, Gianluca
Denejko, Piotr
Dereniowski, Dariusz
Dessmark, Anders
Dieudonn?, Yoann
Diks, Krzysztof
Dobrev, Stefan
Ellen, Faith
Elouasbi, Samir
Emek, Yuval
Farley, Arthur
Flocchini, Paola
Fraczak, Wojciech
Fraigniaud, Pierre
Fusco, Emanuele
Ganczorz, Adam
Gao, Younan
Gasieniec, Leszek
Gavoille, Cyril
Gibbons, Alan
Glacet, Christian
Gorain, Barun
Guilbault, Samuel
Jurdzinski, Tomasz
Hounkanli, Kokouvi
Hromkovic, Juraj
Ilcinkas, David
Kantor, Erez
Kenyon, Claire
Kirousis, Lefteris
Klasing, Ralf
Kosowski, Adrian
Kowalski, Dariusz
Kranakis, Evangelos
Krawczyk, Adam
Krizanc, Danny
Labourel, Arnaud
Lakshmanan, K.B.
Lewko, Mateusz
Lingas, Andrzej
Malinowski, Adam
Mans, Bernard
Markou, Euripides
Mathieu, Fabien
Miller, Avery
Mundici, Daniele
Panaite, Petrisor
Paquette, Michel
Pattanayak, Debasish
Peer, Guy
Pelc, Krzysztof
Peleg, David
Perennes, Stephane
Petit, Franck
Petreschi, Rosella
Piotrow, Marek
Prikry, Karel
Proskurowski, Andrzej
Radzik, Tomasz
Raynal, Michel
Rival, Ivan
Rokicki, Mariusz
Roy, M?lanie
Ruzicka, Petr
Rytter, Wojciech
Santoro, Nicola
Spatharis, Anthony
Su, Chang
Tiane, Anas
Unger, Walter
Upfal, Eli
Urrutia, Jorge
Vargas Martin, Miguel
Vax?s, Yann
Villain, Vincent
Xin, Qin
Yadav, Ram Narayan
Zhang, Xiaohui