Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

Pengurutan data secara umum didefinisikan sebagai suatu proses untuk mengatur suatu kumpulan objek dalam urutan tertentu. Ada… Expand

Is this relevant?

2007

2007

A summary of the results achieved in the paper \Optimal Randomized Parallel Algorithms for Computational Geometry," by Reif and… Expand

Is this relevant?

2007

2007

This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level… Expand

Is this relevant?

1998

1998

Abstract. We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The… Expand

Is this relevant?

1996

1996

Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random… Expand

Is this relevant?

1992

1992

Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a… Expand

Is this relevant?

1992

1992

We present parallel algorithms for some fundamental problems in computational geometry which have a running time ofO(logn) usingn… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

Sorting is arguably the most studied problem in computer science, both because it is used as a substep in many applications and… Expand

Is this relevant?

1990

1990

Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor… Expand

Is this relevant?

1986

1986

The ever-decreasing cost of computer processors has created a great interest in multi-processor computers. However, along with… Expand

Is this relevant?