The following pages link to Michel Schellekens (Q818424):
Displaying 39 items.
- (Q387003) (redirect page) (← links)
- Running time of the treapsort algorithm (Q387004) (← links)
- (Q536035) (redirect page) (← links)
- Complexity spaces as quantitative domains of computation (Q536037) (← links)
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science (Q692921) (← links)
- Partial metric monoids and semivaluation spaces (Q818425) (← links)
- Partial quasi-metrics (Q854183) (← links)
- Applications of the complexity space to the general probabilistic divide and conquer algorithms (Q947570) (← links)
- An extension of the dual complexity space and an application to computer science (Q1032953) (← links)
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis (Q1044673) (← links)
- A characterization of partial metrizability: Domains are quantifiable. (Q1427788) (← links)
- On the Yoneda completion of a quasi-metric space (Q1605178) (← links)
- Quasi-metric properties of complexity spaces (Q1807591) (← links)
- The correspondence between partial metrics and semivaluations (Q1826629) (← links)
- Complexity analysis via approach spaces (Q2015820) (← links)
- Entropy conservation for comparison-based algorithms (Q2077296) (← links)
- (Q2706892) (← links)
- The quasi-metric of complexity convergence (Q2710078) (← links)
- (Q2843626) (← links)
- (Q2843627) (← links)
- (Q2863890) (← links)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics (Q3008383) (← links)
- Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort (Q3453737) (← links)
- The Smyth Completion (Q4222778) (← links)
- (Q4229136) (← links)
- (Q4373434) (← links)
- (Q4500931) (← links)
- (Q4513583) (← links)
- (Q4522472) (← links)
- Extendible spaces (Q4800192) (← links)
- Duality and quasi-normability for complexity spaces (Q4806538) (← links)
- Weightable quasi-metric semigroups and semilattices (Q4923383) (← links)
- A Random Bag Preserving Product Operation (Q4982071) (← links)
- Sorting Algorithms in MOQA (Q4982076) (← links)
- Approximating SP-orders through total preorders: incomparability and transitivity through permutations (Q5236078) (← links)
- Interoperability of Performance and Functional Analysis for Electronic System Designs in Behavioural Hybrid Process Calculus (BHPC) (Q5302400) (← links)
- Binary trees equipped with semivaluations (Q5426701) (← links)
- (Q5476720) (← links)
- (Q5757092) (← links)
