Gonnet G.H., Baeza-Yates R. — Handbook of algorithms and data structures :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

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.

Язык:

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

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

ed2k: ed2k stats

Издание: 2nd edition

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$BB(\alpha)$ trees      100
tree      226
$\omega(x)$ function      304
1-2 brother trees      128
1-2 neighbour trees      128
1-2 son trees      128
1-2 trees      128
2-3 brother trees      125
2-3 trees      124
2-3-4 trees      129
80%-20% rule      70 293
Accesses      91
Accessing books      291
Addition      235 247
Addition chain      240
Address region      79
Address-calculation sort      176
Addressing methods      24
Album      287
Algorithm definition      14
Algorithm descriptions      14
Algorithm format      1 2
Algorithms, code      6
Alignment problem      283
Alphabet size      251
Alternating selection      188 191
Alternation      21
Amortized worst case      103
Approximate matrix multiplication      247
Approximate string matching      267
Arbitrary precision approximating      247
arctan(x)      244
Arithmetic algorithms      235
Arithmetic-geometric mean      242
Array indices      131
Array merging      185
Array of digits      237
Array search      25
Array sorting      230
ASCII      138 235
Asymptotic expansions      296
Asymptotic expansions of definite integrals containing $e^{-x^2}$       302
Asymptotic expansions of sums      298
Asymptotic expansions of sums, containing $e^{-x^2}$       302
Asymptotic matrix multiplication      247
Asymptotic notation      5
Atomic operations      15
Automaton simulation      275
Average minimum accesses      70
AVL trees      97 127 128 183
B*-trees      121 122 132
B+-trees      122
B-Tree insertion      15
B-tree variations      130
B-trees      11 117 183
Balance of a node      100
Balanced binary trees      226
Balanced merge sort      193
Balanced multiway trees      117
Balanced nodes      97
Balanced Quicksort      181
Balanced trees      183
Balancing by internal path reduction      102
Balancing rules      24
Basic algorithms      24
Basic concepts      9
Basic operations      15
Basic operations, multiplication/division      235
Basic sequential search      25
Basic sorting methods      180
Bibliographic databases      251 270
Biharmonic numbers      95 209 300
Binary addition      227
Binary decisions      16
Binary decomposition      16 20 226
Binary digital search trees      138
Binary insertion sort      157
Binary merging      187
Binary powering      240
Binary priority queues      223
Binary search      18 37 91
binary search trees      149 225
Binary search trees as priority queues      225
Binary tree hashing      64
Binary tree search      91
Binary trees      10 223 227
Binary trees used as priority queues      221
Binary trie      140
Binomial queues      226
Bipartition search      37
Bisection search      37
Bit indexing      140
Bit inspections      138
Bit-map display      149
Blocking factor      28
BNF productions      10
Boolean expressions, order      5
Bottom-up construction      107
Bottom-up radix sort      179
Bounded balance trees      100
Bounded disorder      130
Boyer — Moore text searching      256
Bradford’s law      291
break      5
Brent — Salamin      242
Brent’s algorithm      62
Brent’s hashing      62
Browsing text      251
Brute force search      25
Brute force text searching      253
Bubble sort      154
Bucket      28 82
Bucket address      179
Bucket binary tries      137
Bucket sort      166 176 181 231
Bucket tries      137
buckets      54 80 82 86
Building procedures      17
Business applications      20
C      5
Calculated entry search      44
Cascade merge sort      195
Cellar, hashing      79
Centred search      68
Chain      44
Chaining hashing      44
Circular paths      44
Classical matrix multiplication      245
Clustering      44
Clustering free      49
Coalesced hashing      77
Coalesced hashing with cellar      79
Coalescing chains      53
Cocktail shaker sort      155
Collision      44
Collision resolution scheme      44
Commutativity, products      247
Complete binary trees      211
Complex arithmetic      244
Complexity measures      2 7
Complexity of multiplication      235
Complexity of squaring      236
Composite keys      143
composition      17 180
Composition of Quicksort      159
compressed files      36
Compressed tries      140
Computed entry search      44
Computing $\pi$       242
Computing inverses, complexity      236

