An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM

ISSN： 0022-0000

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

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

Reliable computations on faulty EREW PRAM

By Diks K. Pelc A.

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 107-122

Elsevier

Access to resources Recommend Favorite

Improved Bounds for Integer Sorting in the EREW PRAM Model

By dessmark A. Lingas A.

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 1, 1998-01 ,pp. : 64-70

Academic Press

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

A work-time optimal algorithm for computing all string covers

By Iliopoulos C.S. Park K.

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

Elsevier

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