Bridging across the log(n) Space Frontier

Author： Geffert V.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.142, Iss.2, 1998-05, pp. : 127-158

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

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

By Thorup M.  

Journal of Algorithms, Vol. 42, Iss. 2, 2002-02 ,pp. : 205-230

Academic Press

Access to resources Recommend Favorite

An in-place heapsort algorithm requiring n log n + n log* n −0.546871 n comparisons

By Hasan Md. Mahbubul  

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3350-3360

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polynomial shape functions on the logarithmic space: the LogFE method

By  

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS (ELECTRONIC), Vol. 15, Iss. 1, 2015-10 ,pp. : 469-470

John Wiley & Sons Inc

Access to resources Recommend Favorite

Tracking Eigenvalues to the Frontier of Moduli Space I. Convergence and Spectral Accumulation

By Judge C.M.  

Journal of Functional Analysis, Vol. 184, Iss. 2, 2001-08 ,pp. : 273-290

Academic Press

Access to resources Recommend Favorite

Asymptotic expansion for log n! in terms of the reciprocal of a triangular number

By Nemes Gergő  

Acta Mathematica Hungarica, Vol. 129, Iss. 3, 2010-11 ,pp. : 254-262

Springer Publishing Company

Access to resources Recommend Favorite