LEADER 04990nam 22008055 450 001 9910143627903321 005 20200706074717.0 010 $a3-540-44688-5 024 7 $a10.1007/3-540-44688-5 035 $a(CKB)1000000000211550 035 $a(SSID)ssj0000321159 035 $a(PQKBManifestationID)11246886 035 $a(PQKBTitleCode)TC0000321159 035 $a(PQKBWorkID)10263076 035 $a(PQKB)10971905 035 $a(DE-He213)978-3-540-44688-0 035 $a(MiAaPQ)EBC3072706 035 $a(PPN)155237101 035 $a(EXLCZ)991000000000211550 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Engineering $e5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001 Proceedings /$fedited by Gerd Stoelting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (X, 202 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2141 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42500-4 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aCompact DFA Representation for Fast Regular Expression Search -- The Max-Shift Algorithm for Approximate String Matching -- Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance -- Experiences with the Design and Implementation of Space-Efficient Deques -- Designing and Implementing a General Purpose Halfedge Data Structure -- Optimised Predecessor Data Structures for Internal Memory -- An Adaptable and Extensible Geometry Kernel -- Efficient Resource Allocation with Noisy Functions -- Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem -- Exploiting Partial Knowledge of Satisfying Assignments -- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture -- An Experimental Study of Data Migration Algorithms -- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks -- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry -- Pareto Shortest Paths is Often Feasible in Practice. 330 $aThis book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2141 606 $aComputers 606 $aComputer programming 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aComputer programming. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures. 676 $a005.1 702 $aBrodal$b Gerd Stoelting$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFrigioni$b Daniele$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMarchetti-Spaccamela$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWAE 2001 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143627903321 996 $aAlgorithm engineering$91980326 997 $aUNINA