Skip to main content
SpringerLink
Log in

Algorithm Engineering

  • HAUPTBEITRAG
  • ALGORITHM ENGINEERING
  • Published:
Informatik-Spektrum Aims and scope

Zusammenfassung

Algorithm Engineering ist eine Methodik zur Erforschung von Algorithmen, die Lücken zwischen Theorie und Praxis überbrücken soll. Dabei ist der wichtigste Vorgang ein Kreislauf aus Entwurf, Analyse, Implementierung und experimenteller Bewertung von Algorithmen. Realistische Modelle für Anwendung und Maschine, sowie realistische Eingaben für die Experimente bewirken eine enge Kopplung an Anwendungen. Leistungsgarantien und Algorithmenbibliotheken ermöglichen einen nachhaltigen Transfer der Ergebnisse zurück zu den Anwendungen.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Aho AV, Johnson DS, Karp RM, Rao Kosaraju S, McGeoch CC, Papadimitriou CH, Pevzner P (1997) Emerging opportunities for theoretical computer science. SIGACT News 28(3):65–74

    Article  Google Scholar 

  2. Beier R, Vöcking B (2003) Random knapsack in expected polynomial time. In: 35th ACM Symposium on Theory of Computing

  3. Beth T, Clausen M (eds) (1988) Applied algebra, algebraic algorithms and error-correcting codes. In: Proceedings of the 4th International Conference, AAECC-4, Karlsruhe, FRG, 23–26 September 1986, vol. 307 of Lecture Notes in Computer Science, Springer

  4. Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, vol. 5515 of LNCS State-of-the-Art Survey, Springer, pp 117–139

  5. Fleischer R, Moret B, Schmidt EM (eds) (2002) Experimental algorithmics: from algorithm design to robust and efficient software, vol. 2547 of LNCS, Springer

  6. Johnson DS (2002) A theoretician’s guide to the experimental analysis of algorithms. In: Goldwasser M, Johnson DS, McGeoch CC (eds) Proceedings of the 5th and 6th DIMACS Implementation Challenges. American Mathematical Society

  7. Kettner L, Mehlhorn K, Pion S, Schirra S, Yap C-K (2008) Classroom examples of robustness problems in geometric computations. Comput Geom 40(1):61–78

    Article  MATH  MathSciNet  Google Scholar 

  8. Mehlhorn K, Näher S (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press

  9. Meyer U, Sanders P, Sibeyn J (eds) (2003) Algorithms for Memory Hierarchies, vol. 2625 of LNCS Tutorial, Springer

  10. Sanders P (2009) Algorithm engineering – an attempt at a definition. In: Efficient Algorithms, vol. 5760 of Lecture Notes in Computer Science, pp 321–340, Springer

  11. Vitter JS, Shriver EAM (1994) Algorithms for parallel memory, I: Two level memories. Algorithmica 12(2–3):110–147

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institut für Technologie, 76128, Karlsruhe, Deutschland

    Peter Sanders

Authors
  1. Peter Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Sanders.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sanders, P. Algorithm Engineering. Informatik Spektrum 33, 475–478 (2010). https://doi.org/10.1007/s00287-010-0464-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-010-0464-0

Search

Navigation