Michel P. Schellekens

According to our database, Michel P. Schellekens authored at least 41 papers between 1995 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Entropy conservation for comparison-based algorithms.

Michel P. Schellekens

CoRR, 2020

2015

A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms.

Bichen Shi, Michel P. Schellekens, Georgiana Ifrim

CoRR, 2015

2014

Complexity Analysis via Approach Spaces.

Eva Colebunders, Stefan De Wachter, Michel P. Schellekens

Appl. Categorical Struct., 2014

2013

Running time of the Treapsort algorithm.

Diarmuid Early, Michel P. Schellekens

Theor. Comput. Sci., 2013

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

Ultra Low Power Asynchronous Charge Sharing Logic.

Jiaoyan Chen, Dilip P. Vasudevan, Michel P. Schellekens, Emanuel M. Popovici

J. Low Power Electron., 2012

Frugal Encoding in Reversible MOQA: A Case Study for Quicksort.

Diarmuid Early, Ang Gao, Michel P. Schellekens

Proceedings of the Reversible Computation, 4th International Workshop, 2012

Ultra Low Power Booth Multiplier Using Asynchronous Logic.

Jiaoyan Chen, Emanuel M. Popovici, Dilip P. Vasudevan, Michel P. Schellekens

Proceedings of the 18th IEEE International Symposium on Asynchronous Circuits and Systems, 2012

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

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

Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method.

Ang Gao, Kenneth Rea, Michel P. Schellekens

Proceedings of the Sixth International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2011), 2011

Eliminating implicit dependencies in component models.

Wouter Horré, Danny Hughes, Ka Lok Man, Steven Guan, Binbin Qian, Tianlin Yu, Haofan Zhang, Zhun Shen, Michel P. Schellekens, Steve Hollands

Proceedings of the 2nd IEEE International Conference on Networked Embedded Systems for Enterprise Applications, 2011

Design of a Low Power, Sub-Threshold, Asynchronous Arithmetic Logic Unit Using a Bidirectional Adder.

Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens

Proceedings of the 14th Euromicro Conference on Digital System Design, 2011

2010

MO2A; unlocking the potential of compositional static average-case analysis.

Michel P. Schellekens

J. Log. Algebraic Methods Program., 2010

Delay dependent power optimisation of combinational circuits using AND-Inverter graphs.

Rashmi Mehrotra, Tom English, Emanuel M. Popovici, Michel P. Schellekens

Proceedings of the Annual IEEE International SoC Conference, SoCC 2010, 2010

Design and analysis of a novel 8T SRAM cell for adiabatic and non-adiabatic operations.

Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens, Peter Gillen

Proceedings of the 17th IEEE International Conference on Electronics, 2010

Static Average Case Power Estimation Technique for Block Ciphers.

Tingcong Ye, Dilip P. Vasudevan, Jiaoyan Chen, Emanuel M. Popovici, Michel P. Schellekens

Proceedings of the 13th Euromicro Conference on Digital System Design, 2010

Reversible online BIST using bidirectional BILBO.

Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens

Proceedings of the 7th Conference on Computing Frontiers, 2010

2009

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

Proceedings of the Annual IEEE International SoC Conference, SoCC 2009, 2009

2008

A tool for average and worst-case execution time analysis.

David Hickey, Diarmuid Early, Michel P. Schellekens

Proceedings of the 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2008

HotSpot: Visualizing dynamic power consumption in RTL designs.

Tom English, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens

Proceedings of the 2008 East-West Design & Test Symposium, 2008

A modular calculus for the average cost of data structuring.

Michel P. Schellekens

Springer, ISBN: 978-0-387-73383-8, 2008

2007

SC2SCFL: Automated SystemC to SystemC^FL Translation.

Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens

Proceedings of the Embedded Computer Systems: Architectures, 2007

Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt.

Ka L. Man, Michel P. Schellekens

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits.

Menouer Boubekeur, Michel P. Schellekens

Proceedings of the 14th IEEE International Conference on Electronics, 2007

2006

Partial quasi-metrics.

Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens

Theor. Comput. Sci., 2006

A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.

Michel P. Schellekens, Rachit Agarwal, Emanuel M. Popovici, Ka Lok Man

Nord. J. Comput., 2006

Sorting Algorithms in MOQA.

Jacinta Townley, Joseph Manning, Michel P. Schellekens

Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2006

Preface.

Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong

Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2006

A Random Bag Preserving Product Operation.

Michel P. Schellekens

Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2006

2004

The correspondence between partial metrics and semivaluations.

Michel P. Schellekens

Theor. Comput. Sci., 2004

Preface.

Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong

Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2004

Decision Trees of Algorithms and a Semivaluation to Measure Their Distance.

Maria O'Keeffe, Homeira Pajoohesh, Michel P. Schellekens

Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2004

2003

A characterization of partial metrizability: domains are quantifiable.

Michel P. Schellekens

Theor. Comput. Sci., 2003

2002

On the Yoneda completion of a quasi-metric space.

Hans-Peter A. Künzi, Michel P. Schellekens

Theor. Comput. Sci., 2002

Average merge time: an intuitive interpretation.

Maria O'Keeffe, Michel P. Schellekens

Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2002

Norm-weightable Riesz spaces and the dual complexity space.

Maria O'Keeffe, Salvador Romaguera, Michel P. Schellekens

Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2002

2000

Weightable quasi-metric semigroups and semilattices.

Salvador Romaguera, Michel P. Schellekens

Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

1999

Valuations revisited.

Michel P. Schellekens

Proceedings of the 3rd Irish Workshop on Formal Methods, Galway, Ireland, July 1999, 1999

1998

The ideal completion is not sequentially adequate.

Hans-Peter A. Künzi, Michel P. Schellekens

Proceedings of the Workshop on Domains IV 1998, 1998

1995

The Smyth completion: a common foundation for denotational semantics and complexity analysis.

Michel P. Schellekens

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995