Sorting a Low-Entropy Sequence

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We give the first sorting algorithm with bounds in terms of higher-order
entropies: let $S$ be a sequence of length $m$ containing $n$ distinct elements
and let (H_\ell (S)) be the $\ell$th-order empirical entropy of $S$, with
(n^{\ell + 1} \log n \in O (m)); our algorithm sorts $S$ using ((H_\ell (S) + O
(1)) m) comparisons.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sorting a Low-Entropy Sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sorting a Low-Entropy Sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting a Low-Entropy Sequence will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-170360

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.