Computing logarithms      243
Conformation      22
Constraints for data objects      12
constructor      15
Contamination      54
Contamination, hashing      54 74
Continuous growth      82
Control dictionary      271 272
Control function      83
Conventional data structures      10
Corpora      251 270
Counter heuristics      33
Cyclic structures      15
d-prefix      86
D-trees      108
DASG      279
Data processing      289
Data processing distribution      293
Data processing sorting      179
Data structure description      9
Database searching      117
DAWG      279
Decimal operations      235
Decreasing probability order      34 139 289
Deletion      295
Deletions in binary trees      114
Deletions, hashing      45 82
Depth, nodes      91
Depth, trie      136
derivatives      237
Descending factorials      305
Determinants      248
Deterministic finite automaton      see DFA
DFA      259 262
Dichotomic search      37
Dictionaries      251 270
Dictionary structures      127
digit      235
Digital B-trees      130
Digital cardinality      134
Digital decomposition      16 20 133 179
Digital indexing      133
Digital search trees      138
Digital tree      10 133 179 273
Digital trie      146
Digitization      16
DIGITS      244
Diminishing increment sort      161
Direct chaining hashing      70 71
Directed acyclic subsequence graph      see DASG
Directed acyclic word graph      see DAWG
Directory      80
Discrete rectangular distribution      292
Disk cylinder      133
Disk track      133
Dispersion phase      188
Distribution of authorship      293
Distribution phase      188
Distribution, probability      4
Distributions derived from empirical observation      289
Distributions sort      179
Distributive partitioning      181
Divide and conquer      17 152 158 174 231
Division      235 237
Double hashing      55 62
Double left rotation      113
Double right rotation      113
Double rotation      113
Double-direction bubblesort      155
Double-ended      211
Double-ended priority queues      203 211 216 226
Doubly exponential forms      303
Dummy sequences      197
Dynamic hashing      84 138
Dynamic programming      110
Dynamic set sorting      183
Dynamic size hashing      81
Dynamic trees      108
Editing cost      267
Empirical distributions      289
End-of-string      see EOS
English      289
Entropy, searching      105
EOS      263
Equations, systems of      248
Error conditions      7
Estimated entry search      39
Euler — Maclaurin summation formula      307
Euler’s constant      297
Exchange with parent      108
Expansions, asymptotic      297
Expectation      4
Expected value      4
EXPONENT      238
Exponential function      244
Exponential integral      299
Exponential-type expansions      301
Extended precision      235
Extendible hashing      80
EXTERNAL      121
External accesses      85
External hashing      54 74 80 82 86
External merge sorting      188
External merging      192
External path      92
External Quicksort      201
External searching      117
External sorting      170 183 187 272
Extract maximum      205
Factorial function      297 300
Failure function      259
False drops      280
Fast Fourier Transform      236
Fast multiplication      236
Fibonacci numbers      196
Finite fields      69
Finite state machine      262
Finite universe of keys      216
First generalization of a Zipfian distribution      290
First-come-first-served, FCFS      67
Floyd’s heap-construction      213
Folklore distributions      289
for loops      18
Forest      226
Format of simulation results      2
Format of tables      2
found      7
Frequency of references      291
Frequency of words      289
Fringe reorganization      109
Full expansion      83
Full stability      184
Gamma function      297 300
Gamma-type expansions      300
General trees      10
Generalized harmonic      292
Generating function      92 118 189
Go to table      259
goto      5
Grammar for data objects      9
Graphics      149
Greedy trees      107
Growth at root, B-trees      120
Growth, continuous      82
Hamming distance      267
Harmonic numbers      95 106 134 297 300
Hashed increments      55
Hashing      80
hashing algorithms      273
Hashing function      16 43 47 168

1 2 3

О проекте