000			03948nam a22006255i 4500
001			978-3-540-48318-2
003			DE-He213
005			20240423132539.0
007			cr nn 008mamaa
008			121227s1999 gw | s |||| 0|eng d
020			_a9783540483182 _9978-3-540-48318-2
024	7		_a10.1007/3-540-48318-7 _2doi
050		4	_aQA76.6-76.66
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
072		7	_aUM _2thema
082	0	4	_a005.11 _223
245	1	0	_aAlgorithm Engineering _h[electronic resource] : _b3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings / _cedited by Jeffrey S. Vitter, Christos D. Zaroliagis.
250			_a1st ed. 1999.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999.
300			_aVIII, 368 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, _x1611-3349 ; _v1668
505	0		_aInvited Lectures -- Selecting Problems for Algorithm Evaluation -- BSP Algorithms — “Write Once, Run Anywhere” -- Ten Years of LEDA: Some Thoughts -- Contributed Papers -- Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison -- Efficient Implementation of Lazy Suffix Trees -- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism -- Finding Minimum Congestion Spanning Trees -- Evaluation of an Algorithm for the Transversal Hypergraph Problem -- Construction Heuristics and Domination Analysis for the Asymmetric TSP -- Counting in Mobile Networks: Theory and Experimentation -- Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport -- Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA -- On-Line Zone Construction in Arrangements of Lines in the Plane -- The Design and Implementation of Planar Maps in CGAL -- An Easy to Use Implementation of Linear Perturbations within Cupgal -- Analysing Cache Effects in Distribution Sorting -- Fast Regular Expression Search -- An Experimental Evaluation of Hybrid Data Structures for Searching -- LEDA-SM: Extending LEDA to Secondary Memory -- A Priority Queue Transform -- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks -- Estimating Large Distances in Phylogenetic Reconstruction -- The Performance of Concurrent Red-Black Tree Algorithms -- Performance Engineering Case Study: Heap Construction -- A Fast and Simple Local Search for Graph Coloring -- BALL: Biochemical Algorithms Library -- An Experimental Study of Priority Queues in External Memory.
650		0	_aComputer programming.
650		0	_aComputer science.
650		0	_aAlgorithms.
650		0	_aNumerical analysis.
650		0	_aComputer networks .
650		0	_aDiscrete mathematics.
650	1	4	_aProgramming Techniques.
650	2	4	_aTheory of Computation.
650	2	4	_aAlgorithms.
650	2	4	_aNumerical Analysis.
650	2	4	_aComputer Communication Networks.
650	2	4	_aDiscrete Mathematics.
700	1		_aVitter, Jeffrey S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aZaroliagis, Christos D. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540664277
776	0	8	_iPrinted edition: _z9783662168905
830		0	_aLecture Notes in Computer Science, _x1611-3349 ; _v1668
856	4	0	_uhttps://doi.org/10.1007/3-540-48318-7
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
912			_aZDB-2-BAE
942			_cSPRINGER
999			_c188978 _d188978