For a one-semester, junior/senior-level course in Algorithms.
Attuned to the rapidly changing landscape in computer technology, this unique and very progressive text helps students understand the application and analysis of algorithmic paradigms to both the traditional sequential model of computing and to a variety of parallel modelsoffering a unified, fully integrated coverage of both model types so that students can learn to recognize how solution strategies may be shared among computer paradigms and architectures.
|
|
|
2 | (28) |
|
|
|
4 | (1) |
|
|
|
5 | (4) |
|
|
|
9 | (1) |
|
Asymptotic Analysis and Limits |
|
|
9 | (3) |
|
|
|
12 | (5) |
|
Rules for Analysis of Algorithms |
|
|
17 | (4) |
|
|
|
21 | (2) |
|
Limitations of Asymptotic Analysis |
|
|
23 | (1) |
|
|
|
24 | (1) |
|
|
|
25 | (1) |
|
|
|
25 | (5) |
|
|
|
30 | (20) |
|
|
|
32 | (1) |
|
|
|
33 | (2) |
|
|
|
35 | (2) |
|
|
|
37 | (4) |
|
|
|
41 | (6) |
|
|
|
47 | (1) |
|
|
|
47 | (3) |
|
|
|
50 | (14) |
|
Proof of the Master Theorem (Optional) |
|
|
53 | (9) |
|
|
|
62 | (1) |
|
|
|
62 | (2) |
|
|
|
64 | (12) |
|
|
|
75 | (1) |
|
|
|
75 | (1) |
|
|
|
76 | (46) |
|
Examples: Simple Algorithms |
|
|
83 | (7) |
|
|
|
90 | (1) |
|
|
|
91 | (1) |
|
|
|
92 | (21) |
|
|
|
113 | (5) |
|
|
|
118 | (1) |
|
|
|
118 | (4) |
|
|
|
122 | (14) |
|
|
|
124 | (5) |
|
|
|
129 | (5) |
|
|
|
134 | (1) |
|
|
|
135 | (1) |
|
|
|
136 | (22) |
|
Application: Maximum Sum Subsequence |
|
|
145 | (3) |
|
|
|
148 | (2) |
|
Interval (Segment) Broadcasting |
|
|
150 | (2) |
|
(Simple) Point Domination Query |
|
|
152 | (1) |
|
Computing Overlapping Line Segments |
|
|
153 | (3) |
|
|
|
156 | (1) |
|
|
|
156 | (2) |
|
|
|
158 | (8) |
|
|
|
160 | (2) |
|
Linked List Parallel Prefix |
|
|
162 | (1) |
|
|
|
163 | (1) |
|
|
|
163 | (3) |
|
|
|
166 | (36) |
|
|
|
168 | (3) |
|
|
|
171 | (5) |
|
QuickSort (Partition Sort) |
|
|
176 | (14) |
|
|
|
190 | (1) |
|
|
|
191 | (5) |
|
|
|
196 | (3) |
|
|
|
199 | (1) |
|
|
|
200 | (2) |
|
|
|
202 | (30) |
|
|
|
203 | (2) |
|
|
|
205 | (5) |
|
Divide-and-Conquer Solution |
|
|
210 | (8) |
|
|
|
218 | (2) |
|
All-Nearest Neighbor Problem |
|
|
220 | (1) |
|
Architecture-Independent Algorithm Development |
|
|
221 | (1) |
|
Line Intersection Problems |
|
|
222 | (1) |
|
Overlapping Line Segments |
|
|
223 | (4) |
|
|
|
227 | (1) |
|
|
|
228 | (4) |
|
|
|
232 | (20) |
|
|
|
233 | (2) |
|
|
|
235 | (4) |
|
|
|
239 | (2) |
|
|
|
241 | (5) |
|
Hausdorff Metric for Digital Images |
|
|
246 | (2) |
|
|
|
248 | (1) |
|
|
|
249 | (3) |
|
|
|
252 | (44) |
|
|
|
255 | (3) |
|
|
|
258 | (2) |
|
|
|
260 | (15) |
|
Connected Component Labeling |
|
|
275 | (4) |
|
Minimum-Cost Spanning Trees |
|
|
279 | (7) |
|
|
|
286 | (4) |
|
|
|
290 | (2) |
|
|
|
292 | (4) |
|
|
|
296 | (16) |
|
|
|
298 | (1) |
|
|
|
299 | (2) |
|
|
|
301 | (1) |
|
|
|
302 | (2) |
|
Approximation by Taylor Series |
|
|
304 | (3) |
|
|
|
307 | (2) |
|
|
|
309 | (1) |
|
|
|
310 | (2) |
| Bibliography |
|
312 | (5) |
| Index |
|
317 | |
RUSS MILLER is Director of the Center for Computational Research, Professor of Computer Science and Engineering, and Adjunct Professor of Electrical Engineering at the State University of New York at Buffalo (SUNY-Buffalo). He is also Senior Research Scientist at the Hauptman-Woodward Medical Research Institute. Dr. Miller sits on the editorial board of Parallel Processing Letters, on the Advisory Board of the IEEE Technical Committee on Parallel Processing, has co-authored another book, and has authored or co-authored over 100 journal and conference proceedings papers.
LAURENCE BOXER is a faculty member at Niagara University in the Department of Computer and Information Sciences, which he chairs. He is also an Adjunct Professor at SUNY-Buffalo. Dr. Boxer sits on the editorial board of the Journal of Computing and Information and has authored or co-authored over 30 journal and conference proceedings papers.
