( en | de | ru )

 

Disambiguation of "Schellekens, Michel P."

Author of the publication

copydeleteadd this publication to your clipboard
A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.

, , , and . Nord. J. Comput., 13 (4): 340-346 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dries Schellekens

Hans-Willi Schellekens

Michel Georg Michel

-P Comes

-P Klöcking

 

Other publications of authors with the same name

Valuations revisited.. IWFM, BCS, (1999)A characterization of partial metrizability: domains are quantifiable.. Theor. Comput. Sci., 305 (1-3): 409-432 (2003)Partial quasi-metrics., , and . Theor. Comput. Sci., 365 (3): 237-246 (2006)A low-power pairing-based cryptographic accelerator for embedded security applications., , , , , and . SoCC, page 369-372. IEEE, (2009)Preface., , , , and . MFCSIT, volume 161 of Electronic Notes in Theoretical Computer Science, page 1-2. Elsevier, (2004)Sorting Algorithms in MOQA., , and . MFCSIT, volume 225 of Electronic Notes in Theoretical Computer Science, page 391-404. Elsevier, (2006)Timing-Driven Power Optimisation and Power-Driven Timing Optimisation of Combinational Circuits., , , , and . J. Low Power Electron., 7 (3): 364-380 (2011)A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons., , , and . Nord. J. Comput., 13 (4): 340-346 (2006)The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science., , and . Theory Comput. Syst., 50 (2): 387-399 (2012)Frugal Encoding in Reversible MOQA: A Case Study for Quicksort., , and . RC, volume 7581 of Lecture Notes in Computer Science, page 85-96. Springer, (2012)