Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
Open Access
- 1 March 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 26 (2), 350-368
- https://doi.org/10.1137/s0097539793250767
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Chernoff–Hoeffding Bounds for Applications with Limited IndependenceSIAM Journal on Discrete Mathematics, 1995
- The probabilistic method yields deterministic parallel algorithmsJournal of Computer and System Sciences, 1994
- Removing randomness in parallel computation without a processor penaltyJournal of Computer and System Sciences, 1993
- Scheduling parallel I/O operations in multiple bus systemsJournal of Parallel and Distributed Computing, 1992
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Simulating (log c n )-wise independence in NCJournal of the ACM, 1991
- Efficient parallel algorithms for edge coloring problemsJournal of Algorithms, 1987
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952