Evolution of random search trees

Bibliographic Information

Evolution of random search trees

Hosam M. Mahmoud

(Wiley-Interscience series in discrete mathematics)

Wiley, c1992

Other Title

Random search trees

Available at  / 26 libraries

Search this Book/Journal

Note

"A Wiley-Interscience publication."

Includes bibliographical references and index

Description and Table of Contents

Description

A reference source on the probabilistic analysis of algorithms, this book focuses on one powerful class of algorithm, and explores methods of analyzing the data. It presents a body of information that integrates probability theory and computer science in the distributional theory of algorithms, and shows professional programmers how randomness can be effectively used to design more efficient programs. An introduction to mathematical tools, exercises and an extensive bibliography are included.

Table of Contents

  • Time Series: The Asymptotic Distribution of Auto-Correlation Coefficients
  • On a Test of Serial Correlation for Regression Models with Lagged Dependent Variables
  • Directional Data Analysis: Optimal Robust Estimators for the Concentration Parameter of a Von Mises-Fisher Distribution
  • On Watson's Anova for Directions
  • Compositional and Shape Data Analysis: Spherical Triangles Revisited
  • New Directions in Shape Analysis
  • Technical Problems in Inference: Tests of Fit for Logistic Models
  • A Class of Nearly Exact Saddlepoint Approximations
  • Spatial Statistics: A Comparison of Variogram Estimation with Covariogram Estimation
  • Statistics and Genetics: Stochastic Comparisons Between Means and Medians for Random Variables
  • Case Studies on Issues of Public Policy: Parameter Estimation in the Operational Modelling of HIV/AIDS. @20 Intermediate @21 E2 @12 0471 93110 1 approx 400pp approx $106.30 #49.95 @13 A Wiley UK Title. @15 PR15 @16 Mardia @17 Watson @18 Chichester P&R

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top