"A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by ..."

Michel P. Schellekens et al. (2006)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2012-06-12

- no documents available
- export record
  dblp key:
  - journals/njc/SchellekensAPM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/njc/SchellekensAPM06
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)

a service of

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.