Algorithm engineering: bridging the gap between algorithm theory and practice
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2010
|
| Schriftenreihe: | Lecture notes in computer science
5971 Tutorial |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XVI, 513 S. graph. Darst. |
| ISBN: | 9783642148651 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV036616778 | ||
| 003 | DE-604 | ||
| 005 | 20101004 | ||
| 007 | t | ||
| 008 | 100816s2010 gw d||| |||| 00||| eng d | ||
| 015 | |a 10,N28 |2 dnb | ||
| 016 | 7 | |a 1004244312 |2 DE-101 | |
| 020 | |a 9783642148651 |c PB. : EUR 74.90 (freier Pr.), sfr 109.00 (freier Pr.) |9 978-3-642-14865-1 | ||
| 024 | 3 | |a 9783642148651 | |
| 028 | 5 | 2 | |a 80020210 |
| 035 | |a (OCoLC)660152487 | ||
| 035 | |a (DE-599)DNB1004244312 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-706 |a DE-91G |a DE-83 |a DE-11 |a DE-703 |a DE-29T | ||
| 082 | 0 | |a 004.015181 |2 22/ger | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 68-06 |2 msc | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a 68W40 |2 msc | ||
| 084 | |a 68W01 |2 msc | ||
| 245 | 1 | 0 | |a Algorithm engineering |b bridging the gap between algorithm theory and practice |c Matthias Müller-Hannemann (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2010 | |
| 300 | |a XVI, 513 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 5971 Tutorial | |
| 650 | 0 | 7 | |a Anwendungssystem |0 (DE-588)4139375-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 0 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | 2 | |a Anwendungssystem |0 (DE-588)4139375-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Müller-Hannemann, Matthias |d 1969- |e Sonstige |0 (DE-588)120046598 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 5971 Tutorial |w (DE-604)BV000000607 |9 5971 | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3500796&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020536901&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-020536901 | |
Datensatz im Suchindex
| _version_ | 1805094499324526592 |
|---|---|
| adam_text |
CONTENTS CHAPTER 1. FOUNDATIONS OF ALGORITHM ENGINEERING M.
MUELLER-HANNEMANN, S. SCHIRRA 1 1.1 INTRODUCTION 1 1.1.1 CLASSICAL
ALGORITHMICS 1 1.1.2 THE NEW PARADIGM: ALGORITHM ENGINEERING 2 1.1.3
TOWARDS A DEFINITION OF ALGORITHM ENGINEERING 4 1.1.4 METHODOLOGY 5
1.1.5 VISIBILITY OF ALGORITHM ENGINEERING 6 1.2 BUILDING BLOCKS OF
ALGORITHM ENGINEERING 7 1.2.1 MODELING OF PROBLEMS 8 1.2.2 ALGORITHM
DESIGN 9 1.2.3 ANALYSIS 9 1.2.4 REALISTIC COMPUTER MODELS 10 1.2.5
IMPLEMENTATION 11 1.2.6 LIBRARIES 12 1.2.7 EXPERIMENTS 12 1.2.8 SUCCESS
STORIES OF ALGORITHM ENGINEERING 13 1.2.9 CHALLENGES 15 1.2.10 FURTHER
TOPICS * NOT COVERED IN THIS BOOK 15 CHAPTER 2. MODELING M. GEYER, B.
HILLER, S. MEINERT 16 2.1 INTRODUCTION 16 2.2 MODELING FUNDAMENTALS 19
2.2.1 FUNDAMENTALS 19 2.2.2 PROBLEM ANALYSIS 21 2.2.3 PROBLEM
SPECIFICATION: EXAMPLES 23 2.2.4 MODELING A SOLUTION APPROACH 26 2.2.5
MODEL ASSESSMENT 28 2.2.6 INHERENT DIFFICULTIES WITHIN THE MODELING
PROCESS 28 2.3 MODELING FRAMEWORKS 30 2.3.1 GRAPH-BASED MODELS 31 2.3.2
MIXED INTEGER PROGRAMMING 35 2.3.3 CONSTRAINT PROGRAMMING 43 2.3.4
ALGEBRAIC MODELING LANGUAGES 49 2.3.5 SUMMARY ON MODELING FRAMEWORKS 53
2.4 FURTHER ISSUES 53 2.4.1 SPECIFIC INPUT CHARACTERISTICS 55 2.4.
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1004244312 DIGITALISIERT
DURCH XII CONTENTS CHAPTER 3. SELECTED DESIGN ISSUES S. HELWIG, F.
HIIFFNCR, I. ROESSLING, M. WEINARD 58 3.1 INTRODUCTION 58 3.2 SIMPLICITY
GO 3.2.1 ADVANTAGES FOR IMPLEMENTATION 61 3.2.2 HOW TO ACHIEVE
SIMPLICITY? 61 3.2.3 EFFECTS ON ANALYSIS 65 3.3 SCALABILITY 67 3.3.1
TOWARDS A DEFINITION OF SCALABILITY 68 3.3.2 SCALABILITY IN PARALLEL
COMPUTING 70 3.3.3 BASIC TECHNIQUES FOR DESIGNING SCALABLE ALGORITHMS 73
3.3.1 SCALABILITY IN GRID COMPUTING AND PEER-TO-PEER NETWORKS . 76 3.1
TIME-SPACE TRADE-OFFS 80 3.1.1 FORMAL MET HODS 82 3.1.2 REUSE AND LOOKUP
TABLES 84 3.1.3 TIME-SPACE TRADE-OFFS IN STORING DATA 89 3.1.1
PREPROCESSING 92 3.1.5 BRUTE FORCE SUPPORT 93 3.5 ROBUSTNESS 95 3.5.1
SOFTWARE ENGINEERING ASPECTS 90 3.5.2 NUMERICAL ROBUSTNESS ISSUES 108
3.5.3 ROBUSTNESS IN COMPUTATIONAL GEOMETRY 113 CHAPTER 1. ANALYSIS OF
ALGORITHMS //. ACKCNNNNN. H. ROEGLIN, LI. SCHDLBACH, N. SCHWCC.R 127 1.1
INTRODUCTION AND MOTIVATION 127 4.2 WORST-CASE AND AVERAGE-CASE ANALYSIS
130 *1.2.1 WORST-CAW ANALYSIS 131 1.2.2 AVERAGE-CASE ANALYSIS 132 4.3
AMORTIZED ANALYSIS 134 4.3.1 AGGREGATE ANALYSIS 136 4.3.2 THE ACCOUNTING
METHOD 136 4.3.3 THE POTENTIAL METHOD 136 4.3.4 ONLINE ALGORITHMS AND
DATA STRUCTURES 138 4.4 SMOOTHED ANALYSIS 140 4.4.1 SMOOTHED ANALYSIS OF
BINARY OPTIMIZATION PROBLEMS 141 4.1. CONTENTS XIII 4.7.1 IDENTIFYING
REPRESENTATIVE OPERATIONS 170 4.7.2 APPLICATIONS OF REPRESENTATIVE
OPERATION COUNTS 171 4.8 EXPERIMENTAL STUDY OF ASYMPTOTIC PERFORMANCE
173 4.8.1 PERFORMANCE ANALYSIS INSPIRED BY THE SCIENTIFIC METHOD 175
4.8.2 EMPIRICAL CURVE BOUNDING RULES 178 4.8.3 CONCLUSIONS ON THE
EXPERIMENTAL STUDY OF ASYMPTOTIC PERFORMANCE 191 4.9 CONCLUSIONS 192
CHAPTER 5. REALISTIC COMPUTER MODELS D. AJWANI, H. MEYERHENKE 194 5.1
INTRODUCTION 194 5.1.1 LARGE DATA SETS 194 5.1.2 RAM MODEL 196 5.1.3
REAL ARCHITECTURE 196 5.1.4 DISADVANTAGES OF THE RAM MODEL 198 5.1.5
FUTURE TRENDS 199 5.1.6 REALISTIC COMPUTER MODELS 199 5.2 EXPLOITING THE
MEMORY HIERARCHY 200 5.2.1 MEMORY HIERARCHY MODELS 200 5.2.2 FUNDAMENTAL
TECHNIQUES 203 5.2.3 EXTERNAL MEMORY DATA STRUCTURES 206 5.2.4
CACHE-AWARE OPTIMIZATION 209 5.2.5 CACHE-OBLIVIOUS ALGORITHMS 214 5.2.6
CACHE-OBLIVIOUS DATA STRUCTURES 217 5.3 PARALLEL COMPUTING MODELS 218
5.3.1 PRAM 219 5.3.2 NETWORK MODELS 220 5.3.3 BRIDGING MODELS 220 5.3.4
RECENT WORK 223 5.3.5 APPLICATION AND COMPARISON 225 5.4 SIMULATING
PARALLEL ALGORITHMS FOR I/O-EFFICIENCY 229 5.4.1 PRAM SIMULATION 229
5.4.2 COARSE-GRAINED PARALLEL SIMULATION RESULTS 230 5.5 SUCCESS STORIES
OF ALGORITHMS FOR MEMORY HIERARCHIES 233 5.5.1 CACHE-OBLIVIOUS SORTING
233 5.5. XIV CONTENTS CHAPTER 6. IMPLEMENTATION ASPECTS M. MOERIG, S.
SCHOLZ, T. TSCHEUSDINER, E. BERBERICH 237 6.1 INTRODUCTION 237 6.2
CORRECTNESS 239 6.2.1 MOTIVATION AND DESCRIPTION 239 6.2.2 TESTING 239
6.2.3 CHECKING 242 6.2.4 VERIFICATION 245 6.2.5 DEBUGGING 246 6.3
EFFICIENCY 248 6.3.1 IMPLEMENTATION TRICKS - TUNING THE ALGORITHMS 250
6.3.2 IMPLEMENTATION TRICKS - TUNING THE CODE 254 6.3.3 CODE GENERATION
259 6.4 FLEXIBILITY 262 6.4.1 ACHIEVING FLEXIBILITY 263 6.5 EASE OF USE
267 6.5.1 INTERFACE DESIGN 267 6.5.2 DOCUMENTATION AND READABILITY 268
6.5.3 LITERATE PROGRAMMING 271 6.6 IMPLEMENTING EFFICIENTLY 273 6.6.1
REUSE 273 6.6.2 PROGRAMMING LANGUAGE 273 6.6.3 DEVELOPMENT ENVIRONMENT
275 6.6.4 AVOIDING ERRORS 275 6.6.5 VERSIONING 276 6.7 GEOMETRIC
ALGORITHMS 276 6.7.1 CORRECTNESS: EXACT NUMBER TYPES 278 6.7.2
EFFICIENCY: FLOATING-POINT FILTERS AND OTHER TECHNIQUES 280 6.7.3 EASY
TO USE: THE NUMBER TYPES CORE: :EXPR AND LEDA: :REAL 286 CHAPTER 7.
LIBRARIES R. DEMENTIEV, J. SINGLER 290 7.1 INTRODUCTION 290 7.2 LIBRARY
OVERVIEW 292 7.3 LIBRARIES AS BUILDING BLOCKS 297 7.4 BASIC DESIGN GOALS
AND PARADIGMS OF COMBINATORIAL AND GEOMETRIC LIBRARIES 299 7.5
FUNDAMENTAL OPERATIONS 302 7.5. CONTENTS XV 7.7.2 ALGORITHMS 310 7.7.3
SUMMARY AND COMPARISON 314 7.8 GRAPH DATA STRUCTURES AND ALGORITHMS 314
7.8.1 DATA STRUCTURES 314 7.8.2 NODE AND EDGE DATA 315 7.8.3 ALGORITHMS
316 7.8.4 SUMMARY AND COMPARISON 318 7.9 COMPUTATIONAL GEOMETRY 319
7.9.1 KERNELS AND EXACT NUMBER TYPES 319 7.9.2 LOW-LEVEL ISSUES IN
GEOMETRIC KERNELS 321 7.9.3 FUNCTIONALITY 322 7.9.4 PERFORMANCE 323 7.10
CONCLUSION 324 CHAPTER 8. EXPERIMENTS E. BERBERICH, M. HAGEN, B. HILLER,
H. MOSER 325 8.1 INTRODUCTION 325 8.1.1 EXAMPLE SCENARIOS 325 8.1.2 THE
IMPORTANCE OF EXPERIMENTS 327 8.1.3 THE EXPERIMENTATION PROCESS 329 8.2
PLANNING EXPERIMENTS 331 8.2.1 INTRODUCTION 332 8.2.2 MEASURES 333 8.2.3
FACTORS AND SAMPLING POINTS 335 8.2.4 ADVANCED TECHNIQUES 337 8.3 TEST
DATA GENERATION 339 8.3.1 PROPERTIES TO HAVE IN MIND 339 8.3.2 THREE
TYPES OF TEST INSTANCES 342 8.3.3 WHAT INSTANCES TO USE 346 8.4 TEST
DATA LIBRARIES 347 8.4.1 PROPERTIES OF A PERFECT LIBRARY 347 8.4.2 THE
CREATION OF A LIBRARY 349 8.4.3 MAINTENANCE AND UPDATE OF A LIBRARY 350
8.4.4 EXAMPLES OF EXISTING LIBRARIES 351 8.5 SETTING-UP AND RUNNING THE
EXPERIMENT 353 8.5.1 SETUP-PHASE 354 8.5.2 RUNNING-PHASE 360 8.5.3
SUPPLEMENTARY ADVICE 364 8.6 EVALUATING YOUR DATA 367 8.6. XVI CONTENTS
CHAPTER 9. CASE STUDIES D. DELLING, R. HOFFMANN, M. KANDYBA, A. SCHULZE
389 9.1 INTRODUCTION 389 9.2 SHORTEST PATHS 390 9.2.1 PHASE I: "THEORY"
(1959 - 1999) 392 9.2.2 PHASE II: SPEED-UP TECHNIQUES FOR P2P (1999 -
2005) 394 9.2.3 PHASE III: ROAD NETWORKS (2005 - 2008) 398 9.2.4 PHASE
IV: NEW CHALLENGES ON P2P (SINCE 2008) 403 9.2.5 CONCLUSIONS 407 9.3
STEINER TREES 407 9.3.1 PROGRESS WITH EXACT ALGORITHMS 410 9.3.2
APPROXIMATION ALGORITHMS AND HEURISTICS 422 9.3.3 CONCLUSIONS 426 9.4
VORONOI DIAGRAMS 427 9.4.1 NEAREST NEIGHBOR REGIONS 428 9.4.2
APPLICATIONS 430 9.4.3 ALGORITHMS 431 9.4.4 THE IMPLEMENTATION QUEST 434
9.4.5 THE EXACT GEOMETRIC COMPUTATION PARADIGM FOR THE COMPUTATION OF
VORONOI DIAGRAMS 434 9.4.6 TOPOLOGY-ORIENTED INEXACT APPROACHES 438
9.4.7 AVAILABLE IMPLEMENTATIONS 440 9.4.8 CONCLUSIONS 444 CHAPTER 10.
CHALLENGES IN ALGORITHM ENGINEERING M. MUELLER-HANNEMANN, S. SCHIRRA 446
10.1 CHALLENGES FOR THE ALGORITHM ENGINEERING DISCIPLINE 446 10.1.1
REALISTIC HARDWARE MODELS 447 10.1.2 CHALLENGES IN THE APPLICATION
MODELING AND DESIGN PHASE . 448 10.1.3 CHALLENGES IN THE ANALYSIS
PHASE 449 10.1.4 CHALLENGES IN THE IMPLEMENTATION PHASE 449 10.1.5
CHALLENGES IN THE EXPERIMENTATION PHASE 450 10.1.6 INCREASE THE
COMMUNITY! 452 10.2 EPILOGUE 453 REFERENCE |
| any_adam_object | 1 |
| author_GND | (DE-588)120046598 |
| building | Verbundindex |
| bvnumber | BV036616778 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)660152487 (DE-599)DNB1004244312 |
| dewey-full | 004.015181 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015181 |
| dewey-search | 004.015181 |
| dewey-sort | 14.015181 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV036616778</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101004</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100816s2010 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N28</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1004244312</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642148651</subfield><subfield code="c">PB. : EUR 74.90 (freier Pr.), sfr 109.00 (freier Pr.)</subfield><subfield code="9">978-3-642-14865-1</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642148651</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">80020210</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)660152487</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1004244312</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015181</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68W40</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68W01</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm engineering</subfield><subfield code="b">bridging the gap between algorithm theory and practice</subfield><subfield code="c">Matthias Müller-Hannemann (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 513 S.</subfield><subfield code="b">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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5971 Tutorial</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Anwendungssystem</subfield><subfield code="0">(DE-588)4139375-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Anwendungssystem</subfield><subfield code="0">(DE-588)4139375-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller-Hannemann, Matthias</subfield><subfield code="d">1969-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)120046598</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5971 Tutorial</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5971</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=3500796&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">DNB Datenaustausch</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=020536901&sequence=000001&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-020536901</subfield></datafield></record></collection> |
| genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV036616778 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T10:44:21Z |
| institution | BVB |
| isbn | 9783642148651 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020536901 |
| oclc_num | 660152487 |
| open_access_boolean | |
| owner | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 DE-703 DE-29T |
| owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 DE-703 DE-29T |
| physical | XVI, 513 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithm engineering bridging the gap between algorithm theory and practice Matthias Müller-Hannemann (eds.) Berlin [u.a.] Springer 2010 XVI, 513 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5971 Tutorial Anwendungssystem (DE-588)4139375-2 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Algorithmentheorie (DE-588)4200409-3 s Effizienter Algorithmus (DE-588)4125422-3 s Anwendungssystem (DE-588)4139375-2 s DE-604 Müller-Hannemann, Matthias 1969- Sonstige (DE-588)120046598 oth Lecture notes in computer science 5971 Tutorial (DE-604)BV000000607 5971 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3500796&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020536901&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithm engineering bridging the gap between algorithm theory and practice Lecture notes in computer science Anwendungssystem (DE-588)4139375-2 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Algorithmentheorie (DE-588)4200409-3 gnd |
| subject_GND | (DE-588)4139375-2 (DE-588)4125422-3 (DE-588)4200409-3 (DE-588)4143413-4 |
| title | Algorithm engineering bridging the gap between algorithm theory and practice |
| title_auth | Algorithm engineering bridging the gap between algorithm theory and practice |
| title_exact_search | Algorithm engineering bridging the gap between algorithm theory and practice |
| title_full | Algorithm engineering bridging the gap between algorithm theory and practice Matthias Müller-Hannemann (eds.) |
| title_fullStr | Algorithm engineering bridging the gap between algorithm theory and practice Matthias Müller-Hannemann (eds.) |
| title_full_unstemmed | Algorithm engineering bridging the gap between algorithm theory and practice Matthias Müller-Hannemann (eds.) |
| title_short | Algorithm engineering |
| title_sort | algorithm engineering bridging the gap between algorithm theory and practice |
| title_sub | bridging the gap between algorithm theory and practice |
| topic | Anwendungssystem (DE-588)4139375-2 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Algorithmentheorie (DE-588)4200409-3 gnd |
| topic_facet | Anwendungssystem Effizienter Algorithmus Algorithmentheorie Aufsatzsammlung |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3500796&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=020536901&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT mullerhannemannmatthias algorithmengineeringbridgingthegapbetweenalgorithmtheoryandpractice |