pith. sign in

Andrzej Pelc

Identifiers

  • name variant Andrzej Pelc 0.60 · backfill

Papers (34)

  1. Cost vs. Information Tradeoffs for Treasure Hunt in the Plane cs.DS · 2019 · author #1
  2. Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane cs.DC · 2018 · author #1
  3. Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous cs.DC · 2018 · author #1
  4. Deterministic Computations on a PRAM with Static Processor and Memory Faults cs.DC · 2017 · author #3
  5. Reaching a Target in the Plane with no Information cs.DS · 2017 · author #1
  6. Deterministic meeting of sniffing agents in the plane cs.DC · 2017 · author #2
  7. Deterministic rendezvous with detection using beeps cs.DC · 2017 · author #2
  8. Use of Information, Memory and Randomization in Asynchronous Gathering cs.DC · 2017 · author #1
  9. Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$ cs.DC · 2017 · author #2
  10. Deterministic Gathering with Crash Faults cs.DC · 2017 · author #1
  11. Short Labeling Schemes for Topology Recognition in Wireless Tree Networks cs.DC · 2017 · author #2
  12. Leader Election in Trees with Customized Advice cs.DC · 2017 · author #2
  13. Asynchronous Broadcasting with Bivalent Beeps cs.DC · 2016 · author #2
  14. Deterministic Graph Exploration with Advice cs.DS · 2016 · author #2
  15. Impact of Knowledge on Election Time in Anonymous Networks cs.DS · 2016 · author #2
  16. Exploration of Faulty Hamiltonian Graphs cs.DS · 2016 · author #2
  17. Topology recognition with advice cs.DC · 2016 · author #2
  18. Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC cs.DC · 2015 · author #3
  19. Deterministic Broadcasting and Gossiping with Beeps cs.DC · 2015 · author #2
  20. Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks cs.DC · 2015 · author #2
  21. Knowledge, Level of Symmetry, and Time of Leader Election cs.DC · 2015 · author #2
  22. Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt cs.DC · 2015 · author #2
  23. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees cs.DC · 2015 · author #3
  24. Why Do We Believe Theorems? math.LO · 2014 · author #1
  25. Election vs. Selection: Two Ways of Finding the Largest Node in a Graph cs.DC · 2014 · author #2
  26. Fast Rendezvous with Advice cs.DS · 2014 · author #2
  27. Rendezvous in Networks in Spite of Delay Faults cs.DS · 2014 · author #4
  28. How to Meet Asynchronously at Polynomial Cost cs.DS · 2013 · author #2
  29. Anonymous Meeting in Networks cs.DS · 2011 · author #2
  30. Delays Induce an Exponential Memory Gap for Rendezvous in Trees cs.DC · 2011 · author #2
  31. Decidability Classes for Mobile Agents Computing cs.DC · 2010 · author #2
  32. How to meet asynchronously (almost) everywhere cs.DS · 2010 · author #3
  33. Asynchronous deterministic rendezvous in bounded terrains cs.CG · 2010 · author #5
  34. Optimal Exploration of Terrains with Obstacles cs.DS · 2010 · author #5

Mentions

  • 1508.06583 #3 · backfill · confidence 0.70 Andrzej Pelc
  • 1508.06460 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1508.02471 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1508.01300 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1506.07952 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1505.04308 #3 · backfill · confidence 0.70 Andrzej Pelc
  • 1411.4857 #1 · backfill · confidence 0.70 Andrzej Pelc
  • 1411.1319 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1407.1428 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1402.2760 #4 · backfill · confidence 0.70 Andrzej Pelc
  • 1301.7119 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1111.0321 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1102.0467 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1011.2719 #2 · backfill · confidence 0.70 Andrzej Pelc
  • 1001.0890 #3 · backfill · confidence 0.70 Andrzej Pelc
  • 1001.0889 #5 · backfill · confidence 0.70 Andrzej Pelc
  • 1001.0639 #5 · backfill · confidence 0.70 Andrzej Pelc

Frequent Coauthors