# Changeset 1187 for docs/Working/parlensort.tex

Ignore:
Timestamp:
May 22, 2011, 8:11:55 PM (8 years ago)
Message:

Added notes on parallel bitstream-based length sorting.

File:
1 edited

### Legend:

Unmodified
 r1186 \begin{eqnarray*} S_1 & = & n(s)\\ S_1 & = & n(S)\\ E_1 & = & S_1 \wedge E\\ E_{>1} & = & E \wedge \neg E_1\\ \end{enumerate} Of course, this scheme shows just one partitioning into length groups; others are possible.  Using the log-length strategy, a partition of $E_{>8}$ into $E_{9,16}$ and $E_{>16}$ would probably be worthwhile with XML. \section{Expected Benefits}