The algorithm design manual:
This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
London
Springer
2008
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Zusammenfassung: | This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website. |
| Beschreibung: | XVI, 730 S. Ill., graph. Darst. |
| ISBN: | 9781848000698 1848000693 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023329609 | ||
| 003 | DE-604 | ||
| 005 | 20211006 | ||
| 007 | t | ||
| 008 | 080605s2008 ad|| |||| 00||| eng d | ||
| 015 | |a 07,N38,0779 |2 dnb | ||
| 016 | 7 | |a 985456434 |2 DE-101 | |
| 020 | |a 9781848000698 |c : ca. EUR 55.64 (freier Pr.), ca. sfr 91.00 (freier Pr.) |9 978-1-84800-069-8 | ||
| 020 | |a 1848000693 |c : ca. EUR 55.64 (freier Pr.), ca. sfr 91.00 (freier Pr.) |9 1-84800-069-3 | ||
| 035 | |a (OCoLC)228582051 | ||
| 035 | |a (DE-599)DNB985456434 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-824 |a DE-473 |a DE-29T |a DE-860 |a DE-634 |a DE-11 |a DE-2070s |a DE-92 |a DE-384 |a DE-522 |a DE-B768 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Skiena, Steven S. |d 1961- |e Verfasser |0 (DE-588)172376823 |4 aut | |
| 245 | 1 | 0 | |a The algorithm design manual |c Steven S. Skiena |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a London |b Springer |c 2008 | |
| 300 | |a XVI, 730 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website. | |
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entwurf |0 (DE-588)4121208-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Entwurf |0 (DE-588)4121208-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-84800-070-4 |w (DE-604)BV035606177 |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=2997312&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513562&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016513562 | |
Datensatz im Suchindex
| _version_ | 1805090527112069120 |
|---|---|
| adam_text |
Contents
I Practical Algorithm Design
1
Introduction to Algorithm Design
3
1.1
Robot Tour Optimization
. 5
1.2
Selecting the Right Jobs
. 9
1.3
Reasoning about Correctness
. 11
1.4
Modeling the Problem
. 19
1.5
About the War Stories
. 22
1.6
War Story: Psychic Modeling
. 23
1.7
Exercises
. 27
Algorithm Analysis
31
2.1
The RAM Model of Computation
. 31
2.2
The Big Oh Notation
. 34
2.3
Growth Rates and Dominance Relations
. 37
2.4
Working with the Big Oh
. 40
2.5
Reasoning About Efficiency
. 41
2.6
Logarithms and Their Applications
. 46
2.7
Properties of Logarithms
. 50
2.8
War Story: Mystery of the Pyramids
. 51
2.9
Advanced Analysis
(*). 54
2.10
Exercises
. 57
Data Structures
65
3.1
Contiguous vs. Linked Data Structures
. 66
xii CONTENTS
3.2 Stacks and Queues . 71
3.3
Dictionaries
. 72
3.4
Binary Search Trees
. 77
3.5
Priority Queues
. 83
3.6
War Story: Stripping
Triangulations
. 85
3.7
Hashing and Strings
. 89
3.8
Specialized Data Structures
. 93
3.9
War Story: String 'em Up
. 94
3.10
Exercises
. 98
4
Sorting and Searching
103
4.1
Applications of Sorting
. 104
4.2
Pragmatics of Sorting
. 107
4.3
Heapsort: Fast Sorting via Data Structures
. 108
4.4
War Story: Give me a Ticket on an Airplane
. 118
4.5
Mergesort: Sorting by Divide-and-Conquer
. 120
4.6
Quicksort: Sorting by Randomization
. 123
4.7
Distribution Sort: Sorting via Bucketing
. 129
4.8
War Story: Skiena for the Defense
. 131
4.9
Binary Search and Related Algorithms
. 132
4.10
Divide-and-Conquer
. 135
4.11
Exercises
. 139
5
Graph Traversal
145
5.1
Flavors of Graphs
. 146
5.2
Data Structures for Graphs
. 151
5.3
War Story: I was a Victim of Moore's Law
. 155
5.4
War Story: Getting the Graph
. 158
5.5
Traversing a Graph
. 161
5.6
Breadth-First Search
. 162
5.7
Applications of Breadth-First Search
. 166
5.8
Depth-First Search
. 169
5.9
Applications of Depth-First Search
. 172
5.10
Depth-First Search on Directed Graphs
. 178
5.11
Exercises
. 184
6
Weighted Graph Algorithms
191
6.1
Minimum Spanning Trees
. 192
6.2
War Story: Nothing but Nets
. 202
6.3
Shortest Paths
. 205
6.4
War Story: Dialing for Documents
. 212
6.5
Network Flows and Bipartite Matching
. 217
6.6
Design Graphs, Not Algorithms
. 222
6.7
Exercises
. 225
CONTENTS
7
Combinatorial Search and Heuristic Methods
230
7.1
Backtracking
. 231
7.2
Search Pruning
. 238
7.3
Sudoku
. 239
7.4
War Story: Covering Chessboards
. 244
7.5
Heuristic Search Methods
. 247
7.6
War Story: Only it is Not a Radio
. 260
7.7
War Story: Annealing Arrays
. 263
7.8
Other Heuristic Search Methods
. 266
7.9
Parallel Algorithms
. 267
7.10
War Story: Going Nowhere Fast
. 268
7.11
Exercises
. 270
8
Dynamic Programming
273
8.1
Caching vs. Computation
. 274
8.2
Approximate String Matching
. 280
8.3
Longest Increasing Sequence
. 289
8.4
War Story: Evolution of the Lobster
. 291
8.5
The Partition Problem
. 294
8.6
Parsing Context-Free Grammars
. 298
8.7
Limitations of Dynamic Programming: TSP
. 301
8.8
War Story: What's Past is Prolog
. 304
8.9
War Story: Text Compression for Bar Codes
. 307
8.10
Exercises
. 310
9
Intractable Problems and Approximation Algorithms
316
9.1
Problems and Reductions
. 317
9.2
Reductions for Algorithms
. 319
9.3
Elementary Hardness Reductions
. 323
9.4
Satisfiability
. 328
9.5
Creative Reductions
. 330
9.6
The Art of Proving Hardness
. 334
9.7
War Story: Hard Against the Clock
. 337
9.8
War Story: And Then I Failed
. 339
9.9
Ρ
vs. NP
. 341
9.10
Dealing with NP-complete Problems
. 344
9.11
Exercises
. 350
10
How to Design Algorithms
356
II The Hitchhiker's Guide to Algorithms
361
11
A Catalog of Algorithmic Problems
363
CONTENTS
12 Data
Structures
366
12.1
Dictionaries
. 367
12.2
Priority Queues
. 373
12.3
Suffix Trees and Arrays
. 377
12.4
Graph Data Structures
. 381
12.5
Set Data Structures
. 385
12.6
Kd-Trees
. 389
13
Numerical Problems
393
13.1
Solving Linear Equations
. 395
13.2
Bandwidth Reduction
. 398
13.3
Matrix Multiplication
. 401
13.4
Determinants and
Permanents
. 404
13.5
Constrained and Unconstrained Optimization
. 407
13.6
Linear Programming
. 411
13.7
Random Number Generation
. 415
13.8
Factoring and Primality Testing
. 420
13.9
Arbitrary-Precision Arithmetic
. 423
13.10
Knapsack Problem
. 427
13.11
Discrete Fourier Transform
. 431
14
Combinatorial Problems
434
14.1
Sorting
. 436
14.2
Searching
. 441
14.3
Median and Selection
. 445
14.4
Generating Permutations
. 448
14.5
Generating Subsets
. 452
14.6
Generating Partitions
. 456
14.7
Generating Graphs
. 460
14.8
Calendrical Calculations
. 465
14.9
Job Scheduling
. 468
14.10
Satisfiability
. 472
15
Graph Problems: Polynomial-Time
475
15.1
Connected Components
. 477
15.2
Topological Sorting
. 481
15.3
Minimum Spanning Tree
. 484
15.4
Shortest Path
. 489
15.5
Transitive Closure and Reduction
. 495
15.6
Matching
. 498
15.7
Eulerian Cycle/Chinese Postman
. 502
15.8
Edge and Vertex Connectivity
. 505
15.9
Network Flow
. 509
15.10
Drawing Graphs Nicely
. 513
CONTENTS
15.11
Drawing Trees
. 517
15.12
Planarity Detection and Embedding
. 520
16
Graph Problems: Hard Problems
523
16.1
Clique
. 525
16.2
Independent Set
. 528
16.3
Vertex Cover
. 530
16.4
Traveling Salesman Problem
. 533
16.5
Hamiltonian Cycle
. 538
16.6
Graph Partition
. 541
16.7
Vertex Coloring
. 544
16.8
Edge Coloring
. 548
16.9
Graph Isomorphism
. 550
16.10 Steiner
Tree
. 555
16.11
Feedback Edge/Vertex Set
. 559
17
Computational Geometry
562
17.1
Robust Geometric Primitives
. 564
17.2
Convex Hull
. 568
17.3 Triangulation . 572
17.4
Voronoi Diagrams
. 576
17.5
Nearest Neighbor Search
. 580
17.6
Range Search
. 584
17.7
Point Location
. 587
17.8
Intersection Detection
. 591
17.9
Bin Packing
. 595
17.10
Medial-Axis Transform
. 598
17.11
Polygon Partitioning
. 601
17.12
Simplifying Polygons
. 604
17.13
Shape Similarity
. 607
17.14
Motion Planning
. 610
17.15
Maintaining Line Arrangements
. 614
17.16
Minkowski Sum
. 617
18
Set and String Problems
620
18.1
Set Cover
. 621
18.2
Set Packing
. 625
18.3
String Matching
. 628
18.4
Approximate String Matching
. 631
18.5
Text Compression
. 637
18.6
Cryptography
. 641
18.7
Finite State Machine Minimization
. 646
18.8
Longest Common Substring/Subsequence
. 650
18.9
Shortest Common Superstring
. 654
xvi CONTENTS
19
Algorithmic
Resources 657
19.1 Software Systems. 657
19.2 Data
Sources
. 663
19.3 Online Bibliographie Resources. 663
19.4 Professional Consulting Services. 664
Bibliography
665
Index 709 |
| adam_txt |
Contents
I Practical Algorithm Design
1
Introduction to Algorithm Design
3
1.1
Robot Tour Optimization
. 5
1.2
Selecting the Right Jobs
. 9
1.3
Reasoning about Correctness
. 11
1.4
Modeling the Problem
. 19
1.5
About the War Stories
. 22
1.6
War Story: Psychic Modeling
. 23
1.7
Exercises
. 27
Algorithm Analysis
31
2.1
The RAM Model of Computation
. 31
2.2
The Big Oh Notation
. 34
2.3
Growth Rates and Dominance Relations
. 37
2.4
Working with the Big Oh
. 40
2.5
Reasoning About Efficiency
. 41
2.6
Logarithms and Their Applications
. 46
2.7
Properties of Logarithms
. 50
2.8
War Story: Mystery of the Pyramids
. 51
2.9
Advanced Analysis
(*). 54
2.10
Exercises
. 57
Data Structures
65
3.1
Contiguous vs. Linked Data Structures
. 66
xii CONTENTS
3.2 Stacks and Queues . 71
3.3
Dictionaries
. 72
3.4
Binary Search Trees
. 77
3.5
Priority Queues
. 83
3.6
War Story: Stripping
Triangulations
. 85
3.7
Hashing and Strings
. 89
3.8
Specialized Data Structures
. 93
3.9
War Story: String 'em Up
. 94
3.10
Exercises
. 98
4
Sorting and Searching
103
4.1
Applications of Sorting
. 104
4.2
Pragmatics of Sorting
. 107
4.3
Heapsort: Fast Sorting via Data Structures
. 108
4.4
War Story: Give me a Ticket on an Airplane
. 118
4.5
Mergesort: Sorting by Divide-and-Conquer
. 120
4.6
Quicksort: Sorting by Randomization
. 123
4.7
Distribution Sort: Sorting via Bucketing
. 129
4.8
War Story: Skiena for the Defense
. 131
4.9
Binary Search and Related Algorithms
. 132
4.10
Divide-and-Conquer
. 135
4.11
Exercises
. 139
5
Graph Traversal
145
5.1
Flavors of Graphs
. 146
5.2
Data Structures for Graphs
. 151
5.3
War Story: I was a Victim of Moore's Law
. 155
5.4
War Story: Getting the Graph
. 158
5.5
Traversing a Graph
. 161
5.6
Breadth-First Search
. 162
5.7
Applications of Breadth-First Search
. 166
5.8
Depth-First Search
. 169
5.9
Applications of Depth-First Search
. 172
5.10
Depth-First Search on Directed Graphs
. 178
5.11
Exercises
. 184
6
Weighted Graph Algorithms
191
6.1
Minimum Spanning Trees
. 192
6.2
War Story: Nothing but Nets
. 202
6.3
Shortest Paths
. 205
6.4
War Story: Dialing for Documents
. 212
6.5
Network Flows and Bipartite Matching
. 217
6.6
Design Graphs, Not Algorithms
. 222
6.7
Exercises
. 225
CONTENTS
7
Combinatorial Search and Heuristic Methods
230
7.1
Backtracking
. 231
7.2
Search Pruning
. 238
7.3
Sudoku
. 239
7.4
War Story: Covering Chessboards
. 244
7.5
Heuristic Search Methods
. 247
7.6
War Story: Only it is Not a Radio
. 260
7.7
War Story: Annealing Arrays
. 263
7.8
Other Heuristic Search Methods
. 266
7.9
Parallel Algorithms
. 267
7.10
War Story: Going Nowhere Fast
. 268
7.11
Exercises
. 270
8
Dynamic Programming
273
8.1
Caching vs. Computation
. 274
8.2
Approximate String Matching
. 280
8.3
Longest Increasing Sequence
. 289
8.4
War Story: Evolution of the Lobster
. 291
8.5
The Partition Problem
. 294
8.6
Parsing Context-Free Grammars
. 298
8.7
Limitations of Dynamic Programming: TSP
. 301
8.8
War Story: What's Past is Prolog
. 304
8.9
War Story: Text Compression for Bar Codes
. 307
8.10
Exercises
. 310
9
Intractable Problems and Approximation Algorithms
316
9.1
Problems and Reductions
. 317
9.2
Reductions for Algorithms
. 319
9.3
Elementary Hardness Reductions
. 323
9.4
Satisfiability
. 328
9.5
Creative Reductions
. 330
9.6
The Art of Proving Hardness
. 334
9.7
War Story: Hard Against the Clock
. 337
9.8
War Story: And Then I Failed
. 339
9.9
Ρ
vs. NP
. 341
9.10
Dealing with NP-complete Problems
. 344
9.11
Exercises
. 350
10
How to Design Algorithms
356
II The Hitchhiker's Guide to Algorithms
361
11
A Catalog of Algorithmic Problems
363
CONTENTS
12 Data
Structures
366
12.1
Dictionaries
. 367
12.2
Priority Queues
. 373
12.3
Suffix Trees and Arrays
. 377
12.4
Graph Data Structures
. 381
12.5
Set Data Structures
. 385
12.6
Kd-Trees
. 389
13
Numerical Problems
393
13.1
Solving Linear Equations
. 395
13.2
Bandwidth Reduction
. 398
13.3
Matrix Multiplication
. 401
13.4
Determinants and
Permanents
. 404
13.5
Constrained and Unconstrained Optimization
. 407
13.6
Linear Programming
. 411
13.7
Random Number Generation
. 415
13.8
Factoring and Primality Testing
. 420
13.9
Arbitrary-Precision Arithmetic
. 423
13.10
Knapsack Problem
. 427
13.11
Discrete Fourier Transform
. 431
14
Combinatorial Problems
434
14.1
Sorting
. 436
14.2
Searching
. 441
14.3
Median and Selection
. 445
14.4
Generating Permutations
. 448
14.5
Generating Subsets
. 452
14.6
Generating Partitions
. 456
14.7
Generating Graphs
. 460
14.8
Calendrical Calculations
. 465
14.9
Job Scheduling
. 468
14.10
Satisfiability
. 472
15
Graph Problems: Polynomial-Time
475
15.1
Connected Components
. 477
15.2
Topological Sorting
. 481
15.3
Minimum Spanning Tree
. 484
15.4
Shortest Path
. 489
15.5
Transitive Closure and Reduction
. 495
15.6
Matching
. 498
15.7
Eulerian Cycle/Chinese Postman
. 502
15.8
Edge and Vertex Connectivity
. 505
15.9
Network Flow
. 509
15.10
Drawing Graphs Nicely
. 513
CONTENTS
15.11
Drawing Trees
. 517
15.12
Planarity Detection and Embedding
. 520
16
Graph Problems: Hard Problems
523
16.1
Clique
. 525
16.2
Independent Set
. 528
16.3
Vertex Cover
. 530
16.4
Traveling Salesman Problem
. 533
16.5
Hamiltonian Cycle
. 538
16.6
Graph Partition
. 541
16.7
Vertex Coloring
. 544
16.8
Edge Coloring
. 548
16.9
Graph Isomorphism
. 550
16.10 Steiner
Tree
. 555
16.11
Feedback Edge/Vertex Set
. 559
17
Computational Geometry
562
17.1
Robust Geometric Primitives
. 564
17.2
Convex Hull
. 568
17.3 Triangulation . 572
17.4
Voronoi Diagrams
. 576
17.5
Nearest Neighbor Search
. 580
17.6
Range Search
. 584
17.7
Point Location
. 587
17.8
Intersection Detection
. 591
17.9
Bin Packing
. 595
17.10
Medial-Axis Transform
. 598
17.11
Polygon Partitioning
. 601
17.12
Simplifying Polygons
. 604
17.13
Shape Similarity
. 607
17.14
Motion Planning
. 610
17.15
Maintaining Line Arrangements
. 614
17.16
Minkowski Sum
. 617
18
Set and String Problems
620
18.1
Set Cover
. 621
18.2
Set Packing
. 625
18.3
String Matching
. 628
18.4
Approximate String Matching
. 631
18.5
Text Compression
. 637
18.6
Cryptography
. 641
18.7
Finite State Machine Minimization
. 646
18.8
Longest Common Substring/Subsequence
. 650
18.9
Shortest Common Superstring
. 654
xvi CONTENTS
19
Algorithmic
Resources 657
19.1 Software Systems. 657
19.2 Data
Sources
. 663
19.3 Online Bibliographie Resources. 663
19.4 Professional Consulting Services. 664
Bibliography
665
Index 709 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Skiena, Steven S. 1961- |
| author_GND | (DE-588)172376823 |
| author_facet | Skiena, Steven S. 1961- |
| author_role | aut |
| author_sort | Skiena, Steven S. 1961- |
| author_variant | s s s ss sss |
| building | Verbundindex |
| bvnumber | BV023329609 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)228582051 (DE-599)DNB985456434 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV023329609</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211006</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080605s2008 ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N38,0779</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">985456434</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848000698</subfield><subfield code="c">: ca. EUR 55.64 (freier Pr.), ca. sfr 91.00 (freier Pr.)</subfield><subfield code="9">978-1-84800-069-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848000693</subfield><subfield code="c">: ca. EUR 55.64 (freier Pr.), ca. sfr 91.00 (freier Pr.)</subfield><subfield code="9">1-84800-069-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)228582051</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB985456434</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-2070s</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-B768</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Skiena, Steven S.</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172376823</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The algorithm design manual</subfield><subfield code="c">Steven S. Skiena</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 730 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-84800-070-4</subfield><subfield code="w">(DE-604)BV035606177</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=2997312&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513562&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016513562</subfield></datafield></record></collection> |
| id | DE-604.BV023329609 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:57:06Z |
| indexdate | 2024-07-20T09:41:12Z |
| institution | BVB |
| isbn | 9781848000698 1848000693 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016513562 |
| oclc_num | 228582051 |
| open_access_boolean | |
| owner | DE-703 DE-824 DE-473 DE-BY-UBG DE-29T DE-860 DE-634 DE-11 DE-2070s DE-92 DE-384 DE-522 DE-B768 |
| owner_facet | DE-703 DE-824 DE-473 DE-BY-UBG DE-29T DE-860 DE-634 DE-11 DE-2070s DE-92 DE-384 DE-522 DE-B768 |
| physical | XVI, 730 S. Ill., graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| spelling | Skiena, Steven S. 1961- Verfasser (DE-588)172376823 aut The algorithm design manual Steven S. Skiena 2. ed. London Springer 2008 XVI, 730 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficac y and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website. Algorithmes Computer algorithms Computer (DE-588)4070083-5 gnd rswk-swf Entwurf (DE-588)4121208-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Entwurf (DE-588)4121208-3 s DE-604 Computer (DE-588)4070083-5 s Erscheint auch als Online-Ausgabe 978-1-84800-070-4 (DE-604)BV035606177 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=2997312&prov=M&dok_var=1&dok_ext=htm Inhaltstext Digitalisierung UB Bamberg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513562&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Skiena, Steven S. 1961- The algorithm design manual Algorithmes Computer algorithms Computer (DE-588)4070083-5 gnd Entwurf (DE-588)4121208-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4070083-5 (DE-588)4121208-3 (DE-588)4001183-5 |
| title | The algorithm design manual |
| title_auth | The algorithm design manual |
| title_exact_search | The algorithm design manual |
| title_exact_search_txtP | The algorithm design manual |
| title_full | The algorithm design manual Steven S. Skiena |
| title_fullStr | The algorithm design manual Steven S. Skiena |
| title_full_unstemmed | The algorithm design manual Steven S. Skiena |
| title_short | The algorithm design manual |
| title_sort | the algorithm design manual |
| topic | Algorithmes Computer algorithms Computer (DE-588)4070083-5 gnd Entwurf (DE-588)4121208-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes Computer algorithms Computer Entwurf Algorithmus |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=2997312&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513562&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT skienastevens thealgorithmdesignmanual |