Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Probabilistic Methods for Algorithmic Discrete Mathematics

Probabilistic Methods for Algorithmic Discrete Mathematics
Catalogue Information
Field name Details
Dewey Class 511.1
Title Probabilistic Methods for Algorithmic Discrete Mathematics ([EBook] /) / edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed.
Added Personal Name Habib, Michel editor.
McDiarmid, Colin editor.
Ramirez-Alfonsin, Jorge editor.
Reed, Bruce editor.
Other name(s) SpringerLink (Online service)
Publication Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 1998.
Physical Details XVII, 325 p. : online resource.
Series Algorithms and Combinatorics 0937-5511 ; ; 16
ISBN 9783662127889
Summary Note The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques.:
Contents note The Probabilistic Method -- Probabilistic Analysis of Algorithms -- An Overview of Randomized Algorithms -- Mathematical Foundations of the Markov Chain Monte Carlo Method -- Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems -- Concentration -- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms -- Author Index.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-3-662-12788-9
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 47198 Beginning of record . Catalogue Information 47198 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating47198
Quick Search