The Smyth completion: a common foundation for denotational semantics and complexity analysis. - Michel P. Schellekens (MFPS, 1995)

The ideal completion is not sequentially adequate. - Hans-Peter A. Künzi; Michel P. Schellekens (Workshop on Domains, 1998)

Valuations revisited. - Michel P. Schellekens (IWFM, 1999)

Weightable quasi-metric semigroups and semilattices. - Salvador Romaguera; Michel P. Schellekens (MFCSIT, 2000)

Norm-weightable Riesz spaces and the dual complexity space. - Maria O'Keeffe; Salvador Romaguera; Michel P. Schellekens (MFCSIT, 2002)

Average merge time: an intuitive interpretation. - Maria O'Keeffe; Michel P. Schellekens (MFCSIT, 2002)

On the Yoneda completion of a quasi-metric space. - Hans-Peter A. Künzi; Michel P. Schellekens (Theor. Comput. Sci., 2002)

A characterization of partial metrizability: domains are quantifiable. - Michel P. Schellekens (Theor. Comput. Sci., 2003)

Decision Trees of Algorithms and a Semivaluation to Measure Their Distance. - Maria O'Keeffe; Homeira Pajoohesh; Michel P. Schellekens (MFCSIT, 2004)

Preface. - Anthony Karel Seda; Ted Hurley; Michel P. Schellekens; Mícheál Mac an Airchinnigh; Glenn Strong (MFCSIT, 2004)

The correspondence between partial metrics and semivaluations. - Michel P. Schellekens (Theor. Comput. Sci., 2004)

A Random Bag Preserving Product Operation. - Michel P. Schellekens (MFCSIT, 2006)

Preface. - Anthony Karel Seda; Menouer Boubekeur; Ted Hurley; Mícheál Mac an Airchinnigh; Michel P. Schellekens; Glenn Strong (MFCSIT, 2006)

Sorting Algorithms in MOQA. - Jacinta Townley; Joseph Manning; Michel P. Schellekens (MFCSIT, 2006)

A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons. - Michel P. Schellekens; Rachit Agarwal 001; Emanuel M. Popovici; Ka Lok Man (Nord. J. Comput., 2006)

Partial quasi-metrics. - Hans-Peter A. Künzi; Homeira Pajoohesh; Michel P. Schellekens (Theor. Comput. Sci., 2006)

Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits. - Menouer Boubekeur; Michel P. Schellekens (ICECS, 2007)

SC2SCFL: Automated SystemC to SystemCFL Translation. - Ka Lok Man; Andrea Fedeli; Michele Mercaldi; Menouer Boubekeur; Michel P. Schellekens (SAMOS, 2007)

Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. - Ka Lok Man; Michel P. Schellekens (Eng. Lett., 2007)

A modular calculus for the average cost of data structuring. - Michel P. Schellekens (Springer, 2008)

HotSpot: Visualizing dynamic power consumption in RTL designs. - Tom English; Ka Lok Man; Emanuel M. Popovici; Michel P. Schellekens (EWDTS, 2008)

A tool for average and worst-case execution time analysis. - David Hickey; Diarmuid Early; Michel P. Schellekens (WCET, 2008)

A low-power pairing-based cryptographic accelerator for embedded security applications. - Tom English; Maurice Keller; Ka Lok Man; Emanuel M. Popovici; Michel P. Schellekens; William P. Marnane (SoCC, 2009)

Reversible online BIST using bidirectional BILBO. - Jiaoyan Chen 002; Dilip P. Vasudevan; Emanuel M. Popovici; Michel P. Schellekens (Conf. Computing Frontiers, 2010)

Static Average Case Power Estimation Technique for Block Ciphers. - Tingcong Ye; Dilip P. Vasudevan; Jiaoyan Chen 002; Emanuel M. Popovici; Michel P. Schellekens (DSD, 2010)

Design and analysis of a novel 8T SRAM cell for adiabatic and non-adiabatic operations. - Jiaoyan Chen 002; Dilip P. Vasudevan; Emanuel M. Popovici; Michel P. Schellekens; Peter Gillen (ICECS, 2010)

Delay dependent power optimisation of combinational circuits using AND-Inverter graphs. - Rashmi Mehrotra; Tom English; Emanuel M. Popovici; Michel P. Schellekens (SoCC, 2010)

MO2A; unlocking the potential of compositional static average-case analysis. - Michel P. Schellekens (J. Log. Algebraic Methods Program., 2010)

Design of a Low Power, Sub-Threshold, Asynchronous Arithmetic Logic Unit Using a Bidirectional Adder. - Jiaoyan Chen 002; Dilip P. Vasudevan; Emanuel M. Popovici; Michel P. Schellekens (DSD, 2011)

Eliminating implicit dependencies in component models. - Wouter Horré; Danny Hughes 001; Ka Lok Man; Steven Guan 001; Binbin Qian; Tianlin Yu; Haofan Zhang; Zhun Shen; Michel P. Schellekens; Steve Hollands (NESEA, 2011)

Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method. - Ang Gao; Kenneth Rea; Michel P. Schellekens (PARELEC, 2011)

The complexity space of partial functions: a connection between complexity analysis and denotational semantics. - Salvador Romaguera; Michel P. Schellekens; Óscar Valero (Int. J. Comput. Math., 2011)

Timing-Driven Power Optimisation and Power-Driven Timing Optimisation of Combinational Circuits. - Rashmi Mehrotra; Tom English; Michel P. Schellekens; Steve Hollands; Emanuel M. Popovici (J. Low Power Electron., 2011)

Ultra Low Power Booth Multiplier Using Asynchronous Logic. - Jiaoyan Chen 002; Emanuel M. Popovici; Dilip P. Vasudevan; Michel P. Schellekens (ASYNC, 2012)

Frugal Encoding in Reversible MOQA: A Case Study for Quicksort. - Diarmuid Early; Ang Gao; Michel P. Schellekens (RC, 2012)

Ultra Low Power Asynchronous Charge Sharing Logic. - Jiaoyan Chen 002; Dilip P. Vasudevan; Michel P. Schellekens; Emanuel M. Popovici (J. Low Power Electron., 2012)

The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. - M. A. Cerdà-Uguet; Michel P. Schellekens; Óscar Valero (Theory Comput. Syst., 2012)

Running time of the Treapsort algorithm. - Diarmuid Early; Michel P. Schellekens (Theor. Comput. Sci., 2013)

Complexity Analysis via Approach Spaces. - Eva Colebunders; Stefan De Wachter; Michel P. Schellekens (Appl. Categorical Struct., 2014)

A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms. - Bichen Shi; Michel P. Schellekens; Georgiana Ifrim (CoRR, 2015)

Entropy conservation for comparison-based algorithms. - Michel P. Schellekens (CoRR, 2020)