LIV (Livre)Hromkovic, J., R. Klasing, Andrzej Pelc, P. Ruzicka, W. Unger. Information Dissemination in Communication Networks. Springer , 2005. 361. RAC (Revue avec comité de lecture)Bouchard, Sébastien, Arnaud Labourel, Andrzej Pelc. Impact of knowledge on the cost of treasure hunt in trees. Networks 80. (2022) : 51-62. Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc. Want to gather? No need to chatter!. SIAM Journal on Computing 52. (2023) : 358-411. Bouchard, Sébastien, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Almost-optimal deterministic treasure hunt in unweighted graphs. ACM Transactions on Algorithms 19. (2023) : 22:1 - 22:32. Ganczorz, Adam, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc. Deterministic size discovery and topology recognition in radio networks with short labels. Information and Computation 292. (2023) : 105010. Miller, Avery, Andrzej Pelc, Ram Narayan Yadav. Deterministic leader election in anonymous radio networks. ACM Transactions on Algorithms 18. (2022) : 25:1 - 25:33. Czyzowicz, Jurek, Dariusz Dereniowski, Andrzej Pelc. Building a nest by an automaton. Algorithmica 83. (2021) : 144-176. Ellen, Faith, Barun Gorain, Avery Miller, Andrzej Pelc. Constant-length labeling schemes for deterministic radio broadcast. ACM Transactions on Parallel Computing 8. (2021) : 14:1-14:17. Gorain, Barun, Andrzej Pelc. Finding the size and the diameter of a radio network using short labels. Theoretical Computer Science 864. (2021) : 20-33. Gorain, Barun, Andrzej Pelc. Short labeling schemes for topology recognition in wireless tree networks . Theoretical Computer Science 861. (2021) : 23-44. Pelc, Andrzej, Ram Narayan Yadav. Advice complexity of treasure hunt in geometric terrains. Information and Computation 281. (2021) : 104705. Arfaoui, Heger, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc. Deciding and verifying network properties locally with few output bits. Distributed Computing 33. (2020) : 169-187. Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc, Franck Petit. Deterministic treasure hunt in the plane with angular hints. Algorithmica 82. (2020) : 3250-3281. Hounkanli, Kokouvi, Avery Miller, Andrzej Pelc. Global synchronization and consensus using beeps in a fault-prone multiple access channel. Theoretical Computer Science 806. (2020) : 567-576. Dieudonné, Yoann, Andrzej Pelc. Impact of knowledge on election time in anonymous networks. Algorithmica 81. (2019) : 238-288. Gorain, Barun, Andrzej Pelc. Deterministic graph exploration with advice. ACM Transactions on Algorithms 15. (2019) : 8:1-8:17. Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc, Franck Petit. Deterministic rendezvous at a node of agents with arbitrary velocities. Information Processing Letters 133. (2018) : 39-43. Elouasbi, Samir, Andrzej Pelc. Deterministic meeting of sniffing agents in the plane. Fundamenta Informaticae 160. (2018) : 281-301. Pelc, Andrzej. Reaching a target in the plane with no information. Information Processing Letters 140. (2018) : 13-17. Pelc, Andrzej. Deterministic gathering with crash faults. Networks 72. (2018) : 182-199. Pelc, Andrzej. Use of information, memory and randomization in asynchronous gathering. Journal of Computer and System Sciences 94. (2018) : 193-205. Elouasbi, Samir, Andrzej Pelc. Deterministic rendezvous with detection using beeps. International Journal of Foundations of Computer Science 28. (2017) : 77-97. Fraigniaud, Pierre, Andrzej Pelc. Decidability classes for mobile agents computing. Journal of Parallel and Distributed Computing 109. (2017) : 117-128. Glacet, Christian, Avery Miller, Andrzej Pelc. Time vs. information tradeoffs for leader election in anonymous trees . ACM Transactions on Algorithms 13. (2017) : 31:1-31:41. Miller, Avery, Andrzej Pelc. Deterministic distributed construction of T-dominating sets in time T. Discrete Applied Mathematics 222. (2017) : 172-178. Anaya, Julian, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yvon Vaxès. Convergecast and broadcast by power-aware mobile agents. Algorithmica 74. (2016) : 117-155. Caissy, David, Andrzej Pelc. Exploration of faulty Hamiltonian graphs. International Journal of Foundations of Computer Science 27. (2016) : 809-828. Chalopin, Jérémie, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Rendezvous in networks in spite of delay faults. Distributed Computing 29. (2016) : 187-205. Dereniowski, Dariusz, Andrzej Pelc. Topology recognition and leader election in colored networks. Theoretical Computer Science 621. (2016) : 92-102. Dieudonné, Yoann, Andrzej Pelc. Anonymous meeting in networks. Algorithmica 74. (2016) : 908-946. Fusco, Emanuele, Andrzej Pelc, Rosella Petreschi. Topology recognition with advice. Information and Computation 247. (2016) : 254-265. Miller, Avery, Andrzej Pelc. Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Computing 29. (2016) : 51-64. Dieudonné, Yoann, Andrzej Pelc, Vincent Villain. How to meet asynchronously at polynomial cost. SIAM Journal on Computing 44. (2015) : 844-867. Dieudonné, Yoann, Andrzej Pelc. Deterministic polynomial approach in the plane. Distributed Computing 28. (2015) : 111-129. Fusco, Emanuele, Andrzej Pelc. Communication complexity of consensus in anonymous message passing systems. Fundamenta Informaticae 137. (2015) : 305-322. Fusco, Emanuele, Andrzej Pelc. Knowledge, level of symmetry and time of leader election. Distributed Computing 28. (2015) : 221-232. Miller, Avery, Andrzej Pelc. Fast rendezvous with advice . Theoretical Computer Science 608. (2015) : 190-198. Miller, Avery, Andrzej Pelc. Tradeoffs between cost and information for rendezvous and treasure hunt. Journal of Parallel and Distributed Computing 83. (2015) : 159-167. Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. Time vs. space trade-offs for rendezvous in trees. Distributed Computing 27. (2014) : 95-109. Dereniowski, Dariusz, Andrzej Pelc. Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Computing 27. (2014) : 21-38. Dieudonné, Yoann, Andrzej Pelc, David Peleg. Gathering despite mischief. ACM Transactions on Algorithms 11. (2014) : article 1. Dieudonné, Yoann, Andrzej Pelc. Deterministic network exploration by anonymous silent agents with local traffic reports. ACM Transactions on Algorithms 11. (2014) : article 10. Dieudonné, Yoann, Andrzej Pelc. Price of asynchrony in mobile agents computing. Theoretical Computer Science 524. (2014) : 59-67. Pelc, Andrzej, Anas Tiane. Efficient grid exploration with a stationary token. International Journal of Foundations of Computer Science 25. (2014) : 247-262. Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory of Computing Systems 52. 2 (2013) : 179-199. Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, Andrzej Pelc. Worst-case optimal exploration of terrains with obstacles. Information and Computation 225. (2013) : 16-28. Flocchini, Paola, David Ilcinkas, Andrzej Pelc, Nicola Santoro. Computing without communicating: Ring exploration by asynchronous oblivious robots. Algorithmica 65. (2013) : 562-583. Fraigniaud, Pierre, Andrzej Pelc. Delays induce an exponential memory gap for rendezvous in trees. ACM Transactions on Algorithms 9. (2013) : article 17. Guilbault, Samuel, Andrzej Pelc. Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theoretical Computer Science 509. (2013) : 86-96. Kowalski, Dariusz, Andrzej Pelc. Leader election in ad hoc radio networks: a keen ear helps. Journal of Computer and System Sciences 79. (2013) : 1164-1180. Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. How to meet when you forget: Log-space rendezvous in arbitrary graphs. Distributed Computing 25. 2 (2012) : 165-178. Czyzowicz, Jurek, Arnaud Labourel, Andrzej Pelc. How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8. 4 (2012) : Paper 37. Czyzowicz, Jurek, Leszek Gasieniec, Andrzej Pelc. Choosing the best among peers. Theoretical Computer Science 440-441 . (2012) : 52-59. Dereniowski, Dariusz, Andrzej Pelc. Drawing maps with advice. Journal of Parallel and Distributed Computing 72. (2012) : 132-143. Dieudonné, Yoann, Andrzej Pelc. Deterministic network exploration by a single agent with Byzantine tokens. Information Processing Letters 112. (2012) : 467-470. Fusco, Emanuele, Andrzej Pelc. Distributed tree comparison with nodes of limited memory. Networks 60. (2012) : 235-244. Pelc, Andrzej. Deterministic rendezvous in networks: A comprehensive survey . Networks 59. (2012) : 331-347. Ambuehl, Christoph, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, X. Zhang. Tree exploration with logarithmic memory. ACM Transactions on Algorithms 7. (2011) : article 17. Czyzowicz, Jurek, Arnaud Labourel, Andrzej Pelc. Optimality and competitiveness of exploring polygons by mobile robots. Information and Computation 209. (2011) : 74-78. Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, Andrzej Pelc. Asynchronous deterministic rendezvous in bounded terrains. Theoretical Computer Science 412. (2011) : 6926-6937. Czyzowicz, Jurek, Leszek Gasieniec, Dariusz Kowalski, Andrzej Pelc. Consensus and mutual exclusion in a multiple access channel. IEEE Transactions on Parallel and Distributed Systems 22. (2011) : 1092-1104. Flocchini, Paula, David Ilcinkas, Andrzej Pelc, Nicola Santoro. How many oblivious robots can explore a line. Information Processing Letters 111. (2011) : 1027-1031. Fusco, Emanuele, Andrzej Pelc. How much memory is needed for leader election. Distributed Computing 24. (2011) : 65-78. Fusco, Emanuele, Andrzej Pelc. Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60. (2011) : 719-734. Flocchini, Paola, David Ilcinkas, Andrzej Pelc. Remembering without memory: tree exploration by asynchronous oblivious robots. Theoretical Computer Science 411. (2010) : 1544-1557. Fraigniaud, Pierre, David Ilcinkas, Andrzej Pelc. Comunication algorithms with advice. Journal of Computer and System Sciences 76. (2010) : 222-232. Fusco, Emanuele, Andrzej Pelc. Broadcasting in UDG radio networks with missing and inaccurate information. Distributed Computing 22. (2010) : 167-183. Ilcinkas, David, Dariusz Kowalski, Andrzej Pelc. Fast radio broadcasting with advice. Theoretical Computer Science 411. (2010) : 1583-1598. Kranakis, Evangelos, Michel Paquette, Andrzej Pelc. Communication in random geometric radio networks with positively correlated random faults. Ad Hoc & Sensor Wireless Networks 9. (2010) : 23-52. Kranakis, Evangelos, Michel Paquette, Andrzej Pelc. The diameter and connectivity of networks with random dependent faults. Networks 56. (2010) : 103-115. Pelc, Andrzej. Fault-tolerant strategies in the Iterated Prisoner's Dilemma. Information Processing Letters 110. (2010) : 389-395. Czyzowicz, Jurek, Andrzej Pelc, Leszek Gasieniec. Gathering few fat mobile robots in the plane. Theoretical Computer Science 410. 6-7 (2009) : 481-499. Emek, Yuval, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg. Broadcasting time in UDG radio networks with unknown topology. Distributed Computing 21. (2009) : 331-351. Flocchini, P., Andrzej Pelc, N. Santoro. Fault-tolerant sequential scan. Theory of Computing Systems 45. (2009) : 1-26. Fraigniaud, Pierre, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21. (2009) : 395-403. Pelc, Andrzej, Krzysztof J. Pelc. Same game, new tricks: what makes a good strategy in the Prisoner's Dilemma?. Journal of Conflict Resolution 53. (2009) : 774-793. Pelc, Andrzej. Why do we believe theorems?. Philosophia Mathematica III, 17. (2009) : 84-94. Fraigniaud, P., D. Ilcinkas, Andrzej Pelc. Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156. (2008) : 2310-2319. Fraigniaud, P., D. Ilcinkas, Andrzej Pelc. Tree exploration with an oracle. Information and Computation 206. (2008) : 1276-1287. Fusco, E. G., Andrzej Pelc. Acknowledged broadcasting in ad hoc radio networks. Information Processing Letters 109. (2008) : 136-141. Ilcinkas, D., Andrzej Pelc. Impact of asynchrony on the behavior of rational selfish agents. Fundamenta Informaticae 82 (2008) : 113-125. Klasing, R., E. Markou, Andrzej Pelc. Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science 390 (2008) : 27-39. Czyzowicz, Jurek, D. Kowalski, E. Markou, Andrzej Pelc. Searching for a black hole in synchronous tree networks. Combinatorics, Probability & Computing 16 (2007) : 595-619. Czyzowicz, Jurek, E. Kranakis, D. Krizanc, Andrzej Pelc, M. Vargas Martin. Assigning bookmarks in perfect binary trees. Ars Combinatoria
82 (2007) : 165-179. Dessmark, A., Andrzej Pelc. Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5. (2007) : 187-201. Kowalski, D., Andrzej Pelc. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19 (2007) : 185-195. Markou, E., Andrzej Pelc. Efficient exploration of faulty trees. Theory of Computing Systems 40 (2007) : 225-247. Pelc, Andrzej, D. Peleg. Feasibility and complexity of broadcasting with random transmission failures. Theoretical Computer Science 370 (2007) : 279-292. Pelc, Andrzej. Activating anonymous ad hoc radio networks. Distributed Computing 19 (2007) : 361-371. Calamoneri, T., Andrzej Pelc, R. Petreschi. Labeling trees with a condition at distance two. Discrete Mathematics 306. (2006) : 1534-1539. Czyzowicz, Jurek, D. Kowalski, E. Markou, Andrzej Pelc. Complexity of searching for a black hole. Fundamenta Informaticae 71. 2-3 (2006) : 229-242. De Marco, G., Andrzej Pelc. Randomized algorithms for determining the majority on graphs. Combinatorics, Probability & Computing 15 (2006) : 823-834. De Marco, G., L. Gargano, E. Kranakis, D. Krizanc, Andrzej Pelc, V. Vaccaro. Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science 355. (2006) : 315-326. Dessmark, A., P. Fraigniaud, D. Kowalski, Andrzej Pelc. Deterministic rendezvous in graphs. Algorithmica 46 (2006) : 69-96. Diks, K., S. Dobrev, Andrzej Pelc. Exploring planar graphs using unoriented maps. Journal of Interconnection Networks 7 (2006) : 353-373. Fraigniaud, P., L. Gasieniec, D. Kowalski, Andrzej Pelc. Collective tree exploration. Networks 48 (2006) : 166-177. Gasieniec, L., E. Kranakis, Andrzej Pelc, Q. Xin. Deterministic M2M Multicast in Radio Networks. Theoretical Computer Science 362 (2006) : 126-206. Paquette, M., Andrzej Pelc. Fast broadcasting with Byzantine faults. International Journal of Foundations of Computer Science 17 (2006) : 1423-1439. Paquette, M., Andrzej Pelc. Optimal decision strategies in Byzantine environments. Journal of Parallel and Distributed Computing 66 (2006) : 419-427. Pelc, Andrzej. Voting mechanisms in asynchronous Byzantine environments. Parallel Processing Letters 16. (2006) : 93-99. Czyzowicz, Jurek, Wojciech Fraczak, Andrzej Pelc. Transducers with set outputs. Journal of Automata, Languages and Combinatorics 10. (2005) : 37-49. Fraigniaud, P., D. Ilcinkas, G. Peer, Andrzej Pelc, D. Peleg. Graph exploration by a finite automaton. Theoretical Computer Science 345. (2005) : 331-344. Kowalski, D., Andrzej Pelc. Broadcasting in undirected ad hoc radio networks. Distributed Computing 18. (2005) : 43-57. Kowalski, D., Andrzej Pelc. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333. (2005) : 355-371. Pelc, Andrzej, D. Peleg. Broadcasting with locally bounded Byzantine faults. Information Processing Letters 93. (2005) : 109-115. Dessmark, A., Andrzej Pelc. Distributed coloring and communication in rings with local knowledge. Combinatorics, Probability and Computing 13. (2004) : 123-136. Dessmark, A., Andrzej Pelc. Optimal graph exploration without good maps. Theoretical Computer Science 326. (2004) : 343-362. Diks, K., P. Fraigniaud, E. Kranakis, Andrzej Pelc. Tree exploration with little memory. Journal of Algorithms 51. (2004) : 38-63. Dobrev, S., Andrzej Pelc. Leader election in rings with nonunique labels. Fundamenta Informaticae 59. (2004) : 333-347. Kowalski, D., Andrzej Pelc. Faster deterministic broadcasting in ad hoc radio networks. SIAM Journal on Discrete Mathematics 18. (2004) : 332-346. Kowalski, D., Andrzej Pelc. Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33. (2004) : 870-891. Chlebus, B.S., L. Gasieniec, Andrzej Pelc. Deterministic computations on a PRAM with static processor and memory faults. Fundamenta Informaticae 55. (2003) : 285-306. Czyzowicz, Jurek, E. Kranakis, D. Krizanc, Andrzej Pelc, M. Vargas Martin. Enhancing hyperlink structure for improving Web performance. Journal of Web Engineering 1. (2003) : 93-127. Czyzowicz, Jurek, W. Fraczak, Andrzej Pelc, W. Rytter. Linear time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science 14. (2003) : 1019-1031. De Marco, G., Andrzej Pelc. Deterministic broadcasting time with partial knowledge of the network. Theoretical Computer Science 290 (2003) : 2009-2020. Dessmark, A., A. Lingas, Andrzej Pelc. Tradeoffs between load and degree in virtual path layouts. Parallel Processing Letters 13. (2003) : 485-496. Chlebus, B.S., L. Gasieniec, A. Gibbons, Andrzej Pelc, W. Rytter. Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15. (2002) : 27-38. Dessmark, A., Andrzej Pelc. Deterministic radio broadcasting at low cost. Networks 39. (2002) : 88-97. Diks, K., E. Kranakis, D. Krizanc, Andrzej Pelc. The impact of information on broadcasting time in linear radio networks. Theoretical Computer Science 287. (2002) : 449-471. Pelc, Andrzej. Searching games with errors - Fifty years of coping with liars. Theoretical Computer Science 270. (2002) : 71-109. De Marco, G., Andrzej Pelc. Faster broadcasting in unknown radio networks. Information Processing Letters 79. (2001) : 53-56. Fraigniaud, P., Andrzej Pelc, D. Peleg, S. Perennes. Assigning labels in an unknown anonymous network with a leader. Distributed Computing 14. (2001) : 163-183. Gargano, L., Andrzej Pelc, S. Perennes, U. Vaccaro. Efficient communication in unknown networks. Networks 38. (2001) : 39-49. Gasieniec, L., Andrzej Pelc, D. Peleg. The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14. (2001) : 207-222. Kranakis, E., D. Krizanc, Andrzej Pelc. Fault-tolerant broadcasting in radio networks. Journal of Algorithms 39. (2001) : 47-67. Denejko, P., K. Diks, Andrzej Pelc, M. Piotrow. Reliable minimum finding comparator networks. Fundamenta Informaticae 42. (2000) : 235-249. Diks, K., Andrzej Pelc. Optimal adaptive broadcasting with a bounded fraction of faulty nodes. Algorithmica 28. (2000) : 37-50. Kirousis, L.M., E. Kranakis, D. Krizanc, Andrzej Pelc. Power consumption in packet radio networks. Theoretical Computer Science 243. (2000) : 289-305. Kranakis, E., Andrzej Pelc. Better adaptive diagnosis of hypercubes
. IEEE Transactions on Computers 49. (2000) : 1013-1020. Panaite, P., Andrzej Pelc. Impact of topographic information on graph exploration efficiency. Networks 36. (2000) : 96-103. Panaite, P., Andrzej Pelc. Optimal broadcasting in faulty trees,. Journal of Parallel and Distributed Computing 60. (2000) : 566-584. Diks, K., A. Lingas, Andrzej Pelc. An optimal algorithm for broadcasting multiple messages in trees. Journal of Parallel and Distributed Computing 59 (1999) : 465-474. Gasieniec, L., E. Kranakis, D. Krizanc, Andrzej Pelc. Minimizing congestion of layouts for ATM networks with faulty links. International Journal of Foundations of Computer Science 10 (1999) : 503-512. Kranakis, E., Andrzej Pelc, A. Spatharis. Optimal adaptive fault diagnosis for simple multiprocessor systems. Journal of Parallel and Distributed Computing 59 (1999) : 206-214. Panaite, P., Andrzej Pelc. Exploring unknown undirected graphs. Journal of Algorithms 33 (1999) : 281-295. Czumaj, A., L. Gasieniec, Andrzej Pelc. Time and cost trade-offs in gossiping. SIAM Journal on Discrete Mathematics 11 (1998) : 400-413. Diks, K., Andrzej Pelc. System diagnosis with smallest risk of error. Theoretical Computer Science 203 (1998) : 163-173. Diks, K., E. Kranakis, Andrzej Pelc. Broadcasting in unlabeled tori. Parallel Processing Letters 8 (1998) : 177-188. Diks, K., E. Kranakis, Andrzej Pelc. Perfect broadcasting in unlabeled networks. Discrete Applied Mathematics 87 (1998) : 33-47. Diks, K., S. Dobrev, E. Kranakis, Andrzej Pelc, P. Ruzicka. Broadcasting in unlabeled hypercubes with linear number of messages. Information Processing Letters 66 (1998) : 181-186. Farley, A., Andrzej Pelc, A. Proskurowski. Minimum-time multidrop broadcast. Discrete Applied Mathematics 83 (1998) : 61-77. Gasieniec, L., Andrzej Pelc. Broadcasting with linearly bounded transmission faults. Discrete Applied Mathematics 83. (1998) : 121-133. Kranakis, E., D. Krizanc, Andrzej Pelc, D. Peleg. Approximate maxima finding of continuous functions under restricted budget. Theoretical Computer Science 203 (1998) : 151-162. Pelc, Andrzej, E. Upfal. Reliable fault diagnosis with few tests. Combinatorics, Probability & Computing 7 (1998) : 323-333. Pelc, Andrzej. Optimal diagnosis of heterogeneous systems with random faults. IEEE Transactions on Computers 47 (1998) : 298-304. Berman, P., K. Diks, Andrzej Pelc. Reliable broadcasting in logarithmic time with Byzantine link failures. Journal of Algorithms 22 (1997) : 199-211. Chlebus, B., K. Diks, Andrzej Pelc. Transition-optimal token distribution. Fundamenta Informaticae 32 (1997) : 313-328. Diks, K., Andrzej Pelc. Globally optimal diagnosis in systems with random faults. IEEE Transactions on Computers 46 (1997) : 200-204. Gasieniec, L., Andrzej Pelc. Broadcasting with a bounded fraction of faulty nodes. Journal of Parallel and Distributed Computing 42 (1997) : 11-20. Kranakis, E., D. Krizanc, Andrzej Pelc. Hop-congestion tradeoffs for high speed networks. International Journal of Foundations of Computer Science 8 (1997) : 117-126. Chlebus, B.S., K. Diks, Andrzej Pelc. Reliable broadcasting in hypercubes with random link and node failures. Combinatorics, Probability & Computing 5 (1996) : 337-350. Chlebus, B.S., K. Diks, Andrzej Pelc. Broadcasting in synchronous networks with dynamic faults. Networks 27 (1996) : 309-318. Chlebus, B.S., K. Diks, Andrzej Pelc. Broadcasting in Synchronous Networks with Dynamic Faults. Networks 27. (1996) : 309-318. Diks, K., Andrzej Pelc. Broadcasting with universal lists. Networks 27 (1996) : 183-196. Diks, K., Andrzej Pelc. Efficient gossiping by packets in networks with random faults. SIAM Journal on Discrete Mathematics 9 (1996) : 8-17. Diks, K., Andrzej Pelc. Fault-tolerant linear broadcasting. Nordic Journal of Computing 3 (1996) : 188-201. Diks, K., Andrzej Pelc. Reliable computations on faulty EREW PRAM. Theoretical Computer Science 164 (1996) : 107-122. Gasieniec, L., Andrzej Pelc. Adaptive broadcasting with faulty nodes. Parallel Computing 22 (1996) : 903-912. Pelc, Andrzej. Fault-tolerant broadcasting and gossiping in communication networks. Networks 28 (1996) : 143-156. Diks, K., A. Malinowski, Andrzej Pelc. Token transfer in a faulty network. RAIRO, Theoretical Informatics and Applications 29 (1995) : 383-400. Diks, K., E. Kranakis, A. Malinowski, Andrzej Pelc. Anonymous wireless rings. Theoretical Computer Science 145 (1995) : 95-109. Pelc, Andrzej. Almost safe Byzantine Agreement in sparse networks with random faults. Parallel Processing Letters 5 (1995) : 489-497. Berman, P., Andrzej Pelc. Reliable distributed diagnosis for multiprocessor systems with random faults. Networks 24 (1994) : 417-427. Blough, D., Andrzej Pelc. Almost certain fault diagnosis through algorithm-based fault tolerance. IEEE Transactions on Parallel and Distributed Systems 5 (1994) : 532-539. Chlebus, B.S., K. Diks, Andrzej Pelc. Fast gossiping with short unreliable messages. Discrete Applied Mathematics 53 (1994) : 15-24. Chlebus, B.S., K. Diks, Andrzej Pelc. Sorting on a mesh-connected computer with delaying links. SIAM Journal on Discrete Mathematics 7 (1994) : 119-132. Chlebus, B.S., K. Diks, Andrzej Pelc. Sparse networks supporting efficient reliable broadcasting. Nordic Journal of Computing 1 (1994) : 332-345. Czyzowicz, Jurek, B. Lakshmanan, Andrzej Pelc. Searching with local constraints on error patterns. European Journal of Combinatorics 15 (1994) : 217-222. Diks, K., A. Malinowski, Andrzej Pelc. Reliable token dispersal with random faults. Parallel Processing Letters 4 (1994) : 417-427. Diks, K., E. Kranakis, D. Krizanc, B. Mans, Andrzej Pelc. Optimal coteries and voting schemes. Information Processing Letters 51 (1994) : 1-6. Pelc, Andrzej. Almost safe group testing with few tests. Combinatorics, Probability & Computing 3 (1994) : 411-419. Pelc, Andrzej. Searching with Permanently Faulty Tests. Ars Combinatoria 38. (1994) : 65-76. Blough, D., Andrzej Pelc. A clustered failure model for the memory array reconfiguration problem. IEEE Transactions on Computers 42 (1993) : 518-528. Blough, D., Andrzej Pelc. Diagnosis and Repair in Multiprocessor Systems. IEEE Transactions on Computers 42. (1993) : 205-217. Blough, D., Andrzej Pelc. Optimal communication in networks with randomly distributed Byzantine faults. Networks 23 (1993) : 691-701. Diks, K., Andrzej Pelc. Fast diagnosis of multiprocessor systems with random faults. RAIRO, Theoretical Informatics and Applications 27 (1993) : 391-401. Kenyon, C., P. Fraigniaud, Andrzej Pelc. Finding a target subnetwork in sparse networks with random faults. Information Processing Letters 48 (1993) : 297-303. Blough, D., Andrzej Pelc. Complexity of fault diagnosis in comparison models. IEEE Transactions on Computers 41 (1992) : 318-324. Diks, K., Andrzej Pelc. Almost safe gossiping in bounded degree networks. SIAM Journal on Discrete Mathematics 5 (1992) : 338-344. Pelc, Andrzej. Broadcasting time in sparse networks with faulty transmissions. Parallel Processing Letters 2 (1992) : 355-361. Pelc, Andrzej. Optimal fault diagnosis in comparison models. IEEE Transactions on Computers 41 (1992) : 779-786. Pelc, Andrzej. Reliable communication in networks with Byzantine link failures. Networks 22 (1992) : 441-459. Al-Thukair, F., Andrzej Pelc, I. Rival, J. Urrutia. Motion-planning, two-directional point representations and ordered sets. SIAM Journal on Discrete Mathematics 4 (1991) : 151-163. Czyzowicz, Jurek, K.B. Lakshmanan, Andrzej Pelc. Searching with a forbidden lie pattern in responses. Information Processing Letters 37 (1991) : 127-132. Pelc, Andrzej, I. Rival. Orders with level diagrams. European Journal of Combinatorics 12 (1991) : 61-68. Pelc, Andrzej. Broadcasting in complete networks with faulty nodes using unreliable calls. Information Processing Letters 40 (1991) : 169-174. Pelc, Andrzej. Undirected graph models for system-level fault diagnosis. IEEE Transactions on Computers 40 (1991) : 1271-1276. Czyzowicz, Jurek, Andrzej Pelc, I. Rival, J. Urrutia. Crooked diagrams with few slopes. Order 7 (1990) : 133-143. Czyzowicz, Jurek, Andrzej Pelc, I. Rival. Drawing orders with few slopes. Discrete Mathematics 82 (1990) : 233-250. Czyzowicz, Jurek, Andrzej Pelc, I. Rival. Planar ordered sets of width two. Mathematica Slovaca 40 (1990) : 375-388. Czyzowicz, Jurek, D. Mundici, Andrzej Pelc. Ulam's searching game with lies. Journal of Combinatorial Theory, Series A, 52 (1989) : 62-76. Pelc, Andrzej. Detecting a counterfeit coin with unreliable weighings. Ars Combinatoria 27 (1989) : 181-192. Pelc, Andrzej. Detecting errors in searching games. Journal of Combinatorial Theory, Series A, 51 (1989) : 43-54. Pelc, Andrzej. Searching with known error probability. Theoretical Computer Science 63 (1989) : 185-202. Pelc, Andrzej. Weakly adaptive comparison searching. Theoretical Computer Science 66 (1989) : 105-111. Czyzowicz, Jurek, D. Mundici, Andrzej Pelc. Solution of Ulam's problem on binary search with two lies. Journal of Combinatorial Theory, Series A, 49 (1988) : 384-388. Pelc, Andrzej. Prefix search with a lie. Journal of Combinatorial Theory, Series A, 48 (1988) : 165-173. Pelc, Andrzej. Coding with bounded error fraction. Ars Combinatoria 24 (1987) : 17-22. Pelc, Andrzej. Invariant measures on abelian metric groups. Colloquium Mathematicum 54 (1987) : 95-101. Pelc, Andrzej. Solution of Ulam's problem on searching with a lie. Journal of Combinatorial Theory, Series A, 44 (1987) : 129-140. Pelc, Andrzej. Invariant ideals and Borel sets. Proceedings of the American Mathematical Society 97 (1986) : 503-506. Pelc, Andrzej. Invariant measures and ideals on discrete groups. Dissertationes Mathematicae 255 (1986) : 1-52. Pelc, Andrzej. Lie patterns in search procedures. Theoretical Computer Science 47 (1986) : 61-69. Ciesielski, K., Andrzej Pelc. Extensions of invariant measures on Euclidean spaces. Fundamenta Mathematicae 125 (1985) : 1-10. Pelc, Andrzej, K. Prikry. On the existence of measures on sigma-algebras. Fundamenta Mathematicae 125 (1985) : 115-123. Pelc, Andrzej. Combinatorics on sigma-algebras and a problem of Banach. Fundamenta Mathematicae 123 (1984) : 1-9. Pelc, Andrzej. Idempotent ideals on abelian groups. Journal of Symbolic Logic 49 (1984) : 813-819. Pelc, Andrzej. Measure theory from the point of view of set theory. Wiadomosci Matematyczne 26 (1984) : 33-46. Pelc, Andrzej. The nonexistence of maximal invariant measures on abelian groups. Proceedings of the American Mathematical Society 92 (1984) : 55-57. Pelc, Andrzej, K. Prikry. On a problem of Banach. Proceedings of the American Mathematical Society 89 (1983) : 608-610. Pelc, Andrzej. Semiregular invariant measures on abelian groups. Proceedings of the American Mathematical Society 86 (1982) : 423-426. Pelc, Andrzej. Ideals on the real line and Ulam's problem. Fundamenta Mathematicae 112 (1981) : 165-170. Pelc, Andrzej. Solution of a problem of Ulam on countable sequences of sets. Fundamenta Mathematicae 114 (1981) : 113-118. Krawczyk, A., Andrzej Pelc. On families of sigma-complete ideals. Fundamenta Mathematicae 109 (1980) : 155-161. Pelc, Andrzej. An example of formalizing some intensional expressions. Studia Filozoficzne 5 (1980) : 105-109. Pelc, Andrzej. On degrees of uncertainty in mathematics. Studia Filozoficzne 3. (1980) : 91-94. Pelc, Andrzej. 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. 7. 1978 (1978) : 585-589. COC (Contribution à un ouvrage collectif)Pelc, Andrzej, M. Raynal (Eds.). Structural Information and Communication Complexity. Springer, 2005. LNCS 3499, 1-322. Pelc, Andrzej, I. Stojmenovic. Broadcasting in radio networks. Handbook of Wireless Networks and Mobile Computing. New York : John Wiley and Sons Inc., 2002. 509-528. Czyzowicz, Jurek, Andrzej Pelc, I. Rival. Unfolding weighted consensus orders into consistent numerical scales. Topics in Combinatorics and Graph Theory, Essays in honour of Gerhard Ringel, R. Bodendiek and R. Henn . Physica-Verlag, Heidelberg , 1990. 207-217. Pelc, Andrzej. On cardinal numbers. School and Educational Editors, Warsaw, 1984. CAC (Publications arbitrées dans des actes de colloque)Bhagat, Subhash, Andrzej Pelc. How to meet at a node of any connected graph. 36th International Symposium on Distributed Computing (DISC 2022), 11:1 - 11:16. (2022). Bouchard, Sébastien, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Almost-optimal deterministic treasure hunt in arbitrary graphs. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 36:1-36:20. (2021). Ganczorz, Adam, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc. Deterministic size discovery and topology recognition in radio networks with short labels . 35th International Symposium on Distributed Computing (DISC 2021), 22:1-22:20. (2021). Gorain, Barun, Avery Miller, Andrzej Pelc. Four shades of deterministic leader election in anonymous networks. 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), 265-274. (2021). Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc, Franck Petit. Almost universal anonymous rendezvous in the plane. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), 117-127. (2020). Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc. Want to gather? No need to chatter!. 39th Annual ACM Symposium on Principles of Distributed Computing (PODC 2020), 253-262. (2020). Miller, Avery, Andrzej Pelc, Ram Narayan Yadav. Deterministic leader election in anonymous radio networks. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), 407-417. (2020). Pelc, Andrzej, Ram Narayan Yadav. Latecomers help to meet: Deterministic anonymous gathering in the plane. 21st International Conference on Distributed Computing and Networking (ICDCN 2020) , 4:1-4:10. (2020). Czyzowicz, Jurek, Dariusz Dereniowski, Andrzej Pelc. Building a nest by an automaton. 27th Annual European Symposium on Algorithms (ESA 2019), , 35:1-35:14. (2019). Ellen, Faith, Barun Gorain, Avery Miller, Andrzej Pelc. Constant-length labeling schemes for deterministic radio broadcast. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), 171-178. (2019). Pelc, Andrzej, Ram Narayan Yadav. Using time to break symmetry: universal deterministic anonymous rendezvous . 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), 85-92. . (2019). Bouchard, Sébastien, Yoann Dieudonné, Andrzej Pelc, Franck Petit. Deterministic treasure hunt in the plane with angular hints. 29th International Symposium on Algorithms and Computation (ISAAC 2018), 48:1 - 48:13. (2018). Gorain, Barun, Andrzej Pelc. Finding the size of a radio network with short labels . 19th International Conference on Distributed Computing and Networking (ICDCN 2018), 10:1-10:10. (2018). Pelc, Andrzej. Explorable families of graphs. 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018), 165-177. (2018). Dieudonné, Yoann, Andrzej Pelc. Impact of knowledge on election time in anonymous networks. 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017), Washington, DC, USA. 207-215. (2017). Gorain, Barun, Andrzej Pelc. Deterministic graph exploration with advice. 44th International Colloquium on Automata, Languages and Programming (ICALP 2017), Varsovie, Pologne. 132:1-132:14. (2017). Gorain, Barun, Andrzej Pelc. Short labeling schemes for topology recognition in wireless tree networks. 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017), Porquerolles, France. 37-52. (2017). Elouasbi, Samir, Andrzej Pelc. Deterministic meeting of sniffing agents in the plane. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), 212-227. (2016). Glacet, Christian, Avery Miller, Andrzej Pelc. Time vs. information tradeoffs for leader election in anonymous trees. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), 600-609. (2016). Hounkanli, Kokouvi, Andrzej Pelc. Asynchronous broadcasting with bivalent beeps. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), 291-306. (2016). Hounkanli, Kokouvi, Avery Miller, Andrzej Pelc. Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2016), 16-28. (2016). Miller, Avery, Andrzej Pelc. Election vs. selection: How much advice is needed to find the largest node in a graph?. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), 377-386. (2016). Elouasbi, Samir, Andrzej Pelc. Deterministic rendezvous with detection using beeps. 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2015), 85-97. (2015). Chalopin, Jérémie, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Fault-tolerant rendezvous in networks. 41st International Colloquium on Automata, Languages and Programming (ICALP), 411-422. (2014). Miller, Avery, Andrzej Pelc. Fast rendezvous with advice. 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 75-87. (2014). Miller, Avery, Andrzej Pelc. Time versus cost tradeoffs for deterministic rendezvous in networks. 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), 282-290. (2014). Miller, Avery, Andrzej Pelc. Tradeoffs between cost and information for rendezvous and treasure hunt. 18th International Conference on Principles of Distributed Systems (OPODIS) , 263-276. (2014). Arfaoui, Heger, Pierre Fraigniaud, Andrzej Pelc. Local decision and verification with bounded-size outputs. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), 133-147. (2013). Dieudonné, Yoann, Andrzej Pelc, Vincent Villain. How to meet asynchronously at polynomial cost. 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), 92-99. (2013). Dieudonné, Yoann, Andrzej Pelc. Anonymous meeting in networks. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 737-747. (2013). Dieudonné, Yoann, Andrzej Pelc. Deterministic polynomial approach in the plane. 40th International Colloquium on Automata, Languages and Programming (ICALP), 533-544. (2013). Fusco, Emanuele, Andrzej Pelc, Rossella Petreschi. Learning a ring cheaply and fast. 40th International Colloquium on Automata, Languages and Programming (ICALP), 557-568. (2013). Fusco, Emanuele, Andrzej Pelc, Rossella Petreschi. Use knowledge to learn faster: Topology recognition with advice. 27th International Symposium on Distributed Computing (DISC 2013), 31-45. (2013). Guilbault, Samuel, Andrzej Pelc. Gathering asynchronous oblivious agents with restricted vision in an infinite line. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), 296-310. (2013). Anaya, Julian, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès. Collecting information by power-aware mobile agents, . Proc. 26th International Symposium on Distributed Computing (DISC 2012), 46-60. (2012). Chlebus, Bogdan, Dariusz Kowalski, Andrzej Pelc. Electing a leader in multi-hop radio networks,. 16th International Conference on Principles of Distributed Systems (OPODIS 2012), 106-120. (2012). Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. Time vs. space trade-offs for rendezvous in trees. Symposium on Parallel Algorithms and Architecture (SPAA), 1-10. (2012). Czyzowicz, Jurek, Andrzej Pelc, Mélanie Roy. Tree exploration by a swarm of mobile agents. OPODIS, LNCS 7702. Springer. 121-134. (2012). Dieudonné, Yoann, Andrzej Pelc, David Peleg. Gathering despite mischief. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 527-540. (2012). Dieudonné, Yoann, Andrzej Pelc. Deterministic network exploration by anonymous silent agents with local traffic reports. 39th International Colloquium on Automata, Languages and Programming (ICALP), 500-512. (2012). Elouasbi, Samir, Andrzej Pelc. Time of anonymous rendezvous in trees: Determinism vs. randomization. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 291-302. (2012). Fraigniaud, Pierre, Andrzej Pelc. Decidability classes for mobile agents computing. 10th Latin American Theoretical Informatics Symposium (LATIN), 362-374. (2012). Fusco, Emanuele, Andrzej Pelc. Knowledge, level of symmetry, and time of leader election. 20th Annual European Symposium on Algorithms (ESA), 479-490. (2012). Chlebus , Bogdan, Dariusz Kowalski, Andrzej Pelc, Mariusz Rokicki. Efficient distributed communication in ad-hoc radio networks. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011),, Springer. 613-624. (2011). Fusco, Emanuele, Andrzej Pelc. Communication complexity of consensus in anonymous message passing systems. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), Toulouse, France. 191-206. (2011). Guilbault, Samuel, Andrzej Pelc. Asynchronous rendezvous of anonymous agents in arbitrary graphs. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), Toulouse, France. 162-173. (2011). Guilbault, Samuel, Andrzej Pelc. Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2011), Springer. 162-173. (2011). Pelc, Andrzej. DISC 2011 Invited Lecture: Deterministic rendezvous in networks: Survey of models and results. 25th International Symposium on Distributed Computing (DISC 2011), Springer. 1-15. (2011). Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. 35th International Symposiums on Mathematical Foundations of Computer Science (MFCS 2010), 294-305. (2010). Czyzowicz, Jurek, Adrian Kosowski, Andrzej Pelc. How to meet when you forget: Log-space rendezvous in arbitrary graphs. 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), 450-459. (2010). Czyzowicz, Jurek, Arnaud Labourel, Andrzej Pelc. How to meet asynchronously (almost) everywhere. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 22-30. (2010). Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, Andrzej Pelc. Asynchronous deterministic rendezvous in bounded terrains. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010), 72-85. (2010). Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, Andrzej Pelc. Optimal exploration of terrains with obstacles. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), 1-12. (2010). Dereniowski, Dariusz, Andrzej Pelc. Drawing maps with advice. 24th International Symposium on Distributed Computing (DISC 2010), 328-342. (2010). Fraigniaud, Pierre, Andrzej Pelc. Delays induce an exponential memory gap for rendezvous in trees. 22nd Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA 2010), 224-232. (2010). Fusco, Emanuele, Andrzej Pelc. Distributed tree comparison with nodes of limited memory. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010), 142-156. (2010). Fusco, Emanuele, Andrzej Pelc. How much memory is needed for leader election. 24th International Symposium on Distributed Computing (DISC 2010), 251-266. (2010). Czyzowicz, Jurek, Arnaud Labourel, Andrzej Pelc. Optimality and competitiveness of exploring polygons by mobile robots. Proc. 17th European Symposium on Algorithms (ESA 2009), 263-274. (2009). Czyzowicz, Jurek, Leszek Gasieniec, Dariusz Kowalski, Andrzej Pelc. Consensus and mutual exclusion in a multiple access channel. 23rd International Symposium on Distributed Computing (DISC 2009) , 512-526. (2009). Kowalski, Dariusz, Andrzej Pelc. Leader election in ad hoc radio networks: a keen ear helps. 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), 521-533. (2009). Calamoneri, T., E.G. Fusco, Andrzej 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. 311-330. (2008). Flocchini, P., D. Ilcinkas, Andrzej 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. (2008). Fraigniaud, P., Andrzej Pelc. Deterministic rendezvous in trees with little memory
. Proc. 22nd International Symposium on Distributed Computing (DISC 2008), septembre 2008, Arcachon, France. 242-256. (2008). Fusco, E. , Andrzej Pelc. Broadcasting in UDG radio networks with missing and inaccurate information
. Proc. 22nd International Symposium on Distributed Computing (DISC 2008), septembre 2008, Arcachon, France. 257-273. (2008). Fusco, E., Andrzej 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. (2008). Ilcinkas, D., D. Kowalski, Andrzej 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. (2008). Kranakis, E., M. Paquette, Andrzej 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. 108-121. (2008). Pelc, Andrzej. 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). (2008). Emek, Y., L. Gasieniec, E. Kantor, Andrzej 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. (2007). Flocchini, P., D. Ilcinkas, Andrzej 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. (2007). Fraigniaud, P. , C. Gavoille, D. Ilcinkas, Andrzej Pelc. Distributed computing with advice: information sensitivity of graph coloring. Proc. 34th International Colloquium on Automata, (ICALP 2007), July 2007, Wroclaw, Poland. LNCS 4596, 231-242. (2007). Gasieniec, L., Andrzej Pelc, T. Radzik, X. Zhang. Tree exploration with logarithmic memory. Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, USA. 585-594. (2007). Guilbault, S., Andrzej 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, (2007). Kranakis, E., M. Paquette, Andrzej Pelc. Communication in networks with random dependent faults . Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007), août 2007, Cesky Krumlov, République Tchèque, LNCS 4708, 418-429. (2007). Czyzowicz, Jurek, Gasieniec L., Andrzej Pelc. Gathering few fat mobile robots in the plane. Proc. 10th International Conference on Principles of Distributed Systems (OPODIS'2006), Bordeaux, France, décembre 12-15 2006, LNCS 4305, 350-364. (2006). Fraigniaud, P., D. Ilcinkas, Andrzej 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, USA, 179-187. (2006). Fraigniaud, P., D. Ilcinkas, Andrzej Pelc. Tree exploration with an oracle. Proc. 31st International Symposium on Mathematical Foundations of Computer Science, (MFCS 2006), août/septembre 2006, Stara Lesna, Slovaquie, LNCS 4162, 24-37. (2006). Klasing, R., E. Markou , Andrzej Pelc. Gathering asynchronous oblivious mobile robots in a ring. Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006), décembre 2006, Kolkata, Inde, LNCS 4288, 744-753. (2006). De Marco, G., L. Gargano, E. Kranakis, D. Krizanc, Andrzej Pelc, U. Vaccaro. Asynchronous deterministic rendezvous in graphs. 30th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2005), août 2005, Gdansk, Pologne, LNCS3618, 271-282. (2005). Pelc, Andrzej, 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. (2005). Pelc, Andrzej. Waking up anonymous ad hoc radio networks. Proc. 19th International Symposium on Distributed Computing (DISC 2005), septembre 2005, Cracore, Pologne, LNCS 3724, 260-272. (2005). Czyzowicz, Jurek, D. Kowalski, E. Markou, Andrzej 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 35-44, 67-80. (2004). Diks, K., S. Dobrev, Andrzej 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. (2004). Fraigniaud, P., D. Ilcinkas, G. Peer, Andrzej 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. (2004). Fraigniaud, P., L. Gasieniec, D. Kowalski, Andrzej Pelc. Collective tree exploration. Proc. Latin American Theoretical Informatics (LATIN'2004), April 2004, Buenos Aires, Argentina, LNCS 2976, 141-151. (2004). Gasieniec, L., E. Kranakis, Andrzej 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. (2004). Kowalski, D., Andrzej 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. (2004). Kowalski, D., Andrzej 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. (2004). Markou, E., Andrzej 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. (2004). Paquette, M., Andrzej Pelc. Fast broadcasting with Byzantine faults. Proc. 7th IFAC Symposium on Cost Oriented Automation, June 2004, Gatineau-Ottawa, Canada, 311-316. (2004). Paquette, M., Andrzej Pelc. Optimal decision strategies in Byzantine environments. Proc. 11th Colloquium on Structural Information and Communication Complexity (SIROCCO'2004), Smolenice Castle, Slovakia, LNCS 3104, 245-254. (2004). Calamoneri, T., Andrzej 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. (2003). De Marco, G., Andrzej 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. (2003). Dessmark, A., P. Fraigniaud, Andrzej Pelc. Deterministic rendezvous in graphs. Proc. 11th Annual European Symposium on Algorithms (ESA'2003), September 2003, Budapest, Hungary, LNCS 2832, 184-195. (2003). Dobrev, S., Andrzej 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 (USA), 1400-1406. (2003). Kowalski, D., Andrzej Pelc. Broadcasting in undirected ad hoc radio networks. Proc. 22nd Ann. ACM Symposium on Principles of Distributed Computing (PODC'2003) July 1, 2003, Boston (USA), 73-82. (2003). Kowalski, D., Andrzej 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. (2003). Kowalski, D., Andrzej 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. (2003). Czyzowicz, Jurek, W. Fraczak, Andrzej 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. (2002). Czyzowicz, Jurek, W. Fraczak, Andrzej Pelc. Transducers with set outputs. Proc. 8th Annual International Computing and Combinatorics Conference (COCOON 2002), August 1, 2002, Singapore. LNCS 2387, 300-309. (2002). Dessmark, A., Andrzej Pelc. Optimal graph exploration without good maps. Proc. 10th European Symposium on Algorithms (ESA 2002), September 2002, Rome, Italy, LNCS 2461, 374-386. (2002). Diks, K., P. Fraigniaud, E. Kranakis, Andrzej 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. (2002). Kowalski, D., Andrzej Pelc. Deterministic broadcasting time in radio networks of unknown topology. Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), November 1, 2002, Vancouver (Canada), 63-72. (2002). Czyzowicz, Jurek, E. Kranakis, D. Krizanc, Andrzej Pelc, M. Vargas Martin. Evaluation of Hotlink Assignment Heuristics for Improving Web Access. Proc. 2nd International Conference on Internet Computing (IC'2001), Las Vegas, Nevada, 793-799. (2001). De Marco, G., Andrzej 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. (2001). Dessmark, A., Andrzej 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. (2001). Dessmark, A., Andrzej Pelc. Distributed coloring and communication in rings with local knowledge. Proc. International Parallel and Distributed Processing Symposium (IPDPS 2001), April 2001, San Francisco, U.S.A. (2001). Dessmark, A., Andrzej Pelc. Tradeoffs between knowledge and time of communication in geometric radio networks. Proc.13th Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), 59-66. (2001). Bose, P., Jurek Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, Andrzej Pelc, M. Vargas Martin. Strategies for Hotlink Assignments . Proc. 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), Taipe, Taiwan, LNCS 1969, 23-34. (2000). Chlebus, B.S., L. Gasieniec, A. Gibbons, Andrzej Pelc, W. Rytter. Deterministic broadcasting in unknown radio networks. Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2000), San Francisco, U.S.A., 861-870. (2000). De Marco, G., Andrzej Pelc. Deterministic broadcasting time with partial knowledge of the network. Proc. 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), LNCS 1969, 374-385. (2000). Fraigniaud, P., Andrzej Pelc, D. Peleg, 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., 101-112. (2000). Gargano, L., Andrzej Pelc, S. Perennes, U. Vaccaro . Efficient communication in unknown networks. Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'2000), LNCS 1928, 172-183. (2000). Gasieniec, L., Andrzej Pelc, D. Peleg. The wakeup problem in synchronous broadcast systems. Proc. 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'2000), Portland, Oregon, U.S.A., 113-122. (2000). Diks, K., E. Kranakis, D. Krizanc, Andrzej 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. (1999). Kranakis, E., Andrzej 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. (1998). Kranakis, E., D. Krizanc, Andrzej Pelc. Fault-tolerant broadcasting in radio networks. Proc. 6th Annual European Symposium on Algorithms, ESA'98, Venice, Italy, August 1998, LNCS 1461, 283-294. (1998). Panaite, P., Andrzej Pelc. Exploring unknown undirected graphs. Proc. 9th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'98), San Francisco, USA, January 1998, 316-322. (1998). Diks, K., A. Lingas, Andrzej Pelc. Broadcasting multiple messages in trees. Proc. 4th Coll. on Structural Information and Communication Complexity, SIROCCO'97, Ascona, Switzerland, July 1997, 69-80. (1997). Diks, K., Andrzej 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, 118-129. (1997). Kirousis, L., E. Kranakis, D. Krizanc, Andrzej 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, 363-374. (1997). Panaite, P., Andrzej Pelc. Optimal fault-tolerant broadcasting in trees. Proc. 8th Annual International Symposium on Algorithms and Computation, ISAAC'97, Singapore, December 1997, LNCS 1350, 143-152. (1997). Panaite, P., Andrzej Pelc. Universally fault-tolerant broadcasting in trees. Proc. International Conference on Parallel and Distributed Systems, ICPADS'97, Seoul, Korea, December 1997, 724-729. (1997). Panaite, P., Andrzej Pelc. Universally fault-tolerant broadcasting in trees. Proc. International Conference on Parallel and Distributed Systems, ICPADS'97, Seoul, Korea, December 1997, 724-729. (1997). Diks, K., Andrzej 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, 141-150. (1996). Gasieniec, L., E. Kranakis, D. Krizanc, Andrzej 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, 372-381. (1996). Kranakis, E., D. Krizanc, Andrzej 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, 268-278. (1996). Kranakis, E., D. Krizanc, Andrzej 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, 153. (1996). Pelc, Andrzej. Efficient fault location with small risk. Proc. 3rd Coll. on Structural Information and Communication Complexity, SIROCCO'96, Certosa di Pontignano, Siena, June 1996, 292-300. (1996). Chlebus, B.S., L. Gasieniec, Andrzej Pelc. Fast deterministic simulation of computations on faulty parallel machines. . Third Annual European Symposium on Algorithms ESA'95, Corfu, Greece, September 1995, LNCS 979, 89-101. (1995). Diks, K., Andrzej Pelc. Broadcasting with universal lists. Proc. 28th Annual Hawaii International Conference on System Sciences, January 1995, Vol. 2, 564-573. (1995). Kranakis, E., D. Krizanc, Andrzej Pelc. Hop-congestion trade-offs for high-speed networks. Proc. Seventh IEEE Symposium on Parallel and Distributed Processing, San Antonio, Texas, October 1995, 662-668. (1995). Pelc, Andrzej. Fast fault-tolerant broadcasting and gossiping. Proc. 2nd Colloquium on Structural Information and Communication Complexity, SIROCCO'95, June 1995, Olympia, Greece, 159-172. (1995). Chlebus, B.S., K. Diks, Andrzej Pelc. Waking up an anonymous faulty network from a single source. Proc. 27th Annual Hawaii International Conference on System Sciences, January 1994, Vol. 2, 187-193. (1994). Denejko, P., K. Diks, Andrzej 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, 306-315. (1994). Diks, K., Andrzej Pelc. Fault-tolerant linear broadcasting. Proc. First Canada-France Conference on Parallel and Distributed Computing, Theory and Practice, Montreal, Canada, May 1994, LNCS 805, 207-217. (1994). Diks, K., E. Kranakis, A. Malinowski, Andrzej Pelc. The buffer potential of a network. Proc. 1st Colloquium on Structural Information and Communication Complexity, SIROCCO'94, May 1994, Ottawa, Canada, 149-150. (1994). Chlebus, B.S., K. Diks, Andrzej Pelc. Sparse networks supporting efficient reliable broadcasting. Proc. 20th International Colloquium on Automata, Languages and Programming ICALP'93, Lund, Sweden, July 1993, LNCS 700, 388-397. (1993). Pelc, Andrzej. Efficient distributed diagnosis in the presence of random faults. Proc. 23rd Annual International Symposium on Fault-Tolerant Computing, Toulouse, France, June 1993, 462-469. (1993). Blough, D., Andrzej 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, 292-295. (1991). Chlebus, B.S., K. Diks, Andrzej Pelc. Optimal broadcasting in faulty hypercubes. Proc. 21st Annual International Symposium on Fault-Tolerant Computing, Montreal, Canada, June 1991, 266-273. (1991). Berman, P., Andrzej Pelc. Distributed probabilistic fault diagnosis for multiprocessor systems. Proc. 20th Annual International Symposium on Fault-Tolerant Computing, Newcastle upon Tyne, UK, June 1990, 340-346. (1990). Blough, D., Andrzej Pelc. Reliable diagnosis and repair in constant-degree multiprocessor systems. Proc. 20-th Annual International Symposium on Fault-Tolerant Computing, Newcastle upon Tyne, UK, 316-323. (1990). Diks, K., Andrzej Pelc. Reliable gossip schemes with random link failures. Proc. 28th Annual Allerton Conference on Communication, Control and Computing, Allerton, Illinois, October 1990, 978-987. (1990). Pelc, Andrzej. Invariant measures on commutative semigroups. Open Days in Model Theory and Set Theory", Jadwisin, Poland, September 1981, 249-258. (1981). RAP (Rapport de recherche)Panaite, P., Andrzej Pelc. 1997. Fault-Tolerant Broadcasting in Trees, Rapport technique, RR97/04-2. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1996. Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes, Rapport technique, RR96/11-3. Hull : Université du Québec en Outaouais : Diks, K., E. Kranakis, Andrzej Pelc. 1996. Broadcasting in Unlabeled Networks, Rapport technique, RR96/12-5. Hull : Université du Québec en Outaouais : Diks, K., E. Kranakis, Andrzej Pelc. 1996. Broadcasting in Unlabeled Tori, Rapport technique, RR96/12-4. Hull : Université du Québec en Outaouais : Pelc, Andrzej. 1996. Optimal Diagnosis of Heterogeneous Systems with Random Faults, Rapport technique, RR96/08-1. Hull : Université du Québec en Outaouais : Chlebus, B., L. Gasieniec, Andrzej Pelc. 1995. Fast Deterministic Simulation of Computations on Faulty Parallel Machines, Rapport technique, RR 95/03-6. Hull : Université du Québec en Outaouais : Czumaj, A., L. Gasieniec, Andrzej Pelc. 1995. Time and Cost Trade-offs in Gossiping, Rapport technique, RR95/06-9. Hull : Université du Québec en Outaouais : Farley, A., Andrzej Pelc, A. Proskurowski. 1995. Minimum-Time Multidrop Broadcast, Technical Report, CIS-TR-95-05. États-Unis : Université d'Orégon : Gasieniec, L., Andrzej Pelc. 1995. Adaptive Broadcasting with Faulty Nodes, Rapport technique, RR 95/02-5. Hull : Université du Québec en Outaouais : Gasieniec, L., Andrzej Pelc. 1995. Broadcasting with a Bounded Fraction of Faulty Nodes, Rapport technique, RR 95/01-1. Hull : Université du Québec en Outaouais : Gasieniec, L., E. Kranakis, D. Krizanc, Andrzej Pelc. 1995. Minimizing Congestion of Layouts for ATM Networks with Faulty Links, Rapport technique, RR96/05-8. Hull : Université du Québec en Outaouais : Pelc, Andrzej. 1995. Fault-Tolerant Broadcasting and Gossiping in Communication Networks, Rapport technique, RR95/12-12. Hull : Université du Québec en Outaouais : Chlebus, B.S., K. Diks, Andrzej Pelc. 1994. Broadcasting in Synchronous Networks with Dynamic Faults, Rapport technique, RR 94/05-3. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1994. Broadcasting with Universal Lists, Rapport technique, RR 93/06-4. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1994. Globally Optimal Diagnosis in Systems with Random Faults, Rapport de recherche, RR 94/11-8. Hull : Université du Québec en Outaouais : Chlebus, B.S., K. Diks, Andrzej Pelc. 1993. Waking Up an Anonymous Faulty Network from a Single Source, Rapport technique, RR 93/03-5. Hull : Université du Québec en Outaouais : Diks, K., A. Malinowski, Andrzej Pelc. 1993. Token Transfer in a Faulty Network, Rapport technique, RR 93/05-7. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1993. Fault-tolerant Linear Brodcasting, Rapport technique, RR 93/10-10. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1993. Linear Time Gossiping with Random Faults, Rapport technique, RR 93/02-3. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1993. Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures, Rapport technique, RR 93/02-3. Hull : Université du Québec en Outaouais : Diks, K., Andrzej Pelc. 1993. Reliable Computations on Faulty EREW PRAM, Rapport technique, RR 93/06-9. Hull : Université du Québec en Outaouais : Diks, K., E. Kranakis, A. Malinowski, Andrzej Pelc. 1993. Anonymous Wireless Rings, Technical Report, TR-223. Ottawa : Université Carleton : Diks, K., E. Kranakis, D. Krizanc, B. Mans, Andrzej Pelc. 1993. Optimal Coteries and Voting Schemes, Rapport technique, RR 93/11-11. Hull : Université du Québec en Outaouais : Berman, P., Andrzej Pelc. 1992. Efficient Broadcasting and Gossiping with Byzantine Link Failures, Rapport technique, RR 92/11-11. Hull : Université du Québec en Outaouais : Blough, D.M., Andrzej Pelc. 1992. Worst Case Optimal Voting Strategies in a Faulty Environment, Rapport technique, RR 92/09-8. Hull : Université du Québec en Outaouais : Pelc, Andrzej. 1992. Almost Safe Group Testing with Few Tests, Rapport technique, RR 92/09-9. Hull : Université du Québec en Outaouais : Pelc, Andrzej. 1992. Efficient Distributed Diagnosis in the Presence of Random Faults, Rapport technique, RR 92/10-10. Hull : Université du Québec en Outaouais : COF (Communication arbitrée)Pelc, Andrzej, D. Peleg, M. Raynal (Eds.). Structural Information and Communication Complexity . Theoretical Computer Science (Special Issue), Volume 384, Issues 2-3, October 2007, pp. 137-286. . 2007. Pelc, Andrzej. (Ed.), Distributed Computing. 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Springer, LNCS 4731, pp. 1-508. 2007. CNA (Communication non arbitrée)Pelc, Andrzej. Broadcasting in ad hoc radio networks. Universita' degli Studi "La Sapienza". Rome, Italie, 2002-06-06. Pelc, Andrzej. Deterministic broadcasting time in radio networks of unknown topology. Pisa, Italie, 2002-06-20. Pelc, Andrzej. Deterministic broadcasting time in radio networks of unknown topology. Université de Salerno, Salerno, Italie, 2002-05-28. Pelc, Andrzej. Exploring graphs with partial information.. Universita' degli Studi "La Sapienza". Rome, Italy, 2002-06-24. Pelc, Andrzej. Optimal graph exploration without good maps. Pisa, Italie, 2002-06-21. Pelc, Andrzej. Optimal graph exploration without good maps. Université de Varsovie, Varsovie, Pologne, 2002-04-25. |