Skip to search formSkip to main contentSemantic Scholar

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

One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

In this paper, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version of… Expand

Is this relevant?

2009

2009

An improved collision detection algorithm based on AABB is presented. During the global search, each axis is cut into a series of… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Which is the defect that causes a software failure? By comparing the program states of a failing and a passing run, we can… Expand

Is this relevant?

1997

1997

A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments… Expand

Is this relevant?

1986

1986

A direct relationship between Shellsort and the classical “problem of Frobenius” from additive number theory is used to derive a… Expand

Is this relevant?

1983

1983

We show that if n is sufficiently large then there is a graph G of order n with In”’ log n] edges such that the transitive… Expand

Is this relevant?

1983

1983

The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be Θ(N3/2), due to… Expand

Is this relevant?

1979

1979

One classical sorting algorithm, whose performance in many cases remains unanalyzed, is Shellsort. Let $\vec{h} be a t-component… Expand

Is this relevant?

1972

1972

Abstract : Shellsort is a particular method of sorting data on digital computers. Associated with each variant of Shellsort is a… Expand

Is this relevant?