Pages that link to "Item:Q4903466"

The following pages link to New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces (Q4903466):

Displaying 12 items.

• A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms (Q266307) (← links)
• Complexity analysis via approach spaces (Q2015820) (← links)
• New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs (Q2017395) (← links)
• On Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspective (Q2175511) (← links)
• Fixed point theorems in generalized metric spaces with applications to computer science (Q2252670) (← links)
• Metric aggregation functions revisited (Q2311381) (← links)
• On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702) (← links)
• On quasi-metric aggregation functions and fixed point theorems (Q2445564) (← links)
• A characterisation of weightable quasi-metric generating functions (Q5056518) (← links)
• On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms (Q5152986) (← links)
• (Q5154534) (← links)
• Qualitative versus quantitative fixed point techniques in computer science (Q5236147) (← links)