The Reliable Algorithmic Software Challenge RASC

Mehlhorn, Kurt

doi:10.1007/3-540-36477-3_19

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

The Reliable Algorithmic Software Challenge RASC

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K. (2003). The Reliable Algorithmic Software Challenge RASC. In K. Jansen, M. Margraf, M. Mastrolli, & J. D. P. Rolim (Eds.), Experimental and efficient algorithms (pp. 222-222). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-EE28-B

Abstract

Algorithms are the heart of computer science. They make systems work. The theory of algorithms, i.e., their design and their analysis, is a highly developed part of theoretical computer science [7].