While several excellent books have been written on algorithms and their analysis, remarkably few have been dedicated to the probabilistic analysis of algorithms. This graduate text/professional reference fills that gap and brings together material that is scattered over tens of publications. Its unifying theme is the study of some classes of random search trees suitable for use as data structures with a behavior of random growth that is almost as good as balanced trees.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Hardcover. Zustand: Sehr gut. N.Y., Wiley (1991). gr.8°. Some figs. X, 324 p. OCloth. (small scrach on frontcover, otherwise in very good condition).- Wiley-Interscience Series in Discrete Mathematics and Optimization.- Incl. bibliography. Bestandsnummer des Verkäufers 94995
Anzahl: 1 verfügbar