Algorithmics of nonuniformity : tools and paradigms / by Micha Hofri and Hosam Mahmoud.

By: Hofri, Micha [author.]Contributor(s): Mahmoud, Hosam M. (Hosam Mahmoud), 1954- [author.,, author.] | Taylor and FrancisMaterial type: TextTextSeries: Discrete mathematics and its applications: Publisher: Boca Raton, FL : CRC Press, an imprint of Taylor and Francis, 2018Edition: First editionDescription: 1 online resource (590 pages) : 91 illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9781315332307 (e-book: Mobi)Subject(s): Probabilities | MATHEMATICS / Probability & Statistics / Bayesian Analysis | MATHEMATICS / Combinatorics | Combinatorial analysis | Computer algorithms | Data structures (Computer science) | ProbabilitiesAdditional physical formats: Print version: : No titleDDC classification: 511/.6 LOC classification: QA164 | .H6427 2018Online resources: Click here to view.
Contents:
chapter 1 Introduction -- chapter 2 Counting -- chapter 3 Symbolic Calculus -- chapter 4 Languages and Their Generating Functions -- chapter 5 Probability in Algorithmics -- chapter 6 Functional Transforms -- chapter 7 Nonuniform Pólya Urn Schemes -- chapter 8 Nonuniform Data Models -- chapter 9 Sorting Nonuniform Data -- chapter 10 Recursive Trees -- chapter 11 Series-Parallel Graphs.
Abstract: Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and the data structures that support them. Traditionally, algorithmics have been approached either via a probabilistic view or an analytic approach. The authors adopt both approaches and bring them together and benefit from the advantage of each approach. The text examines algorithms that are designed to handle general data—sort any array, find the median of any numerical set, and identify patterns in any setting. At the same time, it evaluates "average" performance, "typical" behavior, or in mathematical terms, the expectations of the random variables that describe their operations.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

chapter 1 Introduction -- chapter 2 Counting -- chapter 3 Symbolic Calculus -- chapter 4 Languages and Their Generating Functions -- chapter 5 Probability in Algorithmics -- chapter 6 Functional Transforms -- chapter 7 Nonuniform Pólya Urn Schemes -- chapter 8 Nonuniform Data Models -- chapter 9 Sorting Nonuniform Data -- chapter 10 Recursive Trees -- chapter 11 Series-Parallel Graphs.

Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and the data structures that support them. Traditionally, algorithmics have been approached either via a probabilistic view or an analytic approach. The authors adopt both approaches and bring them together and benefit from the advantage of each approach. The text examines algorithms that are designed to handle general data—sort any array, find the median of any numerical set, and identify patterns in any setting. At the same time, it evaluates "average" performance, "typical" behavior, or in mathematical terms, the expectations of the random variables that describe their operations.

Technical University of Mombasa
Tom Mboya Street, Tudor 90420-80100 , Mombasa Kenya
Tel: (254)41-2492222/3 Fax: 2490571