Search Results - randomised EREW PRAM algorithm

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM by Halperin, Shay, Zwick, Uri

“…Improving a long chain of works, we obtain a randomised EREW PRAM algorithm for finding the connected components of a graphG=(V, E…”
Get full text

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests by Halperin, Shay, Zwick, Uri

“…We present the first randomized O(logn) time and O(m+n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G=(V,E…”
Get full text

A randomized sublinear time parallel GCD algorithm for the EREW PRAM by Sorenson, Jonathan P.

“… The algorithm either gives a correct answer or reports failure. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem…”
Get full text

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest by Keung Poon, Chung, Ramachandran, Vijaya

Get full text

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM by Sorenson, Jonathan P

“… We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem…”
Get full text

Fast Connected Components Algorithms for the EREW PRAM by Karger, David R., Nisan, Noam, Parnas, Michal

“… These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using $(m+n^{1…”
Get full text

Sorting in Linear Time? by Andersson, Arne, Hagerup, Torben, Nilsson, Stefan, Raman, Rajeev

“… The second one yields an algorithm that usesO(logn) expected time andO(n) expected operations on a randomized EREW PRAM, provided thatw⩾(logn)2+εfor some fixedε>0…”
Get full text

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest by Pettie, Seth, Ramachandran, Vijaya

Get full text

The queue-read queue-write asynchronous PRAM model by Gibbons, P.B., Matias, Y., Ramachandran, V.

“… ( qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model…”
Get full text

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) by Bader, David A., Cong, Guojing

“… Many PRAM algorithms can be adapted to SMPs with few modifications. Yet there are few studies that deal with the implementation and performance issues of running PRAM-style algorithms on SMPs…”
Get full text

Approximate compaction and padded-sorting on exclusive write PRAMs by Kutylowski, M., Wierzbicki, T.

“… We analyze the time complexity of these problems on CREW and EREW PRAMs (deterministic and randomized…”
Get full text

Fast randomized parallel methods for planar convex hull construction by Ghouse, Mujtaba R., Goodrich, Michael T.

“…We present a number of efficient parallel algorithms for constructing 2-dimensional convex hulls on a randomized CRCW PRAM…”
Get full text

A sublinear-time randomized approximation algorithm for matrix games by Grigoriadis, Michael D., Khachiyan, Leonid G.

“…)) expected time on an ( n+ m)/log( n+ m)-processor EREW PRAM. For any fixed accuracy ϵ > 0, the expected sequential running time of the suggested algorithm is O(( n + m)log( n + m…”
Get full text

Efficient algorithms for graph coloring: Vertex, edge, list, total, and acyclic coloring by Skulrattanakulchai, San

“…A proper coloring of a graph is a partition of its elements in such a way that no two adjacent or incident elements belong to the same set in the partition. It…”
Get full text

A lower bound for the QRQW PRAM by MacKenzie, P.D.

“… This is designed to model currently available parallel machines more accurately than either the CRCW PRAM or EREW PRAM models…”
Get full text

Fast RNC and NC algorithms for maximal path sets by Uehara, Ryuhei, Chen, Zhi-Zhong, He, Xin

“… One is randomized and runs in O( log n) expected time with O( n + m) processors on a CRCW PRAM…”
Get full text

Improved optimal shared memory simulations, and the power of reconsideration by Czumaj, A., Meyer auf der Heide, F., Stemann, V.

“…We present time-processor optimal randomized algorithms for simulating a shared memory machine (EREW PRAM…”
Get full text

Contention Resolution in Hashing Based Shared Memory Simulations by Czumaj, Artur, Heide, Friedhelm Meyer auf, Stemann, Volker

“… The main aim is to design strategies that resolve contention at the memory modules. Extending results and methods from random graphs and very fast randomized algorithms…”
Get full text

Efficient Low-Contention Parallel Algorithms by Gibbons, Phillip B., Matias, Yossi, Ramachandran, Vijaya

“…The queue-read, queue-write (qrqw) parallel random access machine (pram) model permits concurrent reading and writing to shared memory locations, but at a…”
Get full text

Parallel randomized techniques for some fundamental geometric problems : A survey by RAMASWAMI, S

Get full text