Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.40, Iss.4, 2007-06, pp. : 327-353

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

O ( d log N )-Quantics Approximation of N - d Tensors in High-Dimensional Numerical Modeling

By Khoromskij Boris

Constructive Approximation, Vol. 34, Iss. 2, 2011-10 ,pp. : 257-280

Springer Publishing Company

Access to resources Recommend Favorite

A Characterization of (2, n )-Semigroup of n -Place Functions and De Morgan (2, n )-Semigroup of n -Place Functions

By Pashazadeh J.

Communications in Algebra, Vol. 40, Iss. 9, 2012-09 ,pp. : 3430-3441

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Two-Graphs of Ovoids in O2n + 1(q)

By Gunawardena A.

European Journal of Combinatorics, Vol. 18, Iss. 8, 1997-11 ,pp. : 857-858

Academic Press

Access to resources Recommend Favorite

Iwasawa Theory for K_2n $\mathematical script capital(O)_F\$

Journal of K-Theory, Vol. 12, Iss. 1, 2013-08 ,pp. : 115-123

Cambridge University Press

Access to resources Recommend Favorite

Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))

The Journal of Symbolic Logic, Vol. 55, Iss. 1, 1990-03 ,pp. : 260-276

Cambridge University Press

Access to resources Recommend Favorite