The following pages link to Andrzej Pelc (Q235631):
Displaying 50 items.
- Invariant measures on abelian metric groups (Q3785086) (← links)
- (Q3872443) (← links)
- On families of σ-complete ideals (Q3905269) (← links)
- Solution of a problem of Ulam on countable sequences of sets (Q3949242) (← links)
- Reliable communication in networks with Byzantine link failures (Q4014611) (← links)
- (Q4018725) (← links)
- Almost Safe Gossiping in Bounded Degree Networks (Q4018844) (← links)
- Ideals on the real line and Ulam's problem (Q4168918) (← links)
- Time and Cost Trade-Offs in Gossiping (Q4210214) (← links)
- Reliable Fault Diagnosis with Few Tests (Q4228208) (← links)
- (Q4235434) (← links)
- (Q4250197) (← links)
- Sorting on a Mesh-Connected Computer with Delaying Links (Q4287945) (← links)
- Fast diagnosis of multiprocessor systems with random faults (Q4288202) (← links)
- Optimal communication in networks with randomly distributed byzantine faults (Q4291477) (← links)
- Almost Safe Group Testing with Few Tests (Q4314157) (← links)
- Reliable distributed diagnosis for multiprocessor systems with random faults (Q4319527) (← links)
- (Q4328855) (← links)
- Hop-Congestion Trade-Offs for High-Speed Networks (Q4358514) (← links)
- (Q4411373) (← links)
- (Q4418601) (← links)
- (Q4418641) (← links)
- (Q4432962) (← links)
- (Q4472476) (← links)
- (Q4472512) (← links)
- (Q4507860) (← links)
- Impact of topographic information on graph exploration efficiency (Q4519131) (← links)
- Deterministic radio broadcasting at low cost (Q4537615) (← links)
- Optimal diagnosis of heterogeneous systems with random faults (Q4571454) (← links)
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4575621) (← links)
- Deterministic Graph Exploration with Advice (Q4629978) (← links)
- Sparse networks supporting efficient reliable broadcasting (Q4630277) (← links)
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge (Q4651497) (← links)
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks (Q4652640) (← links)
- Deterministic gathering with crash faults (Q4686670) (← links)
- Invariant Ideals and Borel Sets (Q4723737) (← links)
- Semiregular Invariant Measures on Abelian Groups (Q4741175) (← links)
- (Q4764627) (← links)
- (Q4808650) (← links)
- Tree exploration with little memory (Q4818671) (← links)
- (Q4825703) (← links)
- (Q4828987) (← links)
- Token transfer in a faulty network (Q4858837) (← links)
- Efficient Gossiping by Packets in Networks with Random Faults (Q4875431) (← links)
- Broadcasting with universal lists (Q4887749) (← links)
- (Q4895545) (← links)
- Collecting Information by Power-Aware Mobile Agents (Q4909401) (← links)
- Exploring Unknown Undirected Graphs (Q4935310) (← links)
- (Q4938771) (← links)
- (Q4952711) (← links)
