The following pages link to Andrzej Pelc (Q235631):
Displaying 50 items.
- (Q2762502) (← links)
- Optimal adaptive fault diagnosis for simple multiprocessor systems (Q2766104) (← links)
- (Q2766680) (← links)
- Fast distributed graph coloring with \(O(\Delta)\) colors (Q2768357) (← links)
- Reliable broadcasting in hypercubes with random link and node failures (Q2785368) (← links)
- Communication complexity of consensus in anonymous message passing systems (Q2805428) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
- Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
- Decidability Classes for Mobile Agents Computing (Q2894480) (← links)
- Efficient grid exploration with a stationary token (Q2929616) (← links)
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees (Q2933647) (← links)
- (Q2934641) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- Efficient Distributed Communication in Ad-Hoc Radio Networks (Q3012952) (← links)
- (Q3027015) (← links)
- The diameter and connectivity of networks with random dependent faults (Q3057173) (← links)
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures (Q3128191) (← links)
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports (Q3167038) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane* (Q3174747) (← links)
- Why Do We Believe Theorems? (Q3182719) (← links)
- Tree exploration with logarithmic memory (Q3188999) (← links)
- How to meet asynchronously (almost) everywhere (Q3189080) (← links)
- Motion Planning,Two-Directional Point Representation, and Ordered Sets (Q3358272) (← links)
- (Q3370007) (← links)
- Better adaptive diagnosis of hypercubes (Q3417035) (← links)
- Randomized Algorithms for Determining the Majority on Graphs (Q3419763) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- Collective tree exploration (Q3423884) (← links)
- (Q3494327) (← links)
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots (Q3511387) (← links)
- Fast Radio Broadcasting with Advice (Q3511406) (← links)
- Communication in Networks with Random Dependent Faults (Q3525589) (← links)
- Deterministic Rendezvous in Trees with Little Memory (Q3540234) (← links)
- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information (Q3540235) (← links)
- Asynchronous Deterministic Rendezvous in Bounded Terrains (Q3569117) (← links)
- Distributed Tree Comparison with Nodes of Limited Memory (Q3569122) (← links)
- Optimal Exploration of Terrains with Obstacles (Q3569874) (← links)
- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains (Q3586092) (← links)
- How Much Memory Is Needed for Leader Election (Q3588307) (← links)
- Drawing Maps with Advice (Q3588312) (← links)
- Optimality and Competitiveness of Exploring Polygons by Mobile Robots (Q3639251) (← links)
- Consensus and Mutual Exclusion in a Multiple Access Channel (Q3646247) (← links)
- Idempotent ideals on abelian groups (Q3689368) (← links)
- The Nonexistence of Maximal Invariant Measures on Abelian Groups (Q3708234) (← links)
- (Q3718967) (← links)
- Extensions of invariant measures on Euclidean spaces (Q3722775) (← links)
- On a Problem of Banach (Q3733053) (← links)
- Combinatorics on σ-algebras and problem of Banach (Q3733054) (← links)
- On the existence of measures on σ-algebras (Q3737708) (← links)
- (Q3783955) (← links)
