Skip to main content
SpringerLink
Log in
Birkhäuser
Book cover

Mathematics and Computer Science III

Algorithms, Trees, Combinatorics and Probabilities

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Michael Drmota

    1. Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wien, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Philippe Flajolet

    1. INRIA Rocquencourt, Le Chesnay, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Danièle Gardy

    1. PRISM, Université de Versailles-St-Quentin, Versailles Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Bernhard Gittenberger

    1. Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wien, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Devoted to connections between mathematics and computer science
  • Presents new trends, new ideas and new results in solving current questions in computer science, with related modern and powerful mathematical methods

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

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

Access this book

Log in via an institution
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
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (54 papers)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Combinatorics and Random Structures

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Common Intervals of Permutations

      • Sylvie Corteel, Guy Louchard, Robin Pemantle
      Pages 3-14

    3. Overpartitions and Generating Functions for Generalized Frobenius Partitions

      • Sylvie Corteel, Jeremy Lovejoy, Ae Ja Yee
      Pages 15-24

    4. Enumerative Results on Integer Partitions Using the ECO Method

      • Luca Ferrari, Renzo Pinzani, Simone Rinaldi
      Pages 25-36

    5. 321-Avoiding Permutations and Chebyshev Polynomials

      • Toufik Mansour
      Pages 37-38

    6. Iterated Logarithm Laws and the Cycle Lengths of a Random Permutation

      • Eugenijus Manstavičius
      Pages 39-47

    7. Transcendence of Generating Functions of Walks on the Slit Plane

      • Martin Rubey
      Pages 49-58

    8. Some Curious Extensions of the Classical Beta Integral Evaluation

      • Michael Schlosser
      Pages 59-68

    9. Divisor Functions and Pentagonal Numbers

      • Klaus Simon
      Pages 69-70

  3. Graph Theory

    1. Front Matter

      Pages 71-71
      Download chapter PDF

    2. On Combinatorial Hoeffding Decomposition and Asymptotic Normality of Subgraph Count Statistics

      • Mindaugas Bloznelis
      Pages 73-79

    3. Avalanche Polynomials of Some Families of Graphs

      • Robert Cori, Arnaud Dartois, Dominique Rossin
      Pages 81-94

    4. Perfect Matchings in Random Graphs with Prescribed Minimal Degree

      • Alan Frieze, Boris Pittel
      Pages 95-132

    5. Estimating the Growth Constant of Labelled Planar Graphs

      • Omer Giménez, Marc Noy
      Pages 133-139

    6. The Number of Spanning Trees in P4-Reducible Graphs

      • Stavros D. Nikolopoulos, Charis Papadopoulos
      Pages 141-143

  4. Analysis of Algorithms

    1. Front Matter

      Pages 145-145
      Download chapter PDF

    2. On the Stationary Search Cost for the Move-to-Root Rule with Random Weights

      • Javiera Barrera, Christian Paroissin
      Pages 147-148

    3. Average-Case Analysis for the Probabilistic Bin Packing Problem

      • Monia Bellalouna, Salma Souissi, Bernard Ycart
      Pages 149-159

    4. Distribution of WHT Recurrences

      • Pawel Hitczenko, Jeremy R. Johnson, Hung-Jen Huang
      Pages 161-162
Back to top

Keywords

Editors and Affiliations

  • Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wien, Austria

    Michael Drmota, Bernhard Gittenberger

  • INRIA Rocquencourt, Le Chesnay, France

    Philippe Flajolet

  • PRISM, Université de Versailles-St-Quentin, Versailles Cedex, France

    Danièle Gardy

Bibliographic Information

  • Book Title: Mathematics and Computer Science III

  • Book Subtitle: Algorithms, Trees, Combinatorics and Probabilities

  • Editors: Michael Drmota, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger

  • Series Title: Trends in Mathematics

  • DOI: https://doi.org/10.1007/978-3-0348-7915-6

  • Publisher: Birkhäuser Basel

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Basel AG 2004

  • Hardcover ISBN: 978-3-7643-7128-9Published: 23 July 2004

  • Softcover ISBN: 978-3-0348-9620-7Published: 03 October 2013

  • eBook ISBN: 978-3-0348-7915-6Published: 06 December 2012

  • Series ISSN: 2297-0215

  • Series E-ISSN: 2297-024X

  • Edition Number: 1

  • Number of Pages: XV, 556

  • Number of Illustrations: 26 b/w illustrations

  • Topics: Theory of Computation, Combinatorics, Visualization, Computer Science, general, Probability Theory and Stochastic Processes

Publish with us

Policies and ethics

Back to top

Search

Navigation