000			03713nam a22005535i 4500
001			978-3-540-48318-2
003			DE-He213
005			20160624102033.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.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _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.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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, _x0302-9743 ; _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 science.
650		0	_aComputer Communication Networks.
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aCombinatorics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aNumeric Computing.
650	2	4	_aComputer Communication Networks.
650	2	4	_aCombinatorics.
650	2	4	_aDiscrete Mathematics in Computer Science.
700	1		_aVitter, Jeffrey S. _eeditor.
700	1		_aZaroliagis, Christos D. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540664277
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1668
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-48318-7
942			_2EBK6417 _cEBK
999			_c35711 _d35711