Certifying algorithms (Q465678): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CGAL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VCC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hull / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cosrev.2010.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W55887128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking geometric programs or verification of geometric structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on the Pentium division bug / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Kuratowski Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and detection of obstructions to planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new graph triconnectivity algorithm and its parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classroom examples of robustness problems in geometric computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational geometry algorithms library CGAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of correctness of data representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program result checking: A new approach to making programs more reliable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software reliability via run-time result-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction Sequences and Certifying 3-Connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on contractible edges in graphs of a prescribed vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of an optimal TSP tour through 85,900 cities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four results on randomized incremental constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational basis for higher-dimensional computational geometry and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking the convexity of polytopes and the planarity of subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-validating methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and Linear-Time Recognition of Probe Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Vertex Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rubber bands, convex embeddings and graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying and constructing minimally rigid graphs in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient local approach to convexity testing of piecewise-linear hypersurfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the O(m 2 n) Barrier for Minimum Cycle Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle bases in graphs characterization, algorithms, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correctness certificate for the Stoer-Wagner min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking the correctness of memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21--23, 2007. Revised papers / rank
 
Normal rank

Latest revision as of 05:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Certifying algorithms
scientific article

    Statements

    Certifying algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2014
    0 references
    0 references
    certifying algorithms
    0 references
    software reliability
    0 references
    certification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references