|
|
|
|
| LEADER |
03064nmm a2200385 u 4500 |
| 001 |
EB001884584 |
| 003 |
EBX01000000000000001047951 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
191115 ||| eng |
| 020 |
|
|
|a 9783540483182
|
| 100 |
1 |
|
|a Vitter, Jeffrey S.
|e [editor]
|
| 245 |
0 |
0 |
|a Algorithm Engineering
|h Elektronische Ressource
|b 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings
|c edited by Jeffrey S. Vitter, Christos D. Zaroliagis
|
| 250 |
|
|
|a 1st ed. 1999
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1999, 1999
|
| 300 |
|
|
|a VIII, 368 p
|b online resource
|
| 505 |
0 |
|
|a Invited 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
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Zaroliagis, Christos D.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-48318-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-48318-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|