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

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

blank
blank
blank
Красота
blank
Gonnet G.H., Baeza-Yates R. — Handbook of algorithms and data structures
Gonnet G.H., Baeza-Yates R. — Handbook of algorithms and data structures



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



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


Название: Handbook of algorithms and data structures

Авторы: Gonnet G.H., Baeza-Yates R.

Аннотация:

Both this book and the preceding (smaller) edition have earned their place on my reference shelf. More up to date than Knuth's 2nd edition and covering much broader territory than (for example) Samet's D&A of Spatial Data Structures, I've found a number of algorithms and data structures in this text that have been directly applicable to my work as a systems programmer.
One of the major features of this book is, where possible, the consistent presentation and comparison of expected running times under a variety of input data conditions, with both theoretical and empirical results.
A very browseable handbook. Not one of the hundreds of 1st year textbooks. It's a shame that it's out of print.


Язык: en

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

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

ed2k: ed2k stats

Издание: 2nd edition

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Hashing methods for text searching      280
Hashing table      44
Hashing tries      138
Hashing value      260
Hashing, memoryless      86
HB[k] trees      99
Header      238
Heap      164 189 211
Heapsort      164
Height balance      13
Height balancing      97
Height increase transformation      126
Height, trees      91
Height-balanced trees      97
Heuristic organization schemes on binary trees      105
Heuristics      28
Heuristics for known probabilities      106
Hierarchical balance      13
Hierarchical order      13
Homogeneous indexing      131
Horizontal pointers      126
Horner’s rule      248
Hu — Tucker algorithm      111
Huffman encoding      107
Hwang and Lin merging      187
hybrid algorithm      247
Hybrid methods of sorting      180
Hybrid Quicksort      159
Hybrid sorting      181
Hybrid tries      137
Hyperrules      10
Implementation of lists      24
Implementation of trees      24
Implementing lists in arrays      172
Implicit data structures      211
In place sorting      153
In-place merging      185
Increment sequences      161
Index and indexed sequential files      130
Index B-trees      122
Index file      130
Index point      271
Index sequential access method      see ISAM
Indexed file      130
indices      130
Infix traversal      18 182
Input structure      14
Insert in decreasing probability order      106
insertion order      60
Insertion sort      156
Inspect queue      205
Interchangeability      23
Interleaving      22
Internal path      92
Internal/external differences      2
Interpolation      16
Interpolation formula      40 166 168 176
Interpolation search      39
Interpolation sort      166
Interpolation—sequential search      42
Introduction      1
Inverse of a function      237
Inverse square distribution      293
Inverse trigonometric functions      244
inversion      19
Inverted file      19 271
Inverted search      19
ISAM      132
Iterative application      18 156
Iterative formula      236
Iterative powering      241
Iterative zero-finder      237
Jump search      35
k-balancing      104
k-clustering      44
k-d tree      149
k-dimensional trees      149
k-height balanced      99
k-prefix      86
Karp — Rabin text searching      260
KMP algorithm      254
Known probabilities, heuristics      105
Knuth — Morris — Pratt text searching      254
language dictionaries      138
Last-come-first-served hashing      67
LCFS hashing      68
LCS      283
Leaf-pages      80
Left single rotation      112
Leftist trees      221
Legendre’s identity      242
Length      238
Length of longest probe sequence      44
Levenshtein distance      269
Lexicographical order      13
Lexicographical trees      91 117 182
Linear combinations      238
Linear hashing      82
Linear insertion sort      18 156 161 166
Linear lists      171
Linear probing      62
Linear probing hashing      51 168
Linear probing sort      168
Linear search      25
Linked list      171
Linked list, search      25
List merging      184
LISTS      71
Lists, search      25
Load factor      44
Logarithms      243
Longest common subsequence      see LCS
Longest probe sequence      44 56
Lotka’s distribution      31
Lotka’s law      293
Lower bounds, selection      228
Lower—upper triangular factoring      248
m-ary search trees      116
Main file      130
Matrix determinant      248
Matrix inversion      248
Matrix multiplication      245
Matrix partitioning      246
Maximum search      205
Maximum-minimum search      211
Mean-centred search      69
Median      181
Median selection      228
Median split      106
Median split trees      107
Memoryless      86
MERGE      20
Merge sort      173
Mergeable priority queues      218 221 227
Merging      173 183
Merging pass      195
Merging phase      188 192
Meta-production      10
Minave      14 71
Minimal perfect hashing function      87
Minimal-comparison merging      186
minimax      14 70
Minimum accesses      70
Minimum height trees      109
Minimum search      205
MOD      261
Mode of a set      232
Mode-centred search      69
Modular arithmetic      261
Move-to-front heuristic      28 108
Move-to-root      108
Multidimensional search      143
Multilevel indices      130
Multiple alignment problem      284
Multiple-precision      235
Multiple-precision multiplication      239
Multiplication      235 246
Multiplicity      232
Multiway decisions      16
Multiway merging      183
Multiway trees      10 117
Naming of variables      3
Natural merge      174
Natural merge sort      182
Natural selection      188 190
Nearest neighbour search      131
Negative search      143
Newton’s iteration      236
Node inspections      91
Node splittings      118
Non-atomic keys      143
Non-recursive bucket sort      182
Normalization      238
Notfound      7
NUMBER      235
Number of binary trees      92
numbering systems      16
On-line algorithm      255 260 263 267
One-sided height balanced      99
Open-addressing      44
Optimal binary tree search      109
Optimal external hashing      85
Optimal hashing      70
Optimal merging      187
Optimal polynomial evaluation      249
Optimal polyphase merge      197
Optimal powering      240
Optimal sequential search      34
Optimality      14
Order relation      60
Ordered arrays      36
Ordered binary tree      93
Ordered hashing      60 168
Ordering rules      24
ORGANIZATION      22
Organization of handbook      1
Oscillating merge sort      200
OSHB trees      99
Other arithmetic functions      240
Other text searching problems      283
Output function      259
Overflow      83
Overflow area      168
Overflow records      131
Overflow techniques      121
P-strings      281
P-trees      209
Pagodas      218
Parameters      14
Parsed strings      281
Partially sorted      170
Partial—match searching      143 151
Partition methods      24
Partitioning matrices      246
Pascal      5
PASS      188
PAT      273
PAT tree      142
Path      44
Path trees      102
Path-balanced trees      102
Patricia tree      140 146 273
Pattern matching      251
Pattern matching machine      259
Perfect binary trees      211
Perfect distribution      195
Perfect hashing      87
Perfectly balanced k-d trees      152
Permanents      32
Physical record      121
Planar coordinates      149
Poisson distribution      69 80 82 84
Polynomial evaluation      248
Polynomial roots      304
Polyphase merge sort      196
Population of cities      289
Positive search      143
Postfix traversals      18
Powering a number      240
Practical hashing functions      47
Practical recommendations      2
Preconditioning      249
Prefix B-trees      130
Prefix search      138
Prefix traversals      18
Preprocessing text      251 270
Presortedness      170
Primality testing      21
Primary clustering      44 53
Primary key access      117
Primary key search      25
Prime table size      55
Priority queue      164 189 205
priority queue order      13
Priority trees      209
Probabilistic algorithms      21
Probabilities      4
probability distribution      4 289
Probability notation      4
Probability universe      4
Product commutativity      247
Product, matrices      245
Programming languages      5
Prolix author      293
Proximity searching      278
Pseudo-random probing      51
Psi function      297 300
Punched cards      179
Quad trees      144
Quad tries      146
Quadratic convergence      242
Quadratic hashing      57 62
Quickersort      160
Quicksort      14 17 158 230
Quicksort for lists      174
Radix sort      136 179
Random binary trees      96
Random heaps      212
Random probing      68
Random probing hashing      50
Random search trees      94
Random string      251
Random variables      4
Randomization      20
Randomly generated binary trees      94
Range search      28 121 131 143 151 273
ranking      16
Read backwards      200
Real timings      7 170
recommendations      2
Recursion      19
Recursion termination      22 181
Recursive matrix multiplication      246
Recursive structures search      91
Red—black trees      129
Rehashing      44
Reordering of arrays      172
Reorganization      22
Reorganization schemes      62
Repeated selection      230
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте