Probabilistic methods for algorithmic discrete mathematics (Q1270418)

From MaRDI portal
Revision as of 02:46, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Probabilistic methods for algorithmic discrete mathematics
scientific article

    Statements

    Probabilistic methods for algorithmic discrete mathematics (English)
    0 references
    21 October 1998
    0 references
    The articles of this volume will be reviewed individually. Indexed articles: \textit{Molloy, Michael}, The probabilistic method, 1-35 [Zbl 0918.05092] \textit{Frieze, Alan M.; Reed, Bruce}, Probabilistic analysis of algorithms, 36-92 [Zbl 0980.65153] \textit{Motwani, Rajeev; Raghavan, Prabhakar}, An overview of randomized algorithms, 93-115 [Zbl 0916.68070] \textit{Jerrum, Mark}, Mathematical foundations of the Markov chain Monte Carlo method, 116-165 [Zbl 0920.65001] \textit{Welsh, Dominic}, Percolation and the random cluster model: Combinatorial and algorithmic problems, 166-194 [Zbl 0916.60085] \textit{McDiarmid, Colin}, Concentration, 195-248 [Zbl 0927.60027] \textit{Devroye, Luc}, Branching processes and their applications in the analysis of tree structures and tree algorithms, 249-314 [Zbl 0924.60077]
    0 references
    Probabilistic methods
    0 references
    Algorithmic discrete mathematics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references