scientific article; zbMATH DE number 790246
From MaRDI portal
Publication:4846463
zbMATH Open0865.68050MaRDI QIDQ4846463FDOQ4846463
Authors: Christian Lavault
Publication date: 27 August 1995
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10)
Cited In (12)
- Randomized local elections.
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Processing and Applied Mathematics
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Title not available (Why is that?)
- Locally guided randomized elections in trees: The totally fair case
- A uniform self-stabilizing minimum diameter spanning tree algorithm
- DENSITY AND DISTRIBUTION OF PRIMES
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
- Appraising two decades of distributed computing theory research
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846463)