<s>
In	O
theoretical	O
computer	O
science	O
,	O
the	O
word	B-Application
RAM	I-Application
(	O
word	O
random-access	B-Application
machine	I-Application
)	O
model	O
is	O
a	O
model	O
of	O
computation	O
in	O
which	O
a	O
random-access	B-Application
machine	I-Application
does	O
bitwise	O
operations	O
on	O
a	O
word	O
of	O
bits	O
.	O
</s>
<s>
Michael	O
Fredman	O
and	O
Dan	O
Willard	O
created	O
it	O
in	O
1990	O
to	O
simulate	O
programming	O
languages	O
like	O
C	B-Language
.	O
</s>
<s>
The	O
word	B-Application
RAM	I-Application
model	O
is	O
an	O
abstract	B-Application
machine	I-Application
similar	O
to	O
a	O
random-access	B-Application
machine	I-Application
,	O
but	O
with	O
additional	O
capabilities	O
.	O
</s>
<s>
Because	O
the	O
model	O
assumes	O
that	O
the	O
word	O
size	O
matches	O
the	O
problem	O
size	O
,	O
that	O
is	O
,	O
for	O
a	O
problem	O
of	O
size	O
,	O
,	O
the	O
word	B-Application
RAM	I-Application
model	O
is	O
a	O
transdichotomous	O
model	O
.	O
</s>
<s>
In	O
the	O
word	B-Application
RAM	I-Application
model	O
,	O
integer	B-Algorithm
sorting	I-Algorithm
can	O
be	O
done	O
fairly	O
efficiently	O
.	O
</s>
<s>
Yijie	O
Han	O
and	O
Mikkel	O
Thorup	O
created	O
a	O
randomized	B-General_Concept
algorithm	I-General_Concept
to	O
sort	O
integers	O
in	O
expected	O
time	O
of	O
(	O
in	O
Big	O
O	O
notation	O
)	O
,	O
while	O
Han	O
also	O
created	O
a	O
deterministic	B-General_Concept
variant	O
with	O
running	O
time	O
.	O
</s>
<s>
The	O
dynamic	B-Data_Structure
predecessor	I-Data_Structure
problem	I-Data_Structure
is	O
also	O
commonly	O
analyzed	O
in	O
the	O
word	B-Application
RAM	I-Application
model	O
,	O
and	O
was	O
the	O
original	O
motivation	O
for	O
the	O
model	O
.	O
</s>
<s>
Dan	O
Willard	O
used	O
y-fast	B-Data_Structure
tries	I-Data_Structure
to	O
solve	O
this	O
in	O
time	O
.	O
</s>
<s>
Michael	O
Fredman	O
and	O
Willard	O
also	O
solved	O
the	O
problem	O
using	O
fusion	B-Data_Structure
trees	I-Data_Structure
in	O
time	O
.	O
</s>
