most citedIn-place associative integer sorting

5 citations · 17 across the 8 of their papers we have counts for

collaborators

7 papers

cs.DS2013

The technique of in-place associative sorting

A. Emre Cetin

In the first place, a novel, yet straightforward in-place integer value-sorting algorithm is presented. It sorts in linear time using constant amount of additional memory for stori…

cs.DS2013

In-situ associative permuting

A. Emre Cetin

The technique of in-situ associative permuting is introduced which is an association of in-situ permuting and in-situ inverting. It is suitable for associatively permutable permuta…

cs.DS2012★ 5 cited

In-place associative integer sorting

A. Emre Cetin

A novel integer value-sorting technique is proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms. It requires only constant a…

cs.DS2012★ 1 cited

In-place associative permutation sort

A. Emre Cetin

In-place associative integer sorting technique was developed, improved and specialized for distinct integers. The technique is suitable for integer sorting. Hence, given a list S o…

cs.DS2012★ 2 cited

Sorting distinct integers using improved in-place associative sort

A. Emre Cetin

In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting…

cs.DS2012★ 3 cited

Improved in-place associative integer sorting

A. Emre Cetin

A novel integer sorting technique was proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms which requires only constant amou…