A work-time optimal algorithm for computing all string covers

Author： Iliopoulos C.S.   Park K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.164, Iss.1, 1996-09, pp. : 299-310

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

Real-time broadcast algorithm for mobile computing

By Lim S.-H.   Kim J.-H.  

Journal of Systems and Software, Vol. 69, Iss. 1, 2004-01 ,pp. : 173-181

Elsevier

Access to resources Recommend Favorite

An Optimal Multiprocessor Real-Time Scheduling Algorithm

By Khemka A.   Shyamasundar R.K.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 37-45

Academic Press

Access to resources Recommend Favorite

Plato: a genetic algorithm approach to run-time reconfiguration in autonomic computing systems

By Ramirez Andres  

Cluster Computing, Vol. 14, Iss. 3, 2011-09 ,pp. : 229-244

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis   Molle Mart  

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM

By Halperin S.   Zwick U.  

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 395-416

Academic Press

Access to resources Recommend Favorite