Michel P. Schellekens

	2010
21		Michel P. Schellekens: MO2A; unlocking the potential of compositional static average-case analysis. J. Log. Algebr. Program. 79(1): 61-83 (2010)
	2009
20		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)
19		Michel P. Schellekens: A Random Bag Preserving Product Operation. Electr. Notes Theor. Comput. Sci. 225: 341-360 (2009)
18		Jacinta Townley, Joseph Manning, Michel P. Schellekens: Sorting Algorithms in MOQA. Electr. Notes Theor. Comput. Sci. 225: 391-404 (2009)
	2008
17		David Hickey, Diarmuid Early, Michel P. Schellekens: A tool for average and worst-case execution time analysis. WCET 2008
	2007
16		Ka L. Man, Michel P. Schellekens: Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. IMECS 2007: 568-573
15		Ka Lok Man, Andrea Fedeli, Michele Mercaldi, Menouer Boubekeur, Michel P. Schellekens: SC2SCFL: Automated SystemC to SystemCFL Translation. SAMOS 2007: 34-45
14		Ka Lok Man, Michel P. Schellekens: Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt. Engineering Letters 15(2): 317-326 (2007)
	2006
13		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)
12		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)
11		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)
10		Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens: Partial quasi-metrics. Theor. Comput. Sci. 365(3): 237-246 (2006)
	2004
9		Michel P. Schellekens: The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. 315(1): 135-149 (2004)
	2003
8		Michel P. Schellekens: A characterization of partial metrizability: domains are quantifiable. Theor. Comput. Sci. 305(1-3): 409-432 (2003)
	2002
7		M. O'Keeffe, Michel P. Schellekens: Average merge time: an intuitive interpretation. Electr. Notes Theor. Comput. Sci. 74: (2002)
6		M. O'Keeffe, Salvador Romaguera, Michel P. Schellekens: Norm-weightable Riesz spaces and the dual complexity space. Electr. Notes Theor. Comput. Sci. 74: (2002)
5		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)
	2000
4		Hans-Peter A. Künzi, Michel P. Schellekens: The ideal completion is not sequentially adequate. Electr. Notes Theor. Comput. Sci. 35: (2000)
3		Salvador Romaguera, Michel P. Schellekens: Weightable quasi-metric semigroups and semilattices. Electr. Notes Theor. Comput. Sci. 40: (2000)
	1999
2		Michel P. Schellekens: Valuations revisited. IWFM 1999
	1995
1		Michel P. Schellekens: The Smyth completion: a common foundation for denotational semantics and complexity analysis. Electr. Notes Theor. Comput. Sci. 1: (1995)

Coauthor Index

1	Rachit Agarwal	[11]
2	Mícheál Mac an Airchinnigh	[13] [20]
3	Menouer Boubekeur	[15] [20]
4	Diarmuid Early	[17]
5	Andrea Fedeli	[15]
6	David Hickey	[17]
7	Ted Hurley	[13] [20]
8	Hans-Peter A. Künzi	[4] [5] [10]
9	Ka Lok Man (Ka L. Man)	[11] [14] [15] [16]
10	Joseph Manning	[18]
11	Michele Mercaldi	[15]
12	M. O'Keeffe	[6] [7] [12]
13	Homeira Pajoohesh	[10] [12]
14	Emanuel M. Popovici	[11]
15	Salvador Romaguera	[3] [6]
16	Anthony Karel Seda	[13] [20]
17	Glenn Strong	[13] [20]
18	Jacinta Townley	[18]

Colors in the list of coauthors