Skip to main content
  • Conference proceedings
  • © 2000

Mathematics and Computer Science

Algorithms, Trees, Combinatorics and Probabilities

Birkhäuser

Part of the book series: Trends in Mathematics (TM)

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (28 papers)

  1. Front Matter

    Pages N2-xi
  2. Trees and Analysis of Algorithms

    1. Front Matter

      Pages 1-1
    2. Rawa Trees

      • Andras Antos, Luc Devroye
      Pages 3-15
    3. The height and width of simple trees

      • P. Chassaing, J. F. Marckert, M. Yor
      Pages 17-30
    4. On the node structure of binary search trees

      • F. M. Dekking, S. De Graaf, L. E. Meester
      Pages 31-40
    5. The Saturation Level in Binary Search Tree

      • Michael Drmota
      Pages 41-51
    6. An Universal Predictor Based on Pattern Matching: Preliminary results 1

      • Philippe Jacquet, Wojciech Szpankowski, Izydor Apostol
      Pages 75-85
  3. Combinatorics and Random Generation

    1. Front Matter

      Pages 87-87
    2. A bijective proof for the arborescent form of the multivariable Lagrange inversion formula

      • Michel Bousquet, Cedric Chauve, Gilbert Labelle, Pierre Leroux
      Pages 89-100
    3. Counting paths on the slit plane

      • Mireille Bousquet-Mélou, Gilles Schaeffer
      Pages 101-112
    4. An Algebra for Proper Generating Trees

      • D. Merlini, R. Sprugnoli, M. C. Verri
      Pages 127-139
    5. A set of well-defined operations on succession rules

      • Elisa Pergola, Renzo Pinzani, Simone Rinaldi
      Pages 141-152
  4. Algorithms and Optimization

    1. Front Matter

      Pages 153-153
    2. Convergence of a Genetic Algorithm with finite population

      • J. Bérard, A. Bienvenüe
      Pages 155-163
    3. Complexity issues for a redistribution problem

      • Moshe Dror, Dominique Fortin, Catherine Roucairol
      Pages 165-176
    4. On the rate of escape of a mutation-selection algorithm

      • Christian Mazza, Didier Piau
      Pages 177-182
    5. Randomized Rendezvous

      • Yves Métivier, Nasser Saheb, Akka Zemmari
      Pages 183-194

Editors and Affiliations

  • Bâtiment Descartes, Université de Versailles-St-Quentin PRISM, Versailles, France

    Danièle Gardy

  • Département de Mathématiques Bâtiment Fermat, Université de Versailles-St-Quentin, Versailles, France

    Abdelkader Mokkadem

Bibliographic Information

  • Book Title: Mathematics and Computer Science

  • Book Subtitle: Algorithms, Trees, Combinatorics and Probabilities

  • Editors: Danièle Gardy, Abdelkader Mokkadem

  • Series Title: Trends in Mathematics

  • DOI: https://doi.org/10.1007/978-3-0348-8405-1

  • Publisher: Birkhäuser Basel

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Basel AG 2000

  • Hardcover ISBN: 978-3-7643-6430-4Published: 01 September 2000

  • Softcover ISBN: 978-3-0348-9553-8Published: 29 October 2012

  • eBook ISBN: 978-3-0348-8405-1Published: 06 December 2012

  • Series ISSN: 2297-0215

  • Series E-ISSN: 2297-024X

  • Edition Number: 1

  • Number of Pages: XI, 341

  • Topics: Probability Theory and Stochastic Processes, Mathematics, general

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access