Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Mahmoud H.M. — Sorting: a distribution theory
Mahmoud H.M. — Sorting: a distribution theory



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Sorting: a distribution theory

Автор: Mahmoud H.M.

Аннотация:

A cutting-edge look at the emerging distributional theory of sorting

Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting.

Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory:
* Contains introductory material on complete and partial sorting
* Explains insertion sort, quick sort, and merge sort, among other methods
* Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code
* Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques
* Features a variety of end-of-chapter exercises


Язык: en

Рубрика: Computer science/Алгоритмы/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2000

Количество страниц: 396

Добавлена в каталог: 19.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Selection, multiple      166
Selection, random      166
Selmer, E.      124
Sentinel      90 100 194 254—255 258 271 284
Sequential scheme      211
Sharp, W.      128
Shell, D.      103 124
Shepp, L.      113—114 119—120
Short circuit      89 371
Slutsky, E.      52 92
Smoluchowski, M.      107
Smythe, R.      116 122 166 172—174 187 190 195—196
Sorting      1
Sorting, comparison-based      4
Sorting, complete      3
Sorting, lexicographic      261
Sorting, ln-situ      5
Sorting, naive      4
Sorting, parsimonious      5
Sorting, partial      3
Sorting, stable      5
Stasevich, G.      124 128
Steepest descent      55
Stieltjes, T.      122; see “Lebesgue — Stieltjes integral”
Stirling numbers      43 48 182
Stirling’s approximation      22 24 32 43 64 67 78 80 96 133 218—219 222 257
Stochastic process      107—110
Stochastic process with independent increments      109
Stochastic process, Markovian      112 118
Stochastic process, stationary      109
Suel, T.      124
Support      195
Symbolic computation      156—157
Szpankowski, W.      62 64 81
Tan, K.      159 242
Tarjan, R.      25 294 297
Tavare, S.      62
Tournament      26 34
transform      57
Transform, Dirichlet      67 70 236 242
Transform, Fourier      57
Transform, Laplace      57
Transform, Mellin      56 265—266
Transform, Mellin, inversion      57 265
Transform, Poisson      63
Tree branch      10
Tree depth      10
Tree descendant      11
Tree edge      10
Tree height      12
Tree insertion      84
Tree leaf      11
Tree node      10
Tree node, external      11
Tree node, internal      11
Tree order      10
Tree parent      10
Tree root      10
Tree size      10
Tree, ancestor in      11
Tree, binary      11
Tree, binary search      14
Tree, binary search, random      15
Tree, child in      10
Tree, complete      12
Tree, decision      18
Tree, drawing convention      10
Tree, extended      11
Tree, level in      10
Tree, level saturation in      11
Tree, perfect      12 97—99
Tree, predessor in      11
Tree, sub-      11
Tree, vertex of      10
Tree-growing property      97 101
Tri-mean      3
Trimmed mean      3 178
Trollope, H.      247 249
Tukey, J.      3
Uniform integrability      135
UNIX      148
Viola, A.      256
Wasserstein distance      161 164 174 191—192 194—196
Wasserstein metric space      161 191—192
Wegener, I.      219
Weighted average      3
Weiss, M.      124
Wellner, A.      116 122
Wells, M.      286
Wiener, N.      107
Williams, J.      212
Wimbledon      26
Wong, R.      55
World Cup      26
Yang, B.      298—300 302
Yao, A.      141
Yeh, Y.      298—300 302
Zolotarev’s metric      242
Zwick, U.      25 30—31
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте