Michel P. Schellekens

48 papers B 1C 3Journal 16Unranked 22

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Entropy conservation for comparison-based algorithms. CoRR Michel P. Schellekens
2015	J	`jnl`	A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms. CoRR Bichen Shi, Michel P. Schellekens, Georgiana Ifrim
2014	J	`jnl`	Complexity Analysis via Approach Spaces. Appl. Categorical Struct. Eva Colebunders, Stefan De Wachter, Michel P. Schellekens
2013	J	`jnl`	Running time of the Treapsort algorithm. Theor. Comput. Sci. Diarmuid Early, Michel P. Schellekens
2012	C	`conf`	Frugal Encoding in Reversible MOQA: A Case Study for Quicksort. RC Diarmuid Early, Ang Gao, Michel P. Schellekens
2012	J	`jnl`	The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. Theory Comput. Syst. M. A. Cerdà-Uguet, Michel P. Schellekens, Óscar Valero
2012	J	`jnl`	Ultra Low Power Asynchronous Charge Sharing Logic. J. Low Power Electron. Jiaoyan Chen, Dilip P. Vasudevan, Michel P. Schellekens, Emanuel M. Popovici
2012	—	`conf`	Ultra Low Power Booth Multiplier Using Asynchronous Logic. ASYNC Jiaoyan Chen, Emanuel M. Popovici, Dilip P. Vasudevan, Michel P. Schellekens
2011	C	`conf`	Design of a Low Power, Sub-Threshold, Asynchronous Arithmetic Logic Unit Using a Bidirectional Adder. DSD Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens
2011	—	`conf`	Eliminating implicit dependencies in component models. NESEA Wouter Horré, Danny Hughes, Ka Lok Man, Steven Guan, Binbin Qian, Tianlin Yu, Haofan Zhang, Zhun Shen, Michel P. Schellekens, Steve Hollands
2011	—	`conf`	Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method. PARELEC Ang Gao, Kenneth Rea, Michel P. Schellekens
2011	J	`jnl`	The complexity space of partial functions: a connection between complexity analysis and denotational semantics. Int. J. Comput. Math. Salvador Romaguera, Michel P. Schellekens, Óscar Valero
2011	J	`jnl`	Timing-Driven Power Optimisation and Power-Driven Timing Optimisation of Combinational Circuits. J. Low Power Electron. Rashmi Mehrotra, Tom English, Michel P. Schellekens, Steve Hollands, Emanuel M. Popovici
2010	—	`conf`	Delay dependent power optimisation of combinational circuits using AND-Inverter graphs. SoCC Rashmi Mehrotra, Tom English, Emanuel M. Popovici, Michel P. Schellekens
2010	—	`conf`	Design and analysis of a novel 8T SRAM cell for adiabatic and non-adiabatic operations. ICECS Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens, Peter Gillen
2010	J	`jnl`	MO2A; unlocking the potential of compositional static average-case analysis. J. Log. Algebraic Methods Program. Michel P. Schellekens
2010	—	`conf`	Reversible online BIST using bidirectional BILBO. Conf. Computing Frontiers Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens
2010	C	`conf`	Static Average Case Power Estimation Technique for Block Ciphers. DSD Tingcong Ye, Dilip P. Vasudevan, Jiaoyan Chen, Emanuel M. Popovici, Michel P. Schellekens
2010	J	`jnl`	The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science CoRR M. A. Cerdà-Uguet, Michel P. Schellekens, Óscar Valero
2009	—	`conf`	A low-power pairing-based cryptographic accelerator for embedded security applications. SoCC Tom English, Maurice Keller, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens, William P. Marnane
2009	—	`ed.`	Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2006, Cork, Ireland, August 1-5, 2006 MFCSIT Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong
2008	—	`book`	A modular calculus for the average cost of data structuring. Michel P. Schellekens
2008	—	`conf`	A tool for average and worst-case execution time analysis. WCET David Hickey, Diarmuid Early, Michel P. Schellekens
2008	—	`conf`	HotSpot: Visualizing dynamic power consumption in RTL designs. EWDTS Tom English, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens
2007	—	`conf`	Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. IMECS Ka L. Man, Michel P. Schellekens
2007	J	`jnl`	Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. Eng. Lett. Ka Lok Man, Michel P. Schellekens
2007	—	`conf`	Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits. ICECS Menouer Boubekeur, Michel P. Schellekens
2007	—	`conf`	SC2SCFL: Automated SystemC to SystemC SAMOS Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens
2006	—	`conf`	A Random Bag Preserving Product Operation. MFCSIT Michel P. Schellekens
2006	J	`jnl`	A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons. Nord. J. Comput. Michel P. Schellekens, Rachit Agarwal, Emanuel M. Popovici, Ka Lok Man
2006	J	`jnl`	Partial quasi-metrics. Theor. Comput. Sci. Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens
2006	—	`conf`	Preface. MFCSIT Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong
2006	—	`ed.`	Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2004, Dublin, Ireland, July 22-23, 2004 MFCSIT Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong
2006	—	`conf`	Sorting Algorithms in MOQA. MFCSIT Jacinta Townley, Joseph Manning, Michel P. Schellekens
2004	—	`conf`	Decision Trees of Algorithms and a Semivaluation to Measure Their Distance. MFCSIT Maria O'Keeffe, Homeira Pajoohesh, Michel P. Schellekens
2004	—	`conf`	Preface. MFCSIT Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong
2004	J	`jnl`	The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. Michel P. Schellekens
2003	J	`jnl`	A characterization of partial metrizability: domains are quantifiable. Theor. Comput. Sci. Michel P. Schellekens
2003	—	`ed.`	Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2002, Galway, Ireland, July 18-19, 2002 MFCSIT Sharon Flynn, Ted Hurley, Mícheál Mac an Airchinnigh, Niall Madden, Michael McGettrick, Michel P. Schellekens, Anthony Karel Seda
2002	—	`conf`	Average merge time: an intuitive interpretation. MFCSIT Maria O'Keeffe, Michel P. Schellekens
2002	—	`conf`	Norm-weightable Riesz spaces and the dual complexity space. MFCSIT Maria O'Keeffe, Salvador Romaguera, Michel P. Schellekens
2002	J	`jnl`	On the Yoneda completion of a quasi-metric space. Theor. Comput. Sci. Hans-Peter A. Künzi, Michel P. Schellekens
2000	—	`ed.`	First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2000, Cork, Ireland, July 20-21, 2000 MFCSIT Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Anthony Karel Seda
2000	—	`conf`	Weightable quasi-metric semigroups and semilattices. MFCSIT Salvador Romaguera, Michel P. Schellekens
2000	—	`ed.`	Workshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998 Workshop on Domains Dieter Spreen, Ralf Greb, Holger Schulz, Michel P. Schellekens
1999	—	`conf`	Valuations revisited. IWFM Michel P. Schellekens
1998	—	`conf`	The ideal completion is not sequentially adequate. Workshop on Domains Hans-Peter A. Künzi, Michel P. Schellekens
1995	B	`conf`	The Smyth completion: a common foundation for denotational semantics and complexity analysis. MFPS Michel P. Schellekens