Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

SIAMDM
1998

favoriteEmaildiscussreport

65views more SIAMDM 1998»

A Greedy Algorithm Estimating the Height of Random Trees

13 years 10 months ago

A Greedy Algorithm Estimating the Height of Random Trees

Download www.ima.umn.edu

Tomasz Luczak

Real-time Traffic

SIAMDM 1998 |

claim paper

Related Content

» Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise

» Randomized path coloring on binary trees

» Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning T...

» Smoothed Analysis of Binary Search Trees

» Note on the Structure of Kruskals Algorithm

» Stopping Rules for Randomized Greedy Triangulation Schemes

» Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem

» A GraphSpectral Method for Surface Height Recovery

» Parameter estimation for spatial random trees using the EM algorithm

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	SIAMDM
Authors	Tomasz Luczak

Comments (0)