Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.3, 2003-01, pp. : 667-677

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

Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

By Wang B.-F.

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 377-401

Elsevier

Access to resources Recommend Favorite

Divide-and-conquer algorithms on the hypercube

By Mayr E.W. Werchner R.

Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. : 283-296

Elsevier

Access to resources Recommend Favorite

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

By Okumoto Kazumasa Fukunaga Takuro Nagamochi Hiroshi

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 787-806

Springer Publishing Company

Access to resources Recommend Favorite

Solving the Double Transposition Challenge with a Divide-and-Conquer Approach

By Lasry George Kopal Nils Wacker Arno

Cryptologia, Vol. 38, Iss. 3, 2014-07 ,pp. : 197-214

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Divide-and-Conquer Learning Approach to Radial Basis Function Networks

By CHEUNG YIU-MING HUANG RONG-BO

Neural Processing Letters, Vol. 21, Iss. 3, 2005-06 ,pp. : 189-206

Springer Publishing Company

Access to resources Recommend Favorite