Michel P. Schellekens

Jiaoyan Chen, Dilip P. Vasudevan, Michel P. Schellekens, Emanuel M. Popovici: Ultra Low Power Asynchronous Charge Sharing Logic. J. Low Power Electronics 8(4): 526-534 (2012)

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

Jiaoyan Chen, Emanuel M. Popovici, Dilip P. Vasudevan, Michel P. Schellekens: Ultra Low Power Booth Multiplier Using Asynchronous Logic. ASYNC 2012: 81-88

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

Salvador Romaguera, Michel P. Schellekens, Oscar Valero: The complexity space of partial functions: a connection between complexity analysis and denotational semantics. Int. J. Comput. Math. 88(9): 1819-1829 (2011)

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 Electronics 7(3): 364-380 (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: 301-308

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: 1-6

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

Michel P. Schellekens: MO2A; unlocking the potential of compositional static average-case analysis. J. Log. Algebr. Program. 79(1): 61-83 (2010)

Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens: Reversible online BIST using bidirectional BILBO. Conf. Computing Frontiers 2010: 257-266

Tingcong Ye, Dilip P. Vasudevan, Jiaoyan Chen, Emanuel M. Popovici, Michel P. Schellekens: Static Average Case Power Estimation Technique for Block Ciphers. DSD 2010: 689-696

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: 434-437

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

M. A. Cerdà-Uguet, Michel P. Schellekens, Oscar Valero: The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science. CoRR abs/1009.6105 (2010)

Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong: Preface. Electr. Notes Theor. Comput. Sci. 225: 1-2 (2009)

Michel P. Schellekens: A Random Bag Preserving Product Operation. Electr. Notes Theor. Comput. Sci. 225: 341-360 (2009)

Jacinta Townley, Joseph Manning, Michel P. Schellekens: Sorting Algorithms in MOQA. Electr. Notes Theor. Comput. Sci. 225: 391-404 (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: 369-372

Michel P. Schellekens: A modular calculus for the average cost of data structuring. Springer 2008, isbn 978-0-387-73383-8, pp. I-XXIV, 1-246

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

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

Ka Lok Man, Michel P. Schellekens: Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. Engineering Letters 15(2): 317-326 (2007)

Ka L. Man, Michel P. Schellekens: Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. IMECS 2007: 568-573

Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens: SC2SCFL: Automated SystemC to SystemC^FL Translation. SAMOS 2007: 34-45

Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong: Preface. Electr. Notes Theor. Comput. Sci. 161: 1-2 (2006)

M. O'Keeffe, Homeira Pajoohesh, Michel P. Schellekens: Decision Trees of Algorithms and a Semivaluation to Measure Their Distance. Electr. Notes Theor. Comput. Sci. 161: 175-183 (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): 340-346 (2006)

Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens: Partial quasi-metrics. Theor. Comput. Sci. 365(3): 237-246 (2006)

Michel P. Schellekens: The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. 315(1): 135-149 (2004)

Michel P. Schellekens: A characterization of partial metrizability: domains are quantifiable. Theor. Comput. Sci. 305(1-3): 409-432 (2003)

M. O'Keeffe, Salvador Romaguera, Michel P. Schellekens: Norm-weightable Riesz spaces and the dual complexity space. Electr. Notes Theor. Comput. Sci. 74: 105-121 (2002)

M. O'Keeffe, Michel P. Schellekens: Average merge time: an intuitive interpretation. Electr. Notes Theor. Comput. Sci. 74: 122-133 (2002)

Hans-Peter A. Künzi, Michel P. Schellekens: On the Yoneda completion of a quasi-metric space. Theor. Comput. Sci. 278(1-2): 159-194 (2002)

Hans-Peter A. Künzi, Michel P. Schellekens: The ideal completion is not sequentially adequate. Electr. Notes Theor. Comput. Sci. 35: 87-93 (2000)

Salvador Romaguera, Michel P. Schellekens: Weightable quasi-metric semigroups and semilattices. Electr. Notes Theor. Comput. Sci. 40: 347-358 (2000)

Michel P. Schellekens: Valuations revisited. IWFM 1999

Michel P. Schellekens: The Smyth completion: a common foundation for denotational semantics and complexity analysis. Electr. Notes Theor. Comput. Sci. 1: 535-556 (1995)