Michel P. Schellekens

Publication Activity (10 Years)

Years Active: 1995-2015
Publications (10 Years): 1

Top Topics

Complexity Analysis

Classical Logic

Delay Insensitive

Top Venues

Appl. Categorical Struct.

Theory Comput. Syst.

Publications

Bichen Shi, Michel P. Schellekens, Georgiana Ifrim
A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms. CoRR (2015)
Eva Colebunders, Stefan De Wachter, Michel P. Schellekens
Complexity Analysis via Approach Spaces. Appl. Categorical Struct. 22 (1) (2014)
Diarmuid Early, Michel P. Schellekens
Running time of the Treapsort algorithm. Theor. Comput. Sci. 487 (2013)
M. A. Cerdà-Uguet, Michel P. Schellekens, Óscar Valero
The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. Theory Comput. Syst. 50 (2) (2012)
Jiaoyan Chen, Dilip P. Vasudevan, Michel P. Schellekens, Emanuel M. Popovici
Ultra Low Power Asynchronous Charge Sharing Logic. J. Low Power Electron. 8 (4) (2012)
Diarmuid Early, Ang Gao, Michel P. Schellekens
Frugal Encoding in Reversible MOQA: A Case Study for Quicksort. RC (2012)
Jiaoyan Chen, Emanuel M. Popovici, Dilip P. Vasudevan, Michel P. Schellekens
Ultra Low Power Booth Multiplier Using Asynchronous Logic. ASYNC (2012)
Rashmi Mehrotra, Tom English, Michel P. Schellekens, Steve Hollands, Emanuel M. Popovici
Timing-Driven Power Optimisation and Power-Driven Timing Optimisation of Combinational Circuits. J. Low Power Electron. 7 (3) (2011)
Ang Gao, Kenneth Rea, Michel P. Schellekens
Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method. PARELEC (2011)
Wouter Horré, Danny Hughes, Ka Lok Man, Steven Guan, Binbin Qian, Tianlin Yu, Haofan Zhang, Zhun Shen, Michel P. Schellekens, Steve Hollands
Eliminating implicit dependencies in component models. NESEA (2011)
Salvador Romaguera, Michel P. Schellekens, Óscar Valero
The complexity space of partial functions: a connection between complexity analysis and denotational semantics. Int. J. Comput. Math. 88 (9) (2011)
Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens
Design of a Low Power, Sub-Threshold, Asynchronous Arithmetic Logic Unit Using a Bidirectional Adder. DSD (2011)
Tingcong Ye, Dilip P. Vasudevan, Jiaoyan Chen, Emanuel M. Popovici, Michel P. Schellekens
Static Average Case Power Estimation Technique for Block Ciphers. DSD (2010)
Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens
Reversible online BIST using bidirectional BILBO. Conf. Computing Frontiers (2010)
Michel P. Schellekens
MO2A; unlocking the potential of compositional static average-case analysis. J. Log. Algebraic Methods Program. 79 (1) (2010)
Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens, Peter Gillen
Design and analysis of a novel 8T SRAM cell for adiabatic and non-adiabatic operations. ICECS (2010)
Rashmi Mehrotra, Tom English, Emanuel M. Popovici, Michel P. Schellekens
Delay dependent power optimisation of combinational circuits using AND-Inverter graphs. SoCC (2010)
M. A. Cerdà-Uguet, Michel P. Schellekens, Óscar Valero
The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science CoRR (2010)
Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong
Preface. Electron. Notes Theor. Comput. Sci. 225 (2009)
Jacinta Townley, Joseph Manning, Michel P. Schellekens
Sorting Algorithms in MOQA. Electron. Notes Theor. Comput. Sci. 225 (2009)
Michel P. Schellekens
A Random Bag Preserving Product Operation. Electron. Notes Theor. Comput. Sci. 225 (2009)
Tom English, Maurice Keller, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens, William P. Marnane
A low-power pairing-based cryptographic accelerator for embedded security applications. SoCC (2009)
Tom English, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens
HotSpot: Visualizing dynamic power consumption in RTL designs. EWDTS (2008)
David Hickey, Diarmuid Early, Michel P. Schellekens
A tool for average and worst-case execution time analysis. WCET (2008)
Ka L. Man, Michel P. Schellekens
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. IMECS (2007)
Ka Lok Man, Michel P. Schellekens
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. Eng. Lett. 15 (2) (2007)
Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens
Translation. SAMOS (2007)
Menouer Boubekeur, Michel P. Schellekens
Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits. ICECS (2007)
M. O'Keeffe, Homeira Pajoohesh, Michel P. Schellekens
Decision Trees of Algorithms and a Semivaluation to Measure Their Distance. Electron. Notes Theor. Comput. Sci. 161 (2006)
Michel P. Schellekens, Rachit Agarwal, Emanuel M. Popovici, Ka Lok Man
A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons. Nord. J. Comput. 13 (4) (2006)
Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens
Partial quasi-metrics. Theor. Comput. Sci. 365 (3) (2006)
Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong
Preface. Electron. Notes Theor. Comput. Sci. 161 (2006)
Michel P. Schellekens
The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. 315 (1) (2004)
Michel P. Schellekens
A characterization of partial metrizability: domains are quantifiable. Theor. Comput. Sci. 305 (1-3) (2003)
Hans-Peter A. Künzi, Michel P. Schellekens
On the Yoneda completion of a quasi-metric space. Theor. Comput. Sci. 278 (1-2) (2002)
M. O'Keeffe, Salvador Romaguera, Michel P. Schellekens
Norm-weightable Riesz spaces and the dual complexity space. Electron. Notes Theor. Comput. Sci. 74 (2002)
M. O'Keeffe, Michel P. Schellekens
Average merge time: an intuitive interpretation. Electron. Notes Theor. Comput. Sci. 74 (2002)
Hans-Peter A. Künzi, Michel P. Schellekens
The ideal completion is not sequentially adequate. Electron. Notes Theor. Comput. Sci. 35 (2000)
Salvador Romaguera, Michel P. Schellekens
Weightable quasi-metric semigroups and semilattices. Electron. Notes Theor. Comput. Sci. 40 (2000)
Michel P. Schellekens
Valuations revisited. IWFM (1999)
Michel P. Schellekens
The Smyth completion: a common foundation for denotational semantics and complexity analysis. MFPS (1995)