Cantitate/Preț
Produs

Algorithm Engineering: 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings: Lecture Notes in Computer Science, cartea 1668

Editat de Jeffrey S. Vitter, Christos D. Zaroliagis
en Limba Engleză Paperback – 18 aug 1999

Din seria Lecture Notes in Computer Science

Preț: 33372 lei

Preț vechi: 41715 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6386 6627$ 5338£

Carte tipărită la comandă

Livrare economică 17-31 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540664277
ISBN-10: 3540664270
Pagini: 376
Ilustrații: VIII, 368 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.45 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras