dblp.uni-trier.dewww.uni-trier.de

Andrzej Pelc

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

1Fawzi Al-Thukair [11]
2Piotr Berman [56]
3Douglas M. Blough [19] [22] [23] [30]
4Prosenjit Bose [94]
5Tiziana Calamoneri [118] [156] [188]
6Bogdan S. Chlebus [15] [24] [26] [28] [32] [36] [43] [49] [59] [90] [107] [117]
7Artur Czumaj [67]
8Jurek Czyzowicz [4] [8] [10] [13] [31] [94] [111] [112] [115] [116] [132] [140] [155] [160] [169] [170] [193]
9Piotr Denejko [35] [87]
10Anders Dessmark [100] [101] [103] [106] [110] [114] [124] [125] [130] [158] [166]
11Krzysztof Diks [15] [16] [21] [24] [26] [27] [28] [29] [32] [34] [35] [36] [37] [38] [40] [42] [44] [46] [48] [49] [51] [56] [58] [59] [61] [64] [65] [68] [69] [71] [79] [82] [87] [88] [104] [108] [128] [152]
12Stefan Dobrev [69] [122] [129] [152]
13Yuval Emek [172]
14Arthur M. Farley [72]
15Paola Flocchini [173] [186]
16Wojciech Fraczak [111] [112] [116] [140]
17Pierre Fraigniaud [20] [92] [99] [108] [124] [128] [133] [134] [138] [151] [158] [159] [161] [176] [180] [183] [190]
18Emanuele G. Fusco [179] [185] [188] [189]
19Luisa Gargano [89] [96] [144] [149]
20Leszek Gasieniec [43] [45] [54] [55] [67] [73] [81] [90] [91] [94] [95] [107] [117] [134] [136] [148] [151] [160] [171] [172] [193]
21Cyril Gavoille [176]
22Alan Gibbons [90] [107]
23Samuel Guilbault [175]
24Juraj Hromkovic [147]
25David Ilcinkas [133] [138] [159] [161] [173] [176] [180] [181] [183] [186] [187]
26Erez Kantor [172]
27Lefteris M. Kirousis [60] [83]
28Ralf Klasing [147] [162] [178]
29Dariusz R. Kowalski [109] [119] [120] [121] [126] [127] [132] [134] [135] [137] [139] [142] [151] [155] [158] [168] [169] [187]
30Evangelos Kranakis [29] [34] [38] [50] [53] [54] [57] [60] [66] [68] [69] [71] [76] [77] [78] [81] [82] [83] [86] [94] [97] [104] [108] [115] [128] [136] [144] [148] [149] [170] [174] [192]
31Danny Krizanc [29] [50] [53] [54] [57] [60] [66] [77] [81] [82] [83] [94] [97] [104] [115] [144] [149] [170]
32K. B. Lakshmanan (Kadathur B. Lakshmanan) [13] [31]
33Andrzej Lingas [61] [79] [114]
34Adam Malinowski [27] [38] [40]
35A. Malinowsky [34]
36Bernard Mans [29]
37Gianluca De Marco [93] [98] [102] [113] [123] [144] [149] [157]
38Euripides Markou [132] [155] [162] [163] [169] [178]
39Miguel Vargas Martin [94] [170]
40Mogiel V. Martin [115]
41Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [20]
42Daniele Mundici [4] [8]
43Petrisor Panaite [62] [63] [75] [80] [84] [85]
44Michel Paquette [131] [153] [154] [174] [192]
45Guy Peer [133] [138]
46David Peleg [50] [53] [66] [91] [92] [95] [99] [133] [138] [141] [143] [164] [165] [172]
47Stéphane Pérennes (Stephane Perennes) [89] [92] [96] [99]
48Rossella Petreschi [118] [156]
49Marek Piotrów [35] [87]
50Andrzej Proskurowski [72]
51Tomasz Radzik [171]
52Michel Raynal [146] [164]
53Ivan Rival [10] [11]
54Peter Ruzicka [69] [147]
55Wojciech Rytter [90] [107] [112] [116]
56Nicola Santoro [173] [186]
57Anthony Spatharis [76] [78]
58Chang Su [172]
59Walter Unger [147]
60Eli Upfal [74]
61Jorge Urrutia [11]
62Ugo Vaccaro [89] [96] [144] [149]
63Qin Xin [136] [148]
64Xiaohui Zhang [171]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)