2011
DOI: 10.1016/j.cosrev.2010.09.009
|View full text |Cite
|
Sign up to set email alerts
|

Certifying algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
115
0
12

Year Published

2011
2011
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 146 publications
(128 citation statements)
references
References 93 publications
1
115
0
12
Order By: Relevance
“…Our approach applies to any problem for which a certifying algorithm is known; see [13] for a survey. Most algorithms in LEDA [14] are certifying and, in future work, we plan to verify all of them.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Our approach applies to any problem for which a certifying algorithm is known; see [13] for a survey. Most algorithms in LEDA [14] are certifying and, in future work, we plan to verify all of them.…”
Section: Discussionmentioning
confidence: 99%
“…A certifying algorithm [3,18,13] produces with each output a certificate or witness that the particular output is correct. By inspecting the witness, the user can convince himself that the output is correct, or reject the output as buggy.…”
Section: Introductionmentioning
confidence: 99%
“…A state of art of certifying algorithms was published in 2011 [59] by McConell, Mehlhorn, Näher and Schweitzer.…”
Section: Theorem 12mentioning
confidence: 99%
“…McConnell, Mehlhorn, Näher, and Schweitzer [80] review certifiable algorithms that produce an easy-toverify certificate that the output of the algorithm is correct. Yet such designs in general are not tolerant against tail events.…”
Section: Verifiable or Error-tolerant Algorithmsmentioning
confidence: 99%