Skip to main content
SpringerLink
Log in
Birkhäuser

Mathematics and Computer Science

Algorithms, Trees, Combinatorics and Probabilities

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Danièle Gardy

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Abdelkader Mokkadem

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (28 papers)

  1. Performance Evaluation

    1. Front Matter

      Pages 195-195
      Download chapter PDF

    2. Computing Closed-Form Stochastic Bounds on the Stationary Distribution of Markov Chains

      • Mouad Ben Mamoun, Nihal Pekergin
      Pages 197-208

    3. Effects of Reordering and Lumping in the Analysis of Discrete-Time SANs

      • Tuğrul Dayar
      Pages 209-220

    4. Large deviations for polling systems

      • Franck Delcoigne, Arnaud De La Fortelle
      Pages 221-229

    5. A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network

      • Guy Fayolle, Jean-Marc Lasgouttes
      Pages 231-242

  2. Other Topics

    1. Front Matter

      Pages 243-243
      Download chapter PDF

    2. A new proof of Yaglom’s exponential limit law

      • Jochen Geiger
      Pages 245-249

    3. The branching measure, Hausdorff and packing measures on the Galton-Watson tree

      • Quansheng Liu
      Pages 251-263

    4. Likelihood ratio processes and asymptotic statistics for systems of interacting diffusions with branching and immigration

      • Eva Löcherbach
      Pages 265-274

    5. Probabilistic Analysis of a Schröder Walk Generation Algorithm

      • Guy Louchard, Olivier Roques
      Pages 275-294

    6. Gibbs Families

      • V. Malyshev
      Pages 295-304

    7. Generating functions with high-order poles are nearly polynomial

      • Robin Pemantle
      Pages 305-321

    8. Ultrahigh Moments for a Brownian Excursion

      • Joel H. Spencer
      Pages 323-328

    9. A zero-one law for random sentences in description logics

      • Bernard Ycart, Marie-Christine Rousset
      Pages 329-340

  3. Back Matter

    Pages 341-341
    Download chapter PDF
Back to top

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

Publish with us

Policies and ethics

Back to top

Search

Navigation