Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Certifying and repairing solutions to large LPs how good are LP-solvers?
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Rewriting, inference, and proof
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
| Hi-index | 0.00 |
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]. In comparison, algorithmic software is in its infancy. For many fundamental algorithmic tasks no reliable implementations are available due to a lack of understanding of the principles underlying reliable algorithmic software, some examples are given during the talk. The challenge is - to work out the principles underlying reliable algorithmic software and - to create a comprehensive collection of reliable algorithmic software components. I describe what I consider a major challenge in algorithmics, and then outline some venues of attack.