The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrzej Pelc: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dariusz R. Kowalski, Andrzej Pelc
    Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:171-182 [Conf]
  2. Krzysztof Diks, Andrzej Pelc
    Fault-Tolerant Linear Broadcasting. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:207-217 [Conf]
  3. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
    Transducers with Set Output. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:300-309 [Conf]
  4. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
    Fast Deterministic Simulation of Computations on Faulty Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:89-101 [Conf]
  5. Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
    Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:184-195 [Conf]
  6. Anders Dessmark, Andrzej Pelc
    Optimal Graph Exploration without Good Maps. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:374-386 [Conf]
  7. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    The Impact of Knowledge on Broadcasting Time in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:41-52 [Conf]
  8. Krzysztof Diks, Andrzej Pelc
    Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:118-129 [Conf]
  9. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:283-294 [Conf]
  10. Dariusz R. Kowalski, Andrzej Pelc
    Deterministic Broadcasting Time in Radio Networks of Unknown Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:63-72 [Conf]
  11. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Optimal Broadcasting in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:266-273 [Conf]
  12. Andrzej Pelc
    Efficient Distributed Diagnosis in the Presence of Random Faults. [Citation Graph (0, 0)][DBLP]
    FTCS, 1993, pp:462-469 [Conf]
  13. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Waking up an Anonymous Faulty Network from a Single Source. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:187-193 [Conf]
  14. Krzysztof Diks, Andrzej Pelc
    Broadcasting with universal lists. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:564-573 [Conf]
  15. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:388-397 [Conf]
  16. Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
    Deterministic M2M Multicast in Radio Networks: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:670-682 [Conf]
  17. Petrisor Panaite, Andrzej Pelc
    Universally Fault-Tolerant Broadcasting in Trees. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1997, pp:724-729 [Conf]
  18. Anders Dessmark, Andrzej Pelc
    Distributed coloring and communication in rings with local knowledge. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:78- [Conf]
  19. Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
    Strategies for Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:23-34 [Conf]
  20. Ralf Klasing, Euripides Markou, Andrzej Pelc
    Gathering Asynchronous Oblivious Mobile Robots in a Ring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:744-753 [Conf]
  21. Dariusz R. Kowalski, Andrzej Pelc
    Polynomial Deterministic Rendezvous in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:644-656 [Conf]
  22. Gianluca De Marco, Andrzej Pelc
    Deterministic Broadcasting Time with Partial Knowledge of the Network. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:374-385 [Conf]
  23. Petrisor Panaite, Andrzej Pelc
    Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:143-152 [Conf]
  24. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:141-151 [Conf]
  25. Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
    Reliable Minimum Finding Comparator Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:306-315 [Conf]
  26. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Tree Exploration with an Oracle. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:24-37 [Conf]
  27. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:451-462 [Conf]
  28. Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:372-381 [Conf]
  29. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
    Asynchronous Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:271-282 [Conf]
  30. Gianluca De Marco, Andrzej Pelc
    Randomized Algorithms for Determining the Majority on Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:368-377 [Conf]
  31. Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
    Gathering Few Fat Mobile Robots in the Plane. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:350-364 [Conf]
  32. Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
    Searching for a Black Hole in Tree Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2004, pp:67-80 [Conf]
  33. Stefan Dobrev, Andrzej Pelc
    Leader Election in Rings with Nonunique Labels. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:1400-1406 [Conf]
  34. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Oracle size: a new measure of difficulty for communication tasks. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:179-187 [Conf]
  35. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in unknown anonymous networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:101-111 [Conf]
  36. Leszek Gasieniec, Andrzej Pelc, David Peleg
    The wakeup problem in synchronous broadcast systems (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:113-121 [Conf]
  37. Dariusz R. Kowalski, Andrzej Pelc
    Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:73-82 [Conf]
  38. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    The Complexity of Data Mining on the Web (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:153- [Conf]
  39. Andrzej Pelc, David Peleg
    Feasibility and complexity of broadcasting with random transmission failures. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:334-341 [Conf]
  40. Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc
    The Buffer Potential of a Network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:149-150 [Conf]
  41. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
    An Optimal Algorithm for Broadcasting Multiple Messages in Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:69-80 [Conf]
  42. Dariusz R. Kowalski, Andrzej Pelc
    Time of Radio Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:195-210 [Conf]
  43. Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
    Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:82-97 [Conf]
  44. Michel Paquette, Andrzej Pelc
    Optimal Decision Strategies in Byzantine Environments. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:245-254 [Conf]
  45. Andrzej Pelc
    Fast Fault-tolerant Broadcasting and Gossiping. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:159-172 [Conf]
  46. Andrzej Pelc
    Efficient fault location with small risk. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:292-300 [Conf]
  47. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:861-870 [Conf]
  48. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:588-597 [Conf]
  49. Gianluca De Marco, Andrzej Pelc
    Fast distributed graph coloring with O(Delta) colors. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:630-635 [Conf]
  50. Petrisor Panaite, Andrzej Pelc
    Exploring Unknown Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:316-322 [Conf]
  51. Anders Dessmark, Andrzej Pelc
    Tradeoffs between knowledge and time of communication in geometric radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:59-66 [Conf]
  52. Anders Dessmark, Andrzej Pelc
    Deterministic Radio Broadcasting at Low Cost. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:158-169 [Conf]
  53. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power Consumption in Packet Radio Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:363-374 [Conf]
  54. Dariusz R. Kowalski, Andrzej Pelc
    Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:109-120 [Conf]
  55. Andrzej Pelc
    Waking Up Anonymous Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:260-272 [Conf]
  56. Krzysztof Diks, Andrzej Pelc
    System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:141-150 [Conf]
  57. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient Communication in Unknown Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:172-183 [Conf]
  58. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:268-278 [Conf]
  59. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
    Prime Decompositions of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:85-94 [Conf]
  60. Krzysztof Diks, Andrzej Pelc
    Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:37-50 [Journal]
  61. Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
    Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:69-96 [Journal]
  62. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Hypercubes with Random Link and Node Failures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:337-350 [Journal]
  63. Anders Dessmark, Andrzej Pelc
    Distributed Colouring and Communication in Rings with Local Knowledge. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:2, pp:123-136 [Journal]
  64. Andrzej Pelc
    Almost Safe Testing with Few Tests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:411-419 [Journal]
  65. Andrzej Pelc, Eli Upfal
    Reliable Fault Diagnosis with Few Tests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:323-333 [Journal]
  66. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Fast gossiping with short unreliable messages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:15-24 [Journal]
  67. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
    Perfect Broadcasting in Unlabeled Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:33-47 [Journal]
  68. Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
    Minimum-time multidrop broadcast. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:61-77 [Journal]
  69. Leszek Gasieniec, Andrzej Pelc
    Broadcasting with linearly bounded transmission faults. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:121-133 [Journal]
  70. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:1, pp:27-38 [Journal]
  71. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in an unknown anonymous network with a leader. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:3, pp:163-183 [Journal]
  72. Dariusz R. Kowalski, Andrzej Pelc
    Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:1, pp:43-57 [Journal]
  73. Dariusz R. Kowalski, Andrzej Pelc
    Optimal Deterministic Broadcasting in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:3, pp:185-195 [Journal]
  74. Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
    Labeling trees with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1534-1539 [Journal]
  75. Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
    Searching with Local Constraints on Error Patterns. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:3, pp:217-222 [Journal]
  76. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Transition-Optimal Token Distribution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:3-4, pp:313-328 [Journal]
  77. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
    Deterministic Computations on a PRAM with Static Processor and Memory Faults. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:3-4, pp:285-306 [Journal]
  78. Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
    Reliable Minimum Finding Comparator Networks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:42, n:3-4, pp:235-249 [Journal]
  79. Stefan Dobrev, Andrzej Pelc
    Leader Election in Rings with Nonunique Labels. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:59, n:4, pp:333-347 [Journal]
  80. Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
    Complexity of Searching for a Black Hole. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:2-3, pp:229-242 [Journal]
  81. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
    Linear-Time Prime Decomposition Of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1019-1032 [Journal]
  82. Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:503-512 [Journal]
  83. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Hop-Congestion Trade-Offs for High-Speed Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:117-0 [Journal]
  84. Michel Paquette, Andrzej Pelc
    Fast Broadcasting with Byzantine Faults. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1423-1440 [Journal]
  85. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
    Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:181-186 [Journal]
  86. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc
    Optimal Coteries and Voting Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:1-6 [Journal]
  87. Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
    Searching with a Forbidden Lie Pattern in Responses. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:3, pp:127-132 [Journal]
  88. Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
    Finding a Target Subnetwork in Sparse Networks with Random Faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:6, pp:297-303 [Journal]
  89. Gianluca De Marco, Andrzej Pelc
    Faster broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:2, pp:53-56 [Journal]
  90. Andrzej Pelc
    Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:3, pp:169-174 [Journal]
  91. Andrzej Pelc, David Peleg
    Broadcasting with locally bounded Byzantine faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:109-115 [Journal]
  92. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
    Token Transfer in a Faulty Network. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:5, pp:383-400 [Journal]
  93. Krzysztof Diks, Andrzej Pelc
    Fast Diagnosis of Multiprocessor Systems with Random Faults. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:5, pp:391-401 [Journal]
  94. Piotr Berman, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:199-211 [Journal]
  95. Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
    Tree exploration with little memory. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:1, pp:38-63 [Journal]
  96. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Fault-Tolerant Broadcasting in Radio Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:47-67 [Journal]
  97. Petrisor Panaite, Andrzej Pelc
    Exploring Unknown Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:281-295 [Journal]
  98. Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc
    Ulam's searching game with lies. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:62-76 [Journal]
  99. Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici
    Solution of Ulam's problem on binary search with two lies. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:384-388 [Journal]
  100. Andrzej Pelc
    Solution of Ulam's problem on searching with a lie. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:1, pp:129-140 [Journal]
  101. Andrzej Pelc
    Prefix search with a lie. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:48, n:2, pp:165-173 [Journal]
  102. Andrzej Pelc
    Detecting errors in searching games. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:1, pp:43-54 [Journal]
  103. Anders Dessmark, Andrzej Pelc
    Broadcasting in geometric radio networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:187-201 [Journal]
  104. Krzysztof Diks, Andrzej Lingas, Andrzej Pelc
    An Optimal Algorithm for Broadcasting Multiple Messages in Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:59, n:3, pp:465-474 [Journal]
  105. Leszek Gasieniec, Andrzej Pelc
    Broadcasting with a Bounded Fraction of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:42, n:1, pp:11-20 [Journal]
  106. Petrisor Panaite, Andrzej Pelc
    Optimal Broadcasting in Faulty Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:5, pp:566-584 [Journal]
  107. Michel Paquette, Andrzej Pelc
    Optimal decision strategies in Byzantine environments. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:3, pp:419-427 [Journal]
  108. Andrzej Pelc
    Idempotent Ideals on Abelian Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:3, pp:813-817 [Journal]
  109. Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Mogiel V. Martin
    Enhancing Hyperlink Structure for Improving Web Performance. [Citation Graph (0, 0)][DBLP]
    J. Web Eng., 2003, v:1, n:2, pp:93-127 [Journal]
  110. Anders Dessmark, Andrzej Pelc
    Deterministic radio broadcasting at low cost. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:2, pp:88-97 [Journal]
  111. Krzysztof Diks, Andrzej Pelc
    Broadcasting with universal lists. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:3, pp:183-196 [Journal]
  112. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient communication in unknown networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:39-49 [Journal]
  113. Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
    Optimal adaptive fault diagnosis for simple multiprocessor systems. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:3, pp:206-214 [Journal]
  114. Petrisor Panaite, Andrzej Pelc
    Impact of topographic information on graph exploration efficiency. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:96-103 [Journal]
  115. Andrzej Pelc
    Fault-tolerant broadcasting and gossiping in communication networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:3, pp:143-156 [Journal]
  116. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective tree exploration. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:3, pp:166-177 [Journal]
  117. Krzysztof Diks, Andrzej Pelc
    Fault-Tolerant Linear Broadcasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:2, pp:188-201 [Journal]
  118. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:332-345 [Journal]
  119. Leszek Gasieniec, Andrzej Pelc
    Adaptive Broadcasting with Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1996, v:22, n:6, pp:903-912 [Journal]
  120. Anders Dessmark, Andrzej Lingas, Andrzej Pelc
    Trade-Offs Between Load and Degree in Virtual Path Layouts. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2003, v:13, n:3, pp:485-496 [Journal]
  121. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
    Broadcasting in Unlabeled Tori. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:177-188 [Journal]
  122. Krzysztof Diks, Adam Malinowski, Andrzej Pelc
    Reliable Token Despersal with Random Faults. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:417-427 [Journal]
  123. Andrzej Pelc
    Broadcasting time in Sparse Networks with Faulty Transmissions. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:355-361 [Journal]
  124. Andrzej Pelc
    Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:489-497 [Journal]
  125. Andrzej Pelc
    Voting Mechanisms in Asynchronous Byzantine Environments. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:1, pp:93-100 [Journal]
  126. Dariusz R. Kowalski, Andrzej Pelc
    Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:870-891 [Journal]
  127. Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia
    Motion Planning, Two-Directional Point Representations, and Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:151-163 [Journal]
  128. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sorting on a Mesh-Connected Computer with Delaying Links. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:119-132 [Journal]
  129. Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
    Time and Cost Trade-Offs in Gossiping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:400-413 [Journal]
  130. Krzysztof Diks, Andrzej Pelc
    Almost Safe Gossiping in Bounded Degree Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:3, pp:338-344 [Journal]
  131. Leszek Gasieniec, Andrzej Pelc, David Peleg
    The Wakeup Problem in Synchronous Broadcast Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:207-222 [Journal]
  132. Dariusz R. Kowalski, Andrzej Pelc
    Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:2, pp:332-346 [Journal]
  133. Douglas M. Blough, Andrzej Pelc
    Complexity of Fault Diagnosis in Comparison Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:3, pp:318-324 [Journal]
  134. Douglas M. Blough, Andrzej Pelc
    Diagnosis and Repair in Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:2, pp:205-217 [Journal]
  135. Douglas M. Blough, Andrzej Pelc
    A Clustered Failure Model for the Memory Array Reconfiguration Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:5, pp:518-528 [Journal]
  136. Krzysztof Diks, Andrzej Pelc
    Globally Optimal Diagnosis in Systems with Random Faults. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:2, pp:200-204 [Journal]
  137. Evangelos Kranakis, Andrzej Pelc
    Better Adaptive Diagnosis of Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:10, pp:1013-1020 [Journal]
  138. Andrzej Pelc
    Undirected Graph Models for System-Level Fault Diagnosis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:11, pp:1271-1276 [Journal]
  139. Andrzej Pelc
    Optimal Fault Diagnosis in Comparison Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:6, pp:779-786 [Journal]
  140. Andrzej Pelc
    Optimal Diagnosis of Heterogeneous Systems with Random Faults. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:3, pp:298-304 [Journal]
  141. Anders Dessmark, Andrzej Pelc
    Optimal graph exploration without good maps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:343-362 [Journal]
  142. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    The impact of information on broadcasting time in linear radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:449-471 [Journal]
  143. Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc
    Anonymous Wireless Rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:95-109 [Journal]
  144. Krzysztof Diks, Andrzej Pelc
    Reliable Computations on Faulty EREW PRAM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:107-122 [Journal]
  145. Krzysztof Diks, Andrzej Pelc
    System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:163-173 [Journal]
  146. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
    Graph exploration by a finite automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:331-344 [Journal]
  147. Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
    Deterministic M2M multicast in radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:196-206 [Journal]
  148. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power consumption in packet radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:289-305 [Journal]
  149. Dariusz R. Kowalski, Andrzej Pelc
    Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:355-371 [Journal]
  150. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    Approximate Maxima Finding of Continuous Functions under Restricted Budget. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:151-162 [Journal]
  151. Gianluca De Marco, Andrzej Pelc
    Deterministic broadcasting time with partial knowledge of the network. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2009-2020 [Journal]
  152. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
    Asynchronous deterministic rendezvous in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:3, pp:315-326 [Journal]
  153. Andrzej Pelc
    Searching games with errors - fifty years of coping with liars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:71-109 [Journal]
  154. Andrzej Pelc
    Lie Patterns in Search Procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:61-69 [Journal]
  155. Andrzej Pelc
    Searching with Known Error Probability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:2, pp:185-202 [Journal]
  156. Andrzej Pelc
    Weakly Adaptive Comparison Searching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:1, pp:105-111 [Journal]
  157. Andrzej Pelc, David Peleg
    Feasibility and complexity of broadcasting with random transmission failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:279-292 [Journal]
  158. Douglas M. Blough, Andrzej Pelc
    Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:5, pp:532-539 [Journal]
  159. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
    Distributed Computing with Advice: Information Sensitivity of Graph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:231-242 [Conf]
  160. Evangelos Kranakis, Michel Paquette, Andrzej Pelc
    Communication in Networks with Random Dependent Faults. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:418-429 [Conf]
  161. Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
    Broadcasting in udg radio networks with unknown topology. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:195-204 [Conf]
  162. Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
    Tree exploration with logarithmic memory. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:585-594 [Conf]
  163. Andrzej Pelc
    Activating anonymous ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:5-6, pp:361-371 [Journal]
  164. Jurek Czyzowicz, Andrzej Pelc, Ivan Rival
    Drawing orders with few slopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:233-250 [Journal]
  165. Euripides Markou, Andrzej Pelc
    Efficient Exploration of Faulty Trees. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:3, pp:225-247 [Journal]
  166. Andrzej Pelc, David Peleg, Michel Raynal
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:137-138 [Journal]

  167. Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. [Citation Graph (, )][DBLP]


  168. Algorithmic aspects of radio communication. [Citation Graph (, )][DBLP]


  169. Optimality and Competitiveness of Exploring Polygons by Mobile Robots. [Citation Graph (, )][DBLP]


  170. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. [Citation Graph (, )][DBLP]


  171. Fast Adaptive Diagnosis with a Minimum Number of Tests. [Citation Graph (, )][DBLP]


  172. Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. [Citation Graph (, )][DBLP]


  173. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. [Citation Graph (, )][DBLP]


  174. Impact of Information on the Complexity of Asynchronous Radio Broadcasting. [Citation Graph (, )][DBLP]


  175. How to meet when you forget: log-space rendezvous in arbitrary graphs. [Citation Graph (, )][DBLP]


  176. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. [Citation Graph (, )][DBLP]


  177. Fast Radio Broadcasting with Advice. [Citation Graph (, )][DBLP]


  178. Asynchronous Deterministic Rendezvous in Bounded Terrains. [Citation Graph (, )][DBLP]


  179. Distributed Tree Comparison with Nodes of Limited Memory. [Citation Graph (, )][DBLP]


  180. How to Meet Asynchronously (Almost) Everywhere. [Citation Graph (, )][DBLP]


  181. Trade-offs between the size of advice and broadcasting time in trees. [Citation Graph (, )][DBLP]


  182. Delays induce an exponential memory gap for rendezvous in trees. [Citation Graph (, )][DBLP]


  183. Optimal Exploration of Terrains with Obstacles. [Citation Graph (, )][DBLP]


  184. Deterministic Rendezvous in Trees with Little Memory. [Citation Graph (, )][DBLP]


  185. Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. [Citation Graph (, )][DBLP]


  186. Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]


  187. How Much Memory Is Needed for Leader Election. [Citation Graph (, )][DBLP]


  188. Drawing Maps with Advice. [Citation Graph (, )][DBLP]


  189. Assigning Bookmarks in Perfect Binary Trees. [Citation Graph (, )][DBLP]


  190. Optimal Exploration of Terrains with Obstacles [Citation Graph (, )][DBLP]


  191. Asynchronous deterministic rendezvous in bounded terrains [Citation Graph (, )][DBLP]


  192. How to meet asynchronously (almost) everywhere [Citation Graph (, )][DBLP]


  193. Randomized Algorithms for Determining the Majority on Graphs. [Citation Graph (, )][DBLP]


  194. Searching for a Black Hole in Synchronous Tree Networks. [Citation Graph (, )][DBLP]


  195. Impact of memory size on graph exploration capability. [Citation Graph (, )][DBLP]


  196. Special issue on DISC 07. [Citation Graph (, )][DBLP]


  197. Distributed computing with advice: information sensitivity of graph coloring. [Citation Graph (, )][DBLP]


  198. Broadcasting in UDG radio networks with unknown topology. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002