Cover Image
Read Now

Algorithm Engineering and Experimentation International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers

Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid...

Full description

Bibliographic Details
Other Authors: Goodrich, Michael T. (Editor), McGeoch, Catherine C. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1999, 1999
Edition:1st ed. 1999
Series:Lecture Notes in Computer Science
Subjects:
Artificial Intelligence / Data Processing
Computer Graphics
Programming Techniques
Computer Programming
Algorithms
Data Structures And Information Theory
Application Software
Information Theory
Data Structures (computer Science)
Computer And Information Systems Applications
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Combinatorial Algorithms
  • Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes
  • Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
  • Designing Practical Efficient Algorithms for Symmetric Multiprocessors
  • Circular Drawings of Biconnected Graphs
  • Heuristics and Experimental Design for Bigraph Crossing Number Minimization
  • Binary Space Parititions in Plücker Space
  • Practical Point-in-Polygon Tests Using CSG Representations of Polygons
  • Software and Applications
  • Accessing the Internal Organization of Data Structures in the JDSL Library
  • Object-Oriented Design of Graph Oriented Data Structures
  • A Case Study on the Cost of Geometric Computing
  • Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
  • Algorithms for Restoration Planning in a Telecommunications Network
  • Computing the n × m Shortest Paths Efficiently
  • Image Watermarking for Copyright Protection
  • Algorithms for NP-Hard Problems
  • A Self Organizing Bin Packing Heuristic
  • Finding the Right Cutting Planes for the TSP
  • Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
  • Data Structures
  • Adaptive Algorithms for Cache-efficient Trie Search
  • Fast Priority Queues for Cached Memory
  • Efficient Bulk Operations on Dynamic R-trees

Similar Items