000 03872nam a22006255i 4500
001 978-3-540-44688-0
003 DE-He213
005 20170515111527.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540446880
_9978-3-540-44688-0
024 7 _a10.1007/3-540-44688-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithm Engineering
_h[electronic resource] :
_b5th International Workshop, WAE 2001 Århus, Denmark, August 28–31, 2001 Proceedings /
_cedited by Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2001.
300 _aX, 202 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2141
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aData structures (Computer science).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aProgramming Techniques.
650 2 4 _aData Structures, Cryptology and Information Theory.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
700 1 _aBrodal, Gerth Stølting.
_eeditor.
700 1 _aFrigioni, Daniele.
_eeditor.
700 1 _aMarchetti-Spaccamela, Alberto.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540425007
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2141
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-44688-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _2ddc
_cEB
950 _aComputer Science (Springer-11645)
999 _c15091
_d15091