Evolution of Random Search Trees

Evolution of Random Search Trees
Author: Hosam M. Mahmoud
Publisher: Wiley-Interscience
Total Pages: 340
Release: 1992
Genre: Mathematics
ISBN:

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.

Algorithms and Computation

Algorithms and Computation
Author: Rudolf Fleischer
Publisher: Springer Science & Business Media
Total Pages: 951
Release: 2004-12-03
Genre: Computers
ISBN: 3540241310

This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004. The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.

Algorithms and Computation

Algorithms and Computation
Author: Kyung-Yong Chwa
Publisher: Springer
Total Pages: 522
Release: 2003-06-29
Genre: Computers
ISBN: 3540493816

This book constitutes the refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998. The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms.

STACS 2003

STACS 2003
Author: Helmut Alt
Publisher: Springer Science & Business Media
Total Pages: 716
Release: 2003-02-21
Genre: Computers
ISBN: 3540006230

This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.

Polya Urn Models

Polya Urn Models
Author: Hosam Mahmoud
Publisher: CRC Press
Total Pages: 308
Release: 2008-06-30
Genre: Mathematics
ISBN: 142005984X

Incorporating a collection of recent results, Polya Urn Models deals with discrete probability through the modern and evolving urn theory and its numerous applications. It looks at how some classical problems of discrete probability have roots in urn models. The book covers the Polya-Eggenberger, Bernard Friedman's, the Bagchi-Pal, and the Ehrenfest urns. It also explains the processes of poissonization and depoissonization and presents applications to random trees, evolution, competitive exclusion, epidemiology, clinical trials, and random circuits. The text includes end-of-chapter exercises that range from easy to challenging, along with solutions in the back of the book.

Stein's Method and Applications

Stein's Method and Applications
Author: A. D. Barbour
Publisher: World Scientific
Total Pages: 320
Release: 2005
Genre: Mathematics
ISBN: 9812562818

Stein's startling technique for deriving probability approximations first appeared about 30 years ago. Since then, much has been done to refine and develop the method, but it is still a highly active field of research, with many outstanding problems, both theoretical and in applications. This volume, the proceedings of a workshop held in honour of Charles Stein in Singapore, August 1983, contains contributions from many of the mathematicians at the forefront of this effort. It provides a cross-section of the work currently being undertaken, with many pointers to future directions. The papers in the collection include applications to the study of random binary search trees, Brownian motion on manifolds, Monte-Carlo integration, Edgeworth expansions, regenerative phenomena, the geometry of random point sets, and random matrices.

Probability and Mathematical Genetics

Probability and Mathematical Genetics
Author: N. H. Bingham
Publisher: Cambridge University Press
Total Pages: 547
Release: 2010-07-15
Genre: Mathematics
ISBN: 1139487922

No leading university department of mathematics or statistics, or library, can afford to be without this unique text. Leading authorities give a unique insight into a wide range of currently topical problems, from the mathematics of road networks to the genomics of cancer.

Mathematics and Computer Science

Mathematics and Computer Science
Author: Daniele Gardy
Publisher: Birkhäuser
Total Pages: 337
Release: 2012-12-06
Genre: Mathematics
ISBN: 3034884052

This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on September 18-20, 2000. The colloquium was a meeting place for researchers in mathematics and computer science and thus an important opportunity to exchange ideas and points of view, and to present new approaches and new results in the common areas such as algorithms analysis, trees, combinatorics, optimization, performance evaluation and probabilities. The book is intended for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and related modern mathematical methods. The range of applications is very wide and reaches beyond computer science.

Applications of Fibonacci Numbers

Applications of Fibonacci Numbers
Author: G.E. Bergum
Publisher: Springer Science & Business Media
Total Pages: 633
Release: 2012-12-06
Genre: Mathematics
ISBN: 9401120587

This book contains 58 papers from among the 68 papers presented at the Fifth International Conference on Fibonacci Numbers and Their Applications which was held at the University of St. Andrews, St. Andrews, Fife, Scotland from July 20 to July 24, 1992. These papers have been selected after a careful review by well known referees in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers and recurrence relations are their unifying bond. It is anticipated that this book, like its four predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. June 5, 1993 The Editors Gerald E. Bergum South Dakota State University Brookings, South Dakota, U.S.A. Alwyn F. Horadam University of New England Armidale, N.S.W., Australia Andreas N. Philippou Government House Z50 Nicosia, Cyprus xxv THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Campbell, Colin M., Co-Chair Horadam, A.F. (Australia), Co-Chair Phillips, George M., Co-Chair Philippou, A.N. (Cyprus), Co-Chair Foster, Dorothy M.E. Ando, S. (Japan) McCabe, John H. Bergum, G.E. (U.S.A.) Filipponi, P. (Italy) O'Connor, John J.