Kooperativer Bibliotheksverbund

UID:

Format: XIII, 394 S. , graph. Darst.

ISBN: 0471327107

Series Statement: Wiley-interscience series in discrete mathematics and optimization

Note: Literaturverz. S. 373 - 387

Language: English

Subjects: Mathematics

Keywords: Sortierverfahren ; Aufsatzsammlung ; Lehrbuch

URL: Publisher description

URL: Table of Contents

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

URL: Autorenbiografie

URL: Verlagsangaben

URL: Cover

URL: Inhaltstext

URL: http://www.loc.gov/catdir/toc/onix05/99086783.html

UID:

Format: X, 324 Seiten.

ISBN: 0-471-53228-2

Series Statement: Wiley-Interscience Series in Discrete Mathematics and Optimization

Language: English

Subjects: Mathematics

Keywords: Stochastisches Suchverfahren ; Algorithmus ; Zufallsvariable ; Baum ; Algorithmus ; Suchbaum ; Datenstruktur ; Wahrscheinlichkeitsrechnung ; Graph ; Aufgabensammlung ; Aufgabensammlung

UID:

Format: 1 online resource (xv, 394 pages) : , illustrations

ISBN: 9781118032886 , 1118032888 , 9781118031131 , 111803113X

Note: Front Matter -- Sorting and Associated Concepts -- Insertion Sort -- Shell Sort -- Bubble Sort -- Selection Sort -- Sorting by Counting -- Quick Sort -- Sample Sort -- Heap Sort -- Merge Sort -- Bucket Sorts -- Sorting Nonrandom Data -- Epilogue -- Answers to Exercises -- Appendix: Notation and Standard Results from Probability Theory -- Bibliography -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Sorting and Associated Concepts -- , Sorting -- , Selection -- , Jargon -- , Algorithmic Conventions -- , Order -- , Binary Trees -- , Decision Trees -- , Bounds on Sorting -- , Lower Bounds on Sorting -- , Upper Bounds on Sorting -- , Bounds on Selection -- , Lower Bounds on Selection -- , Upper Bounds on Selection -- , Random Permutations -- , Records -- , Inversions -- , Cycles -- , Runs -- , An Analytic Toolkit -- , The Saddle Point Method -- , The Mellin Transform -- , Poissonization -- , The Dirichlet Transform -- , Rice's Method -- , Insertion Sort -- , A General Framework -- , A Sufficient Condition for Normality -- , Linear Insertion Sort -- , Binary Insertion Sort -- , Shell Sort -- , The Algorithm -- , Streamlined Stochastic Analysis -- , The Empirical Distribution Function -- , The Brownian Bridge -- , Using the Stochastic Tools -- , Other Increment Sequences -- , Bubble Sort -- , The Algorithm -- , A limit Law for Passes -- , A Limit Law for Comparisons -- , Selection Sort -- , The Algorithm -- , Analysis -- , Sorting by Counting -- , Count Sort -- , Sorting by Counting Frequencies -- , Quick Sort -- , The Partitioning Stage -- , Bookkeeping -- , Quick Sort Tree -- , Probabilistic Analysis of Quick Sort -- , Quick Selection -- , Hoare's Find -- , Multiple Quick Select -- , Sample Sort -- , The Small Sample Algorithm -- , The Large Sample Algorithm -- , Heap Sort -- , The Heap -- , Sorting via a Heap -- , Merge Sort -- , Merging Sorted Lists -- , Linear Merge -- , Binary Merge -- , The Hwang-Lin Merging Algorithm -- , The Merge Sort Algorithm -- , Distributions -- , Bottom-Up Merge Sort -- , Bucket Sorts.

Additional Edition: Print version: Mahmoud, Hosam M. (Hosam Mahmoud), 1954- Sorting. New York : John Wiley & Sons, 2000 ISBN 0471327107

Language: English

Keywords: Electronic books. ; Electronic books. ; Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

UID:

