default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel P. Schellekens
Person information
- affiliation: University College Cork, Department of Computer Science, Ireland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i3]Michel P. Schellekens:
Entropy conservation for comparison-based algorithms. CoRR abs/2011.07278 (2020)
2010 – 2019
- 2015
- [i2]Bichen Shi, Michel P. Schellekens, Georgiana Ifrim:
A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms. CoRR abs/1503.06572 (2015) - 2014
- [j13]Eva Colebunders, Stefan De Wachter, Michel P. Schellekens:
Complexity Analysis via Approach Spaces. Appl. Categorical Struct. 22(1): 119-136 (2014) - 2013
- [j12]Diarmuid Early, Michel P. Schellekens:
Running time of the Treapsort algorithm. Theor. Comput. Sci. 487: 65-73 (2013) - 2012
- [j11]Jiaoyan Chen, Dilip P. Vasudevan, Michel P. Schellekens, Emanuel M. Popovici:
Ultra Low Power Asynchronous Charge Sharing Logic. J. Low Power Electron. 8(4): 526-534 (2012) - [j10]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): 387-399 (2012) - [c26]Jiaoyan Chen, Emanuel M. Popovici, Dilip P. Vasudevan, Michel P. Schellekens:
Ultra Low Power Booth Multiplier Using Asynchronous Logic. ASYNC 2012: 81-88 - [c25]Diarmuid Early, Ang Gao, Michel P. Schellekens:
Frugal Encoding in Reversible MOQA: A Case Study for Quicksort. RC 2012: 85-96 - 2011
- [j9]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): 1819-1829 (2011) - [j8]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): 364-380 (2011) - [c24]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 - [c23]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 - [c22]Ang Gao, Kenneth Rea, Michel P. Schellekens:
Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method. PARELEC 2011: 1-6 - 2010
- [j7]Michel P. Schellekens:
MO2A; unlocking the potential of compositional static average-case analysis. J. Log. Algebraic Methods Program. 79(1): 61-83 (2010) - [c21]Jiaoyan Chen, Dilip P. Vasudevan, Emanuel M. Popovici, Michel P. Schellekens:
Reversible online BIST using bidirectional BILBO. Conf. Computing Frontiers 2010: 257-266 - [c20]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 - [c19]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 - [c18]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 - [i1]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 abs/1009.6105 (2010)
2000 – 2009
- 2009
- [c17]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 - [e5]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, MFCSIT 2006, Cork, Ireland, August 1-5, 2006. Electronic Notes in Theoretical Computer Science 225, Elsevier 2009 [contents] - 2008
- [b1]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 - [c16]Tom English, Ka Lok Man, Emanuel M. Popovici, Michel P. Schellekens:
HotSpot: Visualizing dynamic power consumption in RTL designs. EWDTS 2008: 45-48 - [c15]David Hickey, Diarmuid Early, Michel P. Schellekens:
A tool for average and worst-case execution time analysis. WCET 2008 - 2007
- [j6]Ka Lok Man, Michel P. Schellekens:
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. Eng. Lett. 15(2): 317-326 (2007) - [c14]Menouer Boubekeur, Michel P. Schellekens:
Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits. ICECS 2007: 283-286 - [c13]Ka L. Man, Michel P. Schellekens:
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. IMECS 2007: 568-573 - [c12]Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens:
SC2SCFL: Automated SystemC to SystemCFL Translation. SAMOS 2007: 34-45 - 2006
- [j5]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) - [j4]Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens:
Partial quasi-metrics. Theor. Comput. Sci. 365(3): 237-246 (2006) - [c11]Anthony Karel Seda, Menouer Boubekeur, Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Glenn Strong:
Preface. MFCSIT 2006: 1-2 - [c10]Michel P. Schellekens:
A Random Bag Preserving Product Operation. MFCSIT 2006: 341-360 - [c9]Jacinta Townley, Joseph Manning, Michel P. Schellekens:
Sorting Algorithms in MOQA. MFCSIT 2006: 391-404 - [e4]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, MFCSIT 2004, Dublin, Ireland, July 22-23, 2004. Electronic Notes in Theoretical Computer Science 161, Elsevier 2006 [contents] - 2004
- [j3]Michel P. Schellekens:
The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. 315(1): 135-149 (2004) - [c8]Anthony Karel Seda, Ted Hurley, Michel P. Schellekens, Mícheál Mac an Airchinnigh, Glenn Strong:
Preface. MFCSIT 2004: 1-2 - [c7]Maria O'Keeffe, Homeira Pajoohesh, Michel P. Schellekens:
Decision Trees of Algorithms and a Semivaluation to Measure Their Distance. MFCSIT 2004: 175-183 - 2003
- [j2]Michel P. Schellekens:
A characterization of partial metrizability: domains are quantifiable. Theor. Comput. Sci. 305(1-3): 409-432 (2003) - [e3]Sharon Flynn, Ted Hurley, Mícheál Mac an Airchinnigh, Niall Madden, Michael McGettrick, Michel P. Schellekens, Anthony Karel Seda:
Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2002, Galway, Ireland, July 18-19, 2002. Electronic Notes in Theoretical Computer Science 74, Elsevier 2003 [contents] - 2002
- [j1]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) - [c6]Maria O'Keeffe, Salvador Romaguera, Michel P. Schellekens:
Norm-weightable Riesz spaces and the dual complexity space. MFCSIT 2002: 105-121 - [c5]Maria O'Keeffe, Michel P. Schellekens:
Average merge time: an intuitive interpretation. MFCSIT 2002: 122-133 - 2000
- [c4]Salvador Romaguera, Michel P. Schellekens:
Weightable quasi-metric semigroups and semilattices. MFCSIT 2000: 347-358 - [e2]Dieter Spreen, Ralf Greb, Holger Schulz, Michel P. Schellekens:
Workshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998. Electronic Notes in Theoretical Computer Science 35, Elsevier 2000 [contents] - [e1]Ted Hurley, Mícheál Mac an Airchinnigh, Michel P. Schellekens, Anthony Karel Seda:
First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2000, Cork, Ireland, July 20-21, 2000. Electronic Notes in Theoretical Computer Science 40, Elsevier 2000 [contents]
1990 – 1999
- 1999
- [c3]Michel P. Schellekens:
Valuations revisited. IWFM 1999 - 1998
- [c2]Hans-Peter A. Künzi, Michel P. Schellekens:
The ideal completion is not sequentially adequate. Workshop on Domains 1998: 87-93 - 1995
- [c1]Michel P. Schellekens:
The Smyth completion: a common foundation for denotational semantics and complexity analysis. MFPS 1995: 535-556
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
