<s>
The	O
skew	B-Application
binary	I-Application
number	I-Application
system	I-Application
is	O
a	O
non-standard	O
positional	O
numeral	O
system	O
in	O
which	O
the	O
nth	O
digit	O
contributes	O
a	O
value	O
of	O
times	O
the	O
digit	O
(	O
digits	O
are	O
indexed	O
from	O
0	O
)	O
instead	O
of	O
times	O
as	O
they	O
do	O
in	O
binary	O
.	O
</s>
<s>
The	O
advantage	O
of	O
skew	O
binary	O
is	O
that	O
each	O
increment	O
operation	O
can	O
be	O
done	O
with	O
at	O
most	O
one	O
carry	B-Algorithm
operation	O
.	O
</s>
<s>
When	O
numbers	O
are	O
represented	O
using	O
a	O
form	O
of	O
run-length	B-Algorithm
encoding	I-Algorithm
as	O
linked	O
lists	O
of	O
the	O
non-zero	O
digits	O
,	O
incrementation	O
and	O
decrementation	O
can	O
be	O
performed	O
in	O
constant	O
time	O
.	O
</s>
<s>
The	O
skew	O
binary	O
numbers	O
were	O
developed	O
by	O
Eugene	O
Myers	O
in	O
1983	O
for	O
a	O
purely	B-Application
functional	I-Application
data	I-Application
structure	I-Application
that	O
allows	O
the	O
operations	O
of	O
the	O
stack	B-Application
abstract	I-Application
data	I-Application
type	I-Application
and	O
also	O
allows	O
efficient	O
indexing	O
into	O
the	O
sequence	O
of	O
stack	B-Application
elements	O
.	O
</s>
<s>
They	O
were	O
later	O
applied	O
to	O
skew	B-Application
binomial	I-Application
heaps	I-Application
,	O
a	O
variant	O
of	O
binomial	B-Application
heaps	I-Application
that	O
support	O
constant-time	O
worst-case	O
insertion	O
operations	O
.	O
</s>