Format: 1 Online-Ressource (290 Seiten)

ISBN: 9780429191992

Series Statement: Texts in statistical science

Additional Edition: ISBN 9781420059830

Language: English

DOI: 10.1201/9781420059847

URL: lizenzpflichtig

UID:

Format: 290 S. , Ill. , 25 cm

ISBN: 9781420059830 , 1420059831

Series Statement: Texts in statistical science series 76

Language: English

Keywords: Diskrete Wahrscheinlichkeitsverteilung ; Urnenmodell

URL: Table of contents only

URL: Inhaltsverzeichnis

UID:

Format: 1 online resource

ISBN: 9781315351346 , 131535134X , 9781315368306 , 1315368307

Series Statement: Discrete mathematics and its applications

Content: 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

Note: 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.

Additional Edition: Print version: Hofri, Micha. Algorithmics of Nonuniformity. Boca Raton, FL : CRC Press, [2019] ISBN 9781498750714

Additional Edition: ISBN 1498750710

Language: English

Keywords: Electronic books. ; Electronic books.

DOI: 10.1201/9781315368306

URL: https://www.taylorfrancis.com/books/9781315368306

UID:

Format: 1 online resource (xv, 394 pages) : , illustrations

ISBN: 9781118032886 , 1118032888 , 9781118031131 , 111803113X

Note: Front Matter -- Sorting and Associated Concepts -- Insertion Sort -- Shell Sort -- Bubble Sort -- Selection Sort -- Sorting by Counting -- Quick Sort -- Sample Sort -- Heap Sort -- Merge Sort -- Bucket Sorts -- Sorting Nonrandom Data -- Epilogue -- Answers to Exercises -- Appendix: Notation and Standard Results from Probability Theory -- Bibliography -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Sorting and Associated Concepts -- , Sorting -- , Selection -- , Jargon -- , Algorithmic Conventions -- , Order -- , Binary Trees -- , Decision Trees -- , Bounds on Sorting -- , Lower Bounds on Sorting -- , Upper Bounds on Sorting -- , Bounds on Selection -- , Lower Bounds on Selection -- , Upper Bounds on Selection -- , Random Permutations -- , Records -- , Inversions -- , Cycles -- , Runs -- , An Analytic Toolkit -- , The Saddle Point Method -- , The Mellin Transform -- , Poissonization -- , The Dirichlet Transform -- , Rice's Method -- , Insertion Sort -- , A General Framework -- , A Sufficient Condition for Normality -- , Linear Insertion Sort -- , Binary Insertion Sort -- , Shell Sort -- , The Algorithm -- , Streamlined Stochastic Analysis -- , The Empirical Distribution Function -- , The Brownian Bridge -- , Using the Stochastic Tools -- , Other Increment Sequences -- , Bubble Sort -- , The Algorithm -- , A limit Law for Passes -- , A Limit Law for Comparisons -- , Selection Sort -- , The Algorithm -- , Analysis -- , Sorting by Counting -- , Count Sort -- , Sorting by Counting Frequencies -- , Quick Sort -- , The Partitioning Stage -- , Bookkeeping -- , Quick Sort Tree -- , Probabilistic Analysis of Quick Sort -- , Quick Selection -- , Hoare's Find -- , Multiple Quick Select -- , Sample Sort -- , The Small Sample Algorithm -- , The Large Sample Algorithm -- , Heap Sort -- , The Heap -- , Sorting via a Heap -- , Merge Sort -- , Merging Sorted Lists -- , Linear Merge -- , Binary Merge -- , The Hwang-Lin Merging Algorithm -- , The Merge Sort Algorithm -- , Distributions -- , Bottom-Up Merge Sort -- , Bucket Sorts.

Additional Edition: Print version: Mahmoud, Hosam M. (Hosam Mahmoud), 1954- Sorting. New York : John Wiley & Sons, 2000 ISBN 0471327107

Language: English

Keywords: Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886