Presorting algorithms: An average-case point of view

Author： Hwang H.-K.   Yang B.-Y.   Yeh Y.-N.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.242, Iss.1, 2000-07, pp. : 29-40

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

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

By Cicalese Ferdinando   Jacobs Tobias   Laber Eduardo   Molinaro Marco  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1045-1074

Springer Publishing Company

Access to resources Recommend Favorite

Average-Case Analysis of Approximate Trie Search

By Maass Moritz G.  

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 469-491

Springer Publishing Company

Access to resources Recommend Favorite

A Framework for Average Case Analysis of Conjunctive Learning Algorithms

By Pazzani M.J.  

Machine Learning, Vol. 09, Iss. 4, 1992-10 ,pp. : 349-372

Springer Publishing Company

Access to resources Recommend Favorite

An Average-Case Optimal One-Variable Pattern Language Learner

By Reischuk R.   Zeugmann T.  

Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. : 302-335

Academic Press

Access to resources Recommend Favorite

Average case analysis of greedy algorithms for optimisation problems on set systems

By Blot J.   de la Vega W.F.   Paschos V.T.   Saad R.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 267-298

Elsevier

Access to resources Recommend Favorite