Entropy conservation for comparison-based algorithms (Q2077296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running time of the treapsort algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Hausdorff Topology and Domain Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating SP-orders through total preorders: incomparability and transitivity through permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and semivaluations on semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling concurrency with partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of partial metrizability: Domains are quantifiable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correspondence between partial metrics and semivaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Heapsort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank

Latest revision as of 03:58, 28 July 2024

scientific article
Language Label Description Also known as
English
Entropy conservation for comparison-based algorithms
scientific article

    Statements

    Entropy conservation for comparison-based algorithms (English)
    0 references
    25 February 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    comparison-based algorithms
    0 references
    sorting and searching
    0 references
    linear extensions
    0 references
    topological sorts
    0 references
    partial orders
    0 references
    series-parallel partial orders
    0 references
    data structures
    0 references
    entropy
    0 references
    0 references
    0 references