"Sorting In-Place with a Worst Case Complexity of n ..."

Klaus Reinhardt (1992)

> Home

Details and statistics

DOI: 10.1007/3-540-56279-6_101

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/Reinhardt92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/Reinhardt92
Klaus Reinhardt:
Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports. ISAAC 1992: 489-498

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.