3 citations · 3 across the 3 of their papers we have counts for
4 papers
Entropy conservation for comparison-based algorithms
Michel Schellekens
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based co…
A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms
Bichen Shi, Michel Schellekens, Georgiana Ifrim
Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex a…
The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science
M. A. Cerdà-Uguet, M. P. Schellekens, O. Valero
In 1994, S.G. Matthews introduced the notion of partial metric space in order to obtain a suitable mathematical tool for program verification [Ann. New York Acad. Sci. 728 (1994),…
A survey of topological work at CEOL
Homeira Pajoohesh, M. P. Schellekens
We present an overview of ongoing work at the Centre for Efficiency-Oriented languages (CEOL), with a focus on topological aspects. CEOL researchers are engaged in designing a new…