Randomized path coloring on binary trees.
type: Item
instance of: scholarly article
title: Randomized path coloring on binary trees.
zbMATH Open document ID: 1061.68119
DOI: 10.1016/S0304-3975(01)00310-3
author: V. Auletta
author: I. Caragiannis
author: C. Kaklamanis
author: P. Persiano
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1857069
MaRDI profile type: Publication
cites work: Weighted sums of certain dependent random variables
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Q4373682
cites work: Q5538132
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Efficient wavelength routing on directed fiber trees
cites work: Constrained bipartite edge coloring with applications to wavelength routing
cites work: Tail bounds for occupancy and the satisfiability threshold conjecture
cites work: Q4400852
cites work: Q5501821
cites work: Q4252739
cites work: Q4856179
cites work: Efficient routing in all-optical networks
cites work: Q3140437
description: scientific article; zbMATH DE number 1857069