Description

Book Synopsis

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 to get the best of both worlds and benefit from the advantage of each approach.

The text examines algorithms that are designed to handle general datasort 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.

Many exercises are presented, which are essential since they convey additional

material complementing the content of the chapters. For this reason, the solutions are more than mere answers, but explain and expand

Table of Contents

1 Algorithmics 2 Counting: Tools and Strategies 3 Symbolic Calculus 4 Languages and Their Generating Functions 5 Probability in Algorithmics 6 Data Models 7 Sorting Nonuniform Data 8 Nonuniform Pólya Urn Schemes 9 Nonuniform trees

Algorithmics of Nonuniformity

Product form

£199.50

Includes FREE delivery

RRP £210.00 – you save £10.50 (5%)

Order before 4pm today for delivery by Sat 17 Jan 2026.

A Hardback by Hosam Mahmoud, Hosam Mahmoud

Out of stock


    View other formats and editions of Algorithmics of Nonuniformity by Hosam Mahmoud

    Publisher: Taylor & Francis Inc
    Publication Date: 1/17/2018 12:07:00 AM
    ISBN13: 9781498750714, 978-1498750714
    ISBN10: 1498750710

    Description

    Book Synopsis

    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 to get the best of both worlds and benefit from the advantage of each approach.

    The text examines algorithms that are designed to handle general datasort 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.

    Many exercises are presented, which are essential since they convey additional

    material complementing the content of the chapters. For this reason, the solutions are more than mere answers, but explain and expand

    Table of Contents

    1 Algorithmics 2 Counting: Tools and Strategies 3 Symbolic Calculus 4 Languages and Their Generating Functions 5 Probability in Algorithmics 6 Data Models 7 Sorting Nonuniform Data 8 Nonuniform Pólya Urn Schemes 9 Nonuniform trees

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account