Verified analysis of random binary tree structures (Q5919010): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Monad normalisation / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Probabilistic_Prime_Tests / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quicksort / 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.1007/s10817-020-09545-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3004733293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of randomized algorithms in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of code-based cryptographic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CryptHOL: game-based proofs in higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated recurrence analysis for almost-linear expected-runtime bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified analysis of random binary tree structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Verified Compiler for Probability Density Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalising Semantics for Expected Running Time of Probabilistic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and Markov decision processes in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Chapters of Measure Theory in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Functions and Cryptographic Oracles in Higher Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Complexity Verified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Functional Correctness Proofs for Functional Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Root-Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmen und Datenstrukturen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The height of a random binary search tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of Quicksort programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified tail bounds for randomized programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq / rank
 
Normal rank

Latest revision as of 22:40, 23 July 2024

scientific article; zbMATH DE number 7268890
Language Label Description Also known as
English
Verified analysis of random binary tree structures
scientific article; zbMATH DE number 7268890

    Statements

    Verified analysis of random binary tree structures (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2020
    0 references
    binary search trees
    0 references
    randomised data structures
    0 references
    randomised algorithms
    0 references
    quicksort
    0 references
    Isabelle
    0 references
    interactive theorem proving
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references