default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Pelc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c141]Subhash Bhagat
, Andrzej Pelc:
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. ICDCN 2025: 115-124- 2024
- [j201]Debasish Pattanayak, Andrzej Pelc:
Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. 356: 149-160 (2024) - [j200]Debasish Pattanayak, Andrzej Pelc:
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Inf. Process. Lett. 185: 106455 (2024) - [j199]Subhash Bhagat, Andrzej Pelc:
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984: 114313 (2024) - [c140]Younan Gao, Andrzej Pelc:
Gathering Teams of Deterministic Finite Automata on a Line. OPODIS 2024: 11:1-11:17 - [i58]Subhash Bhagat, Andrzej Pelc:
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR abs/2401.13044 (2024) - [i57]Younan Gao, Andrzej Pelc:
Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid. CoRR abs/2407.14969 (2024) - [i56]Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc:
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. CoRR abs/2410.07382 (2024) - 2023
- [j198]Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. Algorithmica 85(10): 3110-3143 (2023) - [j197]Barun Gorain, Avery Miller, Andrzej Pelc:
Four shades of deterministic leader election in anonymous networks. Distributed Comput. 36(4): 419-449 (2023) - [j196]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic size discovery and topology recognition in radio networks with short labels. Inf. Comput. 292: 105010 (2023) - [j195]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! SIAM J. Comput. 52(2): 358-411 (2023) - [j194]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19(3): 22:1-22:32 (2023) - [c139]Avery Miller, Andrzej Pelc:
Fast Deterministic Rendezvous in Labeled Lines. DISC 2023: 29:1-29:22 - [i55]Subhash Bhagat, Andrzej Pelc:
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles. CoRR abs/2302.00052 (2023) - [i54]Andrzej Pelc:
Deterministic Rendezvous Algorithms. CoRR abs/2303.10391 (2023) - [i53]Andrzej Pelc:
Explorable families of graphs. CoRR abs/2303.10394 (2023) - [i52]Debasish Pattanayak, Andrzej Pelc:
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs. CoRR abs/2310.01136 (2023) - [i51]Debasish Pattanayak, Andrzej Pelc:
Computing Functions by Teams of Deterministic Finite Automata. CoRR abs/2310.01151 (2023) - [i50]Avery Miller, Andrzej Pelc:
Fast Deterministic Rendezvous in Labeled Lines. CoRR abs/2311.12976 (2023) - 2022
- [j193]Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc:
Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1): 51-62 (2022) - [j192]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. ACM Trans. Algorithms 18(3): 25:1-25:33 (2022) - [c138]Subhash Bhagat, Andrzej Pelc:
How to Meet at a Node of Any Connected Graph. DISC 2022: 11:1-11:16 - [i49]Subhash Bhagat, Andrzej Pelc:
Deterministic Rendezvous in Infinite Trees. CoRR abs/2203.05160 (2022) - 2021
- [j191]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. Algorithmica 83(1): 144-176 (2021) - [j190]Andrzej Pelc, Ram Narayan Yadav:
Advice complexity of treasure hunt in geometric terrains. Inf. Comput. 281: 104705 (2021) - [j189]Barun Gorain, Andrzej Pelc:
Short labeling schemes for topology recognition in wireless tree networks. Theor. Comput. Sci. 861: 23-44 (2021) - [j188]Barun Gorain, Andrzej Pelc:
Finding the size and the diameter of a radio network using short labels. Theor. Comput. Sci. 864: 20-33 (2021) - [j187]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. ACM Trans. Parallel Comput. 8(3): 14:1-14:17 (2021) - [c137]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP 2021: 36:1-36:20 - [c136]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - [c135]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. SPAA 2021: 265-274 - [c134]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. SPAA 2021: 432-434 - [c133]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. DISC 2021: 22:1-22:20 - [i48]Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. CoRR abs/2105.10595 (2021) - 2020
- [j186]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11): 3250-3281 (2020) - [j185]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33(2): 169-187 (2020) - [j184]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. Theor. Comput. Sci. 806: 567-576 (2020) - [c132]Andrzej Pelc, Ram Narayan Yadav:
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. ICDCN 2020: 4:1-4:10 - [c131]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! PODC 2020: 253-262 - [c130]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. SPAA 2020: 117-127 - [c129]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. SPAA 2020: 407-417 - [i47]Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. CoRR abs/2002.02641 (2020) - [i46]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR abs/2005.00875 (2020) - [i45]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. CoRR abs/2005.00880 (2020) - [i44]Barun Gorain, Avery Miller, Andrzej Pelc:
Four Shades of Deterministic Leader Election in Anonymous Networks. CoRR abs/2009.06149 (2020) - [i43]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR abs/2010.14916 (2020)
2010 – 2019
- 2019
- [j183]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. Algorithmica 81(1): 238-288 (2019) - [j182]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ACM Trans. Algorithms 15(1): 8:1-8:17 (2019) - [c128]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. ESA 2019: 35:1-35:14 - [c127]Andrzej Pelc, Ram Narayan Yadav:
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. SPAA 2019: 85-92 - [c126]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. SPAA 2019: 171-178 - [p1]Andrzej Pelc:
Deterministic Rendezvous Algorithms. Distributed Computing by Mobile Entities 2019: 423-454 - [i42]Andrzej Pelc, Ram Narayan Yadav:
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane. CoRR abs/1902.06090 (2019) - [i41]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. CoRR abs/1904.10850 (2019) - [i40]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! CoRR abs/1908.11402 (2019) - 2018
- [j181]Samir Elouasbi, Andrzej Pelc:
Deterministic Meeting of Sniffing Agents in the Plane. Fundam. Informaticae 160(3): 281-301 (2018) - [j180]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133: 39-43 (2018) - [j179]Andrzej Pelc:
Reaching a target in the plane with no information. Inf. Process. Lett. 140: 13-17 (2018) - [j178]Andrzej Pelc:
Use of information, memory and randomization in asynchronous gathering. J. Comput. Syst. Sci. 94: 193-205 (2018) - [j177]Andrzej Pelc:
Deterministic gathering with crash faults. Networks 72(2): 182-199 (2018) - [c125]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. ICDCN 2018: 10:1-10:10 - [c124]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC 2018: 48:1-48:13 - [c123]Andrzej Pelc:
Explorable Families of Graphs. SIROCCO 2018: 165-177 - [i39]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. CoRR abs/1801.00237 (2018) - [i38]Andrzej Pelc, Ram Narayan Yadav:
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous. CoRR abs/1810.03120 (2018) - [i37]Andrzej Pelc, Ram Narayan Yadav:
Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane. CoRR abs/1811.06420 (2018) - [i36]Andrzej Pelc, Ram Narayan Yadav:
Information Complexity of Treasure Hunt in Geometric Terrains. CoRR abs/1811.06823 (2018) - 2017
- [j176]Avery Miller, Andrzej Pelc:
Deterministic distributed construction of T-dominating sets in time T. Discret. Appl. Math. 222: 172-178 (2017) - [j175]Andrzej Pelc, Alexander A. Schwarzmann:
Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015). Inf. Comput. 255: 335 (2017) - [j174]Samir Elouasbi, Andrzej Pelc:
Deterministic Rendezvous with Detection Using Beeps. Int. J. Found. Comput. Sci. 28(1): 77- (2017) - [j173]Pierre Fraigniaud, Andrzej Pelc:
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109: 117-128 (2017) - [j172]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms 13(3): 31:1-31:41 (2017) - [c122]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. ICALP 2017: 132:1-132:14 - [c121]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO 2017: 37-52 - [c120]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. SPAA 2017: 207-215 - [i35]Barun Gorain, Andrzej Pelc:
Leader Election in Trees with Customized Advice. CoRR abs/1702.03534 (2017) - [i34]Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. CoRR abs/1704.01927 (2017) - [i33]Barun Gorain, Andrzej Pelc:
Finding the Size of a Radio Network with Short Labels. CoRR abs/1704.08713 (2017) - [i32]Andrzej Pelc:
Deterministic Gathering with Crash Faults. CoRR abs/1704.08880 (2017) - [i31]Avery Miller, Andrzej Pelc:
Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$. CoRR abs/1705.01229 (2017) - [i30]Andrzej Pelc:
Use of Information, Memory and Randomization in Asynchronous Gathering. CoRR abs/1709.05869 (2017) - [i29]Samir Elouasbi, Andrzej Pelc:
Deterministic rendezvous with detection using beeps. CoRR abs/1709.06214 (2017) - [i28]Samir Elouasbi, Andrzej Pelc:
Deterministic meeting of sniffing agents in the plane. CoRR abs/1709.06217 (2017) - [i27]Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. CoRR abs/1710.03178 (2017) - [i26]Andrzej Pelc:
Reaching a Target in the Plane with no Information. CoRR abs/1710.07145 (2017) - [i25]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR abs/1710.08291 (2017) - 2016
- [j171]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74(1): 117-155 (2016) - [j170]Yoann Dieudonné, Andrzej Pelc:
Anonymous Meeting in Networks. Algorithmica 74(2): 908-946 (2016) - [j169]Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Comput. 29(1): 51-64 (2016) - [j168]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3): 187-205 (2016) - [j167]Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Topology recognition with advice. Inf. Comput. 247: 254-265 (2016) - [j166]David Caissy, Andrzej Pelc:
Exploration of Faulty Hamiltonian Graphs. Int. J. Found. Comput. Sci. 27(7): 809-828 (2016) - [j165]Dariusz Dereniowski, Andrzej Pelc:
Topology recognition and leader election in colored networks. Theor. Comput. Sci. 621: 92-102 (2016) - [c119]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. ALGOSENSORS 2016: 16-28 - [c118]Samir Elouasbi, Andrzej Pelc:
Deterministic Meeting of Sniffing Agents in the Plane. SIROCCO 2016: 212-227 - [c117]Kokouvi Hounkanli, Andrzej Pelc:
Asynchronous Broadcasting with Bivalent Beeps. SIROCCO 2016: 291-306 - [c116]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. SODA 2016: 600-609 - [c115]Avery Miller, Andrzej Pelc:
Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? SPAA 2016: 377-386 - [r2]Andrzej Pelc:
Broadcasting in Geometric Radio Networks. Encyclopedia of Algorithms 2016: 241-244 - [i24]Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi:
Topology recognition with advice. CoRR abs/1601.06040 (2016) - [i23]Dariusz Dereniowski, Andrzej Pelc:
Topology Recognition and Leader Election in Colored Networks. CoRR abs/1601.07790 (2016) - [i22]David Caissy, Andrzej Pelc:
Exploration of Faulty Hamiltonian Graphs. CoRR abs/1602.05136 (2016) - [i21]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234 (2016) - [i20]Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. CoRR abs/1604.05023 (2016) - [i19]Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. CoRR abs/1607.01657 (2016) - [i18]Kokouvi Hounkanli, Andrzej Pelc:
Asynchronous Broadcasting with Bivalent Beeps. CoRR abs/1611.08938 (2016) - 2015
- [j164]Yoann Dieudonné, Andrzej Pelc:
Deterministic polynomial approach in the plane. Distributed Comput. 28(2): 111-129 (2015) - [j163]Emanuele G. Fusco, Andrzej Pelc:
Knowledge, level of symmetry, and time of leader election. Distributed Comput. 28(4): 221-232 (2015) - [j162]Emanuele G. Fusco, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. Fundam. Informaticae 137(3): 305-322 (2015) - [j161]Avery Miller, Andrzej Pelc:
Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distributed Comput. 83: 159-167 (2015) - [j160]Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to Meet Asynchronously at Polynomial Cost. SIAM J. Comput. 44(3): 844-867 (2015) - [j159]Avery Miller, Andrzej Pelc:
Fast rendezvous with advice. Theor. Comput. Sci. 608: 190-198 (2015) - [c114]Samir Elouasbi, Andrzej Pelc:
Deterministic Rendezvous with Detection Using Beeps. ALGOSENSORS 2015: 85-97 - [e3]Andrzej Pelc, Alexander A. Schwarzmann:
Stabilization, Safety, and Security of Distributed Systems - 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings. Lecture Notes in Computer Science 9212, Springer 2015, ISBN 978-3-319-21740-6 [contents] - [i17]Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. CoRR abs/1505.04308 (2015) - [i16]Avery Miller, Andrzej Pelc:
Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt. CoRR abs/1506.07952 (2015) - [i15]Emanuele G. Fusco, Andrzej Pelc:
Knowledge, Level of Symmetry, and Time of Leader Election. CoRR abs/1508.01300 (2015) - [i14]Avery Miller, Andrzej Pelc:
Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks. CoRR abs/1508.02471 (2015) - [i13]Kokouvi Hounkanli, Andrzej Pelc:
Deterministic Broadcasting and Gossiping with Beeps. CoRR abs/1508.06460 (2015) - [i12]Kokouvi Hounkanli, Avery Miller, Andrzej Pelc:
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. CoRR abs/1508.06583 (2015) - 2014
- [j158]Dariusz Dereniowski, Andrzej Pelc:
Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Comput. 27(1): 21-38 (2014) - [j157]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time versus space trade-offs for rendezvous in trees. Distributed Comput. 27(2): 95-109 (2014) - [j156]Andrzej Pelc, Anas Tiane:
Efficient Grid Exploration with a stationary Token. Int. J. Found. Comput. Sci. 25(3): 247-262 (2014) - [j155]Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering Despite Mischief. ACM Trans. Algorithms 11(1): 1:1-1:28 (2014) - [j154]Yoann Dieudonné, Andrzej Pelc:
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ACM Trans. Algorithms 11(2): 10:1-10:29 (2014) - [j153]Yoann Dieudonné, Andrzej Pelc:
Price of asynchrony in mobile agents computing. Theor. Comput. Sci. 524: 59-67 (2014) - [c113]Avery Miller, Andrzej Pelc:
Fast Rendezvous with Advice. ALGOSENSORS 2014: 75-87 - [c112]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. ICALP (2) 2014: 411-422 - [c111]Avery Miller, Andrzej Pelc:
Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt. OPODIS 2014: 263-276 - [c110]Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. PODC 2014: 282-290 - [i11]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. CoRR abs/1402.2760 (2014) - [i10]Avery Miller, Andrzej Pelc:
Fast Rendezvous with Advice. CoRR abs/1407.1428 (2014) - [i9]Avery Miller, Andrzej Pelc:
Election vs. Selection: Two Ways of Finding the Largest Node in a Graph. CoRR abs/1411.1319 (2014) - 2013
- [j152]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65(3): 562-583 (2013) - [j151]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225: 16-28 (2013) - [j150]Dariusz R. Kowalski, Andrzej Pelc:
Leader election in ad hoc radio networks: A keen ear helps. J. Comput. Syst. Sci. 79(7): 1164-1180 (2013) - [j149]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. 52(2): 179-199 (2013) - [j148]Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. ACM Trans. Algorithms 9(2): 17:1-17:24 (2013) - [j147]Samuel Guilbault, Andrzej Pelc:
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. 509: 86-96 (2013) - [c109]Yoann Dieudonné, Andrzej Pelc:
Deterministic Polynomial Approach in the Plane. ICALP (2) 2013: 533-544 - [c108]Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Learning a Ring Cheaply and Fast. ICALP (2) 2013: 557-568 - [c107]Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to meet asynchronously at polynomial cost. PODC 2013: 92-99 - [c106]Yoann Dieudonné, Andrzej Pelc:
Anonymous Meeting in Networks. SODA 2013: 737-747 - [c105]Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc:
Local Decision and Verification with Bounded-Size Outputs. SSS 2013: 133-147 - [c104]Samuel Guilbault, Andrzej Pelc:
Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line. SSS 2013: 296-310 - [c103]Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi:
Use Knowledge to Learn Faster: Topology Recognition with Advice. DISC 2013: 31-45 - [i8]Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to Meet Asynchronously at Polynomial Cost. CoRR abs/1301.7119 (2013) - 2012
- [j146]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Comput. 25(2): 165-178 (2012) - [j145]Yoann Dieudonné, Andrzej Pelc:
Deterministic network exploration by a single agent with Byzantine tokens. Inf. Process. Lett. 112(12): 467-470 (2012) - [j144]Dariusz Dereniowski, Andrzej Pelc:
Drawing maps with advice. J. Parallel Distributed Comput. 72(2): 132-143 (2012) - [j143]Andrzej Pelc:
Deterministic rendezvous in networks: A comprehensive survey. Networks 59(3): 331-347 (2012) - [j142]Emanuele G. Fusco, Andrzej Pelc:
Distributed tree comparison with nodes of limited memory. Networks 60(4): 235-244 (2012) - [j141]Marcos K. Aguilera, Dahlia Malkhi, Keith Marzullo, Alessandro Panconesi, Andrzej Pelc, Roger Wattenhofer:
Announcing the 2012 Edsger W. Dijkstra prize in distributed computing. SIGARCH Comput. Archit. News 40(4): 1-2 (2012) - [j140]Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel:
How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4): 37:1-37:14 (2012) - [j139]Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc:
Choosing the best among peers. Theor. Comput. Sci. 440-441: 52-59 (2012) - [c102]Emanuele G. Fusco, Andrzej Pelc:
Knowledge, Level of Symmetry, and Time of Leader Election. ESA 2012: 479-490 - [c101]Yoann Dieudonné, Andrzej Pelc:
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ICALP (2) 2012: 500-512 - [c100]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. LATIN 2012: 362-374 - [c99]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc:
Electing a Leader in Multi-hop Radio Networks. OPODIS 2012: 106-120 - [c98]Jurek Czyzowicz, Andrzej Pelc, Mélanie Roy:
Tree Exploration by a Swarm of Mobile Agents. OPODIS 2012: 121-134 - [c97]Samir Elouasbi, Andrzej Pelc:
Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization. SIROCCO 2012: 291-302 - [c96]Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering despite mischief. SODA 2012: 527-540 - [c95]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time vs. space trade-offs for rendezvous in trees. SPAA 2012: 1-10 - [c94]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60 - [i7]Dariusz Dereniowski, Andrzej Pelc:
Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks. CoRR abs/1205.6249 (2012) - 2011
- [j138]Emanuele G. Fusco, Andrzej Pelc:
Trade-offs Between the Size of Advice and Broadcasting Time in Trees. Algorithmica 60(4): 719-734 (2011) - [j137]Emanuele G. Fusco, Andrzej Pelc:
How much memory is needed for leader election. Distributed Comput. 24(2): 65-78 (2011) - [j136]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209(1): 74-88 (2011) - [j135]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
How many oblivious robots can explore a line. Inf. Process. Lett. 111(20): 1027-1031 (2011) - [j134]Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2): 17:1-17:21 (2011) - [j133]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50): 6926-6937 (2011) - [j132]Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE Trans. Parallel Distributed Syst. 22(7): 1092-1104 (2011) - [c93]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki:
Efficient Distributed Communication in Ad-Hoc Radio Networks. ICALP (2) 2011: 613-624 - [c92]Emanuele G. Fusco, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. OPODIS 2011: 191-206 - [c91]Samuel Guilbault, Andrzej Pelc:
Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. OPODIS 2011: 421-434 - [c90]Samuel Guilbault, Andrzej Pelc:
Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs. SIROCCO 2011: 162-173 - [c89]Andrzej Pelc:
DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. DISC 2011: 1-15 - [i6]Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. CoRR abs/1102.0467 (2011) - [i5]Yoann Dieudonné, Andrzej Pelc:
Deterministic gathering of anonymous agents in arbitrary networks. CoRR abs/1111.0321 (2011) - 2010
- [j131]Evangelos Kranakis, Michel Paquette, Andrzej Pelc:
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. Ad Hoc Sens. Wirel. Networks 9(1-2): 23-52 (2010) - [j130]Emanuele G. Fusco, Andrzej Pelc:
Broadcasting in UDG radio networks with missing and inaccurate information. Distributed Comput. 22(3): 167-183 (2010) - [j129]Andrzej Pelc:
Fault-tolerant strategies in the Iterated Prisoner's Dilemma. Inf. Process. Lett. 110(10): 389-395 (2010) - [j128]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010) - [j127]Evangelos Kranakis, Michel Paquette, Andrzej Pelc:
The diameter and connectivity of networks with random dependent faults. Networks 56(2): 103-115 (2010) - [j126]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc:
Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15): 1544-1557 (2010) - [j125]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14-15): 1583-1598 (2010) - [c88]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS 2010: 294-305 - [c87]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC 2010: 450-459 - [c86]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85 - [c85]Emanuele G. Fusco, Andrzej Pelc:
Distributed Tree Comparison with Nodes of Limited Memory. SIROCCO 2010: 142-156 - [c84]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
How to Meet Asynchronously (Almost) Everywhere. SODA 2010: 22-30 - [c83]Pierre Fraigniaud, Andrzej Pelc:
Delays induce an exponential memory gap for rendezvous in trees. SPAA 2010: 224-232 - [c82]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12 - [c81]Emanuele G. Fusco, Andrzej Pelc:
How Much Memory Is Needed for Leader Election. DISC 2010: 251-266 - [c80]Dariusz Dereniowski, Andrzej Pelc:
Drawing Maps with Advice. DISC 2010: 328-342 - [i4]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. CoRR abs/1001.0639 (2010) - [i3]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. CoRR abs/1001.0889 (2010) - [i2]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
How to meet asynchronously (almost) everywhere. CoRR abs/1001.0890 (2010) - [i1]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. CoRR abs/1011.2719 (2010)
2000 – 2009
- 2009
- [j124]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in UDG radio networks with unknown topology. Distributed Comput. 21(5): 331-351 (2009) - [j123]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21(6): 395-403 (2009) - [j122]Paola Flocchini, Andrzej Pelc, Nicola Santoro:
Fault-Tolerant Sequential Scan. Theory Comput. Syst. 45(1): 1-26 (2009) - [j121]Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc:
Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6-7): 481-499 (2009) - [c79]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA 2009: 263-274 - [c78]Dariusz R. Kowalski, Andrzej Pelc:
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. ICALP (2) 2009: 521-533 - [c77]Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Consensus and Mutual Exclusion in a Multiple Access Channel. DISC 2009: 512-526 - 2008
- [j120]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Impact of memory size on graph exploration capability. Discret. Appl. Math. 156(12): 2310-2319 (2008) - [j119]Andrzej Pelc:
Special issue on DISC 07. Distributed Comput. 21(2): 85 (2008) - [j118]David Ilcinkas, Andrzej Pelc:
Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Informaticae 82(1-2): 113-125 (2008) - [j117]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008) - [j116]Emanuele G. Fusco, Andrzej Pelc:
Acknowledged broadcasting in ad hoc radio networks. Inf. Process. Lett. 109(2): 136-141 (2008) - [j115]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1): 27-39 (2008) - [c76]Evangelos Kranakis, Michel Paquette, Andrzej Pelc:
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults. ADHOC-NOW 2008: 108-121 - [c75]Andrzej Pelc:
Algorithmic aspects of radio communication. DIALM-POMC 2008: 1-2 - [c74]Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc:
Impact of Information on the Complexity of Asynchronous Radio Broadcasting. OPODIS 2008: 311-330 - [c73]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47 - [c72]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc:
Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305 - [c71]Emanuele G. Fusco, Andrzej Pelc:
Trade-offs between the size of advice and broadcasting time in trees. SPAA 2008: 77-84 - [c70]Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Trees with Little Memory. DISC 2008: 242-256 - [c69]Emanuele G. Fusco, Andrzej Pelc:
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. DISC 2008: 257-273 - [r1]Andrzej Pelc:
Broadcasting in Geometric Radio Networks. Encyclopedia of Algorithms 2008 - 2007
- [j114]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Miguel Vargas Martin:
Assigning Bookmarks in Perfect Binary Trees. Ars Comb. 82 (2007) - [j113]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Searching for a Black Hole in Synchronous Tree Networks. Comb. Probab. Comput. 16(4): 595-619 (2007) - [j112]Dariusz R. Kowalski, Andrzej Pelc:
Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Comput. 19(3): 185-195 (2007) - [j111]Andrzej Pelc:
Activating anonymous ad hoc radio networks. Distributed Comput. 19(5-6): 361-371 (2007) - [j110]Anders Dessmark, Andrzej Pelc:
Broadcasting in geometric radio networks. J. Discrete Algorithms 5(1): 187-201 (2007) - [j109]Euripides Markou, Andrzej Pelc:
Efficient Exploration of Faulty Trees. Theory Comput. Syst. 40(3): 225-247 (2007) - [j108]Andrzej Pelc, David Peleg:
Feasibility and complexity of broadcasting with random transmission failures. Theor. Comput. Sci. 370(1-3): 279-292 (2007) - [j107]Andrzej Pelc, David Peleg, Michel Raynal:
Preface. Theor. Comput. Sci. 384(2-3): 137-138 (2007) - [c68]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - [c67]Samuel Guilbault, Andrzej Pelc:
Fast Adaptive Diagnosis with a Minimum Number of Tests. ISAAC 2007: 415-426 - [c66]Evangelos Kranakis, Michel Paquette, Andrzej Pelc:
Communication in Networks with Random Dependent Faults. MFCS 2007: 418-429 - [c65]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118 - [c64]Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in udg radio networks with unknown topology. PODC 2007: 195-204 - [c63]Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory. SODA 2007: 585-594 - [e2]Andrzej Pelc:
Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Lecture Notes in Computer Science 4731, Springer 2007, ISBN 978-3-540-75141-0 [contents] - 2006
- [j106]Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) - [j105]Gianluca De Marco, Andrzej Pelc:
Randomized Algorithms for Determining the Majority on Graphs. Comb. Probab. Comput. 15(6): 823-834 (2006) - [j104]Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi:
Labeling trees with a condition at distance two. Discret. Math. 306(14): 1534-1539 (2006) - [j103]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Complexity of Searching for a Black Hole. Fundam. Informaticae 71(2-3): 229-242 (2006) - [j102]Michel Paquette, Andrzej Pelc:
Fast Broadcasting with Byzantine Faults. Int. J. Found. Comput. Sci. 17(6): 1423-1440 (2006) - [j101]Krzysztof Diks, Stefan Dobrev, Andrzej Pelc:
Exploring Planar Graphs Using Unoriented Maps. J. Interconnect. Networks 7(3): 353-373 (2006) - [j100]Michel Paquette, Andrzej Pelc:
Optimal decision strategies in Byzantine environments. J. Parallel Distributed Comput. 66(3): 419-427 (2006) - [j99]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective tree exploration. Networks 48(3): 166-177 (2006) - [j98]Andrzej Pelc:
Voting Mechanisms in Asynchronous Byzantine Environments. Parallel Process. Lett. 16(1): 93-100 (2006) - [j97]Gianluca 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) - [j96]Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin:
Deterministic M2M multicast in radio networks. Theor. Comput. Sci. 362(1-3): 196-206 (2006) - [c62]Ralf Klasing, Euripides Markou, Andrzej Pelc:
Gathering Asynchronous Oblivious Mobile Robots in a Ring. ISAAC 2006: 744-753 - [c61]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree Exploration with an Oracle. MFCS 2006: 24-37 - [c60]Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc:
Gathering Few Fat Mobile Robots in the Plane. OPODIS 2006: 350-364 - [c59]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187 - 2005
- [b1]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0, pp. 1-361 - [j95]Dariusz R. Kowalski, Andrzej Pelc:
Broadcasting in undirected ad hoc radio networks. Distributed Comput. 18(1): 43-57 (2005) - [j94]Andrzej Pelc, David Peleg:
Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. 93(3): 109-115 (2005) - [j93]Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. J. Autom. Lang. Comb. 10(1): 37-49 (2005) - [j92]Dariusz R. Kowalski, Andrzej Pelc:
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333(3): 355-371 (2005) - [j91]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph exploration by a finite automaton. Theor. Comput. Sci. 345(2-3): 331-344 (2005) - [c58]Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro:
Asynchronous Deterministic Rendezvous in Graphs. MFCS 2005: 271-282 - [c57]Andrzej Pelc, David Peleg:
Feasibility and complexity of broadcasting with random transmission failures. PODC 2005: 334-341 - [c56]Andrzej Pelc:
Waking Up Anonymous Ad Hoc Radio Networks. DISC 2005: 260-272 - [e1]Andrzej Pelc, Michel Raynal:
Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Lecture Notes in Computer Science 3499, Springer 2005, ISBN 3-540-26052-8 [contents] - 2004
- [j90]Anders Dessmark, Andrzej Pelc:
Distributed Colouring and Communication in Rings with Local Knowledge. Comb. Probab. Comput. 13(2): 123-136 (2004) - [j89]Stefan Dobrev, Andrzej Pelc:
Leader Election in Rings with Nonunique Labels. Fundam. Informaticae 59(4): 333-347 (2004) - [j88]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. J. Algorithms 51(1): 38-63 (2004) - [j87]Dariusz R. Kowalski, Andrzej Pelc:
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. SIAM J. Comput. 33(4): 870-891 (2004) - [j86]Dariusz R. Kowalski, Andrzej Pelc:
Faster Deterministic Broadcasting in Ad Hoc Radio Networks. SIAM J. Discret. Math. 18(2): 332-346 (2004) - [j85]Anders Dessmark, Andrzej Pelc:
Optimal graph exploration without good maps. Theor. Comput. Sci. 326(1-3): 343-362 (2004) - [c55]Dariusz R. Kowalski, Andrzej Pelc:
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. APPROX-RANDOM 2004: 171-182 - [c54]Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin:
Deterministic M2M Multicast in Radio Networks: (Extended Abstract). ICALP 2004: 670-682 - [c53]Dariusz R. Kowalski, Andrzej Pelc:
Polynomial Deterministic Rendezvous in Arbitrary Graphs. ISAAC 2004: 644-656 - [c52]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective Tree Exploration. LATIN 2004: 141-151 - [c51]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph Exploration by a Finite Automaton. MFCS 2004: 451-462 - [c50]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Searching for a Black Hole in Tree Networks. OPODIS 2004: 67-80 - [c49]Michel Paquette, Andrzej Pelc:
Optimal Decision Strategies in Byzantine Environments. SIROCCO 2004: 245-254 - 2003
- [j84]Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc:
Labeling trees with a condition at distance two. Electron. Notes Discret. Math. 15: 55-58 (2003) - [j83]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. Fundam. Informaticae 55(3-4): 285-306 (2003) - [j82]Jurek 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) - [j81]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) - [j80]Anders Dessmark, Andrzej Lingas, Andrzej Pelc:
Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. 13(3): 485-496 (2003) - [j79]Gianluca De Marco, Andrzej Pelc:
Deterministic broadcasting time with partial knowledge of the network. Theor. Comput. Sci. 290(3): 2009-2020 (2003) - [c48]Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Graphs. ESA 2003: 184-195 - [c47]Gianluca De Marco, Andrzej Pelc:
Randomized Algorithms for Determining the Majority on Graphs. MFCS 2003: 368-377 - [c46]Stefan Dobrev, Andrzej Pelc:
Leader Election in Rings with Nonunique Labels. PDPTA 2003: 1400-1406 - [c45]Dariusz R. Kowalski, Andrzej Pelc:
Broadcasting in undirected ad hoc radio networks. PODC 2003: 73-82 - [c44]Dariusz R. Kowalski, Andrzej Pelc:
Time of Radio Broadcasting. SIROCCO 2003: 195-210 - [c43]Dariusz R. Kowalski, Andrzej Pelc:
Faster Deterministic Broadcasting in Ad Hoc Radio Networks. STACS 2003: 109-120 - 2002
- [j78]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks. Distributed Comput. 15(1): 27-38 (2002) - [j77]Anders Dessmark, Andrzej Pelc:
Deterministic radio broadcasting at low cost. Networks 39(2): 88-97 (2002) - [j76]Andrzej Pelc:
Searching games with errors - fifty years of coping with liars. Theor. Comput. Sci. 270(1-2): 71-109 (2002) - [j75]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) - [c42]Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. COCOON 2002: 300-309 - [c41]Anders Dessmark, Andrzej Pelc:
Optimal Graph Exploration without Good Maps. ESA 2002: 374-386 - [c40]Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Broadcasting Time in Radio Networks of Unknown Topology. FOCS 2002: 63-72 - [c39]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. SODA 2002: 588-597 - [c38]Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Prime Decompositions of Regular Prefix Codes. CIAA 2002: 85-94 - 2001
- [j74]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader. Distributed Comput. 14(3): 163-183 (2001) - [j73]Gianluca De Marco, Andrzej Pelc:
Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79(2): 53-56 (2001) - [j72]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Fault-Tolerant Broadcasting in Radio Networks. J. Algorithms 39(1): 47-67 (2001) - [j71]Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
Efficient communication in unknown networks. Networks 38(1): 39-49 (2001) - [j70]Leszek Gasieniec, Andrzej Pelc, David Peleg:
The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discret. Math. 14(2): 207-222 (2001) - [c37]Anders Dessmark, Andrzej Pelc:
Distributed coloring and communication in rings with local knowledge. IPDPS 2001: 78 - [c36]Gianluca De Marco, Andrzej Pelc:
Fast distributed graph coloring with O(Delta) colors. SODA 2001: 630-635 - [c35]Anders Dessmark, Andrzej Pelc:
Tradeoffs between knowledge and time of communication in geometric radio networks. SPAA 2001: 59-66 - [c34]Anders Dessmark, Andrzej Pelc:
Deterministic Radio Broadcasting at Low Cost. STACS 2001: 158-169 - 2000
- [j69]Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. Algorithmica 28(1): 37-50 (2000) - [j68]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. Fundam. Informaticae 42(3-4): 235-249 (2000) - [j67]Petrisor Panaite, Andrzej Pelc:
Optimal Broadcasting in Faulty Trees. J. Parallel Distributed Comput. 60(5): 566-584 (2000) - [j66]Petrisor Panaite, Andrzej Pelc:
Impact of topographic information on graph exploration efficiency. Networks 36(2): 96-103 (2000) - [j65]Evangelos Kranakis, Andrzej Pelc:
Better Adaptive Diagnosis of Hypercubes. IEEE Trans. Computers 49(10): 1013-1020 (2000) - [j64]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Power consumption in packet radio networks. Theor. Comput. Sci. 243(1-2): 289-305 (2000) - [c33]Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec:
Strategies for Hotlink Assignments. ISAAC 2000: 23-34 - [c32]Gianluca De Marco, Andrzej Pelc:
Deterministic Broadcasting Time with Partial Knowledge of the Network. ISAAC 2000: 374-385 - [c31]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111 - [c30]Leszek Gasieniec, Andrzej Pelc, David Peleg:
The wakeup problem in synchronous broadcast systems (extended abstract). PODC 2000: 113-121 - [c29]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870 - [c28]Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro:
Efficient Communication in Unknown Networks. WG 2000: 172-183
1990 – 1999
- 1999
- [j63]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) - [j62]Petrisor Panaite, Andrzej Pelc:
Exploring Unknown Undirected Graphs. J. Algorithms 33(2): 281-295 (1999) - [j61]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. J. Parallel Distributed Comput. 59(3): 465-474 (1999) - [j60]Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis:
Optimal adaptive fault diagnosis for simple multiprocessor systems. Networks 34(3): 206-214 (1999) - [c27]Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
The Impact of Knowledge on Broadcasting Time in Radio Networks. ESA 1999: 41-52 - 1998
- [j59]Andrzej Pelc, Eli Upfal:
Reliable Fault Diagnosis with Few Tests. Comb. Probab. Comput. 7(3): 323-333 (1998) - [j58]Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski:
Minimum-time multidrop broadcast. Discret. Appl. Math. 83(1-3): 61-77 (1998) - [j57]Leszek Gasieniec, Andrzej Pelc:
Broadcasting with linearly bounded transmission faults. Discret. Appl. Math. 83(1-3): 121-133 (1998) - [j56]Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc:
Perfect Broadcasting in Unlabeled Networks. Discret. Appl. Math. 87(1-3): 33-47 (1998) - [j55]Krzysztof 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) - [j54]Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc:
Broadcasting in Unlabeled Tori. Parallel Process. Lett. 8(2): 177-188 (1998) - [j53]Artur Czumaj, Leszek Gasieniec, Andrzej Pelc:
Time and Cost Trade-Offs in Gossiping. SIAM J. Discret. Math. 11(3): 400-413 (1998) - [j52]Andrzej Pelc:
Optimal Diagnosis of Heterogeneous Systems with Random Faults. IEEE Trans. Computers 47(3): 298-304 (1998) - [j51]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
Approximate Maxima Finding of Continuous Functions under Restricted Budget. Theor. Comput. Sci. 203(1): 151-162 (1998) - [j50]Krzysztof Diks, Andrzej Pelc:
System Diagnosis with Smallest Risk of Error. Theor. Comput. Sci. 203(1): 163-173 (1998) - [c26]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). ESA 1998: 283-294 - [c25]Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis:
Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. SIROCCO 1998: 82-97 - [c24]Petrisor Panaite, Andrzej Pelc:
Exploring Unknown Undirected Graphs. SODA 1998: 316-322 - 1997
- [j49]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Transition-Optimal Token Distribution. Fundam. Informaticae 32(3-4): 313-328 (1997) - [j48]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Hop-Congestion Trade-Offs for High-Speed Networks. Int. J. Found. Comput. Sci. 8(2): 117-126 (1997) - [j47]Piotr Berman, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms 22(2): 199-211 (1997) - [j46]Leszek Gasieniec, Andrzej Pelc:
Broadcasting with a Bounded Fraction of Faulty Nodes. J. Parallel Distributed Comput. 42(1): 11-20 (1997) - [j45]Krzysztof Diks, Andrzej Pelc:
Globally Optimal Diagnosis in Systems with Random Faults. IEEE Trans. Computers 46(2): 200-204 (1997) - [c23]Krzysztof Diks, Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). ESA 1997: 118-129 - [c22]Petrisor Panaite, Andrzej Pelc:
Universally Fault-Tolerant Broadcasting in Trees. ICPADS 1997: 724-729 - [c21]Petrisor Panaite, Andrzej Pelc:
Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). ISAAC 1997: 143-152 - [c20]Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO 1997: 69-80 - [c19]Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Power Consumption in Packet Radio Networks (Extended Abstract). STACS 1997: 363-374 - 1996
- [j44]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Comb. Probab. Comput. 5: 337-350 (1996) - [j43]Krzysztof Diks, Andrzej Pelc:
Broadcasting with universal lists. Networks 27(3): 183-196 (1996) - [j42]Andrzej Pelc:
Fault-tolerant broadcasting and gossiping in communication networks. Networks 28(3): 143-156 (1996) - [j41]Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. Nord. J. Comput. 3(2): 188-201 (1996) - [j40]Leszek Gasieniec, Andrzej Pelc:
Adaptive Broadcasting with Faulty Nodes. Parallel Comput. 22(6): 903-912 (1996) - [j39]Krzysztof Diks, Andrzej Pelc:
Efficient Gossiping by Packets in Networks with Random Faults. SIAM J. Discret. Math. 9(1): 7-18 (1996) - [j38]Krzysztof Diks, Andrzej Pelc:
Reliable Computations on Faulty EREW PRAM. Theor. Comput. Sci. 164(1&2): 107-122 (1996) - [c18]Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links. MFCS 1996: 372-381 - [c17]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
The Complexity of Data Mining on the Web (Abstract). PODC 1996: 153 - [c16]Andrzej Pelc:
Efficient fault location with small risk. SIROCCO 1996: 292-300 - [c15]Krzysztof Diks, Andrzej Pelc:
System Diagnosis with Smallest Risk of Error. WG 1996: 141-150 - [c14]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). WG 1996: 268-278 - 1995
- [j37]Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Token Transfer in a Faulty Network. RAIRO Theor. Informatics Appl. 29(5): 383-400 (1995) - [j36]Andrzej Pelc:
Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults. Parallel Process. Lett. 5: 489-497 (1995) - [j35]Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc:
Anonymous Wireless Rings. Theor. Comput. Sci. 145(1&2): 95-109 (1995) - [c13]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Fast Deterministic Simulation of Computations on Faulty Parallel Machines. ESA 1995: 89-101 - [c12]Krzysztof Diks, Andrzej Pelc:
Broadcasting with universal lists. HICSS (2) 1995: 564-573 - [c11]Andrzej Pelc:
Fast Fault-tolerant Broadcasting and Gossiping. SIROCCO 1995: 159-172 - [c10]Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Hop-congestion trade-offs for high-speed networks. SPDP 1995: 662-667 - 1994
- [j34]Andrzej Pelc:
Almost Safe Group Testing with Few Tests. Comb. Probab. Comput. 3: 411-419 (1994) - [j33]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Fast gossiping with short unreliable messages. Discret. Appl. Math. 53(1-3): 15-24 (1994) - [j32]Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc:
Searching with Local Constraints on Error Patterns. Eur. J. Comb. 15(3): 217-222 (1994) - [j31]Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc:
Optimal Coteries and Voting Schemes. Inf. Process. Lett. 51(1): 1-6 (1994) - [j30]Piotr Berman, Andrzej Pelc:
Reliable distributed diagnosis for multiprocessor systems with random faults. Networks 24(8): 417-427 (1994) - [j29]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. 1(3): 332-345 (1994) - [j28]Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Reliable Token Despersal with Random Faults. Parallel Process. Lett. 4: 417-427 (1994) - [j27]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. 7(1): 119-132 (1994) - [j26]Douglas M. Blough, Andrzej Pelc:
Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance. IEEE Trans. Parallel Distributed Syst. 5(5): 532-539 (1994) - [c9]Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. Canada-France Conference on Parallel and Distributed Computing 1994: 207-217 - [c8]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) 1994: 187-193 - [c7]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. MFCS 1994: 306-315 - [c6]Krzysztof Diks, Evangelos Kranakis, A. Malinowsky, Andrzej Pelc:
The Buffer Potential of a Network. SIROCCO 1994: 149-150 - 1993
- [j25]Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc:
Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. 48(6): 297-303 (1993) - [j24]Krzysztof Diks, Andrzej Pelc:
Fast Diagnosis of Multiprocessor Systems with Random Faults. RAIRO Theor. Informatics Appl. 27(5): 391-401 (1993) - [j23]Douglas M. Blough, Andrzej Pelc:
Optimal communication in networks with randomly distributed byzantine faults. Networks 23(8): 691-701 (1993) - [j22]Douglas M. Blough, Andrzej Pelc:
Diagnosis and Repair in Multiprocessor Systems. IEEE Trans. Computers 42(2): 205-217 (1993) - [j21]Douglas M. Blough, Andrzej Pelc:
A Clustered Failure Model for the Memory Array Reconfiguration Problem. IEEE Trans. Computers 42(5): 518-528 (1993) - [c5]Andrzej Pelc:
Efficient Distributed Diagnosis in the Presence of Random Faults. FTCS 1993: 462-469 - [c4]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP 1993: 388-397 - 1992
- [j20]Andrzej Pelc:
Reliable communication in networks with Byzantine link failures. Networks 22(5): 441-459 (1992) - [j19]Andrzej Pelc:
Broadcasting time in Sparse Networks with Faulty Transmissions. Parallel Process. Lett. 2: 355-361 (1992) - [j18]Krzysztof Diks, Andrzej Pelc:
Almost Safe Gossiping in Bounded Degree Networks. SIAM J. Discret. Math. 5(3): 338-344 (1992) - [j17]Douglas M. Blough, Andrzej Pelc:
Complexity of Fault Diagnosis in Comparison Models. IEEE Trans. Computers 41(3): 318-324 (1992) - [j16]Andrzej Pelc:
Optimal Fault Diagnosis in Comparison Models. IEEE Trans. Computers 41(6): 779-786 (1992) - 1991
- [j15]Andrzej Pelc, Ivan Rival:
Orders with Level Diagrams. Eur. J. Comb. 12(1): 61-68 (1991) - [j14]Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc:
Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37(3): 127-132 (1991) - [j13]Andrzej Pelc:
Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls. Inf. Process. Lett. 40(3): 169-174 (1991) - [j12]Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia:
Motion Planning, Two-Directional Point Representations, and Ordered Sets. SIAM J. Discret. Math. 4(2): 151-163 (1991) - [j11]Andrzej Pelc:
Undirected Graph Models for System-Level Fault Diagnosis. IEEE Trans. Computers 40(11): 1271-1276 (1991) - [c3]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Optimal Broadcasting in Faulty Hypercubes. FTCS 1991: 266-273 - 1990
- [j10]Jurek Czyzowicz, Andrzej Pelc, Ivan Rival:
Drawing orders with few slopes. Discret. Math. 82(3): 233-250 (1990) - [c2]Douglas M. Blough, Andrzej Pelc:
Reliable diagnosis and repair in constant-degree multiprocessor systems. FTCS 1990: 316-323 - [c1]Piotr Berman, Andrzej Pelc:
Distributed probabilistic fault diagnosis for multiprocessor systems. FTCS 1990: 340-346
1980 – 1989
- 1989
- [j9]Andrzej Pelc:
Detecting errors in searching games. J. Comb. Theory A 51(1): 43-54 (1989) - [j8]Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc:
Ulam's searching game with lies. J. Comb. Theory A 52(1): 62-76 (1989) - [j7]Andrzej Pelc:
Searching with Known Error Probability. Theor. Comput. Sci. 63(2): 185-202 (1989) - [j6]Andrzej Pelc:
Weakly Adaptive Comparison Searching. Theor. Comput. Sci. 66(1): 105-111 (1989) - 1988
- [j5]Andrzej Pelc:
Prefix search with a lie. J. Comb. Theory A 48(2): 165-173 (1988) - [j4]Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici:
Solution of Ulam's problem on binary search with two lies. J. Comb. Theory A 49(2): 384-388 (1988) - 1987
- [j3]Andrzej Pelc:
Solution of Ulam's problem on searching with a lie. J. Comb. Theory A 44(1): 129-140 (1987) - 1986
- [j2]Andrzej Pelc:
Lie Patterns in Search Procedures. Theor. Comput. Sci. 47(3): 61-69 (1986) - 1984
- [j1]Andrzej Pelc:
Idempotent Ideals on Abelian Groups. J. Symb. Log. 49(3): 813-817 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
