.I 1
algebra
cacm
decemb
intern
languag
perli
preliminari
report
samelson
.I 2
cacm
comput
decemb
digit
extract
repeat
root
subtract
sugai
.I 3
cacm
decemb
depart
friedman
matrix
program
scheme
techniqu
.I 4
cacm
comput
engin
glossari
novemb
program
terminolog
.I 5
approxim
cacm
novemb
root
squar
wadei
.I 6
cacm
comput
inspect
muller
novemb
procedur
.I 7
cacm
comput
engin
glossari
octob
program
terminolog
.I 8
cacm
equival
friedman
octob
program
scheme
transform
.I 9
cacm
conwai
octob
propos
uncol
.I 10
cacm
comput
engin
glossari
program
septemb
terminolog
.I 11
cacm
chang
commun
machin
mock
olsztyn
part
problem
program
propos
septemb
solut
steel
strong
tritter
wegstein
.I 12
cacm
call
error
estim
kutta
procedur
reev
rung
septemb
.I 13
august
cacm
comput
engin
glossari
program
terminolog
.I 14
august
cacm
chang
commun
machin
mock
olsztyn
part
problem
program
propos
solut
steel
strong
tritter
wegstein
.I 15
august
cacm
curv
fit
giblin
recurs
techniqu
.I 16
august
cacm
jeev
modif
newton
secant
.I 17
arithmet
august
cacm
ershov
oper
program
.I 18
adam
automat
cacm
code
juli
schlesing
simpl
system
.I 19
cacm
comput
engin
glossari
june
program
terminolog
.I 20
acceler
appli
cacm
converg
discuss
diverg
equat
illustr
induc
iter
june
procedur
process
rate
solut
techniqu
wegstein
.I 21
algebra
cacm
diagram
flow
formul
june
voorhe
.I 22
applic
automat
cacm
comput
depart
implement
logic
morri
unusu
wohr
.I 23
binari
cacm
command
comput
decim
extract
function
kautz
oper
truth
.I 24
cacm
check
decim
improv
redund
sisson
.I 25
cacm
gener
holt
program
purpos
system
.I 26
bemer
cacm
calcul
logarithm
method
subroutin
.I 27
bessel
bound
cacm
empir
function
gener
note
randel
reev
.I 28
april
cacm
corlei
method
program
request
.I 29
algorithm
april
cacm
need
selden
.I 30
algorithm
analyz
cacm
function
logic
march
produc
statement
tabl
truth
wolp
.I 31
cacm
code
grumett
ibm
march
nundrum
.I 32
binari
cacm
facil
februari
halpern
search
tabl
variabl
width
.I 33
binari
cacm
calcul
counter
hunter
ibm
januari
kenni
program
type
.I 34
automat
cacm
comput
januari
tabl
wilf
.I 35
bemer
cacm
comput
januari
machin
method
root
squar
.I 36
burrough
cacm
conwai
decemb
ibm
johnson
maxwel
network
queue
simul
.I 37
cacm
comput
decemb
develop
humphrei
impact
.I 38
acton
algol
cacm
decemb
interpret
iron
propos
.I 39
cacm
decemb
equat
function
gener
linear
method
necessarili
nonlinear
procedur
secant
simultan
singl
solut
system
variabl
wolf
.I 40
adder
addit
address
advantag
applic
arithmet
binari
buchholz
cacm
care
choic
commun
compact
comput
contribut
convers
data
decemb
decim
directli
effici
essenti
fast
finger
fist
format
gener
greater
hand
high
import
increas
inher
input
instruct
larg
man
need
number
obviou
offer
oper
output
perform
power
practic
process
pure
purpos
represent
requir
review
signific
simplic
slower
speed
supplement
system
take
time
unit
volum
.I 41
cacm
comput
decemb
eastern
europ
nadler
note
research
.I 42
cacm
comput
divis
method
novemb
root
sarafyan
squar
.I 43
cacm
greenwald
handl
instruct
macro
novemb
techniqu
.I 44
algebra
cacm
comput
knuth
limit
novemb
runcibl
translat
.I 45
cacm
chart
flow
gant
novemb
outlin
substitut
.I 46
balanc
built
burden
cacm
carefulli
codd
combin
compil
comput
concurr
consider
design
discuss
execut
exploit
feasibl
increas
independ
logic
lowri
machin
mcdonough
met
minimum
multiprogram
note
novemb
number
parallel
place
present
problem
program
requir
scalzi
stretch
success
supervisori
system
techniqu
tendenc
.I 47
astrahan
cacm
comput
novemb
russian
visit
zaitzeff
.I 48
administr
aid
applic
aris
bar
bit
built
cacm
call
code
combin
commun
comput
correct
cyclic
degre
describ
detail
donat
drum
embed
emploi
error
find
fix
high
identif
identifi
index
indian
institut
low
nadler
nation
octob
order
period
permit
probabl
properti
punctuat
put
receiv
redund
regist
sengupta
shift
simpli
singl
soviet
station
statist
technic
telemet
time
tuitou
unit
untaa
ural
wireless
word
zero
.I 49
applic
busi
cacm
curv
fike
octob
oracl
plotter
scientif
.I 50
cacm
hamblen
ibm
ii
octob
part
program
statist
.I 51
cacm
construct
crozier
flowchart
gorn
ingerman
micro
octob
.I 52
cacm
cook
corrigendum
dimension
distribut
effici
gener
method
octob
point
sphere
surfac
uniformli
.I 53
algol
cacm
committe
octob
recommend
share
.I 54
algebra
brittenham
cacm
clark
engin
kuss
languag
octob
sale
simpl
smith
thompson
.I 55
algebra
cacm
kaner
octob
translat
.I 56
cacm
chart
flow
octob
propos
standard
symbol
.I 57
cacm
center
comput
octob
.I 58
cacm
capacit
comput
construct
contactless
develop
digit
durat
electr
element
examin
ferrit
gener
gutenmach
laboratori
lem
long
machmudov
magnet
memori
model
octob
paper
professor
purpos
question
size
small
sssr
supervis
vinityi
.I 59
automat
busi
cacm
control
data
decemb
develop
feder
govern
iii
manag
process
progress
septemb
survei
system
trend
.I 60
alpha
cacm
constraint
linear
septemb
system
transform
vector
wersan
.I 61
cacm
compil
hornick
ibm
matrix
septemb
tape
.I 62
cacm
curv
dimension
fit
lesh
multi
polynomi
septemb
squar
.I 63
ago
analyz
ancient
applic
back
binari
cacm
chines
circa
comput
concept
date
deriv
design
diagram
digit
electron
genesi
li
logic
modern
octal
paper
septemb
triniti
year
.I 64
algol
cacm
green
manipul
remark
septemb
symbol
.I 65
algol
cacm
committe
dijkstra
extens
heis
perli
report
samelson
septemb
.I 66
bemer
cacm
card
charact
code
gener
propos
septemb
.I 67
blachman
cacm
central
comput
european
septemb
.I 68
activ
administr
cacm
close
comput
convict
curricula
data
detail
develop
disciplin
equip
faculti
fein
field
financ
graduat
integr
investig
legitim
made
oper
organ
polici
present
process
program
provinc
recommend
reflect
relat
research
role
scholar
school
septemb
state
student
studi
unit
univers
.I 69
august
cacm
center
collect
comput
descript
hamblen
ibm
part
program
statist
univers
.I 70
accuraci
aegert
august
cacm
construct
determin
develop
eigenvalu
equat
find
invers
matric
matrix
paper
properti
routin
set
test
.I 71
access
address
advoc
aspect
assist
assumpt
attempt
august
avoid
baglei
cacm
capabl
charact
characterist
comput
concentr
construct
design
digit
discoveri
error
facil
fashion
feasibl
indirect
intend
interrupt
involv
larg
machin
necess
object
opportun
paper
prepar
program
propos
provid
random
real
scale
scheme
segment
set
similar
sourc
statement
storag
stress
system
time
trivial
unrealist
varieti
.I 72
august
cacm
comput
educ
hollingsworth
program
.I 73
assimil
cacm
data
gschwind
juli
real
time
.I 74
cacm
high
juli
procedur
shell
sort
speed
.I 75
cacm
chow
estim
juli
model
nonlinear
paramet
simpl
.I 76
binari
cacm
convers
decim
fix
fraction
juli
precis
taranto
.I 77
arden
cacm
construct
gat
graham
juli
translat
.I 78
activ
analog
analyst
appar
appli
assist
boundari
cacm
characterist
compens
comput
concern
cours
devic
differenti
digit
equat
establish
extens
found
framework
idea
imperfect
initi
june
machin
mathemat
model
normal
note
number
numer
ordinari
paper
practic
problem
procedur
process
purpos
remark
sequenti
solut
solv
wouk
.I 79
address
cacm
calcul
extend
june
machin
mechan
program
schecher
.I 80
automat
cacm
comput
critic
flexibl
june
rotat
schwartz
shaft
speed
techniqu
.I 81
cacm
gleissner
high
june
norc
printer
speed
.I 82
cacm
comput
examin
feasibl
handl
identifi
intern
june
languag
method
orient
present
processor
programm
substitut
symbol
william
.I 83
cacm
carr
center
comput
iii
june
soviet
union
visit
.I 84
automat
busi
ca
cacm
control
data
decemb
develop
feder
govern
ii
manag
part
process
progress
survei
system
trend
.I 85
analysi
arithmet
cacm
carr
error
float
iii
point
.I 86
april
automat
busi
cacm
congress
control
data
decemb
develop
feder
gener
govern
manag
process
progress
state
survei
system
trend
unit
.I 87
april
cacm
dimension
gener
method
muller
note
point
sphere
uniformli
.I 88
april
cacm
dimension
distribut
effici
gener
hick
method
point
sphere
surfac
uniformli
wheel
.I 89
april
cacm
coeffici
equat
find
larson
linear
marshal
polynomi
routin
simultan
solut
.I 90
april
arithmet
binari
cacm
comput
discret
ercoli
length
serial
vacca
variabl
word
.I 91
april
cacm
divis
gilman
machin
mathemat
procedur
.I 92
assort
attempt
begin
bemer
cacm
checklist
classif
comput
date
decis
degre
demonstr
desir
devic
educ
exist
feasibl
function
futur
highli
human
intellig
jungl
limit
made
make
manifest
march
oper
procedur
program
remark
reproduc
sophist
system
systemat
take
variat
.I 93
address
algebra
cacm
code
comput
enabl
formula
languag
march
orient
shown
simpl
techniqu
translat
wegstein
.I 94
cacm
curv
dimension
find
fit
howel
iter
logist
march
method
point
set
squar
.I 95
analog
appli
cacm
calcul
comput
data
differenti
electron
elimin
equat
equival
expand
exponenti
function
gener
hand
invers
march
mathemat
method
numer
ordinari
power
practic
procedur
requir
satisfi
set
simpl
solut
special
subroutin
suffici
tabular
transcendent
trigonometr
.I 96
analog
applic
bailin
bessel
cacm
comput
cost
desk
differenti
electron
equat
evalu
februari
finit
function
gener
hansen
helmholtz
ibm
integr
investig
litton
machin
merit
method
radiat
reev
rel
result
rutishaus
separ
seri
spheric
typic
wai
wave
.I 97
automat
cacm
capt
collom
comput
corp
develop
digit
februari
jr
luebbert
program
research
signal
.I 98
arithmet
automat
cacm
code
compil
februari
fortran
ibm
sheridan
system
translat
.I 99
algebra
cacm
februari
green
intern
languag
modif
.I 100
cacm
carr
compil
februari
iii
list
memori
recurs
subscript
type
.I 101
cacm
code
januari
nather
nuclear
reactor
sangren
.I 102
cacm
comparison
curtz
decemb
method
program
riordan
spohn
.I 103
accur
aid
author
cacm
complex
comput
consol
coordin
cope
decemb
depend
develop
difficult
electron
examin
experi
farbman
grow
ibm
ii
increas
ketov
meet
model
need
oper
outlin
process
profici
program
qualifi
quick
record
select
similar
skill
sophist
specif
tape
test
time
train
uniform
year
.I 104
air
altern
approach
arriv
cacm
capac
channel
character
common
compar
comput
control
decemb
decis
digit
discret
discuss
effect
extens
flow
handl
illustr
interact
involv
item
lewi
moor
movement
object
optim
packag
paper
paramet
physic
plant
portion
princip
problem
procedur
process
program
randomli
rate
simul
storag
studi
system
techniqu
traffic
util
.I 105
cacm
decemb
ibm
invers
jardin
method
price
word
.I 106
cacm
collin
comput
count
data
decemb
describ
desir
effici
eleg
emploi
enabl
eras
erasur
extent
gener
import
ineffici
interspers
lisp
list
longer
mccarthi
method
multipl
need
newel
occurr
overlap
paper
part
place
pose
present
problem
properti
refer
scheme
shaw
simon
solut
storag
store
subsequ
unfortun
.I 107
arithmet
cacm
decemb
multipl
pope
precis
stein
.I 108
cacm
correct
decemb
dimsdal
error
mercuri
program
project
weinberg
.I 109
approxim
cacm
decemb
lubkin
note
.I 110
cacm
decemb
ferguson
fibonaccian
search
.I 111
accuraci
appli
applic
bairstow
basic
cacm
circumv
comput
converg
decemb
degre
ellenberg
equat
exampl
great
high
illustr
invers
iter
newton
numer
pitfal
polynomi
present
procedur
program
raphson
rapid
realiz
recommend
reliabl
root
rule
scale
show
shown
solut
techniqu
.I 112
algorithm
cacm
decemb
ellenberg
equat
numer
polynomi
solut
.I 113
bemer
cacm
charact
code
decemb
represent
survei
.I 114
cacm
card
code
decemb
punch
smith
survei
william
.I 115
cacm
decemb
optim
structur
wheel
.I 116
ad
adder
bring
cacm
calcul
came
chines
chino
commun
concern
devic
enlist
evolut
help
histori
instrument
known
light
literatur
mathemat
member
mexico
motor
novemb
present
purpos
recent
refer
roger
statu
sumador
survei
trip
uncov
writer
.I 117
cacm
effici
estim
intern
method
nagler
novemb
rel
sort
.I 118
cacm
charact
ibm
novemb
scan
speckhard
.I 119
andru
cacm
comput
eigenvalu
note
novemb
.I 120
cacm
code
differenti
equat
novemb
sefton
simpl
techniqu
vaillancourt
.I 121
cacm
comput
control
holt
label
novemb
.I 122
cacm
circl
dewitt
fit
great
novemb
point
sphere
squar
.I 123
accept
algol
base
cacm
california
cdc
code
compil
comput
control
corpor
countess
data
develop
diego
electron
essenti
gener
ident
input
jr
laboratori
languag
machin
masterson
navi
neliac
novemb
program
rand
remington
run
san
univac
version
.I 124
algol
algorithm
assign
base
briefli
cacm
carri
code
comput
digit
discuss
effici
empir
experi
extens
formul
novemb
present
problem
relat
silver
size
solut
time
.I 125
algorithm
cacm
mackinnei
novemb
polynomi
transform
.I 126
algorithm
cacm
fit
mackinnei
novemb
orthogon
polynomi
squar
.I 127
algorithm
assign
cacm
novemb
silver
.I 128
algorithm
cacm
herroit
iii
novemb
rootfind
.I 129
algorithm
cacm
forsyth
herriot
ii
novemb
rootfind
.I 130
algorithm
arbitrari
cacm
function
leavenworth
novemb
real
zero
.I 131
algorithm
cacm
diagon
equat
leavenworth
linear
novemb
solut
tri
.I 132
algorithm
cacm
feurzeig
math
novemb
sort
.I 133
algorithm
bessel
cacm
function
kind
novemb
oser
riccati
.I 134
algorithm
bessel
borsch
cacm
function
integ
novemb
order
set
supan
.I 135
cacm
comput
digit
iv
octob
reev
univers
.I 136
cacm
calcul
ingerman
interest
note
octob
.I 137
cacm
english
evalu
express
number
octob
string
swift
word
.I 138
cacm
charact
corrigenda
octob
propos
reconcil
set
thought
voorhe
.I 139
algorithm
binomi
cacm
coeffici
kenyon
octob
.I 140
algorithm
cacm
crout
forsyth
octob
pivot
.I 141
cacm
octob
parallel
process
thought
yarbrough
.I 142
cacm
comment
count
octob
sherman
techniqu
.I 143
cacm
comput
datatron
ibm
list
octob
program
romberg
ss
system
univac
.I 144
accru
alphabet
approxim
bemer
benefit
binari
cacm
charact
code
combin
common
commun
comput
cost
dictionari
digit
english
entir
equip
form
group
ineffici
languag
made
method
name
non
number
numer
octob
peopl
phrase
place
present
provis
puls
pure
reflect
represent
requir
save
scheme
set
shorthand
simpl
singl
spars
stream
substitut
system
termin
time
translat
transmiss
transmit
word
.I 145
automat
cacm
class
grader
hollingsworth
octob
program
.I 146
act
april
attende
cacm
classroom
colleg
committe
comput
condens
confer
discuss
educ
engin
ford
foundat
held
idea
instruct
katz
kei
michigan
octob
offer
pertin
project
report
select
special
steer
time
topic
transcript
univers
.I 147
cacm
center
comput
confer
director
octob
report
univers
.I 148
cacm
comput
digit
iii
reev
septemb
univers
.I 149
algorithm
cacm
decis
dickson
effici
frederick
improv
linear
problem
program
rule
septemb
simplex
solv
.I 150
algorithm
cacm
continu
floyd
fraction
interpol
ration
septemb
.I 151
algorithm
cacm
iii
septemb
spragu
trdiag
.I 152
algorithm
cacm
crout
forsyth
pivot
septemb
.I 153
blatt
cacm
comment
fortran
septemb
user
.I 154
berin
cacm
converg
evalu
express
rapidli
septemb
.I 155
cacm
fredkin
memori
septemb
trie
.I 156
cacm
introductori
manipul
problem
rosin
septemb
student
symbol
.I 157
august
cacm
comput
digit
ii
reev
univers
.I 158
algorithm
august
cacm
ii
jr
rootfind
thacher
.I 159
algorithm
august
cacm
jr
rootfind
thacher
.I 160
algorithm
august
cacm
ii
jr
rootfind
thacher
.I 161
abbrevi
august
barrett
cacm
corrigendum
grem
systemat
word
.I 162
august
cacm
count
frieden
techniqu
variant
.I 163
august
cacm
count
ibm
kutler
.I 164
august
cacm
effici
jr
notat
short
smith
studi
.I 165
algol
august
cacm
dialect
halstead
huskei
neliac
.I 166
cacm
close
compat
comput
digit
famili
juli
luebbert
program
relat
.I 167
algol
analysi
cacm
check
combin
juli
mcisaac
statement
valid
.I 168
algorithm
cacm
codd
constraint
extern
juli
multiprogram
part
schedul
.I 169
cacm
holmstrom
juli
multilingu
project
terminolog
.I 170
cacm
charact
juli
propos
reconcil
set
thought
voorhe
.I 171
cacm
comput
digit
juli
part
reev
univers
.I 172
algorithm
beam
cacm
complex
exponenti
integr
juli
.I 173
atla
cacm
comput
concept
design
june
larg
.I 174
cacm
doubleexponenti
estim
interv
june
neal
process
ratio
state
time
total
.I 175
anderson
cacm
comput
differenti
digit
equat
gener
june
ordinari
purpos
simultan
solut
.I 176
cacm
corrigendum
june
list
manipul
perli
symbol
thornton
thread
.I 177
acm
algorithm
bairstow
cacm
commun
equat
februari
grau
hitchcock
jr
june
method
polynomi
solut
thacher
.I 178
algorithm
cacm
jr
june
rootfind
thacher
.I 179
algorithm
cacm
evalu
galler
june
legendr
pn
polynomi
recurs
.I 180
algorithm
cacm
evalu
galler
june
laguerr
ln
polynomi
recurs
.I 181
algorithm
cacm
evalu
galler
hermit
hn
june
polynomi
recurs
.I 182
algorithm
cacm
chebyshev
evalu
galler
june
polynomi
recurs
tn
.I 183
cacm
convers
float
june
perri
point
represent
.I 184
cacm
error
june
measur
method
power
robinson
seri
short
squar
strubl
.I 185
abil
algorithm
applic
cacm
capabl
class
codd
comput
concis
concurr
constraint
construct
defeat
determin
entail
entir
execut
exploit
extent
extern
extrem
fast
fulli
introduct
june
larg
machin
minim
multiprogram
order
part
pend
possess
preced
process
program
prove
rapid
respect
routin
run
schedul
sequenti
simultan
subject
subset
tend
theori
time
urgenc
wide
workload
.I 186
addendum
algol
algorithm
assign
cacm
defin
floyd
june
statement
.I 187
cacm
compil
connect
june
swift
.I 188
berezin
cacm
comput
depart
june
mathemat
moscow
state
univers
.I 189
automat
booth
cacm
comput
digit
futur
june
.I 190
bendix
cacm
system
.I 191
abbrevi
barrett
cacm
grem
systemat
word
.I 192
binari
cacm
comput
count
techniqu
wegner
.I 193
assign
automat
cacm
patrick
start
storag
.I 194
cacm
comput
continu
divisionless
root
sarafyan
squar
.I 195
cacm
code
patterson
.I 196
algol
algorithm
backu
cacm
languag
naur
report
.I 197
april
cacm
imaginari
knuth
number
system
.I 198
april
cacm
comput
digit
gurzi
high
multipl
process
speed
.I 199
algorithm
april
cacm
claussen
euclidian
.I 200
algorithm
april
asymptot
bessel
cacm
clark
expans
function
.I 201
algorithm
april
bessel
cacm
clark
expans
funtion
seri
.I 202
april
block
cacm
check
comput
control
conveni
data
describ
diagnosi
diagnost
facilit
featur
format
includ
instruct
integr
load
logic
make
method
monitor
number
object
oper
paper
program
section
senko
similar
simpl
subroutin
system
understand
.I 203
april
brown
cacm
combin
decod
integ
time
.I 204
april
cacm
pattern
prove
recognit
theorem
wang
.I 205
accept
april
assembl
cacm
capabl
compil
condit
construct
definit
extens
extrem
function
gener
ground
instruct
languag
macro
macroinstruct
made
make
mcilroi
nest
notat
parenthet
power
serv
set
small
.I 206
april
cacm
green
manipul
symbol
xtran
.I 207
algol
april
augment
cacm
semant
smith
syntact
.I 208
april
cacm
inform
introduct
languag
newel
process
tong
.I 209
april
cacm
list
manipul
perli
symbol
thornton
thread
.I 210
april
cacm
comput
express
function
machin
mccarthi
part
recurs
symbol
.I 211
cacm
chart
flow
grem
march
share
standard
symbol
.I 212
algorithm
bisect
cacm
gorn
march
routin
.I 213
cacm
invers
laplac
march
numer
schmittroth
transform
.I 214
algol
algorithm
assign
cacm
defin
floyd
march
statement
.I 215
brook
cacm
execut
fourth
instruct
march
mode
oper
sequenc
.I 216
abacu
cacm
convers
kanner
march
note
number
.I 217
cacm
comput
march
soviet
technolog
.I 218
cacm
comput
concord
februari
painter
poetri
prepar
.I 219
cacm
februari
marriag
problem
shuchter
.I 220
cacm
comput
divis
februari
method
root
squar
traub
.I 221
basic
cacm
februari
label
logan
side
tape
.I 222
cacm
carri
case
code
comput
dealt
easili
extern
februari
form
inform
intern
isomorph
lynch
point
present
preserv
properti
relev
symbol
.I 223
cacm
februari
pelta
program
selfciph
.I 224
address
admiss
algol
algorithm
bauer
cacm
calcul
call
case
cellar
control
conveni
descript
element
extrem
feasibl
februari
formula
furnish
languag
machin
matrix
optim
pair
process
program
recurs
repres
rule
samelson
sequenc
sequenti
simpl
state
statement
symbol
syntax
time
transit
translat
treatment
.I 225
cacm
corrigendum
februari
greenwald
handl
instruct
macro
techniquefor
.I 226
algorithm
bairstow
cacm
equat
februari
grau
hitchcock
method
polynomi
solut
.I 227
algorithm
cacm
februari
rootfind
wegstein
.I 228
algorithm
cacm
februari
herbold
quadi
.I 229
cacm
februari
gruenberg
propos
terminolog
.I 230
bemer
cacm
charact
code
compat
februari
propos
.I 231
acm
cacm
februari
kent
propos
public
set
standard
.I 232
cacm
frank
high
januari
lazaru
procedur
sort
speed
.I 233
abstract
addit
cacm
code
januari
nather
nuclear
reactor
sangren
.I 234
assembl
cacm
ibm
januari
program
sap
speckhard
.I 235
baglei
cacm
januari
piec
think
.I 236
articl
author
automat
cacm
comput
congress
control
cybernet
decemb
deleg
feigenbaum
held
ifac
made
moscow
observ
record
research
scienc
soviet
summer
technolog
union
visit
.I 237
boo
cacm
comput
decemb
peek
product
robbin
sheet
.I 238
analysi
biochem
cacm
decemb
garfinkel
higgin
rutledg
simul
system
.I 239
belzer
boolean
cacm
decemb
function
goffman
ineffici
inform
retriev
system
verhoeff
.I 240
block
cacm
decemb
graham
magnet
process
sprott
tape
variabl
.I 241
accuraci
addit
applic
cacm
calcul
case
comput
conserv
convolut
decemb
directli
distribut
entri
exist
lechner
machin
memori
method
minimum
moment
multipl
necessit
number
present
probabl
refer
repeat
requir
straightforward
tabul
time
.I 242
addit
attempt
cacm
check
comput
decemb
describ
digit
divis
geometr
limit
made
method
modulu
multipl
note
show
system
util
verif
weight
wilson
.I 243
arrai
arrang
ashenhurst
base
binari
bit
cacm
check
code
conceptu
correct
decemb
detect
develop
diagon
dimens
dimension
discuss
effect
encod
error
essenti
evalu
evidenc
extens
famili
greater
higher
horizont
increas
introduc
main
messag
minnick
multidimension
multipl
paper
pariti
plan
power
prescrib
process
purpos
rectangular
restrict
rubinoff
select
similar
singl
straightforward
vertic
.I 244
algorithm
cacm
decemb
ellipt
incomplet
integr
kriebel
.I 245
algorithm
associ
cacm
decemb
herndon
kind
legendr
polynomi
set
.I 246
algorithm
cacm
decemb
fit
macmillan
orthogon
polynomi
squar
.I 247
algorithm
cacm
decemb
ellipt
incomplet
integr
jefferson
.I 248
acm
angel
cacm
committe
consist
decemb
discuss
garner
hall
impress
interest
lo
mathemat
meet
moder
nation
necessarili
note
panel
panelist
particip
posit
program
proprietari
repres
septemb
smith
sole
special
th
.I 249
baker
cacm
decemb
gorn
languag
mechan
processor
specif
.I 250
applic
cacm
engin
logic
nickerson
novemb
structur
tabl
.I 251
ammunit
angl
archambault
armament
ballist
cacm
calcul
cam
comput
control
data
design
digit
essenti
fire
gener
introduc
main
manufactur
novemb
paper
preproduct
present
profil
program
rapid
requir
superelev
system
tank
type
util
.I 252
achiev
basic
cacm
check
combin
comput
continu
cross
data
defens
describ
dow
duplex
final
greater
input
integr
intermedi
level
method
militari
novemb
oper
packag
paper
process
program
reliabl
requir
result
similar
special
system
.I 253
abstract
cacm
chaudhuri
complex
cover
foata
minimum
novemb
program
rai
.I 254
acm
agre
algol
bachelork
cacm
compil
comput
confer
consid
counter
defin
dempster
express
final
group
interest
joint
knuth
languag
later
month
nation
novemb
peopl
preliminari
present
prior
propos
recommend
report
result
size
smalgol
small
speroni
standard
subcommitte
subset
user
version
western
.I 255
algorithm
augment
breed
cacm
novemb
.I 256
algorithm
cacm
dubai
matric
novemb
set
test
.I 257
algorithm
cacm
invert
knapp
novemb
shaman
.I 258
algorithm
cacm
composit
gener
hellerman
novemb
ogden
.I 259
algorithm
cacm
covey
novemb
permut
sullivan
.I 260
aitken
algorithm
cacm
interpol
mifsud
novemb
.I 261
cacm
moor
novemb
split
tape
.I 262
cacm
map
moor
novemb
ruw
.I 263
altern
cacm
librari
load
moor
novemb
routin
select
.I 264
algorithm
cacm
gener
merg
novemb
polyphas
reynold
.I 265
arithmet
barnett
bit
cacm
charact
code
deal
describ
displai
expand
fortran
input
languag
level
low
manipul
multi
novemb
output
paper
precis
program
set
subroutin
symbol
visual
.I 266
cacm
fit
method
novemb
robinson
sphere
squar
.I 267
algol
cacm
effici
improv
novemb
propos
wilk
.I 268
alloc
cacm
cohen
evalu
octob
static
stochast
storag
.I 269
alloc
base
cacm
core
octob
probabl
riskin
.I 270
algorithm
alloc
cacm
jr
kellei
octob
storag
techniqu
.I 271
alloc
automat
cacm
heis
larner
load
octob
semi
storag
system
time
.I 272
administr
algol
alloc
auxiliari
block
cacm
control
core
data
detail
direct
drum
full
inform
instruct
jensen
machin
magnet
mondrup
naur
octob
program
programm
routin
run
scheme
storag
store
time
.I 273
alloc
automat
cacm
collin
experi
jr
octob
storag
.I 274
alloc
atla
automat
back
cacm
comput
dynam
fotheringham
includ
octob
storag
store
.I 275
alloc
cacm
dynam
inform
octob
retriev
sam
storag
system
.I 276
activ
alloc
applic
armi
ascii
cacm
comput
concern
core
design
dynam
headquart
holt
intellig
keep
materi
matic
militari
octob
oper
organ
paper
part
plan
portion
present
program
project
record
storag
system
techniqu
.I 277
alloc
cacm
maher
multiprocessor
multiprogram
octob
problem
storag
system
.I 278
address
admiss
alloc
arbitrari
attempt
cacm
case
complet
comput
consid
data
direct
discuss
effect
establish
execut
exist
extern
fictiti
formal
formul
gener
ident
interlud
intern
interpret
jr
link
locat
map
octob
period
possess
practic
primari
process
program
proof
realiz
refer
respect
restrict
robert
sequenc
set
special
specif
storag
subprogram
term
time
total
tractabl
unbound
underwhich
.I 279
alloc
cacm
case
dynam
octob
sam
storag
.I 280
alloc
approach
cacm
compil
octob
preplan
storag
.I 281
antilog
approxim
cacm
consid
deriv
describ
emin
evalu
exponenti
famili
fast
feurzeig
formul
formula
hex
high
indirect
natur
note
octob
practic
precis
produc
put
recent
.I 282
area
basi
bypass
cacm
case
check
comput
consid
critic
decis
depend
determin
develop
error
evalu
expect
formula
futur
hutchinson
loss
magnet
number
occur
optimum
paper
procedur
program
read
record
rewrit
routin
rule
select
septemb
size
system
tape
time
try
write
written
.I 283
cacm
complex
invers
matrix
septemb
tornheim
.I 284
algebra
algorithm
analysi
applic
block
cacm
cipi
compil
confin
conjunct
connect
continu
deriv
develop
devic
diagram
enablesu
express
extend
feedback
form
function
linear
loop
machin
manipul
mathemat
multi
origin
problem
program
purpos
represent
rom
septemb
simplifi
studi
sum
system
task
transfer
virtu
.I 285
cacm
houghton
matric
septemb
solut
tridiagon
wenrick
.I 286
bramhal
cacm
invers
iter
method
power
septemb
seri
.I 287
cacm
event
gener
import
septemb
shapiro
techniqu
vreenegoor
.I 288
algol
cacm
chart
septemb
syntact
taylor
turner
waychoff
.I 289
alexand
algorithm
cacm
critic
path
schedul
septemb
.I 290
algorithm
cacm
chain
mayoh
septemb
trace
.I 291
cacm
hoffman
mobol
opler
preparingretriev
program
septemb
.I 292
bacon
cacm
horti
inform
kehl
languag
legal
mitchel
retriev
septemb
studi
.I 293
appli
basin
cacm
david
laboratori
mathemat
model
richston
septemb
taylor
.I 294
august
cacm
imaginari
knuth
number
system
.I 295
approxim
august
cacm
clendenin
error
function
ration
similar
.I 296
arithmet
august
cacm
cox
luther
multipl
note
precis
.I 297
august
cacm
circl
fit
great
marcu
note
squar
.I 298
adequaci
appli
august
bit
cacm
carlo
come
comput
determin
distribut
frequenc
gener
half
integ
interv
kuehn
low
ly
mean
million
moment
mont
number
obtain
order
program
pseudo
random
run
set
signific
statist
substanti
suitabl
test
.I 299
algorithm
august
cacm
gener
merg
polyphas
reynold
.I 300
august
cacm
chosen
cobol
comput
control
depart
languag
mackinson
merchandis
mythic
potenti
present
problem
program
run
sampl
simplifi
store
system
user
.I 301
algorithm
august
cacm
gilbert
matric
set
test
.I 302
algorithm
augment
august
cacm
rice
.I 303
air
august
basic
cacm
connect
forc
foundat
gorn
jointli
languag
mechan
nation
offic
paper
part
pennsylvania
processor
research
scienc
scientif
suggest
support
terminolog
univers
work
.I 304
algorithm
cacm
complex
jr
juli
nestor
nth
number
root
.I 305
algorithm
cacm
caffrei
cram
juli
.I 306
algorithm
cacm
cafferi
invr
juli
.I 307
algorithm
cacm
find
hoar
juli
.I 308
algorithm
cacm
hoar
juli
quicksort
.I 309
algorithm
cacm
hoar
juli
partit
.I 310
algorithm
associ
cacm
herndon
juli
kind
legendr
polynomi
set
.I 311
algorithm
arithmet
cacm
gibb
juli
procedur
rang
.I 312
approxim
cacm
juli
note
olivi
.I 313
bramhal
cacm
invers
iter
juli
method
power
seri
.I 314
cacm
clarkson
convers
divisionless
integ
juli
method
princ
.I 315
cacm
juli
matric
solut
tridiagon
wenrick
.I 316
algorithm
arden
cacm
declar
equival
galler
graham
juli
.I 317
approxim
bellman
cacm
curv
dynam
june
line
program
segment
.I 318
activ
cacm
combat
fire
fischer
june
stabil
suspens
vehicl
.I 319
approach
approxim
cacm
class
consid
deriv
discuss
error
estim
euler
final
formula
gener
histor
iter
june
known
notat
note
number
obtain
pade
procedur
ration
section
short
show
simplifi
suggest
traub
unifi
.I 320
aspect
cacm
cantrel
chart
circuit
code
compil
comput
consid
develop
dimension
directli
elimin
enabl
exampl
excel
explain
express
flow
fulli
hand
june
king
logic
machin
mean
natur
need
oper
parallel
procedur
program
requir
rule
sequenti
set
simpl
structur
system
tabl
vend
write
.I 321
admir
algol
algorithm
assign
author
base
beginn
cacm
certainli
class
compil
complex
confidenti
consid
correctli
crop
describ
detail
difficult
discuss
easi
encount
enorm
experi
explain
fact
featur
final
gener
handl
hard
impos
june
knuth
languag
later
learn
li
lift
lot
merner
obscur
paper
part
power
precis
present
problem
purpos
readabl
remark
report
restrict
serv
shown
statement
technic
thing
unnecessari
unobvi
us
write
written
.I 322
awar
bright
broad
cacm
chairman
code
committe
compat
compon
comput
consid
consider
convent
devot
effici
effort
fact
feel
fix
gener
georg
grow
hardwar
incompat
interest
june
manual
medium
minim
number
occupi
oper
organ
problem
program
recogn
requir
resolv
ryckman
set
share
standard
storag
suffici
system
time
user
util
view
.I 323
blachman
cacm
comput
digit
europ
june
state
technolog
.I 324
algorithm
bauer
cacm
integr
june
romberg
.I 325
alexand
algorithm
cacm
equat
numer
polynomi
solut
.I 326
algorithm
cacm
mathsort
ranshaw
.I 327
algorithm
bareiss
cacm
fisherkel
polynomi
procedur
real
result
zero
.I 328
algorithm
cacm
cohen
invers
matrix
.I 329
abstract
analysi
applic
approach
automat
cacm
concept
conclus
content
date
detail
discuss
document
edmundson
frequenc
group
includ
index
linguist
machin
mathemat
measur
point
prepar
present
problem
publish
read
recommend
rel
report
scanner
sentenc
signific
solut
sophist
studi
summari
survei
techniqu
transmit
widespread
word
write
wylli
.I 330
area
baker
cacm
evalu
function
method
normal
.I 331
approxim
bellman
cacm
comput
differenti
equat
ordinari
problem
storag
success
.I 332
access
addit
address
base
basi
briefli
cacm
chain
detail
effici
enter
gener
indirect
johnson
kei
method
permit
present
pseudo
random
recoveri
review
secondari
survei
transform
wide
.I 333
bemer
cacm
code
data
design
improv
jr
process
smith
transmiss
william
.I 334
april
cacm
divis
imaginari
nadler
number
quater
root
squar
system
.I 335
accuraci
advantag
april
bellman
cacm
case
comparison
ellipt
ellipticboundari
equat
exp
experi
form
gener
iter
juncosa
kalaba
linear
method
newton
nonlinear
numer
obtain
offer
parabol
picard
problem
procedur
quisi
result
show
solv
substanti
time
xx
yy
.I 336
april
cacm
determin
factor
kulsrud
method
optimum
practic
relax
success
techniqu
.I 337
april
cacm
card
code
punch
ross
survei
.I 338
algorithm
april
cacm
grout
ii
jr
thacher
.I 339
alexand
algorithm
april
cacm
exponenti
integr
jr
real
thacher
.I 340
algorithm
april
cacm
herndon
legendr
polynomi
.I 341
algorithm
april
cacm
chebyschev
herndon
polynomi
.I 342
algorithm
april
barstow
cacm
equat
herndon
hitchcock
polynomi
solut
.I 343
algol
algorithm
april
cacm
error
frequent
herndon
occur
program
.I 344
algorithm
april
bei
ber
cacm
function
herndon
.I 345
algorithm
april
cacm
complet
ellipt
herndon
integr
kind
.I 346
algorithm
april
cacm
complet
ellipt
herndon
integr
kind
.I 347
algorithm
april
cacm
function
gamma
herndon
rang
.I 348
algorithm
april
cacm
complex
herndon
nth
number
root
.I 349
april
cacm
herndon
matric
set
test
.I 350
adjust
algorithm
april
cacm
element
herndon
invers
matrix
perturb
.I 351
algorithm
april
cacm
finit
herndon
hilbert
invers
matrix
segment
.I 352
algorithm
april
cacm
function
herndon
neumant
spheric
.I 353
algorithm
april
cacm
complex
herndon
logarithm
number
.I 354
algorithm
april
argument
cacm
function
herndon
imaginari
kind
legendr
real
.I 355
algorithm
april
cacm
complex
exponenti
herndon
number
.I 356
algorithm
april
cacm
ingerman
interest
.I 357
algorithm
april
bessel
cacm
comput
function
recurs
wojcicki
.I 358
algorithm
april
cacm
crout
ii
jr
pivot
thacher
.I 359
algorithm
april
cacm
invert
wood
.I 360
algorithm
april
cacm
determin
evalu
solomon
.I 361
april
cacm
comput
correct
decim
error
program
weinberg
.I 362
april
cacm
look
sherman
tabl
techniqu
.I 363
approxim
april
cacm
continu
fraction
karst
number
transcendent
.I 364
april
cacm
compil
nather
subscript
variabl
.I 365
april
argument
bessel
cacm
complex
function
grai
integr
order
.I 366
april
cacm
eigenvalu
matrix
smith
symmetr
.I 367
april
assum
cacm
circular
creat
direct
element
free
high
identifi
lasser
line
list
network
node
non
number
numer
order
randomli
segment
simpl
speed
system
techniqu
termin
topolog
.I 368
algorithm
arbitrari
cacm
colling
function
march
real
zero
.I 369
algorithm
cacm
crout
jr
march
pivot
thacher
.I 370
algorithm
bisect
cacm
march
rader
routin
.I 371
algorithm
cacm
march
remark
wilkinson
.I 372
algorithm
cacm
critic
leavenworth
march
path
schedul
.I 373
algorithm
cacm
coeffici
correl
march
matrix
multipl
sassouni
.I 374
algorithm
bron
cacm
march
telescop
.I 375
algorithm
bron
cacm
march
telescop
.I 376
algorithm
cacm
gianni
march
tchebycheff
.I 377
algorithm
cacm
march
siev
wood
.I 378
cacm
calcul
gener
manipul
march
numer
ross
symbol
techniqu
.I 379
bitwis
cacm
march
oper
strachei
.I 380
author
cacm
calcul
compar
comparison
converg
data
estim
includ
input
iter
machin
macrocompil
march
method
nth
propos
root
run
theoret
time
traub
varieti
wai
.I 381
altern
bratman
cacm
form
march
.I 382
bush
cacm
carolina
februari
north
program
statist
univers
.I 383
cacm
caldwel
februari
find
minimum
network
penalti
rout
turn
.I 384
algorithm
cacm
februari
function
gamma
lipp
.I 385
algorithm
cacm
factori
februari
lipp
.I 386
algorithm
cacm
februari
freeman
jr
multint
.I 387
algorithm
cacm
colling
februari
function
gamma
.I 388
algorithm
bairstow
cacm
equat
februari
hitchcock
method
polynomi
solut
vandergraft
.I 389
algorithm
cacm
exponenti
februari
integr
peavi
real
.I 390
algorithm
cacm
complex
exponenti
februari
integr
jr
rader
thacher
.I 391
bk
cacm
februari
philco
smith
system
.I 392
cacm
comment
februari
nekora
paper
parallel
process
.I 393
algebra
cacm
carr
compil
februari
hanson
iii
manipul
subroutin
symbol
.I 394
cacm
data
februari
multipl
process
program
ryle
.I 395
cacm
divis
februari
multipl
precis
rabinowitz
.I 396
accur
analysi
applic
area
autom
automat
cacm
check
checkpoint
code
complex
conjunct
creat
criteria
data
debug
effect
enforc
error
execut
flexibl
function
inform
input
jacobi
juli
later
layton
lead
locat
loop
maximum
memori
perform
program
programm
record
reduc
repetit
result
run
set
specifi
substanti
system
techniqu
time
trace
verifi
.I 397
abbrevi
articl
basic
book
cacm
card
choic
class
code
column
cross
descriptor
divid
entri
equip
februari
field
flexibl
format
gener
grem
hardwar
ibm
identif
identifi
includ
index
inform
interest
kind
machin
major
materi
matrix
number
paper
person
process
program
propos
refer
rigid
sourc
standard
suffici
suitabl
summari
system
term
titl
varieti
.I 398
cacm
januari
siblei
slang
system
.I 399
algol
boolean
cacm
compil
condit
express
huskei
januari
statement
techniqu
wattenburg
.I 400
algol
block
cacm
comment
feurzeig
implement
iron
januari
procedur
recurs
.I 401
algol
alloc
arrai
cacm
januari
sattlei
storag
.I 402
cacm
declar
dynam
ingerman
januari
.I 403
cacm
comment
compil
declar
ingerman
januari
procedur
statement
thunk
.I 404
algol
cacm
compil
direct
iron
januari
syntax
.I 405
algorithm
arithmet
cacm
code
compil
constant
effici
equival
evalu
exist
fetch
floyd
formula
ineffici
januari
method
number
oper
recogn
reduc
scheme
store
subexpress
translat
yield
.I 406
algol
assembl
cacm
combin
construct
evan
januari
jr
list
machin
perli
processor
thread
van
zoeren
.I 407
cacm
compil
displai
formula
januari
languag
madcap
scientif
textbook
well
.I 408
arden
cacm
galler
graham
intern
januari
mad
organ
translat
.I 409
accept
algorithm
base
cacm
cheatham
cl
collin
command
compil
complex
comput
concept
content
data
defin
descript
detail
develop
discuss
distinct
environ
express
facilit
famili
flexibl
ibm
inform
instanc
intercommun
januari
jr
languag
larg
leonard
master
problem
process
program
programm
provid
provis
realiz
retriev
scale
set
solut
store
system
.I 410
cacm
clark
clip
englund
januari
translat
.I 411
algol
bottenbruch
cacm
data
januari
magnet
oracl
storag
tape
translat
.I 412
algol
cacm
grai
januari
process
recurs
translat
.I 413
arithmet
basic
cacm
compil
express
huskei
januari
wattenburg
.I 414
announc
busi
cacm
corpor
data
decemb
develop
disk
drive
featur
ibm
interchang
intern
machin
newli
pack
process
recent
storag
system
unit
wheel
.I 415
cacm
comput
decemb
digit
germani
schuff
western
.I 416
boundari
cacm
decemb
method
morrison
multipl
point
problem
rilei
shoot
zancanaro
.I 417
achiev
alert
aspect
assist
burden
busi
cacm
call
clearanc
climat
comput
decemb
effect
entangl
favor
forestal
freed
gener
implic
industri
interpret
involv
lawyer
legal
make
minim
opportun
paper
plan
point
potenti
respons
situat
specialist
stage
suggest
system
technic
techniqu
technolog
varieti
wai
.I 418
algorithm
behrenz
cacm
decemb
random
.I 419
algorithm
cacm
decemb
jr
magic
squar
thacher
.I 420
algorithm
cacm
decemb
perm
phillip
.I 421
algorithm
cacm
decemb
hacker
point
polygon
posit
rel
.I 422
algorithm
cacm
combin
decemb
grench
.I 423
algorithm
behrenz
cacm
decemb
invers
matrix
.I 424
algorithm
behrenz
cacm
decemb
function
gamma
.I 425
algorithm
cacm
complet
decemb
ellipt
integr
merner
.I 426
algorithm
cacm
collison
decemb
magic
squar
term
.I 427
algorithm
amit
cacm
decemb
psif
.I 428
algorithm
cacm
decemb
integr
mckeeman
multipl
.I 429
adapt
cacm
decemb
integr
mckeeman
nimer
simpson
.I 430
algorithm
cacm
decemb
jr
kaup
treesort
.I 431
algorithm
cacm
decemb
jr
kaup
treesort
.I 432
algorithm
cacm
decemb
haflei
lewi
regress
triangular
.I 433
arrai
cacm
comput
decemb
fix
length
sonquist
variabl
word
world
.I 434
cacm
charact
decemb
fortran
ii
jr
manipul
poor
.I 435
area
author
basi
bigger
cacm
compil
concern
data
deal
decemb
decis
develop
effort
emploi
evolutionari
execut
exist
great
handl
idea
implement
improv
incorpor
input
instantan
interest
languag
maintain
matrix
method
multiprogram
neglect
occur
present
problem
procedur
process
program
provid
routin
simpl
spent
standard
system
time
vasilako
.I 436
cacm
comput
decemb
evalu
knuth
polynomi
.I 437
cacm
compil
decemb
galler
matrix
oper
perli
.I 438
cacm
decemb
gorn
linguist
mechan
miniatur
motion
pragmat
studi
system
time
.I 439
cacm
comput
control
digit
line
measur
neurolog
novemb
okab
payn
stark
system
.I 440
appli
basi
cacm
collect
consider
demograph
develop
devis
difficulti
discrimin
discuss
document
encount
famili
gener
group
health
identifi
individu
inform
item
kennedi
larg
linkag
make
match
maximum
methodolog
name
nearli
newcomb
novemb
optim
particular
person
power
primarili
problem
purpos
record
reliabl
research
retriev
rule
search
special
studi
system
underli
unreli
updat
util
vital
wai
.I 441
achiev
activ
adapt
analysi
anticip
baltimor
byproduct
cacm
complet
develop
discuss
effici
gener
greater
handl
hour
implement
involv
kahn
larg
larger
lockhe
machin
method
need
network
novemb
obtain
order
paper
permit
pert
plan
present
problem
procedur
program
regard
requir
serv
sort
techniqu
term
time
topolog
treatment
westinghous
.I 442
algorithm
cacm
crout
equilibr
iter
mckeeman
novemb
.I 443
algorithm
cacm
complex
decemb
erwin
jr
number
power
real
.I 444
algorithm
cacm
evalu
jacobi
novemb
symbol
.I 445
algorithm
cacm
combin
novemb
.I 446
behrenz
cacm
novemb
simpson
.I 447
cacm
calcul
certif
easter
novemb
william
.I 448
algorithm
cacm
ingerman
matrix
novemb
path
.I 449
algorithm
cacm
ingerman
invers
matrix
novemb
.I 450
algorithm
cacm
diophantin
equat
novemb
peck
solut
.I 451
algorithm
cacm
dahm
ii
nest
novemb
statement
well
.I 452
algorithm
cacm
dahm
nest
novemb
statement
well
.I 453
algorithm
cacm
enlarg
group
novemb
well
.I 454
algorithm
cacm
crout
equilibr
iter
mckeeman
novemb
.I 455
algorithm
cacm
exponenti
fetti
novemb
seri
.I 456
algorithm
behrenz
cacm
novemb
random
.I 457
brown
cacm
integr
mechan
novemb
quantum
slater
type
.I 458
algorithm
allen
cacm
coeffici
determin
novemb
smith
.I 459
algorithm
cacm
eav
lt
novemb
permut
.I 460
algorithm
cacm
minifun
novemb
whitlei
.I 461
analysi
cacm
case
code
comput
data
histori
lipkin
medic
octob
woodburi
.I 462
adapt
addit
applic
approach
artifici
background
cacm
center
choos
class
classif
classifi
clinic
comparison
comput
deal
devic
diagnosi
digit
electrocardiogram
electrocardiograph
filter
five
gener
good
human
import
inspect
intellig
interest
live
machin
make
match
method
motiv
multipl
normal
obtain
octob
okajima
pattern
peopl
perform
phase
practic
present
problem
program
purpos
recognit
report
result
serv
signal
stark
techniqu
train
undergo
visual
whippl
.I 463
ambigu
cacm
floyd
languag
octob
phrase
structur
.I 464
account
addit
analysi
analyz
barnett
cacm
comput
consist
describ
descript
digit
discuss
enabl
express
form
futrel
gener
input
languag
materi
octob
orient
output
paper
perform
present
previous
problem
program
question
relat
report
result
shadow
string
subroutin
summari
syntact
syntax
tabl
tabular
trace
transform
unpublish
version
work
year
.I 465
algorithm
cacm
octob
perm
schrack
.I 466
algorithm
arithmet
cacm
gener
georg
octob
order
.I 467
algorithm
cacm
gener
octob
permut
schrack
shimrat
.I 468
algorithm
cacm
ellipt
incomplet
integr
jefferson
octob
.I 469
algorithm
cacm
critic
hellberg
octob
path
schedul
.I 470
algorithm
cacm
fourier
octob
seri
summat
well
.I 471
algorithm
cacm
octob
ortho
walsh
.I 472
cacm
count
gauss
octob
.I 473
algorithm
cacm
octob
rutishaus
weightcoeff
.I 474
cacm
data
fortran
input
octob
organ
yarbrough
.I 475
cacm
invers
matrix
octob
pei
procedur
test
.I 476
cacm
ii
nadler
octob
remark
sampl
tape
.I 477
cacm
muller
octob
remark
sampl
tape
.I 478
baecker
cacm
implement
octob
stack
.I 479
accept
algorithm
cacm
dispers
econom
level
manner
mendoza
merg
number
octob
paper
pass
polyphas
present
prove
reach
shown
string
techniqu
.I 480
cacm
calcul
corrigendum
ellipt
function
jacobian
quick
salzer
septemb
.I 481
armerd
cacm
comput
dai
gruenberg
look
mark
parkin
septemb
.I 482
cacm
comput
feldman
list
philco
processor
septemb
tall
.I 483
algol
cacm
defin
floyd
formal
grammar
inform
mechan
nonexist
partli
phrase
restrict
septemb
shown
state
structur
suffici
type
.I 484
algorithm
cacm
function
hankel
schaefer
septemb
.I 485
algorithm
cacm
crawford
erf
error
function
real
septemb
techo
.I 486
algorithm
cacm
dietzel
matrix
septemb
tridiagon
.I 487
algorithm
cacm
normdev
septemb
shafer
.I 488
cacm
comput
heurist
multiprogram
page
septemb
turn
weil
.I 489
cacm
comput
ipl
june
philco
septemb
shaffer
statu
.I 490
cacm
garfinkel
graphic
method
output
printer
program
septemb
.I 491
cacm
comput
cost
design
digit
low
multiprogram
pearcei
penni
septemb
.I 492
address
advantag
analysi
august
base
basi
cacm
calcul
chain
comput
customari
displac
distribut
identif
interest
introduct
jr
larg
markov
mathemat
method
model
number
paper
present
probabl
probe
reader
recircul
record
requir
schai
spruth
suffici
summari
type
.I 493
august
cacm
classif
design
mcgee
method
process
properti
.I 494
adjoint
arbitrari
august
cacm
compact
domain
finit
guseman
integr
jr
luther
matric
process
sequenti
.I 495
adjust
advantag
allow
august
buse
cacm
capac
coeffici
comput
definit
devis
element
equat
evalu
handl
high
independ
invers
invert
larg
larger
levi
manipul
matric
matrix
measur
memori
method
normal
order
paramet
posit
precis
procedur
program
requir
result
simultan
solv
speed
squar
store
symmetr
symmetri
take
.I 496
august
brenner
cacm
comput
matric
program
set
test
.I 497
ad
addit
analyt
august
bellman
briefli
cacm
compris
comput
confin
consid
constraint
curv
deriv
determin
discret
dynam
end
equat
fit
found
fulli
function
give
gluss
interv
involv
line
minim
paper
point
previous
primarili
problem
procedur
program
recent
reduc
remark
search
segment
show
shown
similar
solut
squar
stone
subdivis
suggest
.I 498
algorithm
august
cacm
collison
magic
squar
.I 499
algorithm
august
cacm
collison
gener
permut
.I 500
algorithm
august
cacm
collison
permut
.I 501
algorithm
august
cacm
hillmor
jacobi
.I 502
august
cacm
georg
simpson
.I 503
algorithm
august
cacm
coeffici
collison
integ
polynomi
ration
root
.I 504
algorithm
august
cacm
factor
hillmor
.I 505
algorithm
august
cacm
collison
composit
gener
.I 506
algorithm
august
cacm
hillmor
permut
.I 507
algorithm
august
cacm
find
hillmor
partit
quicksort
.I 508
algorithm
august
cacm
georg
invers
matrix
.I 509
algorithm
august
cacm
invers
matrix
strubl
.I 510
algorithm
august
bei
ber
cacm
function
jr
thacher
.I 511
algorithm
august
cacm
hillmor
matric
set
test
.I 512
algorithm
august
cacm
jr
telescop
thacher
.I 513
algorithm
august
cacm
hillmor
siev
.I 514
algorithm
august
binomi
cacm
coeffici
georg
.I 515
algorithm
august
cacm
continu
fraction
interpol
jr
ration
thacher
.I 516
algorithm
august
cacm
georg
ii
invers
matrix
.I 517
algorithm
august
cacm
eisenman
evalu
network
pert
shapiro
.I 518
algorithm
august
cacm
collison
magic
odd
order
squar
.I 519
algorithm
august
cacm
collison
magic
order
squar
.I 520
algorithm
august
cacm
complex
divis
smith
.I 521
algorithm
august
cacm
perm
trotter
.I 522
algorithm
august
cacm
constraint
gener
partit
stockmal
.I 523
algorithm
august
cacm
floyd
treesort
.I 524
algorithm
august
cacm
point
polygon
posit
rel
shimrat
.I 525
analysi
august
cacm
comput
handl
howel
techniqu
varianc
.I 526
august
cacm
charact
fortran
manipul
pyle
.I 527
august
author
banerji
built
cacm
class
compar
concept
correspond
defin
definit
descript
discuss
disjoint
distinguish
elementari
establish
formal
list
mean
member
natur
object
obtain
partit
previou
process
properti
public
recurs
set
structur
.I 528
busi
cacm
data
fortran
juli
process
robbin
.I 529
aroian
cacm
code
data
edit
juli
pattern
regress
robison
.I 530
cacm
comput
juli
laughlin
method
plan
radiat
siler
treatment
.I 531
accomplish
agenc
bahn
cacm
care
case
comment
compar
comput
count
custom
depart
describ
detail
determin
digit
earlier
electron
elicit
error
establish
experi
gener
health
histori
honeywel
hundr
identif
individu
initi
interest
jr
juli
labori
link
linkag
longitudin
mainten
marriag
maryland
match
method
misspel
miyasaki
number
oper
order
paper
patient
payrol
person
phillip
physician
preassign
present
problem
procedur
process
provid
psychiatr
purpos
receiv
record
refer
regist
report
secur
servic
social
subject
suggest
undupl
uniqu
updat
vital
.I 532
approxim
cacm
comput
continu
fraser
function
hart
juli
ration
.I 533
acf
adorno
agre
amplitud
analysi
approxim
aris
auto
cacm
consist
correl
corrupt
covari
data
densiti
digit
discret
discuss
engin
exact
form
function
gener
harmon
input
interv
juli
known
line
method
need
nois
note
order
peabodi
perform
period
phase
practic
prescrib
present
process
produc
properti
propos
random
requir
section
sens
simpl
simplifi
spectral
stationari
statist
strict
synthes
synthesi
system
techniqu
term
test
.I 534
cacm
calcul
ellipt
function
jacobian
juli
quick
salzer
.I 535
cacm
equat
hill
juli
method
ono
pattern
solv
transcendent
triangular
walk
.I 536
ai
baer
bound
cacm
calcul
converg
determin
differ
distinguish
equat
frequent
function
gaussian
iter
juli
linear
minim
necessarili
nonlinear
observ
paramet
problem
regress
relat
reli
rise
sai
scheme
set
shown
simultan
solut
squar
sum
techniqu
valu
version
zm
.I 537
cacm
connect
davi
discuss
improv
juli
logemann
loveland
machin
procedur
program
proof
prove
run
theorem
trial
.I 538
algorithm
cacm
integr
juli
kruglyak
mechan
orbit
quantum
slater
type
whitman
.I 539
algorithm
cacm
definit
exponenti
integr
juli
kruglyak
whitman
.I 540
algorithm
cacm
definit
exponenti
integr
juli
kruglyak
whitman
.I 541
cacm
juli
relph
simpson
.I 542
algorithm
cacm
factor
juli
relph
.I 543
aitken
algorithm
cacm
interpol
juli
relph
.I 544
algorithm
bei
ber
cacm
function
juli
relph
.I 545
adjust
algorithm
cacm
element
georg
invers
juli
matrix
perturb
.I 546
algorithm
cacm
complex
johnson
juli
logarithm
number
sangren
.I 547
algorithm
cacm
function
gamma
johnson
juli
sangren
.I 548
cacm
calcul
interact
juli
kruglyak
molecular
orbit
whitman
.I 549
cacm
integr
juli
kruglyak
mechan
orbit
quantum
slater
type
whitman
.I 550
algorithm
cacm
definit
exponenti
integr
juli
kruglyak
whitman
.I 551
algorithm
cacm
definit
exponenti
integr
juli
kruglyak
whitman
.I 552
cacm
count
gauss
juli
.I 553
algorithm
cacm
complex
johnson
juli
number
power
real
sangren
.I 554
algorithm
bauer
cacm
juli
maehli
newton
stoer
.I 555
algorithm
cacm
jacobi
juli
reduct
rutishausr
.I 556
boolean
bottenbirruch
cacm
express
grau
juli
translat
.I 557
cacm
comput
devic
juli
simul
time
.I 558
algorithm
cacm
code
comput
cost
dens
describ
develop
engin
esso
form
ibm
invers
juli
larsen
linear
matrix
modifi
month
non
oper
paper
pivot
procedur
product
program
realiz
research
row
save
select
substanti
test
valuabl
.I 559
appel
approxim
cacm
eigenvalu
eigenvector
juli
known
problem
solut
.I 560
block
cacm
commun
independ
juli
translat
wegner
.I 561
analyt
cacm
cavi
comput
differenti
hanson
joseph
june
.I 562
algorithm
avint
cacm
june
whittier
.I 563
algorithm
cacm
june
procedur
randel
sort
.I 564
algorithm
cacm
cram
june
relph
.I 565
algorithm
cacm
caffrei
invr
june
.I 566
algorithm
cacm
conger
invers
june
matrix
.I 567
algorithm
cacm
complex
june
logarithm
number
relph
.I 568
algorithm
cacm
complex
exponenti
june
number
relph
.I 569
algorithm
binomi
cacm
coeffici
june
steck
.I 570
cacm
june
kuncir
simpson
.I 571
algorithm
cacm
june
lexicograph
order
permut
schrack
shimrat
.I 572
add
algorithm
cacm
chain
item
june
kiviat
link
list
.I 573
algorithm
cacm
chain
item
june
kiviat
link
list
remov
.I 574
algorithm
cacm
evalu
garland
jacobi
june
knapp
symbol
.I 575
algorithm
cacm
complex
definit
evalu
integr
june
line
pfaltz
.I 576
algorithm
cacm
floyd
june
path
shortest
.I 577
algorithm
ancestor
cacm
floyd
june
.I 578
algorithm
cacm
count
form
gener
june
part
partit
stockmal
.I 579
algorithm
cacm
combin
june
kurtzberg
.I 580
algorithm
arithmet
cacm
gener
june
order
perstein
.I 581
cacm
jone
june
note
sampl
tape
.I 582
bit
cacm
june
lost
oster
.I 583
algol
cacm
check
jr
june
program
redund
thacher
.I 584
algorithm
cacm
fortran
ii
june
languag
rabinowitz
report
.I 585
accomplish
achiev
ad
addit
automat
basic
cacm
center
code
complet
comput
cure
data
degre
descript
develop
eas
education
emphas
evolut
evolv
experi
facilit
follow
form
futur
hardwar
import
improv
independ
initi
input
insur
landi
lewi
load
machin
made
mano
materi
mistak
model
modif
modifi
multiprogram
oper
output
pace
point
present
principl
problem
proce
program
rand
reduct
requir
research
schedul
scientif
search
share
simultan
sperri
suggest
system
temper
time
turner
univac
valuabl
work
year
.I 586
algorithm
cacm
equat
invers
matrix
roek
routin
simultan
system
.I 587
algorithm
buchner
cacm
integr
romberg
.I 588
algorithm
cacm
chebyshev
curv
fit
newhous
.I 589
algorithm
cacm
cosin
cundiff
evalu
fresnel
integr
.I 590
algorithm
cacm
cundiff
evalu
fresnel
integr
sine
.I 591
algorithm
asymptot
cacm
cosin
cundiff
evalu
express
fresnel
integr
sine
.I 592
batch
cacm
cobol
mullen
problem
.I 593
cacm
data
divis
independ
introduct
machin
mullin
.I 594
advanc
bouman
cacm
cobol
compil
input
output
system
.I 595
accept
approach
area
aris
cacm
cobol
comput
concept
concern
data
determin
difficult
divid
gener
green
guid
hardwar
histor
know
knowledg
logic
main
measur
possess
problem
program
programm
solv
student
subject
syntax
teach
unfortun
write
.I 596
arithmet
basic
cacm
carri
cobol
conclud
examin
float
kesner
oper
paper
point
procedur
specif
storag
work
.I 597
cacm
cobol
data
emeri
modular
process
system
written
.I 598
answer
cacm
cobol
compil
construct
creation
effici
forc
full
gener
hick
kei
librari
librarian
object
present
program
question
util
.I 599
cacm
cobol
donal
report
writer
.I 600
berman
cacm
chart
cobol
sharp
sturg
syntact
.I 601
bureau
cacm
cobol
evalu
interim
program
report
ship
siegel
smith
.I 602
cacm
cobol
compat
lippitt
.I 603
basic
cacm
cobol
element
sammet
.I 604
cacm
cobol
cunningham
.I 605
abil
actual
april
assign
bureau
cacm
carri
citi
comput
consequ
data
desir
determin
digit
entri
exit
expect
field
flow
futur
give
identif
load
made
make
model
motion
movement
nation
observ
pictur
point
process
proport
real
simul
speed
standard
street
tabul
techniqu
traffic
type
vehicl
.I 606
ambigu
april
cacm
coincid
design
digit
due
elimin
kaiser
method
signal
.I 607
april
cacm
calcul
easter
knuth
.I 608
algorithm
april
cacm
peck
permut
schrack
.I 609
algorithm
april
brown
cacm
permut
.I 610
algorithm
april
brown
cacm
siev
.I 611
algorithm
april
cacm
gener
howel
permut
.I 612
algorithm
april
cacm
peck
permut
schrack
.I 613
algorithm
april
cacm
evan
jacobi
.I 614
april
cacm
hennion
simpson
.I 615
address
analyst
april
arrai
assum
cacm
computation
consid
convent
convers
dimension
element
exist
fix
function
hellerman
ident
implement
index
indic
linear
locat
mean
method
mix
multidimension
note
number
paper
perform
pictur
point
radix
repres
select
set
space
storag
subject
system
transform
valu
variabl
vector
wai
.I 616
address
algebra
analyst
appreci
approach
april
arriv
attempt
author
avid
base
bosak
businessman
cacm
call
carei
cash
chairman
clipping
codasyl
comment
committe
compani
concern
corpor
data
defin
design
develop
discours
divis
dobb
edp
electr
exhaust
gener
georg
goal
goldfing
group
honeywel
hope
ibm
implementor
independ
inform
interest
jasper
jean
keat
kendrick
languag
level
line
machin
manag
mathemat
member
model
nation
navi
offic
part
peopl
phase
philosophi
present
primarili
problem
process
profession
program
programm
proper
provid
question
rand
read
regist
remington
rene
report
repres
result
richard
robert
roi
sammet
similar
stimul
structur
system
theoret
think
tri
understand
univac
vital
welcom
william
work
.I 617
action
automat
cacm
calcul
complet
comput
control
data
fast
form
human
instant
known
march
part
partli
perform
poseidon
process
requir
result
speed
system
wheel
work
.I 618
cacm
carlson
character
comput
control
estim
industri
kei
machin
main
man
march
market
process
shown
system
total
type
viewpoint
.I 619
agent
airlin
annex
automat
cacm
close
comput
condens
core
davidson
develop
discuss
drum
entri
final
flight
form
hundr
inventori
involv
isol
jet
larg
limit
march
match
memori
misspel
name
number
oper
origin
paper
passeng
phone
present
problem
procedur
program
recognit
record
request
resembl
reserv
retriev
roster
score
selecton
signific
solid
state
store
subject
successfulli
system
techniqu
telefil
time
unusu
usual
.I 620
algorithm
cacm
halstead
march
ratfact
.I 621
algorithm
cacm
integr
jr
march
romberg
thacher
.I 622
algorithm
cacm
classif
march
mayoh
object
optim
.I 623
algorithm
cacm
economis
march
mayoh
sequenc
.I 624
algorithm
cacm
economis
march
mayoh
sequenc
.I 625
algorithm
argument
cacm
function
gamma
holsten
march
real
reciproc
.I 626
cacm
code
digit
foster
march
method
number
random
represent
retriev
storag
.I 627
cacm
knot
list
march
structur
weizenbaum
.I 628
algorithm
cacm
float
grau
languag
march
number
point
represent
.I 629
binari
cacm
convers
decim
lynch
march
scheme
wire
.I 630
ad
advantag
autocod
cacm
cobol
compat
economi
elli
enjoi
evalu
express
full
give
manag
march
pair
print
process
programm
readabl
requir
translat
utmost
valid
version
write
.I 631
analysi
automat
cacm
languag
ledlei
march
program
syntact
translat
wilson
.I 632
aid
algol
cacm
der
diagnosi
februari
forsyth
groeben
tool
vectorcardiograph
von
.I 633
analysi
biochem
cacm
februari
garfinkel
higgin
iii
ochser
pattern
polk
recognit
simul
system
.I 634
cacm
februari
inform
manipul
retriev
salton
tree
.I 635
baker
boolean
cacm
februari
matric
multipli
note
.I 636
cacm
februari
iter
program
split
tape
weisert
.I 637
basic
cacm
compil
complet
construct
develop
diego
difficulti
document
electron
exist
experi
februari
gener
ibm
improv
inher
laboratori
languag
machin
naval
neliac
origin
pol
present
process
produc
program
project
reduct
report
result
run
san
shown
signific
system
time
watt
wattenburg
.I 638
algorithm
cacm
cobol
control
februari
longo
merchandis
recod
surg
.I 639
algorithm
cacm
coeffici
differ
express
februari
giammo
.I 640
algorithm
cacm
coeffici
februari
integ
perri
polynomi
ration
root
.I 641
algorithm
cacm
differenti
februari
hennion
integr
interpol
.I 642
algol
cacm
februari
introduct
schwarz
.I 643
analysi
biochemci
cacm
differenti
equat
ii
januari
larson
meyer
seller
simul
solut
system
.I 644
abil
ad
algol
arrai
artifici
base
boolean
cacm
charact
compar
comput
concaten
concept
declar
defin
describ
descript
exampl
experi
explicit
extend
formal
ibm
inform
introduc
januari
languag
length
manipul
primer
program
propos
rank
relat
report
shift
sting
string
substr
symbol
wegstein
youden
.I 645
algorithm
broyden
cacm
invr
januari
randel
.I 646
algorithm
cacm
finit
hilbert
invers
januari
matrix
randel
segment
.I 647
algorithm
cacm
cohen
equat
januari
numer
polynomi
solut
.I 648
algorithm
cacm
flore
januari
procedur
sort
.I 649
algorithm
cacm
factor
januari
peck
.I 650
algorithm
cacm
constraint
curv
fit
januari
peck
.I 651
cacm
grem
inform
januari
languag
retriev
survei
system
.I 652
cacm
inform
januari
sabl
semant
structur
system
.I 653
cacm
cheatham
couch
english
januari
jr
languag
request
retriev
translat
warshal
.I 654
barn
cacm
data
heavili
januari
languag
pose
problem
structur
.I 655
applic
cacm
comit
discuss
examin
featur
gener
good
inform
ir
januari
languag
make
manipul
present
program
render
retriev
suit
symbol
type
uniqu
yngve
.I 656
abil
cacm
data
extract
inform
intellig
januari
system
wang
.I 657
cacm
colilla
inform
januari
process
retriev
sam
structur
.I 658
bohnest
cacm
con
discuss
ir
januari
languag
ohlman
pro
sammet
special
.I 659
algorithm
cacm
decemb
jr
revers
seri
thacher
.I 660
cacm
decemb
determin
englar
invers
matric
pracniqu
test
.I 661
arrai
barnett
cacm
decemb
dimension
element
index
lambda
method
multi
notat
scheme
sequenti
spars
store
.I 662
algorithm
cacm
decemb
juelich
shuttl
sort
.I 663
algorithm
cacm
decemb
determin
lapidu
.I 664
algorithm
assign
cacm
decemb
witti
.I 665
algorithm
cacm
decemb
gauss
seidel
shantz
.I 666
algorithm
cacm
decemb
kase
network
order
pert
topolog
.I 667
algorithm
cacm
decemb
kutta
lukehart
merson
.I 668
algorithm
brigg
cacm
cost
curv
decemb
excess
minimum
.I 669
cacm
decemb
jovial
shaw
specif
.I 670
affect
agenc
aspect
attent
attract
author
avoid
bank
basic
bond
busi
cacm
care
challeng
charg
check
common
complic
comput
computer
concern
cooper
court
coverag
crystal
data
decemb
depositor
directli
disclos
divers
earli
econom
entiti
especi
essenti
establish
expens
extent
facil
fidel
freed
govern
highli
identifi
impact
implic
import
improp
industri
inform
introduct
invest
involv
later
law
legal
liabil
mechan
merit
nonbank
oblig
order
pai
pertin
phenomenon
physic
practic
premis
process
processor
proprieti
provid
question
ramif
refus
regul
relat
render
respect
rule
servic
signific
stage
state
statut
subject
suscept
system
unanticip
varieti
wide
.I 671
applic
bank
banker
benefit
cacm
case
cite
comput
conceptu
consumm
corpor
criteria
decemb
design
develop
discuss
earli
equip
field
institut
led
line
need
oper
perform
program
reliabl
sander
save
statist
studi
system
telefil
teleregist
trace
.I 672
administr
adp
affect
cacm
decemb
develop
leibowitz
recent
tax
.I 673
account
autom
bank
cacm
classif
decemb
eckert
.I 674
andrew
applic
cacm
calcul
complex
constant
decou
edp
format
hassler
ibm
iron
method
novemb
.I 675
abl
accept
alter
analysi
arbitrarili
autom
automat
blood
cacm
chemistri
clinic
code
composit
comput
computer
conclud
construct
convention
criteria
data
describ
develop
discuss
emerg
encount
featur
flexibl
gross
handl
hematolog
hospit
inform
laboratori
list
multipl
need
novemb
outlin
paper
part
practic
present
problem
process
produc
qualit
quantit
record
remain
report
reproduct
result
retriev
seri
simul
solut
standard
storag
store
stratifi
synonym
system
ten
terminolog
test
uniqu
unsolv
urin
wit
year
.I 676
cacm
comput
function
incompletebeta
novemb
tang
type
.I 677
algorithm
altern
appear
ascend
backward
cacm
contrari
descend
detail
form
fourth
intern
knuth
length
literatur
long
maxim
merg
method
modif
novemb
phase
polyphas
previous
produc
read
result
shown
slight
sort
statement
statist
string
suggest
tape
tend
.I 678
accept
applic
bit
boolean
cacm
circuit
compil
compon
comput
digit
discuss
execut
function
gener
increas
instruct
katz
machin
major
novemb
optim
program
purpos
repres
set
simul
sophist
subsequ
techniqu
time
.I 679
acm
admit
area
basic
binomi
cacm
chief
coeffici
comm
compil
complex
control
discuss
displai
featur
focus
form
formula
implement
improv
integr
jan
languag
logic
loop
madcap
nest
notat
novemb
paper
previou
program
promin
recent
scientif
subprogram
subscript
superscript
textbook
variabl
well
.I 680
algorithm
cacm
correct
error
iron
novemb
pars
.I 681
abbrevi
cacm
comput
flexibl
languag
lomi
novemb
rubin
word
.I 682
ayer
cacm
fortran
ii
novemb
program
recurs
.I 683
cacm
determin
minimum
novemb
path
serial
techniqu
weimer
.I 684
algorithm
cacm
differenti
hennion
integr
interpol
novemb
.I 685
algorithm
cacm
euler
jr
novemb
summat
thacher
.I 686
algorithm
cacm
georg
novemb
smooth
.I 687
algorithm
cacm
jr
novemb
shank
thacher
.I 688
algorithm
bessel
cacm
function
novemb
pereira
simo
.I 689
cacm
christoph
common
czechoslovakia
discuss
gai
gosden
jone
languag
merner
novemb
poland
program
report
visit
.I 690
cacm
glossari
inform
intern
novemb
particip
process
standard
traub
usa
.I 691
algol
apt
brown
cacm
concern
control
descript
develop
drayton
exampl
histor
includ
introduc
languag
metalinguist
mittman
notat
novemb
numer
present
program
report
statement
statu
summari
tool
usag
.I 692
cacm
invers
matrix
octob
stockmal
test
.I 693
cacm
calcul
concept
cooper
develop
dimension
extens
fibonaccian
function
involv
kind
krolak
octob
optim
problem
proven
search
sens
solv
techniqu
unimod
valuabl
variabl
.I 694
applic
cacm
characterist
compar
comparison
competit
conclus
disk
hess
illustr
import
magnet
octob
present
princip
sort
summar
tape
tapesort
unit
.I 695
applic
approxim
arithmet
arm
begin
bit
briefli
cacm
calcul
carlson
characterist
comment
compil
comput
connot
consid
core
delai
describ
develop
discuss
disk
due
dump
econom
emphasi
equip
file
futur
ibm
input
interrupt
librari
limit
made
malfunct
mathemat
minimum
motion
note
octob
oper
organ
output
paper
physic
problem
program
rate
recoveri
regard
reliabl
reserv
rotat
separ
special
storag
stretch
subroutin
supervisori
system
techniqu
time
transmiss
transmit
unit
usag
usec
util
voorh
weak
word
.I 696
acquisit
ada
addit
applic
automat
busi
cacm
california
capac
center
central
collect
compani
control
data
date
disc
disk
edp
edward
facil
flow
includ
incom
inform
input
inquiri
instal
larg
line
locat
lockhe
magnet
missil
nui
octob
oper
outgo
process
provid
rca
receiv
record
remot
requir
respons
scale
space
station
storag
store
sunnyval
system
tape
ti
transmit
van
.I 697
cacm
curv
dalrympl
determin
field
isodos
method
move
numer
octob
perez
plan
radiotherapi
tamayo
treatment
.I 698
area
boston
cacm
call
commun
comput
connect
data
dial
edward
feurzeig
form
hardwar
input
locat
maril
octob
oper
ordinari
output
remot
report
requir
result
special
spoken
system
telephon
test
user
.I 699
ax
cacm
contour
crystallographi
dayhoff
dimens
evenli
factor
fortran
ibm
map
matrix
need
octob
perpendicular
plotter
point
produc
program
rai
scale
space
system
.I 700
algorithm
cacm
dwyer
hermit
interpol
octob
.I 701
algorithm
cacm
octob
schubert
shuttl
sort
.I 702
algorithm
assign
cacm
filsak
octob
vrchovecka
.I 703
algorithm
assign
cacm
octob
scowen
.I 704
algorithm
cacm
collin
combinatori
octob
thing
time
.I 705
algorithm
blake
cacm
combinatori
octob
thing
time
.I 706
algorithm
approxim
cacm
fourier
octob
schubert
seri
.I 707
algorithm
cacm
erf
ibbetson
octob
.I 708
algorithm
cacm
evalu
fresnel
grai
integr
octob
.I 709
algorithm
assign
cacm
newhous
octob
.I 710
algorithm
cacm
fresnel
grai
integr
octob
.I 711
algorithm
cacm
distribut
frequenc
grai
octob
.I 712
algorithm
cacm
hermit
interpol
octob
schubert
.I 713
algorithm
cacm
interpol
lagrangian
octob
schubert
.I 714
algorithm
cacm
gauss
ibbetson
octob
.I 715
algorithm
cacm
convolut
discret
foreman
jr
octob
.I 716
algorithm
boothroyd
cacm
octob
stringsort
.I 717
algorithm
cacm
element
exactli
fewer
finit
gener
hutchinson
integ
octob
partit
posit
repetit
repres
set
tupl
.I 718
automat
cacm
compil
cost
effect
experi
explicit
gressett
octob
program
replac
techniqu
verif
weinberg
.I 719
address
advantag
algorithm
avail
basi
cacm
charact
class
command
compil
comput
decod
delimit
establish
field
fix
item
length
machin
made
manipul
octob
oper
opler
permit
pop
proper
push
readi
rotenberg
singl
stack
variabl
varieti
width
word
.I 720
bailei
barnett
cacm
format
fortran
free
futrel
input
octob
.I 721
american
analysi
asa
associ
cacm
content
descript
essenti
flowchart
inform
octob
paper
prepar
present
problem
process
propos
report
rossheim
standard
subcommitte
symbol
.I 722
alcor
algol
cacm
group
octob
represent
symbol
.I 723
algol
cacm
ecma
octob
subset
.I 724
accept
accid
acm
advanc
appar
applic
attitud
attribut
build
cacm
career
choic
colleagu
concern
condit
determin
differ
enter
expect
factor
favor
field
function
futur
good
half
happi
high
interest
job
languag
level
light
list
manag
member
mobil
mostfind
motiv
natur
octob
offer
organ
part
particip
percentag
person
personnel
poor
posit
primarili
princip
problem
profess
profession
profil
program
programm
prospect
proven
relat
remain
report
salari
satisfact
satisfactori
seen
specif
studi
synopsi
system
techniqu
tend
turnov
vari
work
year
.I 725
cacm
comput
demonstr
group
mccormick
octob
particip
.I 726
analysi
block
cacm
calcul
comput
describ
design
diagram
digit
flow
gener
handl
incomplet
known
lattic
method
paper
program
purpos
rectangular
septemb
smilli
squar
.I 727
accur
approxim
cacm
delta
detail
dimension
dirichlet
exampl
exception
extens
fast
fu
greenspan
mathemat
mean
method
natur
numer
problem
program
septemb
solut
suppli
theori
treat
yohe
.I 728
aid
cacm
chart
clearli
code
commun
comput
cross
date
debug
describ
descript
document
drawn
easili
effect
explain
final
flow
flowchart
format
great
improv
input
knuth
list
meet
need
origin
output
prepar
present
program
programm
promis
prove
referenc
septemb
shown
simpl
system
valuabl
written
.I 729
algol
cacm
gener
septemb
wirth
.I 730
actual
attempt
automat
base
cacm
chief
compil
diagnosi
english
entir
error
featur
formula
fragment
gawlik
indic
instruct
intend
locat
mathemat
minim
mirfag
normal
notat
oper
organiz
origin
pilot
plain
present
problem
program
scientif
septemb
solut
standard
statement
system
textbook
uncompil
version
.I 731
backward
cacm
call
capabl
cell
charact
code
datum
defin
depend
field
final
form
fortran
forward
function
higher
imbed
intend
languag
level
limit
link
list
machin
manipul
present
primit
process
processor
program
round
septemb
set
subroutin
symmetr
system
weizenbaum
.I 732
algorithm
cacm
carlo
invers
mont
rodman
septemb
.I 733
algorithm
cacm
differ
divid
forward
interpol
jr
newton
septemb
thacher
.I 734
algorithm
backward
cacm
differ
divid
interpol
jr
newton
septemb
thacher
.I 735
algorithm
cacm
calcul
confluent
differ
divid
jr
septemb
thacher
.I 736
algorithm
cacm
function
hankel
jr
modifi
septemb
thacher
.I 737
algorithm
cacm
exponenti
lawrenc
septemb
seri
.I 738
algorithm
approxim
cacm
fourier
georg
septemb
seri
.I 739
algorithm
cacm
minifun
septemb
wasscher
.I 740
algorithm
cacm
interest
septemb
wright
.I 741
algorithm
cacm
determin
evalu
freed
septemb
.I 742
algorithm
cacm
determin
evalu
freed
septemb
.I 743
algorithm
arccosin
cacm
konda
septemb
.I 744
algorithm
ativ
cacm
haubrich
septemb
.I 745
algorithm
cacm
septemb
steep
wasscher
.I 746
algorithm
cacm
septemb
steep
wasscher
.I 747
algorithm
cacm
gener
lexicograph
order
permut
septemb
shen
.I 748
arctang
cacm
chu
evalu
iter
process
saathoff
semi
septemb
.I 749
cacm
dumei
matric
note
onstochast
septemb
.I 750
cacm
eigenvector
matrix
newberi
pei
septemb
.I 751
cacm
invers
matric
note
rodman
septemb
set
test
.I 752
cacm
close
moor
print
septemb
tape
.I 753
cacm
condit
convert
effici
egler
instruct
logic
procedur
septemb
sequenc
tabl
test
.I 754
blatt
cacm
indiscreet
monitor
septemb
ye
.I 755
accuraci
august
cacm
class
compar
comput
decreas
differenti
engin
equat
exponenti
formula
high
integr
involv
larg
method
need
numer
ordinari
pope
prepar
problem
properti
shown
significantli
size
solut
stabil
standard
step
superior
term
time
total
.I 756
august
brigg
cacm
comput
danielson
edit
new
program
.I 757
august
cacm
katz
network
simul
traffic
.I 758
august
cacm
compon
comput
cpa
interrelationship
introduct
kahn
major
mechan
outlin
pert
program
provid
purpos
skelet
structur
.I 759
account
arrai
august
barnett
cacm
collect
comput
consist
continu
convent
deal
devic
formal
function
manipul
mathemat
multipl
notat
oper
pi
procedur
process
relationship
represent
sigma
string
symbol
syntax
transform
variabl
.I 760
august
cacm
dialect
fortran
pyle
.I 761
add
algol
ambigu
august
background
cacm
conveni
dangl
discuss
elimin
includ
jr
kaup
languag
note
problem
proof
propos
remov
revis
sketch
statement
.I 762
august
cacm
diforino
languag
program
remark
symbol
syntax
.I 763
august
bauer
cacm
control
eickel
formal
gener
languag
paul
processor
samelson
syntax
.I 764
algorithm
august
cacm
element
hennion
matrix
polynomi
reduct
.I 765
algorithm
august
bitterli
cacm
fit
orthogon
polynomi
squar
surfac
.I 766
algorithm
august
cacm
fletcher
move
plot
xy
.I 767
acm
algorithm
apr
august
cacm
certif
combinatori
comm
thing
thoro
time
wolfson
wright
.I 768
acm
algorithm
apr
august
cacm
certif
combinatori
comm
thing
thoro
time
wolfson
wright
.I 769
algebra
algorithm
august
bosworth
cacm
set
.I 770
algorithm
august
bosworth
cacm
combin
order
.I 771
algorithm
august
bosworth
cacm
combin
lexicograph
order
.I 772
algorithm
august
cacm
gomori
lefkowitz
.I 773
algorithm
august
cacm
georg
invers
matrix
.I 774
algorithm
august
cacm
jacobi
naur
.I 775
algorithm
august
cacm
differenti
hennion
integr
interpol
.I 776
algorithm
august
cacm
find
partit
quicksort
randel
russel
.I 777
algorithm
august
cacm
matric
naur
set
test
.I 778
algorithm
argument
august
cacm
function
georg
imaginari
kind
legendr
real
.I 779
algorithm
august
cacm
crout
domingo
gil
ii
rodriguez
.I 780
alg
algorithm
august
cacm
gauss
gjr
ii
invers
invert
method
naur
.I 781
algorithm
august
bridg
cacm
telescop
.I 782
algorithm
august
bridg
cacm
telescop
.I 783
algorithm
august
boothroyd
cacm
shellsort
.I 784
algorithm
august
cacm
georg
normal
random
.I 785
algorithm
august
cacm
calendar
convers
dai
date
julian
number
tantzen
.I 786
adapt
algorithm
august
cacm
integr
mckeeman
multipl
.I 787
algorithm
august
cacm
divis
matrix
well
.I 788
algorithm
arbitrari
august
cacm
function
muller
roman
.I 789
algorithm
august
bandsolv
cacm
thurnau
.I 790
algorithm
august
cacm
domingo
zersol
.I 791
august
cacm
charact
fortran
manipul
smith
.I 792
addit
august
binari
cacm
convers
decim
integ
key
moor
multipl
precis
subtract
.I 793
august
baecker
cacm
list
map
structur
.I 794
algol
alphamer
applic
arbitrari
august
block
bowlden
cacm
charact
comput
econom
fix
identifi
illustr
inform
length
list
manipul
method
propos
space
storag
string
structur
techniqu
term
time
type
word
.I 795
august
berner
cacm
debug
ferguson
languag
level
sourc
system
.I 796
address
advanc
august
autonom
avoid
basic
built
cacm
channel
comput
concept
concurr
core
cost
defens
depart
design
divis
doubl
drum
effect
effici
esh
execut
expect
facil
ferrit
function
gener
incorpor
increas
input
interlock
israel
jump
lead
lehman
locat
low
machin
magnet
main
ministri
modif
modifi
muchhigh
multipl
natur
need
netter
number
obei
optimum
order
output
paper
permit
program
regist
rel
resort
sabrac
sabrag
scientif
serial
share
simultan
specif
speed
store
subroutin
tape
techniqu
temporari
time
transfer
twin
word
.I 797
american
august
cacm
code
inform
interchang
standard
.I 798
cacm
catalogu
entri
juli
retriev
scheff
system
.I 799
algol
applic
cacm
cobol
compact
compil
comput
construct
conwai
design
diagram
juli
larg
machin
method
moder
pass
permit
present
rapid
requir
separ
smaller
subset
tape
transit
version
work
.I 800
cacm
corbato
daggett
juli
languag
link
loader
mccarthi
segment
subprogram
.I 801
algorithm
cacm
constraint
juli
solut
squar
syng
.I 802
algorithm
cacm
juli
rutishaus
syminv
.I 803
algorithm
cacm
evan
jr
juli
syminv
.I 804
algorithm
cacm
exponenti
jr
juli
seri
thacher
.I 805
algorithm
cacm
juli
kondo
maehli
newton
.I 806
cacm
certif
invers
juli
matrix
moler
procedur
remark
.I 807
algorithm
cacm
fetti
juli
revers
seri
.I 808
algorithm
cacm
confluent
hypergeometr
juli
relph
.I 809
algorithm
cacm
hypergeometr
juli
relph
.I 810
algorithm
cacm
complex
juli
power
relph
.I 811
algorithm
cacm
gil
juli
rodriguez
smooth
.I 812
algorithm
cacm
gil
juli
rodriguez
smooth
.I 813
algorithm
cacm
deriv
differ
juli
riet
vand
.I 814
algorithm
arithmet
cacm
complex
juli
riet
vand
.I 815
algorithm
cacm
colker
curv
fit
juli
normal
probabl
.I 816
algorithm
cacm
colker
curv
erlang
fit
juli
probabl
.I 817
algorithm
cacm
hoplei
juli
nexcom
.I 818
boolean
cacm
connect
hellerman
ibm
juli
realiz
senzig
.I 819
cacm
eisman
evalu
juli
polynomi
revis
.I 820
cacm
check
gordon
juli
loop
network
.I 821
cacm
iii
juelich
juli
remark
sampl
tape
.I 822
applic
cacm
delin
develop
guidelin
head
implement
juli
larg
occur
problem
program
real
specif
suggest
system
time
treat
.I 823
bc
cacm
descript
huskei
juli
love
nelliac
syntact
wirth
.I 824
accuraci
addit
advantag
analog
approach
autom
cacm
call
comput
consist
construct
coordin
correspond
descript
descriptran
design
digit
geometri
graphic
june
kliphardt
make
measur
obtain
origin
problem
procedur
program
simplifi
solv
space
speed
statement
subroutin
unifi
.I 825
achiev
analysi
cacm
chamber
comput
consist
continu
data
deutsch
energi
frame
high
hour
input
interpret
june
maril
measur
oper
particl
perform
photo
photograph
pip
preliminari
process
program
rate
record
rudlo
scan
spark
track
.I 826
analysi
bennett
cacm
fortran
june
remark
seri
subroutin
time
.I 827
access
cacm
devic
disk
evalu
ibm
june
random
schick
sort
storag
techniqu
.I 828
applic
cacm
calcul
cantrel
comput
flow
fluid
gener
incompress
june
method
network
present
pressur
.I 829
cacm
comput
digit
extern
greniewski
june
klipa
languag
turski
ural
.I 830
cacm
comput
conwai
corc
cornel
june
languag
maxwel
.I 831
algorithm
cacm
erf
error
function
jr
june
real
thacher
.I 832
algorithm
cacm
constraint
curv
fit
isoda
june
.I 833
bandmatrix
cacm
diagon
form
june
reduct
schwartz
symmetr
tripl
.I 834
adapt
algorithm
cacm
integr
june
mckeeman
nonrecurs
tesler
.I 835
algorithm
cacm
complementari
error
function
jr
june
larg
thacher
.I 836
algorithm
cacm
error
function
jr
june
larg
thacher
.I 837
algorithm
beta
cacm
incomplet
june
ludwig
ratio
.I 838
algorithm
cacm
direct
jr
june
kaup
search
.I 839
algorithm
cacm
constraint
june
solut
squar
syng
.I 840
algorithm
arthur
cacm
fit
june
squar
surfac
.I 841
algorithm
cacm
june
shaw
shuttl
sort
trimbl
.I 842
algorithm
bound
cacm
gibb
june
polynomi
posteriori
.I 843
algorithm
assign
cacm
hajek
june
.I 844
cacm
edit
featur
fedako
fortran
june
.I 845
cacm
caffrei
determin
invers
june
matrix
test
.I 846
cacm
convers
invers
june
sanborn
tabl
.I 847
brown
cacm
csx
june
logic
match
penni
program
wall
written
.I 848
argument
bemer
binari
cacm
decim
desir
exampl
function
germ
give
idea
june
logarithm
machin
note
paper
pick
previou
rang
root
short
squar
symmetr
transform
usag
year
.I 849
adapt
alloc
alter
binari
cacm
cent
chain
compromis
consid
convers
data
discuss
effici
emploi
frequent
index
item
jr
larg
lead
multidimension
number
optim
organ
paramet
permit
problem
process
proport
readili
relat
search
shown
slog
slower
structur
sussenguth
techniqu
time
tree
trie
.I 850
cacm
comparison
convers
convert
discuss
easili
effici
format
highli
input
intern
length
logic
output
process
program
reconvers
record
relat
sort
techniqu
variabl
wak
.I 851
applic
cacm
characterist
comput
data
describ
design
fix
goetz
implement
initi
input
length
long
memori
merg
number
paper
power
problem
produc
record
restrict
sequenc
size
sort
specif
string
sylvania
system
tape
techniqu
unrestrict
variabl
volum
word
work
.I 852
cacm
compar
hall
method
requir
sort
time
.I 853
cacm
cobol
paterson
sort
verb
.I 854
access
accord
attent
cacm
case
characterist
comput
concept
consid
contrast
criteria
design
despit
determin
develop
devic
dictat
differ
disadvantag
discuss
encourag
extern
hubbard
kei
limit
major
medium
merg
minim
object
optimum
order
orient
paper
possibl
problem
program
properti
random
record
select
sort
storag
substanti
system
tape
time
true
versu
viewpoint
.I 855
accomplish
addition
approach
area
bendix
bryant
cacm
characterist
concept
cover
data
dataon
disc
discuss
disk
effici
execut
function
goetz
mainten
memori
organ
perform
present
process
program
propos
rca
routin
shown
sort
storag
structur
system
work
.I 856
access
applic
approach
cacm
defin
describ
descript
design
divid
drum
environ
falkin
gener
intern
jr
larg
memori
merg
oper
part
present
program
random
record
savastano
solut
sort
statement
storag
techniqu
varieti
volum
.I 857
cacm
call
compil
discuss
examin
fact
glore
includ
method
nonredund
sort
structur
techniqu
typic
.I 858
assign
cacm
characterist
comput
cook
cycl
design
drive
effect
elaps
gener
merg
minim
multipl
pattern
power
present
reel
routin
sequenc
singl
sort
specifi
tape
time
vari
.I 859
cacm
collat
comput
french
plan
.I 860
basi
cacm
comparison
comput
develop
drive
goetz
input
number
oscil
polyphas
read
requir
sort
string
system
tape
techniqu
ten
total
toth
write
.I 861
ascend
backward
cacm
capabl
conjunct
continu
descend
distribut
effici
gilstad
merg
number
polyphas
presort
process
produc
provid
read
requir
sort
string
tape
techniqu
total
.I 862
cacm
distribut
jr
malcolm
polyphas
sort
string
.I 863
cacm
manker
multiphas
sort
.I 864
cacm
empir
hibbard
minim
sort
storag
studi
.I 865
accomplish
applic
averag
cacm
comput
format
gener
goetz
initi
input
intern
length
log
memori
overlap
permit
present
process
program
random
read
record
replac
select
sequenc
shown
simultan
sort
stage
storag
string
tape
techniqu
test
unsort
write
.I 866
cacm
comput
gotlieb
sort
.I 867
algorithm
applic
approxim
april
area
bellman
briefli
broken
cacm
close
closet
consid
constraint
curv
defin
determin
develop
dynam
extend
final
fit
fix
gluss
grid
incorpor
interv
line
method
model
number
optim
paper
plane
present
program
recent
rectangular
segment
shown
space
squar
stone
subarea
success
surfac
type
.I 868
algol
april
brown
cacm
fuller
make
method
shoffner
string
suggest
.I 869
algorithm
april
cacm
magic
squar
term
thoro
.I 870
algorithm
april
barnecut
cacm
magic
squar
term
.I 871
algorithm
april
cacm
jr
psif
thacher
.I 872
adapt
april
cacm
integr
mckeeman
numer
simpson
.I 873
algorithm
april
cacm
jr
poor
random
.I 874
algorithm
april
cacm
chebyshev
curvefit
hale
.I 875
algorithm
april
cacm
de
ellipt
incomplet
integr
riet
van
.I 876
algorithm
april
cacm
complet
ellipt
integr
thacher
.I 877
algorithm
april
cacm
complet
ellipt
integr
jr
kind
thacher
.I 878
algorithm
april
cacm
element
hennion
matrix
polynomi
reduct
.I 879
algorithm
april
cacm
differ
divid
farka
forward
interpol
kahan
newton
.I 880
april
backward
cacm
differ
divid
farka
interpol
kahan
newton
.I 881
algorithm
april
cacm
calcul
confluent
differ
divid
farka
kahan
.I 882
algorithm
april
cacm
carlo
mont
rodman
.I 883
algorithm
april
cacm
complet
ellipt
integr
jr
thacher
.I 884
algorithm
april
cacm
clark
fit
kubik
orthogon
phillip
polynomi
squar
surfac
.I 885
algorithm
april
cacm
fetti
function
hankel
modifi
.I 886
algorithm
april
cacm
move
plot
stockton
xy
.I 887
algorithm
april
cacm
combinatori
thing
time
wolfson
wright
.I 888
algorithm
april
cacm
combinatori
thing
time
wolfson
wright
.I 889
action
algol
april
cacm
languag
offici
program
respons
.I 890
acm
april
cacm
committe
definit
fritz
membership
prepar
present
review
select
standard
terminolog
.I 891
applic
bubget
cacm
difficult
dismiss
equip
everyman
expens
gener
group
inform
instal
librari
limit
make
march
method
month
personnel
point
pose
posit
present
previous
problem
program
reconsid
retriev
solut
stand
technic
type
whitlei
.I 892
applic
associ
cacm
class
climenson
command
condit
data
defin
edit
exampl
featur
implement
interrog
languag
logic
machin
manipul
march
oper
output
print
recol
record
result
retriev
scheme
select
signific
statement
summar
typic
.I 893
arithmet
bit
cacm
comparison
comput
determin
digit
discuss
equat
evalu
exampl
experi
facilit
float
goldstein
handl
identif
includ
intend
invers
linear
made
manner
march
matrix
mode
modifi
numer
nyu
oper
ordinari
point
power
result
seri
signific
solut
.I 894
actual
adapt
approxim
arbitrari
bairstow
cacm
comput
converg
degre
digit
displai
factor
found
initi
iter
jacobian
luther
march
method
occur
polynomi
preliminari
present
process
program
result
shown
similar
simpler
simpli
techniqu
vanish
variabl
.I 895
cacm
comput
develop
differ
extens
march
method
present
scheinok
tintner
variat
.I 896
cacm
characterist
defect
march
matric
thompson
valu
vector
.I 897
algol
brown
cacm
exist
grammar
march
non
note
phrase
proof
structur
.I 898
algorithm
cacm
laughlin
march
random
.I 899
algorithm
bosworth
cacm
magic
march
squar
.I 900
algorithm
ancestor
cacm
jr
march
thacher
.I 901
algorithm
cacm
clark
coeffici
differ
express
march
.I 902
algorithm
cacm
determin
digbi
march
.I 903
algorithm
cacm
exponenti
fetti
march
seri
.I 904
algorithm
approxim
cacm
fourier
march
mifsud
seri
.I 905
algebra
algorithm
cacm
march
mifsud
set
.I 906
algorithm
cacm
combin
march
mifsud
order
.I 907
algorithm
cacm
combin
lexicograph
march
mifsud
order
.I 908
cacm
invers
lasor
march
matrix
test
.I 909
arithmet
cacm
conwai
corrigendum
declar
march
speroni
.I 910
cacm
instruct
march
mayer
select
trap
.I 911
cacm
march
mcilroi
method
search
variant
.I 912
address
analysi
arrai
cacm
dimens
fortran
garber
march
varianc
yi
.I 913
cacm
halstead
march
neliac
.I 914
cacm
document
jovial
march
shaw
.I 915
cacm
document
ipl
march
newel
.I 916
cacm
fortran
heis
march
.I 917
cacm
comit
march
yngve
.I 918
cacm
cobol
cunningham
march
.I 919
algol
cacm
document
march
naur
problem
.I 920
cacm
document
languag
march
program
sammet
yngve
.I 921
algorithm
cacm
ellipt
februari
incomplet
integr
meyer
.I 922
algorithm
cacm
februari
jr
multint
thacher
.I 923
algorithm
bauer
cacm
februari
gomori
.I 924
algorithm
cacm
februari
hoplei
nexcom
.I 925
cacm
februari
lexicograph
listalgorithm
locat
order
vector
walter
.I 926
algorithm
cacm
februari
rutishaus
syminv
.I 927
absorpt
appli
cacm
februari
linear
pratt
program
shapiro
spectroscopi
ultraviolet
white
.I 928
cacm
charact
februari
fortran
lewi
manipul
.I 929
cacm
construct
februari
glossari
grem
.I 930
binari
cacm
convers
decim
februari
field
short
yarbrough
.I 931
analysi
cacm
comput
digit
februari
malonei
miller
mistak
program
systemat
.I 932
algorithm
cacm
gauss
ii
invers
januari
jordan
matrix
naur
.I 933
algorithm
cacm
januari
magic
naur
squar
.I 934
cacm
gauss
januari
naur
.I 935
algorithm
cacm
calcul
gp
januari
mean
naur
prime
.I 936
algorithm
cacm
januari
matric
naur
set
test
.I 937
algorithm
cacm
finit
hilbert
invers
januari
matrix
naur
segment
.I 938
algorithm
cacm
invert
januari
naur
.I 939
algorithm
behrenz
cacm
function
gamma
januari
.I 940
appropri
assign
cacm
choos
chosen
comput
concern
condit
detail
direct
discret
effici
fast
gener
instruct
januari
locat
marsaglia
memori
method
note
probabl
program
random
result
sequenc
space
thing
uniform
variabl
.I 941
accuraci
attain
autocod
bisect
cacm
cadwel
develop
dimension
ferranti
gener
integr
januari
limit
mercuri
natur
outlin
program
recurs
repeat
requir
scheme
simpson
variabl
.I 942
analysi
appli
author
basic
bogert
built
cacm
complet
comput
concern
constitut
data
describ
extens
fairli
fortran
found
gener
heali
includ
involv
januari
larg
main
moder
note
number
numer
oper
perform
piec
process
program
purpos
quantiti
question
recent
remark
requir
research
seri
set
small
statist
studi
subroutin
time
topic
typic
wehav
written
.I 943
cacm
combin
descript
frequent
grem
januari
problem
term
.I 944
alphabet
alphanumer
applic
assum
cacm
construct
data
dictionari
distribut
examin
inform
interest
involv
januari
known
larg
length
list
memori
numer
organ
paper
possess
prime
priori
problem
process
properti
purpos
quantiti
rapidli
retriev
scidmor
search
similar
storag
store
symbol
system
tabl
tree
weinberg
word
.I 945
applic
arithmet
cacm
cobol
conwai
declar
januari
speroni
.I 946
algol
american
associ
cacm
issu
januari
report
rome
standard
subcommitte
suggest
utman
.I 947
algol
cacm
januari
report
supplement
woodger
.I 948
cacm
decemb
heali
note
procedur
.I 949
aim
algol
cacm
conceiv
constant
context
critic
decemb
devic
express
free
gener
grammar
integ
languag
mean
method
open
petron
point
program
relat
remark
semant
sign
string
syntax
true
vandoni
.I 950
advantag
algorithm
analysi
cacm
comput
consist
decemb
dedic
differenti
entir
equat
expect
form
full
futur
highli
integr
knowledg
meant
method
nievergelt
numer
order
ordinari
paper
parallel
process
propos
proposit
real
recast
replac
result
serial
standard
subtask
take
time
.I 951
algorithm
approxim
bessel
cacm
chebyshev
coeffici
decemb
function
gargantini
integr
ki
pomental
precis
ration
relat
reme
.I 952
cacm
chain
decemb
drath
fortran
ii
.I 953
baker
cacm
decemb
scan
text
.I 954
anstei
cacm
calcul
decemb
distribut
note
probabl
smilli
.I 955
cacm
class
cline
decemb
invers
matric
procedur
test
.I 956
cacm
decemb
famili
matric
newberi
test
.I 957
cacm
decemb
magnet
method
miller
partial
rewrit
tape
.I 958
cacm
case
decemb
precis
syng
.I 959
cacm
decemb
input
lubbert
mark
port
program
punch
sens
.I 960
cacm
curv
decemb
fit
format
fortran
garber
.I 961
allow
bcd
binari
bit
cacm
code
convert
decemb
develop
field
fortran
ii
individu
limit
manipul
number
oster
shift
techniqu
test
.I 962
applic
approxim
arithmet
associ
built
cacm
cdc
codi
complet
comput
concern
decemb
doubl
elementari
equal
extens
float
function
han
inspir
januari
larg
late
line
maehli
point
precis
present
root
squar
success
suggest
summari
techniqu
unlik
work
.I 963
cacm
central
comput
decemb
deriv
determin
effect
equat
hardwar
input
intern
larg
measur
output
paper
permit
present
processor
rel
speed
system
techniqu
throughput
unit
usag
white
.I 964
algebra
avoid
barnett
cacm
chemistri
code
coeffici
compos
comput
construct
control
correct
decemb
directli
error
express
formula
fortran
function
integr
interest
involv
keyboard
legendr
mechan
molecular
oper
output
perform
photo
photon
procedur
program
punch
quantum
ration
recurr
relev
result
singl
system
tabl
tape
techniqu
tediou
theoret
transcript
trivial
variabl
wactlar
write
.I 965
algorithm
brai
cacm
common
decemb
divisor
greatest
.I 966
algorithm
cacm
decemb
determin
evalu
hasselblad
rulifson
.I 967
algorithm
cacm
clausen
complementari
decemb
error
function
hansson
.I 968
algorithm
cacm
decemb
halton
invers
point
quasi
radic
random
sequenc
smith
.I 969
algorithm
boothroyd
cacm
decemb
graycod
.I 970
algorithm
cacm
decemb
floyd
treesort
.I 971
aspect
cacm
compet
comput
consist
control
demand
distinct
execut
green
interest
logic
machin
novemb
order
outlin
paper
predefin
prioriti
program
purpos
real
satisfi
share
signal
subprogram
system
time
toronto
traffic
varieti
written
.I 972
access
air
automaton
cacm
central
command
commun
compon
comput
consol
control
data
definit
directli
disk
divid
emphasi
enter
execut
finit
forc
heistand
implement
inform
input
interfac
inventori
larg
line
link
machin
major
man
messag
novemb
oper
orderli
organ
paper
permit
prioriti
process
processor
program
queri
receiv
remot
repli
report
satisfi
send
sensit
share
state
station
statu
store
system
techniqu
time
transit
updat
view
.I 973
basi
bellman
boundari
cacm
cardiographi
collier
comput
determin
digit
dipol
electr
emploi
estim
feasibl
fundament
heart
high
invers
kagiwada
kalaba
mathemat
measur
model
multipoint
nonlinear
novemb
paramet
potenti
problem
quasilinear
relat
selvest
shown
sketch
skin
solut
speed
state
surfac
vector
ventricular
view
.I 974
analysi
arrhythmia
automat
beat
cacm
comparison
compon
comput
cycl
digit
electrocardiogram
electrocardiograph
examin
feasibl
frequenc
gapless
heart
higher
ibm
long
made
maher
make
novemb
patient
present
read
seri
studi
tape
techniqu
valid
.I 975
cacm
comput
inform
intern
novemb
process
program
standard
traub
vocabulari
work
.I 976
algorithm
cacm
fresnel
grai
integr
novemb
.I 977
algorithm
cacm
calendar
convers
dai
date
julian
novemb
number
oppenheim
.I 978
algorithm
cacm
fresnel
integr
lotsch
novemb
.I 979
algorithm
cacm
collen
complex
logarithm
novemb
number
.I 980
argument
arithmet
cacm
calcul
exact
exactli
fix
gener
larg
maer
mechan
multipl
novemb
paper
point
precis
purpos
quantum
redlich
routin
subroutin
symbol
system
.I 981
accomplish
accumul
cacm
commerci
common
data
depend
equal
gener
individu
kellei
manner
novemb
number
prior
problem
procedur
process
recogn
requir
round
set
sign
sum
understood
vari
.I 982
approach
base
cacm
central
concept
consid
discuss
evid
experiment
faulk
fix
induct
inform
languag
mean
measur
motiv
natur
notion
novemb
oper
pair
physic
plai
possibl
premis
present
propos
role
sentenc
similar
string
support
translat
type
work
.I 983
american
cacm
inch
inform
interchang
octob
perfor
propos
reel
standard
take
tape
.I 984
algol
cacm
ifip
input
octob
output
procedur
report
.I 985
algol
cacm
ifip
octob
report
subset
.I 986
amend
american
cacm
card
gener
inform
octob
paper
process
propos
purpos
specif
standard
.I 987
automat
basic
cacm
data
fortran
inform
languag
octob
process
program
system
.I 988
asa
cacm
develop
fortran
heis
histori
octob
standard
summari
.I 989
cacm
iverson
method
octob
specif
syntax
.I 990
assign
cacm
compil
constraint
differenti
explicit
formal
impli
includ
iter
languag
made
make
newtonian
octob
program
propos
purpos
relat
routin
set
statement
type
variabl
wilk
.I 991
accuraci
algorithm
brai
cacm
control
function
gamma
octob
.I 992
algorithm
cacm
function
gamma
mccomb
octob
.I 993
algorithm
cacm
kutta
merson
octob
prieb
.I 994
algorithm
blair
cacm
octob
stringsort
.I 995
algorithm
cacm
octob
steep
wallack
.I 996
algorithm
cacm
octob
permut
repetit
sag
set
.I 997
cacm
comput
jacob
octob
patent
program
protect
.I 998
cacm
comput
hamlin
octob
patent
program
.I 999
cacm
comput
hauptman
inventorship
joint
octob
.I 1000
cacm
comput
disclosur
kate
octob
patent
.I 1001
analyz
aspect
book
cacm
comput
concern
constitut
copyright
direct
discuss
ey
fed
gener
includ
index
infring
law
lawlor
literari
made
nondramat
octob
output
paper
partial
present
primarili
produc
program
propos
question
readabl
recommend
reprint
respect
revis
usag
util
work
.I 1002
allow
analysi
analyz
applic
assembl
band
biolog
cacm
cascad
compon
comput
construct
curv
data
definit
design
devis
digit
expect
facilit
filter
frequenc
good
implement
includ
line
low
macro
manner
method
minimum
multipl
pass
program
rapid
readili
real
recurs
repertoir
respons
septemb
seri
spent
success
synthesi
time
whittlesei
.I 1003
action
analysi
appli
applic
aris
base
berger
biochem
cacm
calcul
calorimet
chemic
compar
complex
comput
concentr
conduct
construct
continu
convention
correct
cylindr
data
david
detect
develop
diffus
direct
distribut
equat
exact
experiment
explicitli
flow
follow
fourier
function
gave
gener
handl
heat
ident
instantan
insul
known
law
layer
loss
mathemat
method
packet
pass
phenomena
physic
principl
procedur
process
produc
program
provid
radiu
rapid
reactant
reaction
regard
relax
result
septemb
solut
state
statement
step
store
subroutin
system
temperatur
test
thermal
time
transient
vari
.I 1004
algorithm
arctang
cacm
mill
septemb
.I 1005
algorithm
cacm
coordin
dorrer
ellipsoid
septemb
.I 1006
ad
alloc
assembl
autocod
cacm
capabl
discuss
fitzwat
fortran
method
propos
refer
sens
septemb
storag
structur
subscript
system
type
variabl
.I 1007
add
applic
belfap
benett
cacm
compil
concaten
descript
emploi
exist
extens
facil
macro
neumann
present
septemb
sophist
string
.I 1008
american
appli
biologi
brook
cacm
comput
develop
experiment
faseb
feder
held
largest
meet
paper
parallel
schedul
schultz
schwartz
scientif
septemb
session
societi
state
techniqu
unit
year
.I 1009
cacm
combinatori
comput
discuss
evalu
field
function
gener
implement
present
problem
result
septemb
solut
solv
util
variabl
weinberg
.I 1010
abil
cacm
commun
complex
comput
correct
dai
denni
educ
facil
full
gener
give
implement
inabl
independ
instrument
interact
limit
machin
multius
obtain
oper
permit
power
present
procedur
research
respons
satisfactori
scale
scientif
septemb
simpl
small
strongli
system
termin
typewrit
user
wish
work
.I 1011
algorithm
august
cacm
collen
complex
logarithm
number
.I 1012
algorithm
analysi
analyz
assign
august
automat
ay
cacm
call
class
compil
concret
connect
consist
context
convent
data
determin
direct
disjoint
element
english
examin
finit
form
formal
free
grammar
greibach
import
input
intern
kuno
languag
machin
map
multipl
natur
nondeterminist
oetting
paper
pars
path
phrase
process
product
program
pushdown
recent
recurs
sentenc
set
store
string
structur
syntact
syntax
system
vocabulari
work
yi
ym
.I 1013
achiev
assign
august
broder
cacm
carlo
comput
conflict
empir
equat
evalu
examin
final
found
heurist
imbed
local
method
minim
mont
nonlinear
number
optimum
process
program
random
repetit
result
schedul
select
set
solut
student
techniqu
yield
.I 1014
analysi
august
bulk
cacm
comput
control
design
devic
error
experiment
exponenti
factor
get
handl
ignor
imposs
increas
interact
interest
involv
look
machin
major
natur
number
problem
program
rise
term
varianc
weldon
work
.I 1015
algorithm
approxim
august
basic
cacm
degre
divid
equal
error
estim
formula
fraser
give
hart
interv
maximum
method
minimax
obtain
partit
polynomi
product
subinterv
.I 1016
american
august
block
cacm
contour
control
cut
format
interchangc
machin
numer
perfor
posit
propos
rs
standard
straight
tape
tool
variabl
.I 1017
ascii
august
bemer
bit
booth
cacm
comment
data
sequenc
serial
transmiss
.I 1018
algorithm
august
cacm
gauss
pike
.I 1019
algorithm
august
cacm
cavin
move
plot
xy
.I 1020
algorithm
august
cacm
field
free
mckeeman
read
.I 1021
algorithm
august
cacm
conjug
gradient
method
reev
.I 1022
algorithm
august
cacm
common
divisor
greatest
peck
.I 1023
algorithm
august
bessel
cacm
function
gautschi
kind
.I 1024
august
cacm
format
free
list
note
wait
.I 1025
acm
algol
attent
august
base
bookkeep
cacm
check
checker
commun
complet
definit
design
desir
despit
devis
element
error
function
languag
lietzk
method
mutual
natur
perform
permit
problem
processor
program
recoveri
recurs
report
requir
set
subroutin
syntax
ti
.I 1026
august
basic
briefli
cacm
comput
correct
defin
desir
digit
divid
divis
estim
exact
fact
formul
interest
introduc
known
method
multipl
notat
oper
precis
problem
produc
properti
relat
result
review
set
stein
step
.I 1027
altern
august
cacm
checksum
method
newhal
.I 1028
accur
analyt
appli
approach
august
cacm
complex
debug
deriv
discuss
easi
evalu
facilit
function
greatli
highli
investig
method
modif
numer
program
propos
recent
requir
shown
techniqu
wilkin
write
.I 1029
algebra
analyt
approach
arbitrari
august
automat
cacm
comput
debug
decomposit
deriv
desir
develop
differenti
elementari
evalu
express
featur
final
function
intermedi
introduct
kei
labori
librari
main
method
numer
partial
permit
present
procedur
process
produc
program
provid
quick
reaction
seri
simpl
simplic
step
subroutin
techniqu
tool
total
valu
variabl
wengert
.I 1030
autom
boolean
breuer
cacm
character
class
comput
constitut
defin
design
digit
effici
evalu
function
gener
greatli
increas
integr
juli
logic
major
method
part
portion
present
procedur
set
simul
simultan
system
techniqu
valu
variabl
.I 1031
beyer
cacm
comput
determin
equat
estim
initi
juli
mean
method
newton
note
raphson
relat
root
sequenc
start
suitabl
.I 1032
access
approach
base
belzer
cacm
circumv
compon
compos
consider
develop
discuss
document
drop
effect
effici
enter
escap
evalu
fals
function
gener
goffman
high
histori
identif
inadequaci
inform
juli
languag
linear
major
make
materi
metalanguag
model
nonrelev
object
organ
paper
past
penal
perform
probabl
recent
relev
retriev
reward
scan
search
storag
strategi
subset
suggest
system
tag
theoret
verhoeff
.I 1033
abil
addit
aid
argument
arrai
boolean
cacm
complet
comput
control
data
design
displai
enter
entir
entri
environ
execut
experiment
gener
hellerman
ibm
implement
includ
interact
interpret
interrupt
intim
juli
languag
machin
man
normal
numer
oper
operand
option
orient
permit
person
power
present
problem
program
purpos
relat
select
sequenc
simpl
singl
solv
sourc
specif
statement
store
switch
symbol
system
test
trace
translat
type
user
util
.I 1034
allevi
analysi
autom
autos
beset
cacm
characterist
conduct
control
data
date
design
determin
direct
document
explicit
gatto
gear
incept
inform
juli
lack
larg
lifetim
long
network
oper
princip
problem
project
relationship
result
span
storag
system
techniqu
time
workload
.I 1035
address
cacm
cep
characterist
complex
core
differ
drum
equip
express
extend
fortran
greater
ii
input
juli
languag
list
magnet
mainli
make
mancino
memori
mixtur
mode
number
occur
output
quantiti
real
remov
restrict
suitabl
tape
transmit
unit
varieti
.I 1036
algol
cacm
garwick
gener
juli
remark
.I 1037
algorithm
cacm
element
juli
matrix
polynomi
prieb
reduct
.I 1038
algorithm
cacm
crout
equilibr
iter
juli
mckeeman
.I 1039
algorithm
cacm
fourier
jr
juli
seri
summat
thacher
.I 1040
algorithm
cacm
integr
jr
juli
romberg
thacher
.I 1041
algorithm
cacm
durstenfeld
juli
permut
random
.I 1042
algorithm
cacm
charlier
juli
pereira
poisson
polynomi
simo
.I 1043
aid
cacm
complex
data
debug
desir
edit
extract
high
identif
interrupt
juli
languag
later
level
list
look
mean
point
previous
program
real
sourc
substanti
system
take
talk
techniqu
time
user
versteeg
.I 1044
adapt
assembl
automat
cacm
conjunct
convent
cope
design
juli
kanner
librari
load
loader
method
nest
oper
pass
specif
structur
subroutin
.I 1045
analysi
cacm
calculu
detail
develop
effici
experi
found
hartlei
isomorph
juli
map
multifactor
oper
peng
program
scheme
sequenc
special
varianc
.I 1046
add
articl
atla
author
briefli
brooker
build
cacm
comment
compil
comput
consider
cover
depart
describ
detail
develop
devot
expand
expositori
featur
ferranti
intention
interest
join
juli
lightli
list
major
materi
morri
number
origin
paper
past
point
present
program
publish
pure
purpos
recent
refer
rohl
rosen
small
space
system
topic
treat
year
.I 1047
cacm
canon
characterist
consist
determin
distribut
form
full
gener
invers
june
known
matric
method
obtain
ortega
prescrib
process
root
similar
simpl
test
transform
vector
.I 1048
accur
approxim
assumpt
axi
axial
boundari
cacm
concentr
differenti
dirichlet
divers
electrostat
ellipt
equat
exceedingli
field
flow
fluid
greenspan
heat
ideal
includ
june
method
nondegener
numer
partial
physic
portion
problem
reduc
region
solut
stress
studi
symmetr
symmetri
theori
type
varieti
.I 1049
attack
boundari
cacm
differ
difficult
discuss
easiest
establish
exampl
extrem
fail
finit
holt
june
linear
method
non
nonlinear
numer
obtain
paper
point
present
problem
question
realiti
shoot
solut
task
techniqu
uniqu
.I 1050
breakdown
brian
cacm
discuss
fact
implement
june
list
oper
part
present
program
propos
structur
techniqu
.I 1051
amount
appli
attempt
cacm
comfort
comput
concept
consecut
consider
data
describ
descript
draw
element
exampl
execut
final
gener
hold
illustr
introduc
item
june
length
list
multiword
newel
origin
paper
perform
problem
process
propos
recent
relat
report
requir
result
save
shaw
simon
singl
space
standard
structur
time
util
variabl
wai
word
.I 1052
accumul
accur
addend
cacm
distinct
elimin
error
establish
extens
hold
increas
individu
integr
interv
june
larg
larger
number
numer
partial
produc
program
reduc
separ
success
sum
truncat
variabl
wolf
.I 1053
advoc
cacm
design
discuss
examin
exemplifi
fortran
gener
hassitt
implement
input
june
philosophi
program
purpos
routin
.I 1054
algorithm
batson
cacm
gauss
june
seidel
.I 1055
algorithm
bessel
cacm
function
june
pereira
simo
.I 1056
algorithm
batti
cacm
june
shellsort
.I 1057
algorithm
cacm
critic
hoffman
june
path
schedul
.I 1058
cacm
june
olynyk
simpson
.I 1059
algorithm
cacm
heapsort
june
william
.I 1060
algorithm
boothroyd
cacm
invers
june
matrix
.I 1061
algorithm
boothroyd
cacm
june
matrix
permut
.I 1062
abbrevi
alloc
analysi
analyz
automat
bailei
barnett
bcd
block
burleson
cacm
common
creat
discuss
dynam
earlier
form
fortran
function
gener
ii
includ
input
intermedi
intern
june
manipul
manner
newli
output
pack
perform
purpos
report
represent
sasp
sequenti
set
shadow
storag
store
string
subroutin
substr
symbol
syntact
synthes
type
.I 1063
american
cacm
inch
inform
interchang
june
paper
perfor
propos
standard
tape
.I 1064
american
cacm
code
inform
interchang
june
perfor
propos
standard
tape
.I 1065
american
ascii
bit
cacm
code
data
inform
interchang
june
propos
sequenc
serial
standard
transmiss
.I 1066
adequ
advanc
algorithm
applic
aronofski
base
basic
cacm
center
chang
code
coeffici
compon
comput
concept
cope
data
demand
devot
direct
edit
effici
emphasi
entri
extens
flexibl
futur
grow
grown
industri
influenc
integr
june
linear
longer
mathemat
matrix
mean
mention
mere
method
model
organ
paper
petroleum
place
principl
prior
problem
process
program
radic
recent
reduc
reliabl
respect
result
simplex
situat
solv
statement
subprogram
summar
system
term
translat
transmiss
undergon
underli
varieti
viewpoint
year
.I 1067
black
blood
cacm
cell
charact
degre
devis
displai
gener
grai
imag
level
line
mendelsohn
method
perri
pictur
print
printer
produc
scale
scan
standard
techniqu
tone
util
.I 1068
ackermann
cacm
fortran
ii
load
saver
time
.I 1069
cacm
collin
compar
comput
intern
method
oper
raichelson
speed
.I 1070
cacm
card
expand
input
norri
replic
system
warrington
.I 1071
account
actual
amount
cacm
comput
concurr
consid
cost
develop
discuss
factor
gener
oper
precis
procedur
requir
revis
rosenberg
share
space
storag
system
time
usag
user
util
.I 1072
algorithm
applic
assign
base
basi
cacm
class
common
comput
declar
defin
dimens
element
equival
fisher
galler
identifi
improv
method
pair
percent
present
previous
problem
publish
reduc
relat
scan
storag
structur
time
tree
.I 1073
brai
cacm
comput
digit
exponenti
fast
gener
maclaren
marsaglia
method
outlin
procedur
random
variabl
.I 1074
algorithm
cacm
schumak
shank
.I 1075
algorithm
cacm
juelich
shuttlesort
.I 1076
algorithm
cacm
integr
multipl
wirth
.I 1077
algorithm
cacm
chebyshev
curv
fit
naur
.I 1078
algorithm
cacm
continu
elementari
fraction
function
morelock
.I 1079
algorithm
bessel
cacm
function
pereira
simo
.I 1080
algorithm
cacm
chebyshev
coeffici
cyvin
polynomi
.I 1081
algorithm
cacm
cyvin
distribut
function
normal
.I 1082
accuraci
algorithm
cacm
control
cyvin
function
gamma
.I 1083
accept
analysi
aspect
broader
cacm
compil
comput
convent
effici
equat
experi
facilit
flexibl
flexowrit
formul
gener
hardwar
input
klerer
languag
manner
mathemat
modifi
orient
part
problem
program
purpos
request
rule
softwar
solv
studi
system
teach
text
tool
type
unrestrict
user
version
.I 1084
addit
alphabet
arbitrari
arbitrarili
bit
cacm
charact
code
collat
declar
encod
exist
handl
inabl
justif
languag
left
mention
number
numer
program
propos
represent
scheme
sequenc
shaw
size
sourc
string
variat
.I 1085
american
cacm
card
gener
inform
paper
process
propos
purpos
specif
standard
.I 1086
acm
algol
cacm
committe
convent
input
languag
output
program
propos
report
subcommitte
.I 1087
abstract
altern
april
area
attempt
automat
cacm
concern
design
detail
discuss
edmundson
gener
made
major
oper
prefer
problem
purpos
solut
system
varieti
view
.I 1088
algorithm
amount
approxim
april
balistfi
cacm
chang
code
combin
comput
consider
cost
dai
daili
data
develop
dietari
fast
find
food
fortran
gastronom
ibm
implement
integ
item
line
menu
minimum
optim
percent
plan
post
preced
problem
process
product
program
request
requir
satisfi
save
sequenc
solut
special
system
theoret
.I 1089
april
cacm
center
comput
denison
design
popov
.I 1090
algorithm
april
beta
cacm
function
gautschi
incomplet
ratio
.I 1091
algorithm
april
cacm
confluent
hypergeometr
jr
thacher
.I 1092
adapt
algorithm
april
butler
cacm
integr
nonrecurs
.I 1093
algorithm
april
cacm
determin
evalu
rotenberg
.I 1094
algorithm
april
cacm
prime
shimrat
twin
.I 1095
april
binari
cacm
code
decim
griebrok
tabl
.I 1096
april
avoid
benson
cacm
fortran
ii
iv
matrix
revers
steven
.I 1097
algorithm
april
base
cacm
convers
convert
gladwin
integ
known
number
present
prove
simpl
system
.I 1098
aid
alloc
applic
approxim
april
arithmet
author
avail
bobrow
cacm
characterist
comit
common
comparison
comput
conclud
consid
consider
data
debug
detail
differ
discuss
distinctli
document
dynam
exhibit
exist
facil
featur
final
form
formal
give
heurist
import
includ
ipl
known
languag
learn
lisp
list
machin
manipul
method
necess
oper
present
princip
problem
process
program
programm
pushdown
raphael
recurs
represent
review
rough
select
show
slip
special
speed
storag
store
structur
superior
term
usabl
.I 1099
acquir
addit
aid
april
blind
bring
cacm
center
cincinnati
colleg
comput
constant
debug
describ
design
develop
disadvantag
entranc
environ
especi
experi
fact
fewer
futur
gain
group
import
includ
intellig
intens
interest
lichstein
locat
machin
make
mediat
medic
medicin
memori
need
number
object
occup
offer
open
opportun
paper
particip
plan
problem
profession
program
programm
qualif
rehabilit
result
scarpino
sight
skill
staff
sterl
stueb
suit
superbl
system
techniqu
technolog
train
univers
unseen
valuabl
work
.I 1100
april
atchison
cacm
colleg
comput
curricula
hamblen
scienc
statu
univers
.I 1101
april
cacm
comput
curriculum
design
logic
muller
place
switch
theori
.I 1102
april
cacm
cours
gorn
languag
mechan
specif
.I 1103
april
cacm
comput
korfhag
logic
scienc
.I 1104
analysi
april
cacm
curriculum
forsyth
numer
undergradu
.I 1105
april
arden
cacm
comput
digit
introduc
.I 1106
april
cacm
comput
digit
perli
program
.I 1107
april
cacm
comput
educ
keenan
.I 1108
applic
assembl
assess
attitud
basic
breadboard
cacm
cascad
center
compris
comput
conduct
connect
consider
consist
control
data
defin
design
detail
digit
drive
effect
entir
error
extract
fabric
feasibl
gener
head
illumin
inform
line
loop
lunar
march
measur
mechan
moon
observ
oper
optic
partial
portion
present
process
processor
purpos
radial
read
readout
scan
select
sensor
sequenti
sight
signal
special
studi
system
techniqu
telescop
track
tracker
unit
wilcox
.I 1109
cacm
chebyshev
coeffici
comput
converg
convers
dilogarithm
evalu
expans
illustr
jr
logarithm
march
method
polynomi
power
rearrang
sequenc
seri
slowli
thacher
transform
.I 1110
advantag
appli
applic
cacm
class
consider
convent
differ
differenti
equat
finit
forrington
fourier
march
method
numer
ordinari
parabol
partial
problem
reduc
seri
show
solut
system
.I 1111
arbitrari
cacm
charact
class
condit
converg
degre
develop
factor
function
iter
lin
luther
march
method
newton
polynomi
process
suffici
techniqu
term
variabl
yield
.I 1112
assum
cacm
compar
comput
correct
damerau
detect
dictionari
error
extra
found
garbl
identif
input
letter
made
march
match
method
miss
occur
percent
run
singl
spell
techniqu
test
text
time
transposit
type
unidentifi
word
wrong
.I 1113
advent
angular
approxim
attitud
basic
box
briefli
cacm
circl
commun
comput
control
cost
direct
domino
draw
dynam
earth
easi
electron
fact
gener
high
ibm
latitud
longitud
made
make
march
microfilm
minut
motion
movi
output
perspect
printer
program
repres
requir
satellit
scientif
shape
speed
sphere
studi
system
time
tool
transform
zajac
.I 1114
assign
cacm
canon
code
comput
determin
encod
exhaust
frequenc
function
gener
huffman
kallick
march
minimum
prefix
program
redund
schwartz
structur
tree
.I 1115
alphabet
binari
branch
cacm
charact
clampett
effici
gain
includ
jr
kei
march
method
minu
path
propos
random
result
search
signific
structur
tree
util
.I 1116
appli
base
bipartit
boolean
cacm
comput
construct
csima
gotlieb
graph
involv
iter
limit
march
matric
method
note
previous
problem
produc
propos
real
refer
relat
school
situat
successfulli
test
theorem
timet
trial
zero
.I 1117
backward
cacm
consid
continu
increas
major
march
mcalest
merg
method
number
oper
overlap
permit
polyphas
portion
read
remain
result
rewind
rewound
save
sort
tape
techniqu
time
variat
written
.I 1118
cacm
data
fortran
macgowan
march
reduct
seri
subroutin
time
.I 1119
american
associ
cacm
fortran
letter
march
open
standard
.I 1120
acm
cacm
comm
corrigenda
march
.I 1121
acm
august
barnett
cacm
clarifi
comm
comment
correct
describ
gerard
intend
manipul
march
notat
note
paper
point
recent
sambl
symbol
.I 1122
algorithm
anderson
arithmet
burrough
cacm
compil
discuss
experiment
express
gener
improv
march
note
present
speierman
suggest
.I 1123
algorithm
cacm
gauss
gladfelt
march
.I 1124
algorithm
cacm
divis
march
matrix
well
.I 1125
algorithm
cacm
march
naur
syminv
.I 1126
algorithm
barton
cacm
erf
march
wagner
.I 1127
algorithm
cacm
march
matrix
naur
tridiagon
.I 1128
algorithm
cacm
determin
evalu
march
rotenberg
.I 1129
algorithm
beta
cacm
function
gautschi
incomplet
march
ratio
.I 1130
althm
cacm
function
gamma
gautschi
march
.I 1131
ambigu
cacm
context
februari
pars
ross
.I 1132
algol
cacm
extens
februari
formula
iturriaga
manipul
perli
.I 1133
arithmet
brooker
cacm
februari
gener
mode
packag
program
.I 1134
actual
allard
arithmet
assum
assumpt
cacm
case
code
compil
comput
develop
discuss
easili
effect
effici
exponenti
februari
function
illustr
improv
intermedi
languag
machin
made
manipul
method
object
paper
present
problem
program
prompt
purpos
reflect
remov
replac
seri
simpl
simplic
simplif
simplifi
statement
structur
subject
subscript
treatment
variabl
violat
wolf
zemlin
.I 1135
adopt
affect
analysi
applic
approach
aspect
base
batch
busi
cacm
characterist
class
codasyl
code
common
compact
compar
compil
complex
comput
content
control
convent
cover
data
decis
defici
definit
depart
descript
design
digit
effect
effici
emphas
entri
exclus
express
extrem
februari
flowchart
formal
fulli
gener
identifi
includ
incorpor
independ
inexpens
inform
invari
involv
known
languag
load
local
lombardi
machin
mechan
meet
modif
nonprocedur
oppos
orient
output
overcom
pattern
permit
philosophi
potenti
prepar
present
procedur
process
program
relat
reli
repres
represent
requir
result
set
sourc
speed
statement
stress
structur
syntact
tabl
term
translat
wide
write
.I 1136
begin
cacm
februari
handl
inform
jr
steel
theori
.I 1137
cacm
februari
format
languag
perli
.I 1138
cacm
februari
formal
iverson
languag
program
.I 1139
cacm
februari
fortran
iv
languag
leavenworth
syntax
.I 1140
cacm
februari
formal
iron
languag
.I 1141
analysi
bound
cacm
context
februari
floyd
syntact
.I 1142
algol
cacm
extens
februari
languag
rose
.I 1143
analysi
analyz
anim
appli
artifici
bound
cacm
calcul
care
compar
confid
consid
constant
data
decai
definit
deriv
entiti
error
exercis
experi
experiment
exponenti
fit
form
function
gener
great
human
identifi
involv
januari
larg
made
method
numer
paramet
physic
procedur
radioact
rel
result
run
select
sensit
set
show
signific
stabl
statist
studi
subject
sum
techniqu
tracer
type
uniform
valu
variat
varieti
worslei
.I 1144
activ
alpha
applic
believ
cacm
comput
detail
determin
digit
experiment
field
homogen
imag
involv
januari
manipul
nuclear
physic
robbin
sourc
taylor
techniqu
.I 1145
algorithm
approach
area
ascertain
attempt
avoid
cacm
call
case
comit
compar
comput
demonstr
design
direct
effici
enum
excess
exclus
exist
fruitless
game
git
graph
heurist
high
ibm
incorpor
interest
isomorph
januari
known
languag
line
narrow
node
order
pair
partial
plai
practic
prevail
problem
process
program
prove
reli
requir
run
scheme
search
similar
situat
solut
sophist
speed
straightforward
success
successfulli
techniqu
test
tester
theorem
time
unger
unknown
varieti
written
year
.I 1146
accuraci
achiev
attach
cacm
composit
congruent
degre
dimension
effici
face
formula
hyper
integr
interior
januari
jr
larg
lie
multidimension
opposit
point
present
quadratur
rectangl
rectangular
requir
sign
subdivid
subdivis
surfac
thacher
volum
weight
.I 1147
addit
algorithm
appli
boundari
cacm
collin
comment
concern
dai
differenti
discuss
equat
extens
gener
ii
initi
integr
involv
januari
linear
made
make
method
nonit
numer
ordinari
present
problem
reduc
result
scheme
solut
specif
step
valu
.I 1148
arithmet
cacm
carri
differ
geometr
give
handl
incorpor
indic
januari
machin
method
miller
process
result
seri
shown
signific
sum
wide
.I 1149
cacm
compil
gargoyl
garwick
januari
languag
write
.I 1150
cacm
fortran
januari
kahan
leppik
mortem
post
procedur
.I 1151
boolean
cacm
comstock
ii
januari
matric
multipli
note
.I 1152
arithmet
bit
cacm
classic
float
gregori
januari
limit
multipl
number
point
precis
present
ranei
represent
size
straightforward
techniqu
type
.I 1153
applic
binari
brai
cacm
comput
decim
distribut
fast
faster
gener
januari
maclaren
marsaglia
normal
number
procedur
random
readili
techniqu
variabl
.I 1154
access
adjoin
allow
amount
automata
bound
cacm
categori
class
close
comput
creat
decemb
digit
discuss
exampl
felt
finit
fischer
function
gener
increas
infinit
input
intermedi
length
machin
manner
memori
multi
number
perform
portion
power
present
properti
recurs
relat
restrict
state
step
survei
tape
total
ture
unbound
unrestrict
.I 1155
abil
acronym
answer
articl
artifici
bad
cacm
calculu
call
chang
commun
comput
conclus
decemb
deducom
deduct
defect
drawn
equival
experi
fact
forerunn
gener
hope
human
increas
inform
intellig
investig
kind
learn
lisp
logic
method
order
power
predic
present
program
question
redund
relev
run
simpl
slagl
specif
tell
varieti
wide
write
.I 1156
algorithm
cacm
decemb
function
hankel
reilli
.I 1157
algorithm
cacm
decemb
distribut
function
maclaren
normal
procedur
.I 1158
algol
anderson
cacm
capabl
command
construct
decemb
discuss
equip
explic
extens
meta
motiv
multiprocess
organ
parallel
process
program
segment
serv
structur
.I 1159
applic
assign
attempt
believ
bootstrap
cacm
case
compil
comput
consider
converg
decemb
design
detail
determin
develop
diminish
discuss
econom
emphasi
especi
examin
final
forese
halpern
hardwar
independ
lead
machin
made
method
offer
problem
process
program
qualit
reason
resolut
satisfactori
singl
softwar
specif
substanti
survei
techniqu
technolog
transfer
trend
weight
.I 1160
action
aid
analysi
analyz
area
assembl
automat
cacm
cat
code
compass
comprehens
comput
consist
convert
data
decemb
deck
diagnost
distinct
fap
final
form
gener
implement
input
instruct
languag
list
macro
moss
order
output
pass
phase
prepar
processor
program
question
regard
semi
special
system
translat
user
verifi
wilson
.I 1161
aid
brought
cacm
came
compat
comput
conjunct
convers
data
decemb
design
edp
equip
era
featur
ibm
incompat
inexpens
larg
led
machin
market
mass
mccormack
mind
model
obsolesc
optimum
part
permit
problem
process
program
rapid
requir
scale
schansman
seri
smooth
specif
store
system
technolog
tediou
time
transit
unfold
womack
written
.I 1162
arbitrari
assembl
bit
cacm
canon
charact
compil
complet
conform
decemb
desir
difficulti
form
gener
graham
greatest
ingerman
languag
list
machin
map
meta
numer
present
program
provid
reprogram
seldom
stream
symbol
translat
treat
user
version
.I 1163
applic
binari
cacm
code
decemb
develop
effort
elimin
encourag
experi
highli
ibm
languag
level
limit
object
olsen
oper
orient
philco
problem
reprogram
requir
seri
sourc
success
symbol
system
techniqu
translat
.I 1164
cacm
call
central
compat
convers
cpu
decemb
describ
detail
develop
discuss
emul
featur
gener
greater
ibm
implement
includ
input
larg
output
problem
process
section
system
techniqu
treatment
tucker
unit
.I 1165
accomplish
aid
benjamin
cacm
capac
code
consider
decemb
emul
execut
function
hardwar
increas
make
micro
necessit
object
program
rate
rca
reprogram
routin
run
simul
softwar
spectra
suppli
system
throughput
tradit
user
.I 1166
address
argument
assembl
assist
basic
begin
cacm
call
categor
class
comput
decemb
deck
dellert
equival
execut
express
gener
handl
ibm
incompat
incorpor
insert
instruct
jr
languag
level
machin
macro
mnemon
modif
oper
prepar
produc
program
requir
set
simul
singl
skeleton
subroutin
suppli
symbol
tag
time
translat
treat
.I 1167
achiev
advent
analyz
automat
cacm
complet
comput
decemb
desir
difficult
gain
goal
highli
languag
larg
machin
make
natur
pitfal
primarili
problem
procedur
program
resolv
scale
semant
semi
shown
suggest
translat
.I 1168
cacm
cobol
comput
decemb
enabl
frederick
ibm
languag
larg
line
machin
mainten
oper
product
program
retriev
specif
system
warburtin
written
.I 1169
algorithm
appli
aris
attach
automat
backboard
cacm
compon
comput
correspond
delta
downhil
element
empti
en
evalu
exchang
exhaust
experiment
find
form
function
increment
initi
integ
iter
layout
local
method
minim
minimum
neg
novemb
order
partial
perform
permut
placement
pomental
posit
present
problem
procedur
process
prove
real
result
set
similar
solv
stop
wire
.I 1170
abl
accumul
accur
accuraci
adequ
analysi
analyz
applic
arpa
averag
base
basic
bulk
cacm
characterist
class
combin
comput
conclud
conclus
depend
depth
develop
direct
earlier
elementari
encount
english
experi
featur
form
gener
governor
includ
infer
knowlton
learn
logic
mcconlogu
neighbor
novemb
oper
ordinari
pars
parser
pattern
percent
probabl
recognit
relat
requir
rule
sdc
sentenc
share
show
simmon
store
syntact
syntax
system
test
text
time
tree
trial
word
.I 1171
algorithm
analysi
artifici
assumpt
basi
cacm
commonli
comparison
condit
constraint
cooper
determin
differ
dual
found
full
gener
iter
linear
made
method
mueller
novemb
number
paramet
primal
problem
program
randomli
ratio
regress
relev
show
signific
simplex
solv
start
statist
superior
variabl
.I 1172
algorithm
base
cacm
complex
comput
condit
contradict
convers
convert
dash
decis
describ
effici
entri
extend
handl
limit
minim
montalbano
novemb
pinpoint
pollack
process
program
redund
requir
result
rule
run
set
space
storag
tabl
time
us
user
work
.I 1173
algol
assess
automat
basi
cacm
compil
conclud
core
discuss
drum
execut
gain
gier
handl
improv
logic
make
naur
novemb
perform
potenti
primarili
program
relat
segment
specif
store
system
time
transfer
wai
.I 1174
algorithm
cacm
invers
medlock
novemb
permut
.I 1175
algorithm
cacm
novemb
quickersort
scowen
.I 1176
algorithm
cacm
eigenvector
elimin
find
gaussian
newhous
novemb
.I 1177
algorithm
cacm
determin
evalu
novemb
pfann
.I 1178
algol
algorithm
cacm
editor
languag
mckeeman
novemb
refer
.I 1179
batch
cacm
compat
compil
comput
core
debug
design
diagnost
donnelli
elabor
execut
fast
fortran
full
half
high
ibftc
ibjob
ibm
input
iv
job
languag
librari
maintain
manufactur
medium
memori
messag
monitor
novemb
output
process
program
pufft
purdu
recompil
resid
rosen
routin
run
sequenc
size
small
sourc
speed
spurgeon
subroutin
suppli
system
time
translat
univers
word
write
.I 1180
accord
appli
applic
arrang
assert
axiom
axiomat
axl
cacm
call
case
cohen
complet
consist
data
decid
definit
design
form
imper
includ
languag
linear
manipul
match
modifi
novemb
part
present
procedur
process
program
recurs
replac
show
special
string
symbol
systemat
tabl
term
transform
wegstein
workspac
.I 1181
activ
applic
basi
cacm
calcul
cardiac
central
comput
data
direct
equip
evolv
impuls
includ
laboratori
method
neilsen
nerv
neurophysiolog
octob
offic
ordinari
origin
output
present
radio
requir
sequenc
simpl
situat
special
studi
system
telephon
time
tracer
transmiss
transmit
type
.I 1182
cacm
common
context
contextu
correl
corrobor
criterion
degre
detect
experiment
function
goodenough
hypothesi
mean
obtain
octob
pair
proport
reliabl
rubenstein
shape
similar
synonymi
word
.I 1183
algebra
base
cacm
compil
comput
digit
format
fortran
forward
gener
ii
languag
long
machin
made
note
octob
procedur
program
purpos
special
statement
straight
tediou
veroni
write
written
.I 1184
alloc
bell
block
bookkeep
cacm
comput
fast
fix
free
half
involv
knowlton
laboratori
languag
larger
level
list
llllll
locat
low
make
method
obtain
octob
oper
part
reconstitut
regist
scheme
simultan
situat
size
smaller
split
storag
structur
success
telephon
.I 1185
area
argument
cacm
code
cover
discuss
element
fit
fletcher
form
instruct
list
macro
octob
overlap
pentomino
plane
primarili
problem
program
recurs
solv
squar
techniqu
.I 1186
algol
analog
analyz
binomi
cacm
class
coeffici
combinatori
comput
develop
element
expos
gener
lynch
octob
problem
process
program
recurs
requir
select
set
solut
solv
specif
techniqu
.I 1187
ascii
cacm
code
crosbi
note
octal
octob
standard
tabl
.I 1188
achiev
algol
benefit
binari
boolean
cacm
chu
comput
construct
declar
design
enumer
equat
exampl
exchang
express
higher
idea
identifi
includ
languag
level
logic
make
microprogram
octob
oper
present
program
purpos
requir
sequenc
set
statement
term
termin
transfer
translat
unari
user
vocabulari
.I 1189
algorithm
cacm
deviat
normal
octob
pike
random
.I 1190
algorithm
cacm
hill
number
octob
pike
pseudo
random
.I 1191
algorithm
cacm
find
function
octob
preced
wirth
.I 1192
algorithm
cacm
interpol
octob
stafford
tabl
.I 1193
algorithm
cacm
gomori
langmaack
octob
.I 1194
access
acm
appli
briefli
cacm
catalog
compil
comput
concept
consist
consol
contribut
coordin
cost
describ
detail
direct
document
earli
easi
establish
exceed
expand
facet
featur
guid
histori
index
inform
invert
ir
jr
line
link
list
main
mechan
moor
octob
oper
organ
paramount
pennsylvania
present
primarili
principl
provid
provis
relat
relationship
repositori
research
retriev
review
rubinoff
schedul
school
search
serv
servic
stochast
system
teletypewrit
term
unfamiliar
univers
unrestrict
user
vocabulari
white
.I 1195
accuraci
administr
aeronaut
block
cacm
canter
check
combin
complet
comput
creat
data
develop
donaghei
fix
format
ibm
input
length
linear
logic
materi
nation
note
oper
optim
output
pittsburgh
process
program
provid
record
septemb
seri
sourc
space
system
tandem
test
univers
uplift
valid
variabl
worthi
.I 1196
applic
cacm
class
comput
debug
detail
differenti
digit
discuss
eas
equat
exampl
exist
formul
furnish
gener
good
klopfenstein
larg
lead
method
minim
number
numer
ordinari
point
power
problem
process
program
purpos
routin
septemb
solut
solv
system
term
time
tool
true
view
.I 1197
achiev
algorithm
bairstow
cacm
case
coeffici
complet
comput
condit
converg
develop
differ
difficulti
equal
error
exist
failur
find
give
henrich
known
magnitud
major
method
nearli
newton
number
occur
polynomi
quotient
rapid
real
result
roundoff
rutishaus
scheme
septemb
simultan
slowli
spoil
start
success
suffici
test
traceabl
tri
valu
watkin
zero
.I 1198
cacm
commun
concurr
control
cycl
cyclic
dijkstra
engag
independ
made
mainli
mean
moment
number
problem
process
program
restrict
septemb
sequenti
solut
.I 1199
applic
base
benefit
cacm
center
central
chang
compar
comput
control
decis
describ
difficult
discuss
experi
formul
function
hardwar
hutchinson
inform
instanc
lockhe
mathemat
model
net
oper
paper
perform
problem
process
project
result
septemb
simul
situat
softwar
system
technolog
term
todai
.I 1200
analog
backward
cacm
classif
comput
concept
conjug
describ
design
develop
execut
federighi
forward
instruct
matrix
nomenclatur
number
oper
parallel
permit
properti
reili
replac
revers
run
septemb
shown
subroutin
suggest
type
unchang
unusu
.I 1201
algorithm
cacm
elliott
gener
graphic
lexico
order
permut
septemb
.I 1202
algorithm
cacm
normal
pike
random
septemb
.I 1203
algorithm
cacm
normdei
pike
septemb
.I 1204
american
bit
cacm
charact
code
commun
data
inform
interchang
pariti
propos
sens
septemb
serial
standard
structur
.I 1205
acm
cacm
committe
comput
curriculum
preliminari
program
recommend
report
scienc
septemb
undergradu
.I 1206
august
bia
cacm
commun
compat
comput
curv
data
defin
demain
design
discard
discuss
easili
equat
error
exactli
experi
factor
fit
graphic
greatli
inadequaci
inform
instrument
intract
irf
item
judgment
limit
made
mathemat
maximum
mean
measur
method
mpe
note
number
numer
ordin
orient
paramet
permit
principl
problem
process
quickli
reduc
reliabl
simplifi
sjp
solv
statist
techniqu
test
valu
wrong
.I 1207
august
boolean
cacm
dodd
function
remark
simul
.I 1208
arithmet
august
cacm
comput
fortran
logic
simul
weingarten
.I 1209
august
cacm
fortran
garber
ibm
ii
neg
program
subscript
.I 1210
allow
august
cacm
casual
comment
describ
facilit
fortran
handl
harrison
inform
name
note
programm
scientif
subroutin
symbol
tape
violat
year
.I 1211
august
berztiss
block
cacm
complet
discuss
dynam
indefinit
method
note
relat
scheme
similar
size
storag
store
string
.I 1212
approxim
august
bellman
boundari
cacm
converg
extrapol
improv
kagiada
kalba
linear
linrar
non
numer
picard
point
problem
properti
provid
scheme
success
suggest
techniqu
usual
.I 1213
august
cacm
control
convers
discuss
dynam
execut
format
fortran
give
implement
input
output
programm
ranelletti
specif
time
type
.I 1214
algebra
allow
august
cacm
comput
difficulti
experi
goldstein
ibm
increas
lapidu
list
manipul
problem
processor
routin
seri
set
slip
solv
subroutin
written
.I 1215
alcor
algol
august
cacm
compil
detail
estim
gri
group
ibm
illinoi
indic
known
organiz
paul
requir
signific
techniqu
time
wiehl
write
written
.I 1216
absolut
appli
august
cacm
chain
comput
continu
deriv
develop
differenti
edit
effici
eleg
elementari
formula
function
hand
imbed
introduc
languag
list
made
obtain
oper
print
process
produc
program
recurs
result
routin
rule
smith
subroutin
subset
symbol
translat
variabl
.I 1217
algorithm
august
cacm
integ
map
mckai
partit
.I 1218
algorithm
august
cacm
gener
mckai
partit
.I 1219
algorithm
august
cacm
mckai
number
partit
restrict
.I 1220
algorithm
august
cacm
gunn
symbol
.I 1221
algorithm
august
cacm
gunn
symbol
.I 1222
algorithm
argument
august
cacm
function
gautschi
larger
legendr
.I 1223
algebra
applic
august
briefli
bulki
cacm
calcul
code
common
compil
constant
depend
direct
discuss
doubl
effect
effici
essenti
express
fortran
gear
gener
hasto
high
highli
import
index
input
intermedi
languag
local
loop
machin
object
optim
order
orient
part
pass
perform
preced
problem
produc
properti
read
recognit
recurs
regist
remov
revers
scan
speed
subexpress
techniqu
term
.I 1224
actual
cacm
center
collect
comput
data
descript
determin
environ
gener
investig
juli
month
obtain
paramet
reduct
result
rosin
summar
tabul
unavail
.I 1225
advantag
analysi
analyz
cacm
characterist
claim
comparison
constitu
core
corpor
delin
develop
disadvantag
discuss
effici
elimin
featur
harvard
ibm
juli
kuno
oper
path
predict
process
rand
repetit
requir
robinson
storag
syntact
system
techniqu
time
.I 1226
applic
cacm
characterist
consid
critic
data
describ
design
dzubak
emploi
independ
inform
integr
juli
limit
number
organ
paper
part
process
provid
refer
select
sourc
structur
system
techniqu
ten
warburton
.I 1227
algorithm
bayer
cacm
juli
transport
.I 1228
abram
algorithm
cacm
juli
treesort
.I 1229
algorithm
cacm
juli
permut
pike
random
.I 1230
applic
briefli
cacm
charact
consid
descript
end
gener
hyphen
juli
line
method
outlin
present
print
result
rich
routin
rule
set
stone
.I 1231
cacm
call
compil
discard
examplesar
final
instruct
juli
mckeeman
method
optim
peephol
redund
simpl
stage
techniqu
.I 1232
bit
cacm
card
code
ecma
juli
punch
represent
standard
.I 1233
american
appear
appli
cacm
consid
convent
flowchart
inform
intend
juli
outlin
paper
prepar
process
propos
se
standard
symbol
system
work
.I 1234
algol
analysi
arrai
block
cacm
case
code
common
compil
complet
conveni
convent
effect
effici
elimin
enabl
express
fetch
gener
handl
high
identifi
implement
interpret
juli
kanner
kosinski
languag
macro
manner
method
minim
motion
need
paramet
permit
pointer
procedur
properli
recurs
robinson
run
side
simpl
simul
solv
sourc
speed
stack
store
string
structur
syntax
techniqu
time
transmiss
trate
.I 1235
accuraci
addit
algorithm
analysi
approach
assign
basi
cacm
carstensen
class
code
coder
comput
condit
context
corpu
decis
deriv
dictionari
empir
emploi
english
event
final
form
frequent
function
grammat
half
hand
high
identifi
improv
june
lexic
limit
logic
obviou
occur
oper
part
preliminari
probabl
program
remain
result
rule
separ
small
space
speech
speed
stochast
stolz
storag
suffix
suggest
tannenbaum
test
text
trial
wai
word
.I 1236
actual
adapt
analysi
analyz
automat
cacm
character
combin
document
effect
environ
evalu
exact
fact
featur
fulli
gener
hundr
ibm
illustr
individu
inform
initi
june
leav
lesk
method
need
obtain
oper
present
procedur
process
reli
report
request
result
retriev
salton
search
sequenc
simul
smart
strategi
system
test
typic
unspecifi
user
want
.I 1237
addit
algorithm
analysi
analyz
cacm
code
compil
comput
convent
convers
decis
definit
discuss
entri
evalu
execut
extend
familiar
featur
guid
hand
june
languag
limit
natur
orient
present
press
presum
procedur
program
reader
requir
storag
tabl
term
time
translat
valuabl
.I 1238
account
agenc
basic
budea
cacm
chang
debug
definit
design
develop
easi
easier
effici
except
expand
final
francisco
function
handl
includ
integr
june
kamena
maintain
multi
osa
oversea
permit
pose
practic
problem
product
report
requir
requisit
respons
run
san
satisfact
satisfactori
servic
simultan
solut
suppli
system
tailor
techniqu
.I 1239
algorithm
allen
cacm
graycod
june
.I 1240
algorithm
bayer
cacm
june
transport
.I 1241
algorithm
cacm
havi
integr
june
kubik
.I 1242
algorithm
cacm
graeff
grau
june
method
modifi
.I 1243
algol
cacm
call
differ
june
test
understand
weil
.I 1244
bit
cacm
fortran
june
languag
manipul
tobei
.I 1245
ari
cacm
counter
fortran
june
kent
.I 1246
cacm
deepli
iter
june
korphag
nest
.I 1247
aid
alloc
arbitrari
automat
block
bookkeep
brown
cacm
commun
compil
comput
contigu
data
debug
dynam
environ
hierarchi
includ
input
introduct
june
list
nontechn
oedipu
oper
output
paper
present
program
public
pushdown
recurs
rudimentari
serv
servic
size
storag
subroutin
system
type
.I 1248
argument
automat
cacm
comput
detect
examin
june
knowledg
nievergelt
paper
perform
present
problem
program
simplif
suppos
write
.I 1249
american
cacm
cpi
inform
interchang
june
magnet
nrzi
propos
record
revis
standard
tape
.I 1250
analysi
cacm
definit
graphic
june
paper
problem
standard
symbol
work
.I 1251
american
cacm
compar
icc
ifip
inform
june
process
standard
term
traub
vocabulari
.I 1252
aid
applic
approach
automat
cacm
comput
consum
data
descript
design
document
function
goal
implement
import
june
larger
made
make
notat
organ
part
prepar
process
program
shown
smith
statist
step
suggest
symbol
system
tabl
tediou
time
.I 1253
algebra
attempt
base
cacm
descript
differ
entir
familiar
flavor
gate
guid
implement
includ
intern
june
keller
languag
major
materi
newel
paper
present
program
quikscript
reader
render
simscript
simul
suffici
tong
understand
.I 1254
addit
algol
cacm
element
express
fischer
fortran
galler
iter
june
languag
mad
made
recent
statement
structur
.I 1255
aid
analysi
applic
arrang
assembl
autocovari
cacm
class
commonli
comput
data
densiti
design
discuss
eeg
function
group
index
lago
languag
list
logic
machin
method
number
oper
outlin
perform
philpott
power
process
program
set
signal
spectral
subroutin
symbol
system
.I 1256
cacm
dynam
format
king
variabl
.I 1257
air
appropri
assembl
bookkeep
cacm
cambridg
characterist
comput
core
darlei
debug
delet
develop
evan
extens
forc
greatli
implement
insert
laboratori
languag
line
linr
method
number
onlin
point
previous
process
program
reloc
remaind
research
simplifi
symbol
task
techniqu
univac
user
.I 1258
algebra
arithmet
blum
cacm
capac
carri
case
code
comprehens
degre
design
discuss
easi
exce
extend
field
gener
hardwar
ibm
machin
made
normal
number
packag
perform
precis
problem
program
refer
specif
theori
.I 1259
altern
applic
baker
binari
cacm
chang
characterist
comput
decim
easili
equival
exampl
express
form
gain
letter
number
power
routin
save
set
space
thought
translat
weldon
.I 1260
analysi
analyz
bcd
cacm
calcul
carri
comput
constraint
converg
core
cut
data
discuss
effect
experi
form
function
ibm
impos
make
marshal
memori
mossbauer
nelson
physic
problem
procedur
reson
small
spectra
squar
step
wilenzick
.I 1261
analyz
applic
approach
behavior
boolean
cacm
combin
common
compris
comput
depend
deriv
describ
digit
discuss
effect
element
engin
fortran
illustr
independ
input
iv
larsen
logic
mano
mean
mode
model
network
output
program
quantiz
relationship
sequenti
set
simplic
simul
system
systemat
techniqu
time
transform
util
.I 1262
allow
attain
bracket
cacm
capabl
comput
defin
degre
devic
effect
establish
execut
facilit
hold
languag
nest
oper
opler
orient
overlap
parallel
partli
path
procedur
process
program
programm
rang
section
serv
statement
suggest
togeth
write
.I 1263
addit
adequ
algol
basic
burkhardt
cacm
descript
formal
fortran
metalanguag
metaoper
specif
suffici
syntax
tabl
.I 1264
assembl
attach
batch
blnsy
braill
cacm
capabl
card
common
condens
control
convers
debug
deck
design
drive
dump
duplic
english
equip
execut
featur
function
handl
ibsi
includ
input
job
landwehr
lichstein
list
lost
machin
mclaughlin
minim
minimum
mueller
object
oper
option
ouput
output
perform
peripher
pollack
post
print
process
produc
program
provid
punch
small
sourc
sp
storag
submit
subroutin
system
tape
time
trace
uncondens
updat
user
written
.I 1265
afford
algol
algorithm
attempt
cacm
chosen
common
compar
comparison
comput
consid
context
defin
descript
devic
divers
effici
empir
equival
formal
free
give
grammar
griffith
increas
investig
languag
lisp
machin
made
make
mean
nondeterminist
number
obtain
paper
pars
petrick
procedur
produc
program
propos
realist
recogn
recognit
rel
respect
sentenc
simpl
simul
ture
univac
.I 1266
appendix
asa
cacm
consider
fortran
purpos
relat
standard
.I 1267
affect
arrang
asa
aspect
bit
cacm
characterist
conclud
condit
conjunct
data
determin
discuss
error
exampl
express
includ
inform
involv
measur
orderli
paper
paramet
perform
pertin
present
procedur
rate
residu
standard
system
term
thruput
transfer
transmiss
trib
tutori
.I 1268
algorithm
boothroyd
cacm
complex
logarithm
number
.I 1269
algorithm
cacm
coeffici
comput
fourier
teijelo
.I 1270
algol
answer
automat
beginn
cacm
check
comput
educ
effect
effici
essenti
evalu
forsyth
grade
grader
integr
order
present
procedur
program
properti
reliabl
search
statement
student
system
test
wirth
.I 1271
address
analysi
april
cacm
compar
complet
data
davi
experiment
ibm
involv
kei
lin
list
logic
method
oper
prepar
present
primari
produc
record
relev
request
result
retriev
satisfi
search
secondari
set
storag
system
.I 1272
abstract
amount
analysi
applic
april
articl
automat
cacm
chief
citat
comput
concord
condens
contend
correct
data
desir
discuss
doul
economi
edit
evalu
exemplifi
expand
expans
factor
function
goe
heavi
human
improv
incom
index
interpret
languag
larg
leav
lectur
mail
mechan
mere
method
necess
oper
opportun
output
paper
prepar
procedur
process
produc
quick
regard
report
requir
summari
survei
telegram
text
translat
unbias
unwelcom
volum
yield
.I 1273
accumul
april
cacm
customari
error
form
krasun
modifi
prager
quadratur
remark
romberg
round
sensit
.I 1274
april
boundari
cacm
consider
dai
develop
differenti
equat
homogen
integr
interv
kutta
linear
method
numer
ordinari
point
problem
requir
rung
solut
system
unknown
.I 1275
april
cacm
code
corrigendum
item
length
manipul
protect
ramamoorthi
structur
variabl
.I 1276
april
cacm
chain
fortran
ii
.I 1277
april
cacm
cobol
fortran
main
program
subroutin
tajiri
.I 1278
acm
analyt
april
articl
attract
bellman
boundari
cacm
commun
deriv
determin
equat
evalu
form
function
kagiwada
kalaba
linear
machin
non
numer
orbit
partial
problem
program
quasilinear
recent
solv
suggest
techniqu
undertaken
viewpoint
wengert
.I 1279
april
assign
base
brown
cacm
charact
compact
condit
correl
effici
encod
gener
integ
number
predecessor
procedur
reason
rule
select
sequenc
set
shown
successor
system
uniqu
valu
.I 1280
april
bellman
biologi
bodi
buell
cacm
common
concern
deal
decreas
depend
differ
differenti
eas
effect
equat
exist
extens
flow
integr
kalaba
knowledg
lag
method
multipl
numer
occurr
ordinari
present
rate
reduc
shown
situat
solut
studi
subsequ
system
time
variabl
.I 1281
answer
april
ask
cacm
check
comput
convers
data
determin
edit
error
format
input
paper
process
pyle
question
requir
scheme
share
standard
statement
time
user
valu
.I 1282
account
advantag
alloc
april
cacm
call
cobol
code
differ
disadvantag
enabl
fortran
iv
languag
librari
main
minim
program
programm
proper
properti
respect
routin
shavel
storag
subroutin
take
techniqu
write
.I 1283
algorithm
april
cacm
fer
invers
matrix
.I 1284
april
bessel
cacm
function
integ
order
set
stafford
.I 1285
algorithm
april
busing
cacm
eigenvalu
eigenvector
matrix
method
qr
real
symmetr
.I 1286
algorithm
april
busing
cacm
eigenvalu
matrix
method
qr
real
symmetr
.I 1287
algorithm
april
cacm
clebsch
coeffici
coupl
gordan
gunn
vector
.I 1288
advantag
april
cacm
clp
concept
construct
conwai
cornel
delfauss
discuss
emploi
exampl
highlight
introduc
languag
list
maxwel
mean
paper
present
process
processor
serv
simul
teach
univers
walker
.I 1289
american
april
cacm
code
inform
interchang
propos
revis
standard
.I 1290
abandon
addit
american
appear
april
ard
ardizationof
area
ascii
basic
cacm
charact
code
commun
complet
concept
conjunct
consider
control
cover
data
date
earlier
elabor
encrypt
expect
forecast
goe
group
handl
inform
interchang
lead
line
materi
mean
mention
mode
modul
non
normal
outlin
paper
philosophi
present
previou
problem
procedur
propos
provid
rate
solut
stand
standard
structur
system
task
transpar
tutori
underth
.I 1291
cacm
data
georg
input
march
tabular
.I 1292
applic
believ
cacm
charact
comput
correct
digit
divid
divis
divisor
earlier
estim
exact
form
get
krishnamurthi
length
machin
march
method
minu
normal
obtain
oper
orient
paper
pope
precis
present
quotient
result
round
stein
suitabl
unlik
variabl
wide
word
.I 1293
analyz
cacm
commonli
gener
greenberg
march
method
nonrandom
number
properti
random
.I 1294
addit
algorithm
arithmet
bit
cacm
describ
develop
divis
doubl
float
gregori
ikeb
march
modif
multipl
note
number
obtain
paper
point
precis
purpos
ranei
recent
similar
subtract
techniqu
tripl
trivial
.I 1295
activ
address
allow
assign
backward
bit
cacm
calcul
carri
cell
complet
core
defin
event
expect
forward
inform
lass
latest
link
locat
major
march
memori
net
order
pert
present
progress
remaind
repres
simplifi
techniqu
time
topolog
typic
unidirect
uniqu
.I 1296
algorithm
ativ
cacm
march
wasscher
.I 1297
algorithm
cacm
march
steep
varah
.I 1298
adapt
cacm
integr
march
numer
pike
simpson
.I 1299
algorithm
bowlden
cacm
diophantin
equat
march
solut
.I 1300
algorithm
cacm
function
march
minim
well
.I 1301
algol
cacm
convent
march
zaremba
.I 1302
american
ard
cacm
data
march
parallel
propos
signal
speed
stand
transmiss
.I 1303
algol
cacm
church
correspond
landin
march
.I 1304
algorithm
basic
cacm
characterist
control
featur
iron
march
multi
paper
program
rapid
system
time
turnaround
.I 1305
cacm
cecchi
cep
compil
comput
convert
emphasi
express
fortran
input
intern
languag
list
mancino
march
object
outlin
output
paper
program
sourc
structur
subscript
translat
variabl
written
.I 1306
algol
ambigu
cacm
class
complet
comput
concept
design
discuss
free
fulli
johnston
languag
march
mean
nest
paper
redefinit
suggest
unambigu
.I 1307
aid
analysi
appli
cacm
command
commun
compos
comput
concern
control
correct
data
describ
design
displai
drive
eas
element
essenti
februari
gener
goodenough
grammar
handl
interpret
intim
languag
learn
light
lightpen
line
make
master
mean
method
month
natur
paper
pen
person
point
primarili
process
program
rememb
requir
restrict
result
rewrit
rule
scientist
scope
select
set
sever
signific
small
spend
successfulli
syntact
system
techniqu
ten
time
unabl
unconstrain
unord
user
vocabulari
.I 1308
advantag
aid
analysi
approach
automat
cacm
center
characterist
common
commun
comput
consist
control
convent
convert
creat
defin
demonstr
describ
descript
design
desir
discuss
draft
draftsmen
draw
drive
dynam
engin
english
equat
experi
februari
flexibl
gener
graviti
group
improv
inform
input
instruct
judici
krolak
languag
luh
machin
man
mathemat
mechan
model
modular
numer
output
part
physic
present
process
propos
quadric
requir
result
subprogram
surfac
system
tailor
take
tape
tool
work
.I 1309
accomplish
algebra
bank
cacm
complex
comput
cost
data
develop
effici
elementari
extract
fast
februari
flexibl
form
format
fundament
graphic
individu
initi
languag
larg
low
make
manag
manipul
matran
matrix
montillon
orient
permit
prepar
present
process
regardless
report
requir
result
select
sequenc
special
subset
suffici
system
tabular
tailor
user
varieti
vehicl
.I 1310
braill
cacm
februari
ibm
klema
machin
rapid
techniqu
transliter
weiler
.I 1311
autocorrel
cacm
effici
februari
schmid
.I 1312
cacm
februari
iter
recurs
rice
.I 1313
cacm
construct
februari
nonlinear
problem
program
rosen
suzuki
test
.I 1314
algol
batson
burrough
cacm
compil
consider
construct
design
effici
featur
februari
gener
identifi
import
organ
primari
rapid
recognit
reserv
symbol
tabl
techniqu
virginia
word
.I 1315
account
administr
amount
atom
autom
bookkeep
cacm
commiss
comput
consolid
consum
contain
convert
creat
detail
dispos
energi
februari
forcom
format
fortran
fulli
health
hospit
ibm
indic
januari
lahner
languag
maintain
materi
microcuri
millicuri
minimum
nebraska
omaha
oper
period
physicist
procedur
program
purchas
radioact
radioisotop
reactor
receiv
record
regul
report
requir
satisfactori
servic
staff
state
system
time
total
transfer
triga
unit
veteran
written
year
.I 1316
algorithm
bessel
cacm
februari
function
gautschi
kind
.I 1317
algorithm
cacm
charlier
februari
poisson
polynomi
samet
.I 1318
algorithm
arccossin
bowlden
cacm
februari
.I 1319
algorithm
cacm
crout
equilibr
februari
iter
meissner
.I 1320
algorithm
boonstra
cacm
februari
invers
permut
.I 1321
algorithm
cacm
februari
outreal
wirth
.I 1322
algorithm
brigg
cacm
februari
netflow
.I 1323
abstract
algol
analogu
applic
base
behavior
cacm
church
classif
comput
correspond
describ
descript
establish
express
featur
februari
form
formal
function
gener
illustr
imper
inform
landin
languag
mainli
map
model
modifi
notion
number
objct
paper
part
pure
rule
semant
small
structur
suggest
.I 1324
advanc
ambigu
answer
base
cacm
calculi
classifi
comput
concern
conclud
convers
data
deal
detail
development
difficult
discuss
earli
english
experiment
fifteen
formal
gener
graphic
import
inferenti
initi
januari
languag
larg
list
logic
machin
make
measur
method
oper
pass
phase
pictur
principl
processor
program
purpos
question
rang
research
review
search
seen
sentenc
simmon
structur
survei
system
text
translat
tree
.I 1325
adapt
analysi
attempt
author
automat
branch
cacm
capabl
clinic
comput
concern
configur
decis
develop
diagnosi
diagnost
dickson
digit
dimension
earli
effort
electrocardiogram
electrocardiograph
extend
fidel
filter
function
hardwar
horib
increas
interact
introduc
januari
lead
like
line
major
match
onlin
paper
parallel
pattern
possibl
present
problem
process
real
remot
report
satisfactori
softwar
solut
sort
stark
studi
system
time
tree
whippl
.I 1326
access
algorithm
amount
arbitrarili
auxiliari
base
bound
boundari
cacm
comput
criteria
data
detail
determin
devic
domain
emploi
evalu
feasibl
gener
inclus
januari
level
line
loomi
method
network
number
partial
partit
plane
point
polygon
procedur
process
purpos
reduc
region
relat
represent
requir
respect
scheme
select
set
storag
total
.I 1327
action
advantag
amount
arriv
base
binari
cacm
clear
comput
condit
cours
creat
creation
data
decis
directli
displai
document
drastic
enabl
entri
form
gain
illustr
imag
inher
input
januari
kirk
limit
logic
memori
point
program
proper
put
reduc
scan
set
simplifi
tabl
tabular
techniqu
view
.I 1328
cacm
error
januari
kahan
reduc
remark
truncat
.I 1329
boolean
cacm
comput
decim
function
januari
mano
simul
.I 1330
anderson
autom
cacm
chart
comput
flow
januari
plot
small
.I 1331
alphanumer
arithmet
assign
bit
cacm
charact
code
comput
control
detect
error
fix
flexibl
identif
inform
insert
item
januari
lead
length
made
manipul
mark
method
number
oper
partit
protect
ramamoorthi
separ
shown
structur
suitabl
symbol
troubl
variabl
word
.I 1332
assembl
cacm
descript
inform
januari
librari
maintain
pass
requir
samet
subroutin
system
tabl
.I 1333
accumul
addend
algorithm
articl
cacm
cascad
case
deal
elimin
error
flexibl
individu
integr
januari
larg
larger
neg
note
number
numer
present
quantiti
recent
reduc
result
ross
simpler
slightli
sum
truncat
wolf
.I 1334
algebra
arbitrari
arrai
barnett
cacm
code
comput
differenti
express
formula
fortran
gener
gerard
integ
izsak
januari
manipul
mechan
newcomb
oper
perform
photograph
photon
planetari
polynomi
produc
program
recurr
scheme
simpl
stand
system
tabl
techniqu
tediou
theori
typeset
variabl
written
.I 1335
american
ard
cacm
charact
januari
optic
propos
recognit
set
stand
.I 1336
cacm
highlight
januari
languag
npl
program
radin
rogowai
.I 1337
algol
cacm
decemb
definit
euler
formal
gener
weber
wirth
.I 1338
addit
cacm
comment
concurr
control
decemb
knuth
problem
progam
.I 1339
algol
cacm
contribut
decemb
develop
hoar
wirth
.I 1340
abraham
cacm
decemb
devic
lanc
monitor
multiplex
output
pearcei
peripher
philosophi
present
slow
.I 1341
attitud
break
bryant
build
cacm
command
commun
comput
continu
control
correspondingli
decemb
discuss
effect
essai
eventu
futur
gener
learn
level
parallel
pose
problem
program
pursu
question
rais
regard
share
structur
system
take
tend
time
trend
us
.I 1342
algorithm
bayer
cacm
decemb
problem
transport
.I 1343
algorithm
cacm
decemb
farka
havi
integr
.I 1344
algebra
analysi
balanc
base
cacm
calcul
complet
compon
comput
consid
decemb
effici
fix
hemerl
includ
machin
method
mix
model
natur
obtain
perform
present
procedur
random
readabl
relat
schlater
specif
statist
symbol
term
varianc
.I 1345
basic
cacm
calcul
calculu
capabl
christoffel
code
comput
coordin
decemb
formac
interest
orthogon
program
quantiti
symbol
system
tensor
walton
written
.I 1346
aim
algorithm
applic
approach
approxim
bessel
cacm
case
converg
decemb
develop
directli
domain
effici
equal
error
establish
extens
function
gargantini
investig
known
limit
maxima
modifi
nearli
numer
obtain
origin
paper
polynomi
present
process
ration
reme
result
seri
show
small
.I 1347
cacm
comput
condit
decemb
depend
deriv
determin
develop
differenti
elimin
equat
error
evalu
execut
extrem
form
gener
individu
initi
investig
involv
led
matric
need
paramet
partial
presag
program
propag
requir
sensit
separ
specif
subroutin
suppli
system
techniqu
time
util
vari
varianc
wengert
wilkin
.I 1348
approach
avoid
cacm
chart
code
comment
comput
confin
control
decemb
deck
defin
describ
descript
desir
detail
document
exampl
exist
fap
featur
flowchart
flowtrac
inclus
languag
manner
metalanguag
object
permit
produc
program
purpos
remark
result
scope
sherman
snobol
statement
syntax
system
written
.I 1349
academ
acquir
activ
art
attribut
author
cacm
capabl
complex
comput
constraint
contin
decemb
descript
effect
equip
europ
european
explic
facil
factor
financi
finerman
futur
govern
handicap
institut
interchang
knowledg
lag
larg
moder
organ
pauciti
plan
present
princip
procedur
profession
relationship
report
scale
share
subordin
summer
system
time
univers
vari
visit
western
.I 1350
abbott
accept
addit
algorithm
analyz
arbitrari
assign
augment
base
bottom
cacm
cock
compar
comparison
complex
construct
context
core
cover
criteria
cy
deriv
describ
descript
due
effect
effici
equival
extens
form
free
gener
grammar
greibach
gs
harvard
inform
intermedi
iron
kuno
languag
normal
novemb
origin
pars
perform
predict
process
program
proven
rel
requir
rule
sakai
sd
section
select
sentenc
similar
standard
storag
structur
supplement
symbol
techniqu
termin
time
top
transform
.I 1351
arithmet
automat
bound
cacm
dargel
error
function
implement
interv
locat
loscalzo
method
newton
novemb
procedur
propos
raphson
ration
real
requir
roundoff
start
version
witt
zero
.I 1352
achiev
adapt
automat
cacm
effici
form
function
greater
integr
integrand
method
novemb
numer
paramet
rabinowitz
romberg
show
shown
simpson
.I 1353
accomplish
automat
cacm
calcul
clasen
control
criteria
defin
linear
method
need
note
novemb
numer
object
procedur
program
review
simplex
step
technic
techniqu
toler
.I 1354
account
cacm
circumst
comput
condit
construct
convers
convert
decis
discuss
drawback
entri
evalu
frequenc
hitherto
improv
king
liabil
limit
longer
mark
mask
materi
method
modif
network
novemb
object
paper
prefer
present
produc
program
recent
rel
rule
run
suggest
tabl
take
techniqu
time
tree
.I 1355
algorithm
cacm
coulomb
function
gautschi
novemb
regular
wave
.I 1356
algorithm
cacm
havi
hillstrom
integr
novemb
.I 1357
algorithm
cacm
examin
novemb
schedul
william
.I 1358
altern
approach
base
cacm
call
condit
defin
discuss
element
exampl
extend
formal
gener
high
languag
leavenworth
level
macro
novemb
option
recogn
scan
semant
string
syntact
syntax
transform
translat
type
.I 1359
accord
appli
applic
assum
bank
cacm
complex
concept
context
control
data
declar
deriv
develop
direct
discuss
environ
explicitli
express
filter
format
function
gener
implement
implicitli
inform
input
intern
interpret
job
languag
larsen
librari
manipul
mechan
modul
novemb
orient
output
part
port
procedur
process
relat
resid
result
retriev
satisfi
sequenc
sourc
storag
string
structur
user
.I 1360
asa
cacm
data
descript
octob
system
transmiss
tutori
.I 1361
american
cacm
card
hole
octob
propos
punch
rectangular
row
standard
twelv
.I 1362
american
applic
asa
ascii
bit
cacm
charact
code
complet
concept
concern
consist
control
corollari
cover
directli
discuss
distinct
doctrin
drawn
equal
extens
inform
interchang
intern
iso
link
manner
materi
mean
mutual
number
octob
paper
philosophi
present
previous
principl
propos
regard
repres
represent
requir
set
standard
suggest
topic
truli
tutori
.I 1363
cacm
calcul
comput
continu
error
estim
gener
initi
integr
interv
martin
method
monitor
numer
octob
order
paulson
problem
procedur
sashkin
size
solv
start
step
systemat
th
truncat
.I 1364
aris
author
bellman
buell
cacm
context
dt
du
equat
experiment
form
interest
kalaba
lag
mathemat
mean
modul
number
numer
obtain
octob
point
properti
scientif
solut
time
.I 1365
addit
algebra
analysi
applic
area
aris
aros
astronaut
astronomi
autom
cacm
coeffici
compil
complic
comput
differenti
discuss
elimin
engin
equat
estim
expans
express
extens
field
formac
formula
fortran
gener
iv
keplerian
likelihood
liter
manipul
mathemat
maximum
monoton
motion
nonlinear
octob
paper
perform
permit
phase
physic
power
practic
present
problem
product
program
seri
simultan
solut
specif
statist
successfulli
system
tediou
tensor
tobei
tool
truncat
type
usag
.I 1366
analysi
attent
cacm
chang
characterist
choos
chosen
clp
compar
comparison
comput
conclus
continu
cost
cpss
csl
design
detail
develop
devot
digit
discret
discuss
distinct
evalu
exist
featur
futur
gasp
gener
iii
implement
implic
improv
inappropri
involv
issu
languag
lubin
model
obviou
occur
octob
offer
packag
paid
paper
part
present
purpos
seri
simscript
simul
softwar
sol
special
strength
substanti
suggest
summar
tabl
techniqu
teichroew
time
train
user
wai
weak
write
.I 1367
american
ascii
bit
cacm
charact
commun
data
parallel
pariti
propos
sens
septemb
standard
structur
.I 1368
applic
arc
cacm
circuit
combinatori
comput
describ
direct
exhaust
gener
hamiltonian
made
matrix
nondirect
paper
problem
program
robert
septemb
specif
systemat
.I 1369
cacm
cyclic
determin
dimension
elementari
euclidean
exampl
half
iter
jacobi
matrix
mccamon
method
numer
obtain
plane
procedur
rotat
septemb
space
util
variant
.I 1370
algorithm
boothroyd
cacm
equat
exact
linear
septemb
solut
.I 1371
algorithm
cacm
function
gamma
hill
logarithm
pike
septemb
.I 1372
algorithm
bell
cacm
direct
pike
search
septemb
.I 1373
algorithm
argument
cacm
function
gamma
hill
logarithm
pike
rang
real
reciproc
septemb
.I 1374
algorithm
bergson
cacm
determin
evalu
septemb
.I 1375
algorithm
cacm
fletcher
function
minim
septemb
.I 1376
algorithm
cacm
graeffe
method
modifi
septemb
stern
.I 1377
algorithm
cacm
hansson
number
pseudo
random
septemb
.I 1378
algorithm
cacm
hill
number
pike
pseudo
random
septemb
.I 1379
abraham
algol
ambigu
attach
basic
cacm
case
chang
class
close
closur
condit
consist
dangl
defin
difficulti
equat
exist
final
form
languag
lead
let
li
open
potenti
preced
preserv
problem
relat
requir
restrict
sand
septemb
shown
solut
statement
syntax
type
unambigu
uncondit
unnecessari
unnecessarili
.I 1380
algol
analyst
base
cacm
concept
concis
dahl
descript
design
discret
event
extens
facilit
import
introduct
languag
nygaard
paper
parallel
process
program
provid
quasi
septemb
serv
simul
simula
sourc
system
unifi
.I 1381
ad
addit
advanc
analysi
applic
automat
cacm
calculu
clarif
clarifi
compet
complex
comput
concept
continu
curriculum
desir
develop
earli
equat
extens
extrem
field
idea
illustr
impact
includ
intens
interest
introduc
introduct
logic
mathemat
mathematician
modifi
murrai
numer
paper
permit
person
portion
prepar
present
profession
program
properli
provid
requir
scienc
septemb
signific
societi
sophist
stage
structur
student
suggest
techniqu
technolog
theori
transform
undergradu
understand
util
variabl
widespread
yield
.I 1382
activ
appli
author
briefli
broad
cacm
comment
comput
concern
demand
desir
discuss
examin
factor
impact
influenc
inform
macon
mathemat
mathematician
matter
mid
profession
project
relat
septemb
state
suppli
symposium
term
theme
train
undergradu
unit
year
.I 1383
affair
alter
appli
cacm
chang
complex
comput
definit
digit
disciplin
educ
exist
given
human
implic
import
interest
logic
longer
mathemat
profoundli
result
scienc
septemb
singl
term
think
.I 1384
approach
associ
assur
atchison
background
believ
broad
cacm
committe
comput
content
cours
curriculum
debat
disciplin
enabl
essenti
machineri
mathemat
physic
program
requir
scienc
scientif
scientist
septemb
student
subject
take
undergradu
varieti
wide
.I 1385
adjudg
aid
applic
aspect
attempt
audett
autom
base
binari
bring
cacm
campaign
capabl
china
chines
communist
comput
concept
control
data
develop
due
educ
head
inform
initi
item
linear
literatur
machin
made
major
margin
mid
natur
new
oper
ordinari
organ
peasant
period
plan
point
present
presum
process
product
program
progress
reach
review
scienc
septemb
soviet
specif
technolog
translat
trend
turn
vacuum
withdraw
worker
.I 1386
algorithm
august
cacm
clapp
coeffici
consist
discuss
effici
exampl
extens
factor
find
finit
found
implement
instanc
integ
interpol
jordan
kain
kroneck
mathemat
multi
number
onlin
polynomi
power
present
prime
promis
proof
singl
step
suffici
symbol
system
techniqu
variabl
variat
.I 1387
appear
aris
august
cacm
case
code
coeffici
comparison
difficulti
due
effect
elimin
equat
estim
explos
formac
found
growth
hazard
initi
integr
intermedi
larg
lisp
made
mathemat
method
mose
need
non
numer
polynomi
problem
procedur
simplif
small
solut
solv
symbol
system
truncat
william
yield
.I 1388
analysi
august
automast
automat
ball
base
bern
cacm
carri
comput
depend
determin
differenti
displai
easili
equat
error
estim
exact
expans
final
finit
gener
includ
influenc
mathemat
non
numer
ordinari
origin
paramet
problem
procedur
program
read
result
seri
shown
solut
solv
symbol
system
taylor
translat
variabl
.I 1389
ad
august
bell
build
cacm
closer
code
comit
data
effici
facil
faster
ipl
knowlton
laboratori
languag
link
lisp
list
machin
manipul
order
permit
processor
program
programm
pronounc
run
snobol
storag
structur
telephon
underli
user
varieti
wider
write
.I 1390
advantag
allow
appli
applic
arrai
august
cacm
code
complic
concis
condit
consequ
conveni
convert
defin
easili
elabor
eventu
express
found
govern
guzman
identifi
languag
list
match
mcintosh
meant
pair
pattern
prescrib
primit
principl
problem
program
recurs
rule
search
seri
skeleton
state
string
subexpress
substitut
transform
.I 1391
algebra
august
cacm
comput
constant
design
engin
environ
experi
familiar
fap
finit
group
ibm
integ
mad
manipul
map
maurer
medium
modern
object
oper
program
scale
scientist
serv
set
share
subset
system
teacher
time
truth
valu
wish
work
written
.I 1392
algorithm
attempt
august
avoid
basic
cacm
concret
core
design
detail
differenti
discuss
exampl
excess
expand
experi
express
extract
facet
formac
gener
idea
implement
intermedi
made
manipul
mathemat
minim
need
order
present
principl
provid
recurr
relev
requir
routin
skelet
storag
stress
structur
swell
theme
tobei
util
.I 1393
algorithm
alpak
arithmet
august
base
cacm
calcul
canon
choic
coeffici
collin
common
compar
constitut
deriv
differ
divisor
exapl
form
formal
greater
greatest
ibm
iii
illustr
includ
independ
integ
integr
larg
lisp
list
manipul
mention
number
oper
perform
pm
polynomi
process
product
program
quotient
refco
respect
size
slip
subroutin
substitut
subsystem
sum
superior
system
unrestrict
variabl
.I 1394
algebra
august
cacm
calcul
complet
complic
comput
develop
digit
discuss
elementari
encount
energi
express
fifteen
follow
futur
hearn
high
human
ibm
involv
larg
limit
lisp
manipul
manner
matrix
minut
month
noncommut
number
oper
outlin
paper
particl
physic
plan
present
problem
program
properti
quantiti
reaction
represent
rule
solv
straightforward
system
take
tensor
work
.I 1395
algorithm
ambit
applic
august
cacm
christensen
descript
design
famili
implement
languag
manipul
member
program
rational
replac
rule
scan
string
symbol
techniqu
transform
.I 1396
applic
arithmet
attent
august
batch
cacm
capabl
differenti
discuss
displai
edit
field
final
formula
gener
input
integr
manipul
onlin
output
precis
program
sammet
simplif
solv
specif
support
survei
system
.I 1397
abraham
acm
algebra
algorithm
applic
arrang
august
bobrow
brought
cacm
chairman
cheatham
clapp
committe
confer
consist
daniel
design
direct
discuss
dougla
editor
even
floyd
formula
futur
goldstein
griesmer
group
hundr
implement
interest
jame
jean
languag
lewi
live
made
manipul
max
mcllroi
meet
panel
paper
paul
peopl
present
proceed
program
robert
sammet
special
sponsor
string
symbol
symposium
thoma
twenti
.I 1398
accept
algorithm
analysi
approach
biolog
cacm
criteria
criterion
data
deriv
determinist
develop
elimin
found
gleser
group
haberman
inform
juli
medicin
model
multivari
outlin
pollack
problem
process
robot
scienc
screen
search
social
solut
sterl
termin
theori
type
variabl
.I 1399
accord
allow
bottom
cacm
context
descript
discuss
effect
equival
free
freegrammar
grammar
juli
kurki
left
null
obtain
perform
procedur
recognit
recurs
rewrit
rule
string
strongli
structur
suonio
top
.I 1400
accept
blum
cacm
discuss
free
frequent
gener
input
juli
manipul
produc
program
relat
routin
simpl
tape
techniqu
text
util
.I 1401
approxim
bellman
cacm
calcul
computation
consid
converg
differenti
eigenvalu
equat
juli
kagiwada
kalaba
kantorovich
method
newton
ordinari
problem
quadrat
quasilinear
quasiliner
raphson
relat
resolv
scheme
success
system
techniqu
.I 1402
accuraci
adam
addit
bashforth
cacm
compar
deriv
differenti
equat
function
glauz
inform
integr
intermedi
interpol
juli
method
obtain
partial
point
requir
step
store
valu
yield
.I 1403
assum
cacm
case
defin
devis
easili
effici
extend
find
fortran
function
implement
import
includ
increas
integ
juli
method
minim
minimum
monoton
observ
order
pair
partial
point
posit
procedur
program
set
sigillito
smallest
tupl
valu
written
.I 1404
accomplish
analysi
aspect
basic
cacm
calculu
carri
comput
connect
covari
cover
develop
discuss
experi
extend
extens
hartli
illustr
introduc
juli
multifactor
multipl
numer
oper
peng
procedur
program
refer
result
shown
special
statist
structur
util
varianc
.I 1405
algorithm
arithmet
blankinship
cacm
integ
juli
matrix
triangul
.I 1406
algorithm
blankinship
cacm
diophantin
equat
juli
linear
simultan
solut
.I 1407
algorithm
cacm
confid
hill
interv
juli
pike
ratio
.I 1408
access
analysi
analyz
applic
ascertain
attack
cacm
capac
chang
circumst
deal
defin
definit
design
develop
drum
efficaci
effici
emploi
enabl
engin
enorm
eschenbach
expens
fewer
function
gener
hardwar
improv
incorpor
increas
introduc
job
juli
light
manner
mean
method
model
modifi
oper
outset
paper
perform
permit
prime
problem
question
queue
quickli
rais
rate
real
realist
scheme
shown
simpl
specif
standard
suggest
system
theori
time
underli
usual
weingarten
.I 1409
aim
arithmet
arrang
associ
basic
bole
cacm
circul
command
comput
conceiv
concept
consol
construct
control
cost
delai
design
develop
digit
easi
easili
educ
effect
elabor
flip
flop
glass
hardwar
inform
interact
interfac
jr
juli
kc
larg
latenc
line
low
machin
man
mc
medium
memori
modif
modifi
nebula
object
oregon
origin
parallel
possibl
project
regist
research
result
rux
seminar
serial
similar
simpl
special
speed
state
structur
system
time
unit
univers
unusu
usabl
weingarten
.I 1410
activ
approxim
arpa
assum
assumpt
biphas
cacm
coffman
common
data
defin
descript
distribut
exponenti
gener
govern
hyperexponenti
independ
input
interarriv
juli
justifi
obtain
optim
paper
perform
process
program
purpos
requir
rough
satisfactori
satisfactorili
sdc
serial
share
stationari
statist
stochast
system
time
triphas
tss
user
usual
wood
.I 1411
accumul
algorithm
basic
cacm
calcul
coeffici
compar
comparison
comput
correct
correl
data
deviat
doubl
due
elimin
error
estim
evalu
formula
gener
includ
initi
juli
larg
make
mean
need
neeli
note
obtain
pass
perform
precis
recurs
reliabl
standard
statist
subset
suggest
systemat
techniqu
term
test
usual
.I 1412
access
account
applic
approach
autom
avail
bank
base
cacm
central
combin
commerci
common
complex
comput
concept
contain
convers
coupl
cross
custom
data
develop
direct
discern
draw
equip
exist
facilit
fold
gener
gradual
head
includ
index
individu
inform
inquir
interfac
introduc
juli
kind
larg
led
major
manag
point
process
progress
provid
prudent
purpos
real
referenc
relationship
respons
serv
sophist
sought
stasu
store
suit
system
time
usag
.I 1413
actual
adapt
aspect
branch
cacm
chang
discoveri
educ
evok
fashion
gener
idea
ignor
invent
juli
known
larg
like
mode
object
oetting
paper
potenti
present
question
rais
respons
scale
social
stem
technolog
time
unknown
vision
.I 1414
american
cacm
card
code
inform
interchang
june
propos
punch
row
standard
twelv
.I 1415
achiev
analysi
analyz
attempt
author
automat
avenu
basic
cacm
carmodi
claus
complex
conclud
conduct
constitu
decomposit
deriv
design
english
exhibit
explor
extract
gener
grammat
harvard
human
idea
improv
interpret
jone
jr
june
kernel
languag
long
longer
machin
man
materi
messag
microsent
monitor
multipath
natur
object
open
oper
output
paper
perform
practic
prefer
prepar
produc
program
prospect
qualiti
reassembl
retriev
select
sentenc
shorter
step
structur
subject
suggest
syntact
system
tree
verb
.I 1416
allow
annot
cacm
calcul
cleari
combat
design
extract
form
format
fortran
gener
inform
input
involv
june
magnet
method
nonstandard
problem
product
report
set
simplifi
standard
statement
suitabl
tabul
tape
techniqu
troublesom
typic
.I 1417
analyz
cacm
comparison
comput
cost
data
develop
economi
equip
examin
function
grosch
ibm
instruct
jr
june
kernel
made
mix
model
present
program
scale
sizabl
solomon
system
time
unquestion
.I 1418
algorithm
cacm
examin
june
peck
schedul
william
zh
.I 1419
algorithm
cacm
chebyshev
hopgood
june
litherland
quadratur
.I 1420
accumul
addit
bit
cacm
capac
congruenti
discuss
gener
hutchinson
june
largest
modulu
multipl
multipli
number
pass
possess
prime
primit
properti
pseudorandom
random
root
signific
statist
test
uniform
usual
.I 1421
algol
base
cacm
consist
contribut
definit
describ
detail
develop
discuss
experi
facil
hoar
ii
iii
improv
includ
incorpor
input
introduct
june
languag
larg
made
motiv
number
output
part
procedur
program
propos
respect
rigor
set
similar
standard
summari
vision
wirth
year
.I 1422
american
cacm
eleven
inch
paper
perfor
propos
sixteenth
standard
tape
.I 1423
addit
advantag
algorithm
analysi
appli
applic
avoid
burru
cacm
case
complic
comput
concept
consider
convent
effort
exist
extens
extra
fairli
form
found
gener
import
includ
inv
invers
invert
loss
matric
matrix
method
non
numer
ordinari
orthogon
product
rank
requir
result
rust
schneeberg
signific
simpl
singular
space
special
squar
storag
transform
wide
yield
.I 1424
analysi
automat
black
cacm
carri
circuit
control
data
diagram
digit
electron
list
map
process
program
shalla
structur
written
.I 1425
al
altern
appli
base
basic
belong
blank
bohm
cacm
composit
decompos
defin
diagram
due
essenti
extens
famili
finit
flow
format
gener
half
inter
interspers
introduc
iter
jacopini
job
languag
level
machin
map
method
normal
number
obtain
paper
part
proper
provid
repres
rule
semant
set
similar
squar
subfamili
suitabl
tape
theori
true
ture
work
.I 1426
admiss
author
base
cacm
censu
constant
determin
discharg
examin
fix
full
hospit
improv
independ
jr
larg
maintain
minu
object
percentag
polici
practic
produc
put
rate
realiz
reason
result
simul
smith
solomon
special
stabil
stabl
studi
type
.I 1427
activ
area
assum
auxiliari
cacm
cathod
characterist
comput
densiti
diagnosi
dimension
disk
displai
dot
field
flexibl
import
increas
limit
made
medic
output
past
pattern
pdp
pizer
present
program
quantum
radioisotop
rai
repres
research
scan
scanner
shown
simul
sourc
storag
structur
studi
system
tube
written
.I 1428
aid
assist
cacm
comput
critic
digit
iii
ill
jr
manag
meagher
monitor
nurs
onlin
paramed
patient
personnel
physician
report
rockwel
shock
shubin
system
weil
.I 1429
algorithm
applic
basic
cacm
calcul
comput
devic
discuss
effici
gener
gotlieb
hand
hungarian
improv
kuhn
lion
matrix
method
need
problem
reduct
school
suit
timet
.I 1430
approxim
base
binari
cacm
case
coeffici
convers
convert
decim
float
ia
integ
larg
mancino
multipl
nonsingl
occupi
paper
perform
point
polynomi
posit
power
precis
region
show
singl
small
storag
suffic
tabl
versa
vice
.I 1431
algorithm
basic
cacm
construct
data
deuel
effici
fact
function
map
present
review
storag
structur
.I 1432
alphanumer
arrang
basi
cacm
call
charact
cohn
control
devic
digit
fortran
graph
handl
incorpor
inform
input
media
medium
method
modifi
nonstandard
number
output
plotter
provid
readili
standard
statement
subroutin
suit
system
type
unit
unus
.I 1433
actual
algorithm
appli
asymptot
attempt
bigger
cacm
calcul
case
characterist
column
combinatori
comput
consid
consumpt
core
cut
data
design
disk
distribut
effici
effort
expens
extrem
fast
find
formula
found
function
gener
grow
improportion
increas
linear
made
magnet
mean
meant
memor
memori
model
moment
narumi
note
number
paper
pivot
probabl
problem
program
provid
put
repetit
restat
result
rise
roe
routin
search
simplif
size
support
tabl
tape
time
transfer
write
.I 1434
algorithm
applic
assign
automat
cacm
carlo
choic
class
close
cours
difficulti
effect
elimin
favorit
fill
fix
illustr
instructor
loss
macon
mont
pick
popular
privileg
problem
random
reduc
request
requir
result
retain
schedul
section
student
techniqu
walker
.I 1435
aim
analysi
applic
background
burdick
cacm
comput
consid
converg
data
design
emphasi
exist
experi
experiment
factor
industri
inform
literatur
major
motiv
multipl
naylor
paper
problem
procedur
provid
rank
respons
sampl
select
sequenti
simul
solv
specif
spectral
stochast
system
techniqu
treat
varianc
.I 1436
algorithm
block
cacm
data
fletcher
interchang
.I 1437
aird
algorithm
cacm
dual
method
mutual
primal
.I 1438
appli
april
cacm
cain
complex
comput
develop
find
function
index
jr
locat
method
number
plane
problem
wind
zero
.I 1439
accomplish
actual
anketel
approach
approxim
april
cacm
creat
curv
data
datan
defin
depend
develop
empir
engin
fit
inform
larg
major
mechan
point
portion
problem
process
programm
simonsen
sru
system
techniqu
written
.I 1440
approxim
april
cacm
calcul
facilit
fike
form
ibm
includ
interest
interv
newton
primari
rang
root
routin
squar
start
system
.I 1441
adam
advantag
amount
appli
applic
april
butcher
cacm
classic
compar
comput
determin
differenti
due
equat
error
evalu
found
function
gear
great
integr
kutta
made
method
newer
numer
nystrom
ordinari
problem
recent
requir
rung
slightli
step
studi
superior
system
time
trivial
truncat
water
.I 1442
american
april
cacm
cpi
inform
interchang
magnet
nrzi
propos
record
standard
tape
.I 1443
adjust
april
cacm
charg
common
error
estim
field
find
gener
gregori
helic
intersect
magnet
manner
measur
method
move
particl
perturb
point
reconstruct
royston
space
squar
track
trajectori
.I 1444
algol
algorithm
april
aris
cacm
electron
element
equat
formula
gener
matrix
procedur
project
reduct
reev
schroding
solut
system
variat
wavefunct
.I 1445
aid
april
cacm
calcul
chang
cincinnati
colleg
comput
conceptu
cours
curricula
engin
explor
forc
give
introductori
mathemat
matter
medicin
number
obviou
offer
pedagog
physic
pollack
possibl
report
statist
sterl
student
subject
teach
technic
understand
univers
year
.I 1446
algorithm
april
cacm
chebyshev
hopgood
litherland
quadratur
.I 1447
abscissa
april
cacm
gregori
quadratur
weight
welsch
.I 1448
abscissa
algorithm
april
cacm
quadratur
romberg
weight
welsch
.I 1449
algorithm
april
cacm
deriv
gautschi
.I 1450
algorithm
april
cacm
displac
kerner
polynomi
real
root
simpl
simultan
.I 1451
algorithm
april
cacm
integr
jr
kutta
rung
thacher
.I 1452
algorithm
april
bayer
cacm
kutta
merson
.I 1453
algebra
algol
algorithm
appli
applic
april
cacm
calcul
carr
carri
complet
comput
concern
context
describ
descript
elimin
equat
express
fortran
free
gaussian
gorn
hand
ii
iii
includ
intuit
kleen
languag
linear
machin
method
nonrecurs
notat
numer
paper
portion
previou
program
recurs
regular
result
revis
similar
simplif
smaller
specif
sublanguag
suggest
syntax
system
term
understood
wai
weiland
.I 1454
april
automat
cacm
capabl
compil
complex
complic
comput
consid
convent
creat
depot
difficulti
direct
effect
electron
eleg
engin
equip
essenti
eventu
expect
familiar
highli
idea
increas
ineleg
languag
militari
need
nonproblem
nonprogram
nonprogramm
number
orient
paper
part
personnel
power
problem
process
program
rapidli
redund
scheff
signific
simpl
skill
sourc
statement
subtl
suffic
syntax
task
test
train
unnecessarili
user
write
.I 1455
abil
accept
algorithm
base
basi
boolean
cacm
capabl
charact
compil
concept
deal
definit
describ
descript
develop
execut
extend
extens
gener
indefinit
integ
languag
march
modifi
mooer
name
packag
print
procedur
process
program
reactiv
reckon
softwar
store
string
text
time
trac
treat
typewrit
variabl
vector
write
.I 1456
action
activ
answer
aspect
associ
auxiliari
cacm
class
complex
conceptu
conclus
context
continu
core
defin
definit
dictionari
direct
east
english
exampl
experiment
extens
graph
ideal
import
inadequ
inclus
inform
input
languag
larg
lisp
list
logic
make
march
materi
mean
memori
method
passiv
possess
power
process
produc
question
refer
relat
research
result
retriev
scale
serv
simmon
simpl
storag
structur
suit
syntact
system
vehicl
word
.I 1457
advantag
aid
applic
automat
briefli
cacm
characterist
data
describ
design
examin
facil
implement
includ
inform
languag
light
linear
list
made
main
manipul
march
matric
outlin
perform
problem
procedur
process
program
represent
requir
retriev
review
salton
spars
structur
suggest
system
text
tree
varieti
.I 1458
cacm
chang
check
condit
discuss
effect
environ
facil
languag
line
made
main
make
march
note
number
onlin
paper
process
produc
program
provid
relat
schwartz
surround
system
transit
user
work
.I 1459
advanc
applic
attack
cacm
compil
develop
environ
execut
extens
field
languag
made
march
natur
object
opler
problem
program
progress
real
requir
solv
special
system
time
ultim
.I 1460
assembl
cacm
call
compil
contribut
defin
design
discuss
evolut
factor
ferguson
final
function
gener
implic
made
march
meta
present
program
.I 1461
cacm
discuss
march
oper
summari
system
.I 1462
actual
applic
basic
built
cacm
capabl
complex
comput
concept
consum
desir
divis
effici
enhanc
establish
fourth
greater
hai
handl
horizont
impli
larg
lead
level
logic
march
matter
monitor
multilevel
natur
need
newer
oper
orchard
precis
problem
proper
requir
respons
similar
softwar
standard
supervisori
system
time
top
vertic
.I 1463
address
author
cacm
characterist
clarifi
concept
concern
connect
control
data
em
embodi
employ
expand
extens
facil
final
goodro
intent
languag
leonard
level
linkag
machin
march
mechan
paper
program
provid
remark
salient
system
trace
.I 1464
addit
algol
assembl
boussard
cacm
call
chain
code
compens
compil
construct
debug
deck
eas
elabor
exce
execut
facil
featur
fortran
fulli
ibsi
includ
inform
integr
link
list
load
main
map
march
oper
option
permit
prepar
procedur
program
relat
satisfactori
system
time
total
translat
user
written
.I 1465
associ
base
cacm
clariti
clear
compil
convent
data
default
dictat
dictum
economi
effect
effici
empti
featur
fix
gener
increas
life
logic
march
mean
naur
need
option
part
preserv
problem
process
program
promot
reliabl
sound
structur
substanti
techniqu
translat
view
violat
.I 1466
cacm
discuss
graphic
languag
march
summari
.I 1467
aid
cacm
commun
definit
develop
displai
endeavor
facilit
field
function
futur
gener
graphic
greatli
interact
languag
machin
man
march
procedur
provid
robert
scope
servic
servicesystem
syntax
system
translat
variabl
varieti
.I 1468
ago
algorithm
appli
applic
author
base
bubbl
cacm
cdc
chamber
class
comput
consid
descript
direct
earlier
embed
english
explain
gener
grammar
ibm
interpret
label
larger
letter
march
mean
mention
model
narasimhan
origin
output
paper
parallel
partial
phase
pictur
process
program
propos
rewritten
scheme
simul
specif
syntax
system
techniqu
work
written
year
.I 1469
abstract
aim
appear
applic
area
bias
cacm
charact
character
choic
class
coin
comput
construct
convent
design
dictat
differ
easi
entiti
expand
express
famili
framework
function
gener
hand
import
includ
independ
instruct
intend
landin
languag
list
make
march
met
name
nonprocedur
number
part
physic
print
program
properti
pure
refer
relat
relationship
represent
rule
sacrif
side
singl
span
specif
split
string
subsystem
system
understand
unifi
unimpl
user
written
.I 1470
achiev
action
advantag
altern
author
basic
cacm
call
caus
choic
command
compar
compon
composit
conclud
context
conveni
convent
data
describ
desir
disadvantag
discuss
distract
effect
elementari
enter
entri
error
evalu
evolut
exampl
execut
explicit
explicitli
factor
form
frequent
function
gener
get
identifi
illustr
imper
implicit
implicitli
indistinguish
influenc
input
instruct
languag
link
linkag
list
major
march
mean
mechan
name
obtain
organ
perman
permit
point
princip
process
program
programm
raphael
refer
referenc
requir
routin
sai
similar
special
specif
statement
structur
subroutin
suggest
syntact
system
take
understand
variabl
wai
.I 1471
advanc
algebra
assembl
cacm
comput
contempl
debug
defin
denni
essenti
hierarch
instruct
languag
march
memori
meta
midwai
multiprogram
name
number
object
oper
parallel
perform
process
program
protect
relat
segment
semant
separ
share
sophist
structur
system
user
vanhorn
write
.I 1472
achiev
cacm
capac
case
center
comput
descript
fast
februari
high
institut
interest
job
lack
low
lynch
minut
oper
quarter
report
review
staff
system
throughput
time
turnaround
univac
univers
volum
year
.I 1473
cacm
character
close
comput
determin
differenti
digit
electron
equat
februari
form
fourth
karim
kutta
linear
mean
method
order
paper
problem
region
rung
solut
stabil
studi
system
transform
.I 1474
accumul
arithmet
assum
cacm
comput
conclud
describ
descript
discrep
effect
error
experi
februari
gener
give
good
hull
mild
model
paper
precis
probabilist
prolong
propag
purpos
rare
roundoff
sens
seri
special
statist
swenson
techniqu
test
type
valid
.I 1475
access
account
activ
applic
avoid
busi
cacm
creat
dribbl
econom
emploi
experienc
februari
head
ledger
magnet
master
number
post
process
produc
prove
random
run
sequenti
situat
small
storag
tape
techniqu
transact
updat
volumin
.I 1476
acm
american
apr
asa
ascii
associ
cacm
characterist
charg
code
comm
committe
commun
concept
control
data
decemb
describ
detail
digit
document
earlier
embodi
emploi
februari
field
form
function
gener
govern
group
inform
interchang
interconnect
intern
march
nation
oper
organ
paper
present
principl
procedur
progress
propos
receiv
report
repres
requir
respons
retain
section
standard
submit
summari
system
task
work
.I 1477
algol
cacm
definit
euler
februari
formal
gener
ii
part
weber
wirth
.I 1478
algorithm
cacm
curv
deili
exponenti
februari
fit
.I 1479
algorithm
cacm
constrain
curv
deili
exponenti
februari
fit
.I 1480
algorithm
cacm
chebyshev
coeffici
comput
februari
seri
smith
.I 1481
algorithm
cacm
februari
graph
lloyd
plotter
.I 1482
analysi
applic
author
belson
bugsi
cacm
collect
comput
concept
debug
depend
famili
februari
graph
input
jacobsen
ledlei
linear
main
measur
pictori
pictur
pointer
process
program
programm
system
type
visual
.I 1483
ad
cacm
comparison
comput
construct
featur
februari
fortran
ii
implement
item
iv
languag
made
manufactur
repres
show
shown
tabl
wright
.I 1484
addit
algol
automat
cacm
commun
comput
describ
descript
design
desir
dialect
discuss
exact
februari
function
inadequaci
introduc
languag
orient
parna
program
purpos
simul
specif
standard
start
suggest
suitabl
synchron
system
.I 1485
advantag
altern
cacm
choic
compar
compon
conclud
conveni
data
disadvantag
discuss
elementari
evalu
evolv
exampl
factor
februari
form
frequent
identifi
illustr
influenc
input
languag
link
list
major
mean
mechan
obtain
organ
paper
permit
process
program
raphael
referenc
statement
structur
suggest
system
wai
.I 1486
behavior
burg
cacm
common
descript
detect
direct
februari
help
human
intellig
item
languag
librari
machin
made
mechan
model
paper
part
pattern
problem
program
rearrang
relationship
reprogram
rule
share
solv
specul
store
system
transform
user
written
.I 1487
absenc
analyz
appear
approach
basi
cacm
capabl
choic
commun
comput
concern
conclud
context
convers
decomposit
develop
discoveri
discuss
edit
eliza
fundament
futur
gener
identif
input
issu
januari
kei
kind
languag
mac
machin
make
man
minim
mit
natur
ofnatur
oper
paper
problem
program
provis
psycholog
reassembl
relev
respons
rule
select
sentenc
share
studi
system
technic
text
time
transform
trigger
weizenbaum
word
.I 1488
advantag
algol
applic
approach
base
broad
cacm
cobol
combin
comput
condit
consid
decis
defin
develop
easili
exclus
form
fortran
implement
input
januari
method
multi
mutual
outlin
paper
present
procedur
processor
program
shown
simpl
simplifi
standard
state
statement
suggest
tabl
veinott
verb
.I 1489
abl
adequ
analyz
busi
cacm
chang
content
continu
cost
data
decis
defin
descript
detail
document
econom
fisher
inform
interact
januari
make
manag
modifi
notabl
object
prepar
process
program
provid
quickli
repres
rule
show
system
tabl
tabular
techniqu
test
time
unfamiliar
.I 1490
american
cacm
inch
inform
interchang
januari
paper
perfor
propos
standard
tape
.I 1491
adequ
algol
algorithm
block
cacm
call
class
concept
constitut
construct
correspond
decid
defin
definit
demonstr
detail
determin
develop
effect
elementari
environ
euler
evalu
execut
exert
exist
explain
fix
formal
full
gener
individu
interpret
introduc
januari
languag
mean
method
notat
obviou
paramet
pars
part
phrase
precis
procedur
program
prove
provid
reduct
relationship
rigor
rule
sequenc
set
structur
syntact
syntax
term
text
unambigu
variabl
weber
wirth
.I 1492
algorithm
cacm
januari
jr
serrev
thacher
.I 1493
algorithm
boothroyd
cacm
deriv
gener
hilbert
januari
matrix
test
.I 1494
algorithm
cacm
complet
ellipt
integr
januari
kind
larssen
.I 1495
algorithm
cacm
develop
equat
express
illustr
januari
jr
known
ln
power
revers
root
seri
solut
thacher
transcendent
.I 1496
applic
base
basi
cacm
class
compil
complet
comput
construct
develop
discuss
effici
feldman
formal
function
inform
januari
languag
larg
mean
meta
present
repres
semant
small
statement
translat
.I 1497
analysi
basic
cacm
charact
choos
condit
consid
correct
decemb
denot
divid
divis
divisor
econom
elimin
estim
found
higher
increas
known
krishnamurthi
lead
made
magnitud
method
nandi
narrow
normal
number
obtain
operand
paper
partial
possibl
precis
present
proper
provid
quotient
radic
rang
remaind
requir
round
scheme
segment
shown
singl
small
smaller
subject
suitabl
trial
true
.I 1498
alcor
algol
analysi
bayer
cacm
comput
decemb
dump
gri
illinoi
intellig
mortem
origin
paul
post
process
program
sourc
techniqu
term
unsuccess
wiehl
written
.I 1499
algorithm
boothroyd
cacm
chebyschev
curv
decemb
fit
revis
.I 1500
algorithm
boothroyd
cacm
chebyschev
curv
decemb
fit
.I 1501
algorithm
cacm
charmonman
construct
decemb
easili
eigenvalu
eigenvector
known
matric
matrix
obtain
order
smaller
.I 1502
abil
cacm
charact
content
conveni
decemb
detail
deutsch
edit
editor
emphasi
experiment
extent
facil
featur
form
handl
interact
justif
lampson
limit
maximum
notabl
onlin
oper
piec
power
program
provid
remark
search
system
test
text
theoret
user
.I 1503
alloc
basic
cacm
case
center
chang
choic
compar
comparison
comput
consider
data
decemb
decis
design
differ
dispatch
eas
event
fewer
fortran
input
introduc
iv
made
make
model
organ
passag
primari
problem
program
relat
represent
requir
revis
show
simscript
storag
studi
term
test
time
variabl
vehicl
weinert
written
.I 1504
adjac
algorithm
cacm
construct
corneil
cycl
decemb
edg
find
fundament
gotlieb
graph
larg
limit
linear
machin
matrix
method
node
number
paper
present
ratio
requir
set
slower
small
span
storag
superior
tree
undirect
welch
.I 1505
alloc
analyst
attempt
basic
cacm
collect
concept
dahm
decemb
descript
divid
exampl
express
facil
framework
gerbstadt
give
introduc
made
manag
organ
pacelli
paper
polici
present
primit
problem
processor
provid
resourc
small
solut
suggest
system
tutori
.I 1506
alloc
applic
back
brought
cacm
call
clock
complet
comput
consol
core
crt
decemb
design
develop
dialogu
drew
driven
event
execut
facil
featur
ibm
import
input
inquiri
invari
laboratori
laconiq
larg
later
mean
monitor
non
numer
onlin
output
primarili
program
reason
remot
resourc
retriev
run
schedul
segment
share
small
storag
support
system
techniqu
time
unusu
user
work
.I 1507
acqui
analysi
applic
approach
architectur
base
biolog
bodi
cacm
characterist
chosen
data
decemb
deriv
discuss
earli
encount
environ
experi
experiment
gener
implement
investig
ition
knutsen
larg
lockemann
multiprogram
object
obtain
onlin
orient
problem
research
scheme
scientif
system
.I 1508
cacm
inform
interchang
label
magnet
novemb
propos
standard
tape
usa
.I 1509
cacm
cpi
inform
interchang
magnet
novemb
nrzi
propos
record
standard
tape
usa
.I 1510
algorithm
cacm
dullei
equat
find
function
novemb
pittewai
solut
unknown
.I 1511
cacm
damp
equat
nonlinear
novemb
solv
spath
squar
sum
system
taylor
.I 1512
algorithm
brown
cacm
equat
linear
non
novemb
simultan
solut
.I 1513
algorithm
cacm
novemb
permut
robinson
.I 1514
adjust
base
bay
cacm
coeffici
deriv
distribut
evalu
expect
function
gain
inform
ing
match
maxim
novemb
omit
paramet
prior
probabl
procedur
proport
propos
retriev
separ
shumwai
statist
system
term
typic
valu
.I 1515
analysi
aris
assist
briefli
cacm
call
collect
comput
concern
data
detail
develop
discuss
execut
factual
implement
infer
larg
levien
logic
novemb
paper
present
problem
project
purpos
rand
relat
retriev
system
.I 1516
accomplish
anpak
automat
basi
bodi
cacm
card
compon
compress
compressor
comput
data
decod
demain
discuss
essenti
extern
fulli
greatli
increas
inform
iopak
item
make
marron
minimum
note
novemb
numer
nupak
paper
part
rapid
rate
recent
reduc
requir
separ
slow
specif
storag
store
system
tape
task
transmiss
year
.I 1517
activ
address
adopt
alloc
analysi
analyz
cacm
channel
chosen
come
compar
comparison
comput
cost
data
differ
directli
econom
evalu
expect
experi
experiment
express
firm
gener
homogen
hypothet
identifi
illustr
incorpor
input
market
maxim
method
model
multipl
multist
naylor
novemb
object
oper
paper
period
plan
posit
possibl
problem
product
profit
quantifi
queue
rank
repres
result
seek
select
simul
singl
strategi
subject
system
techniqu
test
total
turn
wertz
wonnacott
.I 1518
applic
auxiliari
cacm
comput
consist
creat
describ
eas
environ
experiment
formid
gener
hardwar
job
katz
macroscop
measur
mechan
model
modern
novemb
paper
perform
predict
problem
process
produc
program
properti
queue
relat
report
simscript
simul
softwar
statement
statist
system
techniqu
throughput
time
turnaround
util
.I 1519
adjust
atla
background
bailei
batch
cacm
command
common
configur
consol
ctss
depend
devic
geco
gener
georg
handl
ibsi
includ
independ
instal
job
languag
larg
line
mode
multiaccess
multic
multilevel
novemb
number
oestreich
onlin
oper
orient
process
purpos
resembl
run
schedul
share
simultan
store
strauss
supervisor
system
time
user
varieti
wide
.I 1520
absolut
algorithm
cacm
complex
friedland
number
octob
root
squar
.I 1521
algorithm
bratlei
cacm
dimension
gener
mckai
multi
octob
partit
.I 1522
algorithm
cacm
chebyschev
hillstrom
octob
quadratur
.I 1523
approxim
attempt
base
batch
bound
cacm
cdc
code
compil
convers
edit
embed
execut
extens
facil
fortran
gener
harrison
implement
input
machin
made
major
man
manipul
memori
octob
page
process
provid
purpos
reentrant
regist
reloc
scheme
schwartz
segment
share
sharer
simpl
simul
standard
system
time
written
year
.I 1524
accept
adam
adequ
algorithm
approxim
basi
bound
cacm
calcul
complex
criterion
difficult
error
evalu
exampl
find
found
gener
iter
know
mean
number
numer
occur
octob
paper
polynomi
present
process
real
root
roundoff
satisfactori
search
serv
stop
termin
test
.I 1525
accur
algorithm
alloc
amount
arithmet
briefli
cacm
complex
comput
consid
coolei
core
differ
digit
equat
exce
factor
fast
fix
fourier
function
improv
larg
log
major
maximum
memori
method
mix
need
octob
paper
plan
point
power
problem
proport
propos
radix
review
save
scale
shown
singleton
size
solut
storag
system
time
transform
trigonometr
tukei
valu
virtual
word
.I 1526
analysi
analyz
aris
averag
cacm
calcul
characterist
comput
cpu
demand
develop
effect
environ
gaug
hardwar
interact
measur
model
modif
multiprogram
octob
page
paramet
perform
predict
program
propos
readili
share
smith
statist
strategi
system
time
typic
usag
user
.I 1527
answer
automat
base
cacm
case
class
correctli
data
decid
devic
drawn
evalu
exclus
exhaust
explicitli
express
fulli
function
gener
grammar
grammat
implicitli
inform
languag
make
natur
normal
octob
paper
pose
procedur
question
reason
recogn
recognit
repres
request
retriev
rosenbaum
rule
segment
sentenc
set
situat
sort
store
subject
succe
term
ungrammat
.I 1528
basic
cacm
case
cathod
comput
concern
contribut
descript
design
detail
drawn
easili
entir
font
form
gener
greek
includ
letter
lochbaum
lower
mathemat
mathew
moss
number
octob
paper
princip
rai
roman
shape
sign
tube
upper
varieti
vector
.I 1529
absolut
algorithm
analysi
analyz
bell
blend
cacm
compar
cours
decomposit
discov
dual
matrix
octob
order
perform
petroleum
primal
problem
program
rel
relev
simplex
solut
standard
substructur
.I 1530
allow
atla
brown
built
cacm
call
choos
complet
comput
eas
exist
extend
form
gener
implement
incorpor
intend
languag
macro
ml
notat
octob
orient
pdp
processor
program
purpos
rel
statement
syntact
tool
user
.I 1531
algol
ambigu
cacm
knuth
languag
list
notic
octob
paper
public
remain
report
revis
spot
troubl
.I 1532
cacm
complementar
hardwar
octob
oetting
softwar
.I 1533
actual
agre
aid
applic
assumpt
cacm
compil
comput
data
discuss
effect
estim
execut
extens
folei
made
marovian
mathemat
michigan
model
paramet
postul
predict
reason
result
septemb
simplifi
studi
system
univers
.I 1534
allow
assess
austin
back
base
buffer
cacm
consol
control
convent
dad
data
decis
design
detail
develop
displai
drum
environ
execut
figur
found
holden
hudson
implement
input
integr
intend
job
larg
made
month
normal
oper
output
perform
peripher
remot
rest
septemb
slow
stack
store
subsystem
system
tabul
techniqu
valid
work
.I 1535
advanc
alloc
appli
base
cacm
comment
configur
construct
determin
diagram
enumer
futur
independ
index
known
line
link
load
luccio
occurr
optim
portion
present
procedur
program
reduc
regist
requir
separ
septemb
show
step
straight
subdivid
techniqu
.I 1536
addit
arithmet
bear
cacm
compil
complex
comput
conveni
declar
deriv
dynam
evalu
explicit
formula
function
gener
implement
lesk
linkag
need
parallel
part
proce
program
real
septemb
shown
simpl
subroutin
subtract
techniqu
valu
variabl
wengert
.I 1537
algorithm
cacm
chartr
gener
number
prime
septemb
.I 1538
algorithm
cacm
chartr
gener
number
prime
septemb
.I 1539
algorithm
cacm
chartr
gener
number
prime
septemb
.I 1540
algorithm
assign
balanc
busam
cacm
carlo
class
compar
consist
cours
fix
give
honor
mont
natur
nonprefer
object
prefer
result
schedul
section
septemb
stochast
student
time
.I 1541
abil
aspect
cacm
concept
dynam
essenti
experiment
extend
facilit
featur
gener
highli
interact
krasnow
languag
mean
model
natur
object
parent
present
process
repres
role
septemb
simul
studi
system
.I 1542
algorithm
cacm
code
compil
comput
consist
content
control
dimens
effici
euler
execut
exist
experiment
hardwar
higher
ibm
implement
interpret
languag
level
machin
main
match
microprogram
model
obtain
open
perform
process
program
read
requir
result
role
septemb
space
storag
stress
string
structur
system
term
unit
weber
written
.I 1543
advantag
algebra
applic
area
assist
cacm
calculu
capabl
coeffici
comput
coordin
curvilinear
cylindr
data
demonstr
deriv
design
devis
differenti
digit
emploi
equat
extend
facilit
formul
gener
good
howard
human
illustr
involv
languag
manipul
mass
mathemat
mean
method
motion
need
non
notat
numer
oper
order
orthogon
particip
point
polar
preced
prepar
present
problem
process
program
prolat
purpos
reduc
request
result
septemb
serv
spheric
spheroid
stage
symbol
system
techniqu
tensor
term
type
user
work
.I 1544
access
alphanumer
ambigu
audio
batch
cacm
compat
comput
conjunct
context
conwai
cupl
devic
directli
element
elimin
emploi
exist
extens
gener
high
inform
kei
keyboard
locat
morgan
numer
output
print
process
program
provid
purpos
remot
scanner
scheme
septemb
share
signific
singl
speed
stroke
system
tele
telephon
termin
time
transmiss
transmit
twelv
.I 1545
cacm
comput
insur
legal
privaci
safeguard
septemb
societi
westin
.I 1546
august
bemer
cacm
handwritten
standard
.I 1547
algorithm
arbitrari
august
cacm
filho
function
gamma
precis
schwachheim
.I 1548
accomplish
august
cacm
chapin
consid
context
convent
data
decis
hardwar
horizont
ident
job
linkag
paper
pars
prioriti
reduct
regard
relationship
rest
size
structur
tabl
techniqu
vertic
.I 1549
advantag
algorithm
appear
applic
august
cacm
collect
compar
degre
effici
essenti
final
free
garbag
implement
independ
insur
languag
list
literatur
machin
method
number
offer
paper
part
past
present
problem
procedur
process
recoveri
regist
return
review
routin
schorr
signific
solut
speed
storag
structur
system
util
wait
written
.I 1550
august
batch
cacm
center
compar
comparison
complet
comput
convent
cours
debug
effect
effort
elaps
evid
examin
fact
hour
influenc
instant
introductori
item
keypunch
minut
number
oppos
prepar
present
problem
process
program
result
run
smith
student
studi
support
time
trip
turnaround
.I 1551
accumul
algorithm
arithmet
august
cacm
case
code
compil
comput
concern
deal
express
fortran
frequenc
gener
hitac
iv
minim
nakata
object
paper
partial
recov
result
store
.I 1552
a
access
alloc
allow
august
block
cacm
chang
characterist
collect
compil
control
data
detail
dynam
effici
elabor
fine
flexibl
free
function
fundament
garbag
handl
hierarchi
high
intern
involv
level
model
obtain
packag
partit
perform
physic
problem
provis
reus
ross
routin
select
share
shatter
size
softwar
sophist
space
special
storag
structur
system
total
underli
zone
.I 1553
absolut
achiev
adequaci
argu
august
cacm
capabl
comput
context
contextu
convers
depend
develop
discuss
eliza
human
import
imposs
languag
level
machin
natur
part
program
purpos
stress
understand
weizenbaum
.I 1554
appli
august
automat
cacm
comput
digit
dimens
dimension
direct
displai
experi
extens
fourth
gener
hyperobject
hypersurfac
insight
motion
movi
noll
observ
obtain
parallel
perspect
plotter
profound
project
rotat
space
spatial
stereoscop
techniqu
.I 1555
algorithm
bratlei
cacm
juli
mckai
polynomi
symmetr
.I 1556
algorithm
bratlei
cacm
juli
permut
repetit
.I 1557
algorithm
cacm
charact
group
juli
mckai
symmetr
.I 1558
algorithm
cacm
gener
juli
lexicograph
ord
order
permut
pseudo
smith
.I 1559
algorithm
cacm
gener
juli
lexicograph
ord
order
permut
smith
.I 1560
algorithm
cacm
juli
problem
sim
transport
.I 1561
algorithm
cacm
dual
juli
method
mutual
primal
spath
.I 1562
airi
algorithm
cacm
function
juli
pittewai
.I 1563
cacm
find
graph
hamilton
juli
justif
knight
method
path
pohl
problem
theoret
warnsdorff
.I 1564
algorithm
analyz
attempt
basic
cacm
callahan
chapman
cobol
code
condit
contain
convers
core
decis
descript
detab
develop
elimin
extens
form
gener
index
juli
languag
line
modular
obvious
optim
output
portion
preprocessor
produc
queue
requir
save
simpl
statement
storag
tabl
techniqu
test
time
unnecessari
user
written
.I 1565
abil
arbitrari
argument
australia
basser
cacm
compil
comput
depart
facil
featur
independ
juli
languag
macro
make
process
processor
program
sourc
string
sydnei
text
transform
univers
wait
.I 1566
approxim
basic
cacm
calcul
comput
consid
convention
digit
juli
moursund
newton
obtain
optim
polynomi
problem
prove
provid
raphson
result
shown
sqrt
start
state
tabl
uniform
valu
.I 1567
aaron
approach
booker
cacm
determin
earlier
gener
graeff
group
insight
juli
lend
light
mckai
polynomi
previous
publish
relat
represent
root
suggest
symmetr
techniqu
theori
unifi
work
.I 1568
ad
approxim
cacm
construct
contour
convent
develop
function
independ
juli
map
method
nearbi
plot
read
repres
scale
similar
stineman
valu
variabl
vectori
.I 1569
cacm
context
free
grammar
implement
irwin
juli
method
notat
parallel
phrase
pl
procedur
product
statement
structur
.I 1570
alter
basi
block
cacm
consid
conveni
creation
data
demonstr
discuss
effect
evalu
examin
ibm
implement
intern
juli
languag
link
madnick
oper
organ
page
present
process
programm
requir
singl
snobol
speed
storag
string
structur
system
techniqu
word
.I 1571
abil
accumul
addit
advanc
anticip
attempt
betyar
biolog
brain
cacm
complex
comput
data
design
determin
digit
direct
directli
exist
experi
fashion
highli
institut
interact
interfac
juli
laboratori
onlin
orient
paramet
plan
present
process
provid
repres
research
scientist
share
signific
simpl
sophist
system
time
ucla
user
worker
.I 1572
adjust
algorithm
analysi
applic
assist
cacm
center
characterist
compat
compil
comprehens
comput
configur
demonstr
design
develop
effici
fortran
gener
greater
guid
hardwar
ibm
implement
intuit
investig
iv
juli
larg
limit
made
manag
manner
model
nielsen
number
paper
perform
problem
purpos
question
rais
respond
result
sake
scale
share
simul
softwar
studi
subset
suggest
system
techniqu
time
unfortun
varieti
.I 1573
adapt
algorithm
cacm
gallah
june
panel
procedur
quadratur
random
size
.I 1574
algorithm
cacm
curv
hill
integr
joyc
june
normal
.I 1575
algorithm
beta
cacm
hill
incomplet
june
pike
ratio
.I 1576
algorithm
cacm
eigenvalu
june
matrix
method
qr
real
symmetr
welsch
.I 1577
algorithm
cacm
eigenvalu
eigenvector
june
matrix
method
qr
real
symmetr
welsch
.I 1578
algorithm
cacm
fit
gener
june
makinson
orthogon
polynomi
squar
.I 1579
algorithm
cacm
erf
error
function
hill
joyc
june
real
.I 1580
algorithm
cacm
error
function
hill
joyc
june
larg
.I 1581
algorithm
cacm
complementari
error
function
hill
joyc
june
larg
.I 1582
algorithm
cacm
gauss
hill
joyc
june
.I 1583
algorithm
cacm
distribut
function
hill
joyc
june
normal
.I 1584
algorithm
cacm
distribut
function
hill
joyc
june
normal
procedur
.I 1585
algorithm
cacm
curv
hill
integr
joyc
june
normal
.I 1586
algorithm
bairstow
cacm
case
combin
converg
deriv
gener
golub
june
linear
method
polynomi
properti
recurs
robertson
satisfi
term
.I 1587
abramowich
alloc
applic
apport
cacm
case
chosen
consid
consider
continu
core
data
estim
import
input
item
iter
june
machin
made
method
need
occur
output
overflow
process
reloc
requir
simplif
space
special
storag
tabl
time
.I 1588
addit
basic
cacm
complet
complex
concept
data
deal
detail
directli
discuss
elimin
exampl
extens
facil
inabl
introduc
jr
june
languag
lawson
list
oper
organ
perform
philosophi
pl
problem
procedur
process
program
provid
rang
simpl
structur
suffer
write
.I 1589
aid
algebra
basi
basic
cacm
cameron
casual
charact
comput
consol
control
convers
copi
correct
daili
declar
devic
dialog
dimens
displai
ew
experi
facil
februari
graphic
growth
hard
iit
input
institut
instruct
interact
june
keyboard
languag
line
liveright
minimum
numer
onlin
oper
orient
output
overlai
prepar
present
prevent
processor
program
programm
requir
research
restrict
result
situat
statement
storag
syntact
system
type
user
variabl
.I 1590
analog
attach
band
cacm
candid
compress
comput
convert
correct
correctli
defin
detect
determin
digit
distort
error
ibm
interconnect
june
level
list
manner
marker
microphon
nois
normal
oper
pdp
peak
percent
period
phase
pitch
point
procedur
real
recogn
recognit
record
reddi
room
sampl
select
sequenc
sound
speech
structur
system
time
utter
valid
wave
waveform
.I 1591
abac
academ
addit
advantag
assembl
cacm
cathod
compil
comput
consid
control
cours
debug
degre
discuss
displai
dispos
educ
engvold
execut
exercis
flexibl
full
function
game
graphic
hugh
ibm
ibsi
ii
implic
includ
incorpor
industri
interleav
june
languag
larg
leav
librari
materi
mode
model
multifunct
oper
order
present
problem
process
processor
program
programm
provid
rai
readili
recov
reschedul
resourc
resum
run
simul
solv
student
studi
switch
system
teach
termin
text
train
transfer
type
user
write
written
.I 1592
alberga
algorithm
author
cacm
charact
clearli
collect
comput
consid
determin
evalu
gave
grade
incorrect
june
level
made
method
misspel
numberof
percent
problem
program
propos
similar
string
student
techniqu
test
unsatisfactori
word
writer
.I 1593
arithmet
cacm
charact
digit
direct
divis
divisor
econom
equal
gilman
half
harvard
iter
june
krishnamurthi
lead
method
nandi
need
number
oper
radix
similar
simpl
suitabl
techniqu
uniti
variant
.I 1594
abcd
addit
algorithm
applic
cacm
circular
constant
continu
element
gener
index
initi
jr
langdon
lowest
manner
need
object
obtain
order
permut
previous
repeat
rotat
start
success
temporari
yield
.I 1595
algorithm
applic
area
cacm
chronolog
combinator
comput
computation
consid
continu
earli
enumer
error
establish
evan
finit
form
fundament
harari
induc
interest
lead
literatur
lynn
number
point
problem
repres
result
set
side
theoret
topolog
underscor
unearth
us
work
.I 1596
airi
algorithm
bond
cacm
function
pittewai
.I 1597
algorithm
arrai
boothroyd
cacm
store
transpos
vector
.I 1598
algorithm
cacm
fit
makinson
orthogon
polynomi
squar
.I 1599
algorithm
cacm
equat
kohfeld
numer
polynomi
solut
.I 1600
algorithm
cacm
chebyshev
hillstrom
quadratur
.I 1601
algorithm
approxim
cacm
classic
computation
converg
develop
environ
equat
ever
extract
famili
independ
insur
interest
interpret
iter
make
measur
method
numer
obtain
parallel
procedur
process
provid
question
report
root
shedler
singl
solut
stage
standard
statist
superior
techniqu
.I 1602
actual
algol
autom
cacm
cleric
comput
concern
conjunct
departur
describ
detail
differenti
difficult
drastic
equat
essenti
form
formula
fortran
instruct
intricaci
knowledg
languag
logic
method
need
numer
oper
pose
problem
program
programm
provid
represent
requir
sashkin
schlesing
solut
solv
subroutin
subset
translat
type
user
util
vi
.I 1603
addit
buffer
cacm
call
capabl
combin
commun
consist
control
design
detail
devic
element
graphic
hardwar
hornbuckl
input
instruct
int
interfac
interv
keyboard
languag
machin
meta
monitor
multiprogram
output
parallel
process
program
provid
real
reliev
schedul
set
simpl
small
softwar
subroutin
task
time
timer
uniform
user
varieti
wide
.I 1604
accord
analysi
cacm
center
characterist
comput
condit
data
distribut
empir
environ
execut
interest
interpret
job
length
load
measur
obtain
present
process
program
properti
result
select
servic
statist
studi
subdivid
system
term
time
univers
user
wallac
walter
.I 1605
analysi
assign
batch
cacm
characterist
compar
comparison
compat
comput
consid
critiqu
ctss
data
definit
design
develop
differ
due
effect
elaps
elimin
emploi
estim
evid
experi
experiment
extern
factor
group
ibm
ibsi
ident
implic
import
influenc
mean
mit
obtain
problem
process
program
programm
provid
result
schatzoff
sequenc
set
share
solut
statist
strong
subject
system
techniqu
time
tsao
variabl
varianc
wiig
.I 1606
algorithm
april
cacm
chi
hill
integr
pike
squar
.I 1607
algorithm
april
cacm
coulomb
function
gunn
wave
.I 1608
accur
accuraci
advantag
april
automat
bad
cacm
carri
common
compar
comput
converg
depend
discuss
diverg
easi
eisner
explicit
fit
formula
function
inaccur
integr
kind
known
method
need
numer
occur
order
overwhelm
pole
polynomi
posit
rang
shown
simpson
singular
.I 1609
acton
algorithm
approach
approxim
april
cacm
carri
comput
constraint
cours
encourag
examin
expenditur
expens
experi
experiment
feasibl
found
group
hall
ideal
includ
jr
known
minim
minimum
multipl
nonminim
number
obtain
occurr
outlin
period
present
principl
problem
procedur
prohibit
remov
requir
result
satisfi
schedul
select
simultan
small
step
student
take
techniqu
time
univers
wai
worthwhil
yield
.I 1610
applic
april
cacm
classic
classif
column
comput
cost
detail
dwyer
effici
fast
galler
implement
indict
matric
matrix
method
personnel
present
problem
show
solut
tall
transport
work
.I 1611
algorithm
alloc
analysi
april
basic
cacm
concept
critic
detect
develop
error
featur
incorpor
klein
multi
network
path
project
proprietari
ramp
resourc
schedul
system
terminolog
.I 1612
algorithm
april
arithmet
bottom
brooker
cacm
complic
concern
connect
deal
defin
effici
elimin
essenti
express
grammar
instanc
languag
method
note
occupi
pars
path
practic
product
program
rearrang
rehabilit
retrac
shown
spars
structur
suitabl
syntact
top
unprofit
weak
.I 1613
advantag
algorithm
analysi
april
arithmet
assumpt
cacm
call
code
compil
degre
evalu
express
high
inadequ
input
known
multipl
object
oper
parallel
pass
present
processor
produc
requir
serial
stone
structur
take
techniqu
text
unit
variant
.I 1614
ad
algol
april
behavior
block
cacm
complex
context
data
defin
definit
elimin
exampl
exist
extens
featur
fix
galler
head
integr
iter
languag
list
manipul
matric
number
occur
oper
part
perli
process
program
propos
real
redefin
set
storag
temporari
termin
text
type
unnecessari
.I 1615
accur
accuraci
algorithm
cacm
comput
diagram
digit
draw
drawn
faster
fornaro
gener
imposs
krall
lag
locu
march
obtain
ordinari
root
speed
techniqu
time
.I 1616
acm
appendix
basic
cacm
calcul
calculu
capabl
chrisoffel
comm
comput
coordin
dec
discuss
formac
intend
interest
list
main
march
orthogon
output
paper
program
quantiti
symbol
system
tensor
text
walton
.I 1617
algorithm
boothroyd
cacm
eigenvalu
eigenvector
march
symmetr
system
.I 1618
algorithm
cacm
definit
determin
march
matrix
posit
root
spath
squar
.I 1619
algorithm
cacm
comput
concept
costli
discuss
error
free
gener
machin
march
mention
method
neeli
paper
present
rodden
simpl
statist
time
.I 1620
approxim
cacm
commonli
degre
develop
difficulti
error
evalu
fewer
found
function
illustr
low
march
method
multipl
nest
polynomi
practic
prefer
recent
requir
round
routin
satisfactori
year
.I 1621
aid
algol
applic
cacm
comput
computer
consider
control
correct
document
expert
guarante
hardwar
introduc
lai
machin
made
march
method
plan
point
power
program
proofread
publish
refer
represent
scienc
spend
sydow
technolog
time
translat
typeset
typograph
valuabl
work
.I 1622
algorithm
cacm
close
connect
constraint
detect
effici
feedback
form
gener
ibm
iter
languag
march
member
multidimension
network
procedur
program
routin
run
satisfi
set
subset
successfulli
wait
wisp
.I 1623
actual
analysi
applic
area
cacm
circuit
circumv
command
concern
elabor
engin
extens
fail
fairli
formac
gener
hand
interest
involv
languag
larg
made
march
mathemat
method
neidleman
nonlinear
notabl
order
paper
part
practic
problem
program
reader
sens
shortcom
solut
solv
state
straightforward
system
techniqu
tri
trick
unten
util
.I 1624
accomplish
algorithm
arrai
automat
cacm
declar
dimens
exampl
explicit
klerer
march
need
reserv
storag
.I 1625
accept
algol
appli
automat
base
cacm
call
clark
discuss
encount
equival
execut
faster
form
implement
improv
jovial
knowledg
languag
level
march
method
obtain
origin
output
problem
processor
program
shorter
simplif
sourc
suggest
suppos
sure
type
understand
written
.I 1626
address
algorithm
alloc
allow
arithmet
bind
bobrow
build
cacm
care
compat
compil
complet
core
data
declar
determin
devic
drum
environ
good
ideal
includ
interpret
level
linear
lisp
list
low
march
medium
memori
murphi
number
paper
penalti
princip
process
program
reason
scheme
segment
slow
special
storag
structur
surprisingli
system
techniqu
time
type
util
variabl
virtual
.I 1627
applic
cacm
call
capac
chang
comput
concept
data
devic
discuss
econom
effici
inform
introduc
larg
level
manag
march
mclean
mean
morenoff
multilevel
organ
physic
present
requir
retriev
satisfi
storag
store
system
techniqu
.I 1628
activ
background
cacm
carri
characterist
clear
comput
deal
defin
distinct
econom
educ
emerg
enorm
evolv
examin
express
field
great
issu
march
mean
opinion
orden
paper
part
peopl
profess
profession
program
scope
social
varieti
.I 1629
announc
avail
biostatist
cacm
charact
compil
criteria
design
detail
eas
exist
februari
flexibl
fortran
henschk
ii
input
major
medium
modif
output
pack
packag
program
shannon
size
small
stat
statist
word
.I 1630
advantag
boundari
cacm
center
compar
comput
determin
encod
februari
insid
maxim
neighborhood
oper
perform
pfaltz
planar
point
radii
regard
region
repeatedli
repres
represent
requir
rosenfeld
set
skeleton
sort
storag
theoret
union
.I 1631
appli
cacm
comput
februari
gener
gorenstein
gpss
number
present
produc
purpos
random
recommend
result
satisfactori
simul
statist
subject
suitabl
system
test
.I 1632
accomplish
analysi
briefli
cacm
carmer
complet
degre
demonstr
design
eas
effect
experi
factori
februari
fortran
freedom
handl
hierarch
ibm
ii
interact
languag
main
mention
method
modif
obtain
orthogon
partit
pool
present
procedur
program
replic
segment
singl
squar
sum
tabular
total
varianc
.I 1633
approxim
assum
cacm
condit
converg
cubic
discuss
ehrlich
februari
method
modifi
newton
polynomi
root
shown
simpl
variat
.I 1634
accur
accuraci
bit
cacm
compact
conclud
decim
defin
digit
februari
final
float
gener
give
goldberg
import
inequ
like
need
number
point
practic
repres
represent
show
signific
.I 1635
bound
byrn
cacm
choic
error
februari
fourth
free
involv
kutta
method
minimum
note
object
order
paramet
part
point
present
princip
pseudo
rung
term
truncat
.I 1636
area
aris
atmospher
belman
boundari
cacm
complic
control
differenti
divers
encount
equat
experi
februari
frequent
greatli
guidanc
imbed
instabl
integr
invari
kagiwada
kalaba
linear
numer
optim
ordinari
overcom
planetari
point
present
problem
radi
result
solut
system
techniqu
transfer
unstabl
.I 1637
analog
analysi
appli
autocorrel
cacm
comparison
continu
data
differ
estim
expand
experi
februari
fishman
gener
independ
interest
larg
length
mean
measur
need
observ
possibl
problem
process
quantiti
record
relat
research
result
sampl
seri
shown
simul
spectral
spectrum
stabil
statist
suggest
test
time
varianc
.I 1638
accord
approach
assumpt
base
begin
cacm
cell
conjectur
degre
determin
deviat
due
element
error
expect
februari
finit
formula
friend
gasner
increas
infin
infinit
item
length
mathemat
mean
memori
number
obtain
polynomi
proof
prove
rapidli
recurs
replac
result
select
sequenc
shown
sort
standard
th
time
.I 1639
algorithm
cacm
curv
exponenti
februari
fit
spath
.I 1640
algorithm
cacm
februari
fit
gener
makinson
orthogon
polynomi
squar
.I 1641
access
actual
addit
algol
applic
back
cacm
call
cohen
complet
compos
comput
connect
consist
core
data
depend
disk
divid
drum
embed
fast
februari
fold
gain
happen
ibm
implement
inact
increas
languag
leav
level
lisp
list
longest
machin
memori
nonhomogen
number
page
perform
period
permit
price
process
program
reduc
reduct
request
scheme
slow
slower
space
store
structur
substanti
test
time
transfer
util
vari
word
.I 1642
attract
cacm
central
comput
depend
fast
februari
fisher
fit
larger
level
main
make
mean
memori
monitor
present
program
secondari
share
shepard
slower
small
storag
techniqu
time
user
.I 1643
accept
accuraci
ascend
bingham
cacm
calcul
choos
criterion
crossov
descend
divid
divis
error
factor
find
improv
increas
iter
januari
method
minim
order
point
polynomi
power
requir
shown
simpli
time
variabl
zero
.I 1644
accumul
adjust
approxim
cacm
comput
constant
digit
error
goldberg
ing
januari
make
method
polynomi
round
simpl
squar
term
true
.I 1645
approxim
argument
cacm
codi
coeffici
commonli
comput
continu
converg
desir
discuss
error
exponenti
fraction
function
gaussian
interv
januari
lead
ln
method
minimax
neg
note
posit
properti
ralston
ration
reciproc
result
retain
superior
time
valu
.I 1646
aid
approach
asa
attent
basic
cacm
capabl
check
compil
design
diagnost
discuss
ditran
emphas
emploi
error
execut
extens
featur
fortran
gener
handl
implement
improv
instructor
januari
macro
messag
met
moulton
muller
need
note
object
program
provid
special
teach
techniqu
time
.I 1647
achiev
advantag
alik
attract
batch
cacm
compat
compil
core
diagnost
effici
error
execut
extens
featur
fortran
german
ibm
implement
iv
januari
languag
larg
learn
learner
load
make
maximum
mitchel
oper
order
overhead
phase
princip
process
program
resid
run
select
shantz
sourc
speed
statement
system
translat
univers
user
virtual
waterloo
watfor
.I 1648
algorithm
cacm
januari
random
strome
uniform
.I 1649
cacm
compil
data
dimens
direct
discov
discuss
featur
flexibl
fortran
gener
greater
hassitt
hollerith
illustr
implement
incorpor
inform
input
iv
januari
locat
manipul
matrix
mean
method
mode
name
namelist
output
purpos
relat
routin
similar
simplic
standard
statement
variabl
.I 1650
advantag
analys
analysi
cacm
calcul
combin
complet
comput
cooper
data
degre
discuss
effect
elucid
exclud
expect
experi
factor
factori
freedom
interact
januari
leav
level
main
mean
method
obviou
omit
order
partit
perform
polynomi
previous
program
purpos
rearrang
replic
requir
separ
simultan
space
squar
standard
sum
total
unequ
unifi
varianc
variant
varieti
.I 1651
aid
aigner
appear
articl
benefit
bulk
cacm
code
column
comment
constraint
data
deck
deriv
descript
devic
doubtless
editori
effici
evalu
exactli
exampl
fix
flowchart
format
gener
greatli
handl
identif
inabl
includ
inher
input
interpret
januari
keypunch
larg
liber
limit
linear
lp
output
pedagog
prepar
present
problem
program
requir
routin
row
scan
simplifi
skeleton
small
solut
solv
subscript
subsequ
suit
system
textbook
user
wise
write
.I 1652
aid
alphabet
applic
area
basi
basic
binari
bit
cacm
call
channel
charact
classif
code
comput
construct
control
deriv
design
direct
distinguish
document
easili
edit
environ
escap
expand
includ
inform
intern
interpret
ipc
januari
link
local
maxim
mclean
morenoff
non
number
numer
onlin
oper
organ
problem
process
rate
requir
respect
retriev
set
simpl
simplifi
size
special
specif
subset
suitabl
symbol
system
teach
text
transfer
unassign
usabl
user
.I 1653
amount
analysi
apprais
approach
appropri
art
avail
cacm
calingaert
central
cpu
defin
develop
discuss
encount
evalu
examin
explor
fundament
goal
greater
inform
instruct
januari
kernel
level
measur
method
mix
overhead
perform
perspect
pitfal
present
problem
requir
review
role
simul
speed
state
success
survei
synthesi
system
throughput
tool
turnaround
.I 1654
achiev
american
appendic
assert
cacm
comput
contemporari
defin
depart
educ
examin
forsyth
includ
januari
north
object
ph
power
program
qualifi
review
scienc
stanford
state
syllab
univers
wai
.I 1655
cacm
code
decemb
extens
inform
interchang
procedur
propos
standard
usa
.I 1656
cacm
decemb
procedur
process
propos
standard
usa
.I 1657
act
cacm
decemb
execut
featur
harrison
implement
improv
mechan
memori
part
program
protect
share
sharer
simpl
suboper
system
time
version
.I 1658
algorithm
amount
analysi
cacm
cain
compar
comput
concern
decemb
examin
exist
experi
gue
hope
intermedi
liggett
machin
paper
problem
program
provid
reason
requir
review
size
small
solv
storag
summar
test
time
variabl
.I 1659
append
area
basic
bibliographi
cacm
classif
comput
contain
cours
curriculum
decemb
kuno
linguist
oetting
ph
present
program
recommend
report
scienc
subject
ten
.I 1660
algorithm
cacm
decemb
index
subject
.I 1661
algorithm
cacm
decemb
kolbig
multint
.I 1662
brebner
cacm
decemb
eigenvalu
eigenvector
gener
grad
matrix
real
.I 1663
cacm
decemb
distribut
gener
number
poisson
random
satisfi
snow
.I 1664
algorithm
cacm
cartesian
comput
consider
continu
coordin
curvilinear
cylindr
decemb
demonstr
deriv
detail
digit
effect
emphasi
equat
fluid
howard
input
interest
know
manipul
mathemat
method
methodolog
motion
navier
need
obtain
orthogon
paper
physic
polar
present
program
rel
relat
request
result
spheric
stoke
suppli
symbol
system
tashjian
techniqu
theoret
transform
triad
user
.I 1665
a
accept
accomplish
acklei
action
advantag
allow
analyz
applic
area
articl
automat
automata
backup
base
block
cacm
carefulli
charact
code
combin
compar
complet
condit
consider
conveni
correspond
count
dealt
decemb
decis
defin
descript
design
detect
develop
easi
effici
elimin
emploi
error
evalu
event
express
fast
favor
finit
gener
goal
hand
identifi
import
independ
input
item
johnson
languag
lexic
machin
mad
make
mechan
multicharact
natur
nearli
number
oper
order
output
part
pointer
porter
practic
process
processor
produc
program
rang
read
regular
reread
ross
rword
sequenc
speed
state
storag
string
subset
substitut
system
task
techniqu
term
theori
transit
tutori
uniqu
word
.I 1666
algorithm
byrn
cacm
enumer
implicit
linear
novemb
program
proll
solut
variabl
.I 1667
algorithm
cacm
noltemei
novemb
polynomi
result
root
routin
squar
.I 1668
algol
algorithm
arbitrari
cacm
factor
fast
fourier
novemb
procedur
singleton
transform
.I 1669
algol
algorithm
cacm
fast
fourier
novemb
procedur
singleton
transform
.I 1670
bit
cacm
code
comput
correspond
environ
hollerith
novemb
standard
tutori
usasi
.I 1671
allevi
appli
applic
area
bbn
borrow
bundl
cacm
capabl
chomski
command
comput
construct
control
data
defin
definit
design
detail
direct
distinct
easi
effect
embed
english
evalu
execut
facil
fashion
featur
flip
format
framework
fraser
grammat
hall
implement
interact
line
linguist
lisp
list
made
novemb
pattern
permit
phonem
phonolog
present
problem
processor
provid
result
rule
scientif
set
sophist
sound
statabl
store
string
structur
system
test
tester
translat
user
written
.I 1672
analyt
bound
cacm
coeffici
error
function
integr
novemb
paramet
period
practic
rabinowitz
rang
rule
tabul
theoret
trapezoid
valu
.I 1673
appli
approxim
boundari
cacm
demonstr
eas
equat
exampl
greenspan
illustr
initi
linear
method
mildli
nonlinear
novemb
offer
problem
propos
solut
techniqu
treatment
wave
.I 1674
advantag
aim
avoid
brai
cacm
combin
composit
congruenti
consid
conveni
directli
discuss
experi
fortran
gener
incorpor
instruct
librari
line
linkag
marsaglia
mean
method
mix
novemb
number
potenti
program
properti
provid
random
requir
short
simpl
singl
speed
statist
subroutin
versatil
wish
.I 1675
applic
cacm
effect
estim
examin
factor
improv
ineffectu
iter
korfhag
note
novemb
paper
procedur
relev
scale
shown
time
.I 1676
acquir
augment
cacm
call
cohes
compil
comput
confront
depend
develop
discuss
extens
fortran
frequent
heavili
high
ii
iii
independ
intern
isol
languag
level
loop
lrltran
machin
maintain
make
martin
mendicino
minim
notat
novemb
number
occur
optim
organ
pass
polish
possess
postfix
problem
ranelletti
refer
represent
softwar
system
tree
written
zwakenberg
.I 1677
address
advantag
applic
area
arrai
arrang
basi
block
cacm
codeword
composit
comput
consecut
control
data
discuss
effici
entiti
execut
experi
extend
extens
flexibl
form
idea
jodeit
label
linkag
locat
logic
mean
memori
multimedia
novemb
occupi
organ
present
program
protect
realiz
represent
rice
share
simplic
storag
structur
system
time
turn
univers
util
variabl
vector
year
.I 1678
abstract
appli
area
automata
cacm
catalog
comput
cours
describ
descript
discuss
formal
graduat
languag
list
mcnaughton
novemb
number
ph
program
role
scienc
student
switch
.I 1679
achiev
add
algorithm
analyz
bergland
cacm
calcul
complex
comput
coolei
discret
discuss
effect
fast
fourier
hardwar
implement
integr
locat
log
multipli
number
octob
oper
order
perform
point
power
present
preserv
procedur
real
record
reduct
requir
seri
softwar
storag
symmetri
time
transform
turkei
valu
.I 1680
adept
alloc
applic
assist
cacm
catalog
commun
compil
comput
control
data
design
discuss
displai
emploi
engvold
expand
expedit
flexibl
fortran
full
gener
hugh
ibm
illustr
immedi
implic
improv
incorpor
inform
instruct
interleav
iv
job
languag
librari
make
man
materi
mathemat
model
octob
oper
perform
power
present
process
processor
program
purpos
relinquish
reprogram
reschedul
resourc
retriev
simul
solut
standard
store
student
surrend
system
teacher
techniqu
termin
tutor
tutori
unit
user
written
.I 1681
appendix
base
bergman
briefli
cacm
cautin
command
commun
computer
consol
data
demonstr
design
detail
develop
document
easi
english
equival
exampl
express
flowchart
form
formul
illustr
includ
inform
laboratori
languag
machin
macro
man
moor
natur
octob
oper
perform
point
present
printout
queri
rapp
remot
request
retriev
rubinoff
sampl
school
simplifi
standard
string
syntact
system
transform
typewrit
.I 1682
basic
braden
burrough
cacm
combin
compil
comput
context
environ
exist
implement
increment
interpret
languag
machin
mixtur
multiprogram
octob
remot
system
techniqu
termin
uniqu
wulf
.I 1683
applic
boolean
cacm
consist
context
defin
deriv
detect
determin
elementari
free
grammar
martin
matric
matrix
mechan
method
octob
oper
phrase
preced
procedur
simpl
structur
suitabl
.I 1684
accept
algorithm
ambigu
analysi
aspect
base
basi
cacm
check
complet
contradict
convent
convers
decis
defin
design
diagnost
discuss
elimin
emphas
entri
establish
extend
facil
form
import
king
limit
octob
paper
preced
procedur
processor
produc
program
propos
publish
redund
rule
specif
suggest
system
tabl
theoret
tool
translat
unsatisfactori
.I 1685
activ
analyz
cacm
calcul
conveni
deal
defin
descript
design
gan
gener
idea
languag
network
octob
perform
prepar
present
program
save
schedul
schurmann
set
standard
system
time
.I 1686
apertur
applic
approach
author
base
cacm
comput
digit
dimension
discuss
displai
faith
give
hirsch
hologram
holographi
imag
lesem
light
made
mathemat
model
object
octob
optic
photograph
point
present
reconstruct
review
suggest
synthesi
techniqu
white
.I 1687
algorithm
brai
cacm
netflow
septemb
witzgal
.I 1688
algorithm
cacm
henderson
netflow
septemb
.I 1689
algorithm
cacm
calcul
deriv
horner
pankiewicz
polynomi
scheme
septemb
valu
.I 1690
algorithm
brai
cacm
netflow
septemb
witzgal
.I 1691
affect
altern
applic
attribut
autocorrel
behavior
bit
cacm
characterist
comparison
comput
congruenti
constant
correl
defect
discuss
empir
evid
exhibit
extens
field
free
function
gener
hutchinson
ibm
irreduc
lag
lehmer
mix
modulo
multipl
nonrandom
number
older
optimum
pass
polynomi
prime
produc
propos
pseudorandom
random
septemb
sequenc
shown
simpl
size
state
statist
tausworth
test
type
usual
whittlesei
word
.I 1692
analyz
approxim
boundari
cacm
caus
condit
consid
converg
difficulti
discret
equat
heat
iii
iter
lick
line
linear
method
numer
plate
point
problem
remov
result
septemb
shown
slow
solut
standard
stewart
system
techniqu
thin
transfer
.I 1693
algol
basic
cacm
construct
data
declar
defin
deriv
easili
effici
element
facil
full
garwick
gener
gpl
handl
high
implicitli
includ
languag
minim
object
oper
pack
part
perform
pointer
procedur
program
purpos
sens
septemb
special
statement
truli
type
underlin
usag
variabl
word
.I 1694
algorithm
cacm
combin
effici
evalu
event
exclus
independ
larg
miller
minimum
mutual
number
present
probabl
problem
product
septemb
space
storag
sum
time
union
variabl
.I 1695
analyz
built
cacm
capabl
characterist
check
complement
compon
construct
conveni
coordin
data
descript
design
detail
determin
develop
digit
dill
directli
displai
easi
enabl
entir
error
examin
experiment
extens
extern
fiber
gross
individu
input
interact
interconnect
librari
line
made
mean
model
modif
natur
network
neural
neuron
neurophysiolog
oper
output
permit
phase
plexu
present
process
produc
properti
provid
provis
randal
rang
rapid
repres
research
result
retriev
richer
septemb
simul
specif
statist
stimuli
store
system
systemat
techniqu
transit
unit
user
varieti
work
.I 1696
algorithm
applic
cacm
code
compar
comput
construct
deal
discuss
ergod
experiment
fox
identifi
investig
landi
length
markov
matric
matrix
method
present
procedur
program
propos
recent
renew
review
septemb
sequenc
state
stochast
subchain
time
transient
updat
variabl
.I 1697
accomplish
ad
cacm
charact
chines
comput
deal
develop
discuss
displai
duncan
graphic
harvard
hayashl
illustr
includ
input
kuno
limit
mathemat
merit
nonstandard
oper
organ
orthographi
output
present
principl
print
rand
rel
repertoir
scope
septemb
symbol
system
tablet
text
.I 1698
abil
actual
answer
aspect
base
behav
behavior
bound
buffer
cacm
character
claim
collect
commun
comput
consol
den
design
difficult
easi
effici
entir
execut
hypothet
import
input
made
maximum
model
multius
need
oper
perform
postul
process
properti
question
rate
requir
septemb
set
similar
statist
suspend
system
user
virtual
wait
world
.I 1699
actual
assumpt
basic
bergman
cacm
capabl
conclus
conduct
design
detail
dialogu
document
eas
effect
emphasi
evalu
experi
experiment
factor
frank
includ
inform
inquiri
interact
involv
laboratori
languag
learn
librari
limit
machin
man
mechan
moor
perform
provid
psycholog
remot
repositori
research
result
retriev
rubinoff
school
search
searcher
septemb
system
teletypewrit
termin
time
tool
.I 1700
abstract
averag
byte
cacm
card
charact
compar
comput
conclus
construct
creat
cut
devic
enter
entri
equal
estim
half
handl
hutton
idea
inclus
index
inform
item
languag
late
logic
longer
made
mask
mate
method
multipl
natur
offspr
oper
peekabit
peekaboo
present
produc
product
program
punch
question
retriev
run
search
septemb
similarli
store
subject
superimpos
techniqu
test
text
time
unpack
word
.I 1701
august
cacm
data
propos
rate
signal
standard
synchron
transmiss
usa
.I 1702
august
cacm
commentari
jr
mooer
mr
steel
.I 1703
access
accommod
achiev
adopt
allow
appli
august
avoid
cacm
comput
explicit
famili
goal
identif
illustr
interact
languag
local
method
mooer
oppress
organiz
program
public
publish
relat
reli
reliabl
rigid
servic
sourc
standard
techniqu
trac
trademark
undertaken
usefulli
user
variat
want
.I 1704
algorithm
august
cacm
cost
curv
excess
minimum
muth
.I 1705
acm
aim
algol
algorithm
august
basic
berkelei
cacm
call
channel
comm
de
declar
decompos
defin
deriv
document
easi
easili
echo
equival
explicit
fix
flexibl
float
form
format
furnish
highli
inform
input
instanc
integ
interrelationship
ioa
iob
ioi
ior
journal
length
made
mean
nov
ota
otb
oti
otr
outchannel
output
outreal
outsymbol
paramet
point
polici
practic
primit
prior
procedur
properli
provid
qualiti
real
recommend
represent
request
round
set
simultan
statement
style
subset
suggest
symbol
tabular
variant
vogelaer
written
.I 1706
algol
altern
arrai
assembl
assign
august
burrough
cacm
call
champ
charact
class
command
compil
comput
concaten
condit
context
conveni
declar
express
facil
identifi
implement
languag
manipul
notat
numer
pattern
primit
procedur
process
program
provid
quantifi
restrict
set
snobol
standard
storm
string
symbol
thing
turn
variant
.I 1707
appli
august
cacm
condit
construct
gener
hall
known
matric
matrix
porsch
posit
preassign
real
result
similar
spectra
spectrum
suffici
test
transform
triangular
upper
yield
.I 1708
august
borrow
buffer
cacm
comput
context
core
detail
drum
effici
explor
larg
level
lisp
machin
memori
murphi
note
page
problem
program
storag
store
system
time
virtual
.I 1709
addit
algorithm
altern
analysi
august
breaux
cacm
capac
comput
convent
convention
data
doubl
efroymson
half
involv
larg
linear
machineri
matric
matrix
modif
multipl
number
perform
permit
precis
present
problem
regress
requir
stepwis
storag
symmetri
tax
techniqu
variabl
.I 1710
appendix
arbitrari
asp
associ
august
built
cacm
call
data
draw
emphasi
enabl
gener
grai
implement
includ
inform
item
lang
languag
macro
manipul
mean
number
outlin
packag
paper
philosophi
pictur
produc
prove
purpos
reader
relationship
repres
ring
seri
special
structur
suffici
system
.I 1711
alert
august
autom
banzhaf
bill
cacm
compli
complic
comput
contract
copyright
credit
data
decid
discuss
explain
express
focu
guarante
iii
impli
includ
inform
keep
lawyer
leasor
legal
liabil
materi
need
neglig
oper
owner
patent
pend
potenti
problem
process
program
protect
record
regul
relat
retriev
revis
secret
servic
slander
spot
statut
storag
system
theori
tort
trade
troubl
user
warranti
.I 1712
august
cacm
content
discuss
disk
failur
knutsen
lockemann
malfunct
method
recoveri
restor
statu
system
time
.I 1713
activ
algorithm
allevi
august
base
briefli
cacm
case
consid
degrad
futur
gener
high
improv
increas
maxim
method
modifi
multiprogram
number
occur
overcom
paper
paralysi
preassign
primarili
prioriti
program
refin
schedul
simultan
steven
system
time
tori
.I 1714
algorithm
cacm
distribut
juli
maclaren
normal
procedur
.I 1715
algorithm
cacm
de
direct
juli
search
vogelaer
.I 1716
algorithm
bell
cacm
deviat
juli
normal
random
.I 1717
algorithm
arithmet
boolean
cacm
consider
cube
decim
dietmey
don
dulei
encod
extrem
fortran
function
gener
implic
juli
languag
memori
minim
obtain
prime
procedur
program
requir
ternari
topolog
treat
.I 1718
algorithm
arithmet
cacm
comput
digit
divis
ehrman
integ
juli
multipl
operand
particip
posit
present
reserv
sign
signific
unsign
weight
.I 1719
airlin
autom
bron
cacm
calcul
carri
caus
complex
continu
cost
criteria
data
discuss
drum
evalu
examin
govern
illustr
increas
industri
juli
messag
method
methodolog
number
optim
orient
outlin
paper
perform
portion
process
re
real
reserv
size
stimler
switch
system
time
type
typifi
.I 1720
cacm
comment
concern
cours
elliott
emphasi
gener
juli
master
present
program
result
survei
work
.I 1721
addit
appli
approach
area
cacm
calcul
curv
determin
develop
differenti
ensur
equat
identifi
infin
integr
intersect
juli
kuiken
mean
method
modif
neighborhood
paramet
plane
point
prescrib
propos
rectangular
search
singular
stabl
start
system
systemat
tend
theori
.I 1722
advanc
cacm
chang
constant
converg
customari
develop
effici
fail
greatli
import
improp
improv
includ
integr
integrand
iter
juli
kind
mcwilliam
method
nonlinear
numer
paper
polynomi
predetermin
ration
recent
scheme
theori
thompson
transform
truncat
yield
.I 1723
activ
algorithm
arc
cacm
comput
construct
cpm
creat
directli
experiment
fisher
fortran
ibm
ii
juli
liebman
minim
nemhaus
network
node
number
order
pert
preced
program
project
relat
topolog
.I 1724
access
amphisbaen
arbitrari
ashenhurst
bay
block
cacm
column
combin
consider
design
devic
direct
gener
input
intern
juli
kei
nagler
number
partial
pass
power
problem
rang
size
sort
storag
tabul
work
.I 1725
access
aspect
associ
base
binari
cacm
circuit
column
consider
deriv
digit
distinct
effici
elementari
empti
independ
indic
individu
juli
length
lewin
memori
method
number
order
paper
present
proof
prove
readout
reduc
retriev
set
simpl
special
structur
term
theorem
unlik
valu
wolinski
word
.I 1726
accuraci
advoc
analysi
applic
area
autom
board
cacm
charact
code
compani
complic
comput
control
convert
crt
demarc
depend
design
discuss
displai
error
experiment
facsimil
figur
form
frequenc
gener
guid
higher
human
illustr
implement
instanc
interact
investig
involv
journal
joystick
juli
locat
machin
man
materi
matter
mean
meter
method
mode
nagi
obtain
oper
order
page
patent
percent
perform
photograph
portion
possibl
preliminari
prescan
print
problem
process
purpos
rapid
rate
read
reader
recognit
region
relat
reproduct
rescan
resolut
rudimentari
scanner
section
segment
share
simpl
simpler
suitabl
technic
techniqu
telephon
text
textual
thought
time
unformat
unstructur
unsupervis
utmost
.I 1727
account
algorithm
arbitrari
avoid
cacm
case
chain
comput
consid
constant
deriv
difficult
directli
easier
estim
event
execut
found
frequenc
gener
good
ij
instruct
involv
juli
jump
kral
larg
markov
matric
mean
necess
number
obtain
paper
part
posit
program
programm
proport
quantiti
reason
run
segment
structur
sum
th
theori
time
translat
valu
variant
wai
.I 1728
algorithm
alloc
amount
assess
behavior
cacm
coffman
collect
core
data
describ
direct
effect
empir
environ
evalu
execut
experiment
fault
fix
frequenc
instant
instruct
interpret
juli
length
main
measur
memori
multiprogram
number
oper
organ
page
perform
program
replac
requir
result
storag
studi
summar
system
varian
.I 1729
algorithm
cacm
june
linear
minit
program
salazar
sen
.I 1730
algorithm
cacm
jacobi
june
polynomi
witt
.I 1731
algorithm
cacm
formula
gaussian
gautschi
june
quadratur
.I 1732
algorithm
analysi
cacm
factori
june
oliv
varianc
.I 1733
algorithm
cacm
distinguish
distribut
fenichel
indistinguish
june
object
slot
.I 1734
algorithm
bartel
cacm
chebyshev
goulub
june
linear
overdetermin
solut
system
.I 1735
access
alloc
auction
cacm
comput
control
demand
fluctuat
free
futur
import
june
market
method
monthli
period
price
prioriti
project
rel
scheme
sutherland
time
user
.I 1736
cacm
data
format
head
june
standard
transmiss
tutori
usaai
.I 1737
cacm
context
free
global
grammar
june
parser
phrase
structur
unger
.I 1738
applic
bradi
cacm
code
commun
complic
compromis
consum
core
correct
debug
difficult
discuss
economi
effici
eleg
error
excess
experienc
featur
flexibl
format
highli
illustr
import
improv
incorpor
intric
june
make
memori
octal
onlin
opak
outlin
packag
pdp
present
prime
program
requir
rigid
routin
sd
simpl
storag
techniqu
type
unnecessarili
unsatisfactori
user
util
write
.I 1739
accept
algorithm
cacm
charact
compil
discuss
embed
exampl
express
form
ibm
implement
input
june
languag
locat
match
method
object
present
problem
produc
program
regular
search
signal
solut
sourc
specif
string
text
thompson
time
.I 1740
activ
anderson
blind
braill
brailler
cacm
construct
descript
detail
devic
drive
facil
head
increas
inexpens
june
model
modifi
need
platen
present
print
program
programm
requir
resili
roger
share
system
teletyp
termin
time
.I 1741
binari
brad
brookhaven
cacm
calcul
charact
comput
consol
continu
coordin
cost
design
desir
devic
difficult
displai
drawback
drum
emploi
frame
function
gener
head
horizont
imag
independ
initi
input
interact
invers
invest
june
line
low
map
memori
monitor
multiconsol
ophir
pictur
plot
point
process
programmat
rankowitz
raster
read
requir
rich
rotat
screen
select
serv
shepherd
space
spinrad
standard
swept
system
techniqu
teletyp
ten
thousand
tv
unit
written
.I 1742
cacm
channel
circular
comput
consid
data
degre
design
displai
effici
factor
flexibl
found
gener
improv
instruct
june
kei
lie
make
myer
need
number
origin
parent
path
physic
power
processor
purpos
separ
simpl
small
success
suffici
trip
understood
work
.I 1743
achiev
cacm
commun
demonstr
difficulti
duplex
exampl
field
flowchart
full
half
interest
june
line
lynch
present
problem
proven
reliabl
scheme
similar
slightli
telephon
transmiss
unreli
.I 1744
bartel
cacm
chebyshev
computation
decomposit
determin
equat
exchang
gaussian
gener
golub
implement
interchang
june
linear
literatur
lu
method
numer
obtain
occasion
overdetermin
permit
present
row
simultan
solut
stabl
stiefel
system
.I 1745
accomplish
adequ
cacm
clear
commun
comput
concept
construct
cost
creat
denni
depend
develop
divis
effect
enterpris
envis
free
industri
inform
instal
made
messag
multiaccess
oper
paper
posit
process
provis
public
reason
restructur
secur
servic
share
switch
system
wide
.I 1746
cacm
critic
design
discuss
flexibl
graham
inform
permit
privaci
problem
process
protect
share
solut
user
util
.I 1747
abstract
accept
adopt
affect
applic
assign
asynchron
cacm
capabl
clock
comput
concern
content
control
criteria
dai
debug
design
desir
exampl
explain
explicit
extent
facilit
featur
horn
impli
index
influenc
input
kind
know
languag
machin
multiprogram
notion
output
parallel
process
program
propos
protect
read
record
reject
reproduc
scope
specifi
synchron
system
time
user
van
virtual
.I 1748
analysi
analyz
approach
aspect
basic
cacm
collect
compar
connect
consid
convent
design
detail
discuss
embodi
establish
evolv
execut
explain
feasibl
final
framework
gener
hardwar
idea
implement
independ
interlock
interrupt
lampson
mechan
method
multiprocess
natur
notion
oper
orient
past
philosophi
present
prioriti
process
protect
provid
relationship
schedul
state
suitabl
system
time
vector
worker
year
.I 1749
abstract
activ
cacm
correct
design
dijkstra
divid
hierarch
implement
independ
level
logic
multiprogram
number
process
prove
sequenti
sound
structur
system
verif
vital
.I 1750
access
address
arrang
base
cacm
cdc
compar
compon
comput
configur
consider
convent
core
design
devic
discuss
dual
emphasi
estim
execut
expect
extend
fast
faster
fuchel
function
gain
gener
hardwar
heighten
heller
independ
larg
made
memori
million
multicomput
multipl
multiprogram
observ
perform
place
plan
quantiti
random
separ
slower
softwar
special
speed
storag
system
tradit
word
.I 1751
absenc
activ
adequ
alloc
balanc
basic
behavior
cacm
collect
comput
defin
demand
den
develop
dynam
equip
formul
gener
knowledg
manag
manifest
memori
model
modern
ongo
page
paper
problem
process
program
reason
recent
resourc
set
shown
system
treatment
vital
work
.I 1752
algorithm
altern
balanc
batch
cacm
characterist
combin
compar
develop
discuss
effect
emphasi
environ
hardwar
implement
load
machin
manag
medium
memori
mix
oper
oppenheim
page
perform
predecessor
present
process
program
rel
relat
resourc
result
scale
schedul
share
simul
size
synopsi
system
task
time
trace
variat
version
virtual
weizer
.I 1753
address
basic
cacm
concept
dalei
data
defin
denni
design
detail
discuss
dynam
explain
introduc
involv
machin
mean
mechan
memori
multic
oper
page
procedur
process
refer
segment
share
space
symbol
system
transform
user
virtual
.I 1754
accord
alloc
appendix
assess
basic
cacm
capabl
character
comput
design
dynam
eas
facil
function
hardwar
includ
kuehner
method
paper
perspect
present
problem
provid
purpos
randel
recent
repres
storag
survei
system
techniqu
underli
util
.I 1755
acm
cacm
committe
interest
oper
principl
proceed
special
symposium
system
.I 1756
april
cacm
card
code
hollerith
propos
punch
standard
usa
.I 1757
april
cacm
calendar
code
data
date
interchang
machin
propos
standard
usa
.I 1758
algorithm
april
cacm
mckai
polynomi
symmetr
.I 1759
algorithm
april
bayer
cacm
problem
transport
.I 1760
algorithm
april
bergson
cacm
curv
integr
normal
.I 1761
algorithm
april
cacm
chi
integr
squar
wood
.I 1762
algorithm
april
cacm
dilogarithm
kolbig
.I 1763
algorithm
april
cacm
equat
low
nonweil
order
polynomi
root
.I 1764
acm
alan
andri
anniversari
appreci
april
arthur
august
bernard
cacm
chair
charl
comput
condens
confer
consist
dam
davidson
design
discuss
dr
edit
educ
elliot
entitl
experi
galler
half
ham
includ
join
kahn
kohn
make
organ
organick
panel
panelist
paper
perli
pertin
prepar
present
refer
remark
richard
session
statement
th
transcript
van
.I 1765
april
board
cacm
character
complet
comput
conduct
determin
digit
educ
estim
expenditur
fund
hamblen
higher
institut
instruct
popul
present
project
publish
region
report
research
sampl
sourc
southern
state
survei
total
unit
util
.I 1766
april
bellman
cacm
comput
constant
differenti
effect
eigenvalu
estim
experi
formul
kagiwada
kalaba
linear
number
numer
oper
ordinari
precis
procedur
provid
quasilinear
result
solut
unknown
valu
vasudenvan
.I 1767
applic
april
cacm
cheapli
comput
design
develop
devic
expedi
gener
graphic
handl
interact
kulsrud
languag
machin
model
number
order
permit
present
problem
produc
purpos
quickli
solv
system
termin
varieti
.I 1768
algol
algorithm
analyz
applic
april
artifici
ascertain
basic
cacm
context
correspond
data
deriv
extract
free
gener
global
grammar
heurist
implement
includ
input
interest
invalid
languag
length
minimum
nontermin
number
pars
parser
phrase
prefix
procedur
program
purpos
quickli
rca
recurs
routin
sentenc
shorten
snobol
string
structur
subset
substr
successfulli
symbol
target
test
type
unger
.I 1769
activ
analyz
april
automat
barrier
basic
breach
cacm
commun
complex
comput
continu
cost
creat
data
develop
displai
distanc
educ
effect
entir
expand
expans
explos
front
geographi
govern
greater
harder
hardwar
high
human
imped
import
inadequ
incent
increas
inform
judg
lack
languag
machin
main
man
measur
need
onlin
onward
orient
part
popul
potenti
power
princip
problem
process
product
program
progress
rapid
rate
remov
scientist
sensor
servic
share
size
smash
solut
studi
sweep
time
tool
understand
univers
urgent
work
world
.I 1770
acm
adopt
analyz
aspect
background
cacm
code
conduct
consid
council
ethic
guidelin
import
inform
interest
march
motiv
novemb
parker
process
profess
profession
purpos
reason
rule
section
set
stimul
thought
tori
.I 1771
academ
acm
annot
area
attent
bibliographi
cacm
catalog
classif
committe
comput
contain
continu
cours
curriculum
descript
detail
develop
discuss
doctor
educ
emphas
evolv
facil
graduat
guidelin
implement
import
includ
made
march
master
minor
need
organ
outlin
prerequisit
present
program
recommend
report
requir
resourc
scienc
servic
specif
staff
subject
twenti
undergradu
wai
.I 1772
arrang
cacm
case
dual
februari
keyboard
propos
standard
usa
usascsocr
.I 1773
alphanumer
arrang
cacm
februari
gener
inform
interchang
keyboard
propos
purpos
standard
usa
.I 1774
applic
automat
cacm
cdc
classifi
detail
explain
facil
featur
februari
function
gener
hardwar
implement
machin
main
multiprogram
nonautomat
overlai
pankhurst
program
real
refer
semiautomat
special
system
techniqu
time
type
.I 1775
adjust
algorithm
cacm
chang
element
februari
invers
matrix
symmetr
zielk
.I 1776
algorithm
bayer
cacm
februari
maxflow
.I 1777
algorithm
cacm
februari
gener
lexicograph
ord
order
permut
smith
.I 1778
algorithm
cacm
distribut
dorrer
februari
.I 1779
algorithm
cacm
februari
morri
probabl
test
.I 1780
algorithm
analysi
cacm
data
distribut
februari
harmon
hunter
symmetr
.I 1781
applic
approach
aspect
autom
cacm
critic
discuss
effort
februari
feldman
formal
gri
ii
iii
iv
languag
post
present
program
recent
relat
review
section
semant
studi
syntact
syntax
system
topic
translat
write
.I 1782
accuraci
analysi
cacm
complet
eas
equal
formul
formula
fourier
improv
integr
interv
januari
log
meisel
numer
present
sampl
scale
set
space
unequ
usag
.I 1783
allow
back
base
byan
cacm
combin
consid
convers
convert
digit
float
intermedi
januari
matula
mean
need
number
origin
point
question
round
signific
truncat
.I 1784
abscissa
analyt
assumpt
binari
cacm
coeffici
comput
consider
degre
error
estim
exact
express
function
infinit
integr
januari
polynomi
practic
publish
quadratur
question
rabinowitz
round
rule
true
valu
weight
.I 1785
assembl
cacm
compil
document
effect
implement
januari
method
morri
number
present
review
scatter
storag
symbol
tabl
techniqu
variant
wai
.I 1786
base
build
cacm
code
collis
discuss
divis
faster
fix
free
handl
hash
improv
introduc
januari
known
length
linear
logic
maurer
method
multipl
oper
point
quadrat
random
scatter
search
storag
tabl
.I 1787
algorithm
bnf
cacm
check
compil
construct
effect
effici
exampl
grammar
gri
illustr
januari
languag
left
matric
matrix
number
oper
purpos
pushdown
recogn
sentenc
stack
suitabl
syntax
transit
type
usual
.I 1788
bodi
cacm
call
canon
compil
conflict
constitut
construct
contend
develop
difficulti
discuss
effici
effort
form
function
gener
greatest
halpern
higher
implement
independ
instruct
januari
languag
level
lie
logic
machin
macro
made
notat
object
paper
present
processor
program
prove
question
role
satisfactori
support
term
toric
.I 1789
algorithm
cacm
function
gamma
hoar
januari
logarithm
.I 1790
algorithm
arbitrari
cacm
function
januari
muller
whitlei
.I 1791
algorithm
cacm
factor
green
januari
matric
modifi
triangular
.I 1792
access
account
cacm
compar
comput
condit
conduct
control
corpor
debug
design
develop
differ
encount
erikson
experi
experiment
exploratori
faster
find
grant
hypothes
import
individu
involv
januari
known
limit
line
made
measur
methodolog
onlin
perform
point
practic
present
problem
program
programm
research
result
sackman
signific
standard
statist
strike
studi
suggest
system
task
work
.I 1793
alphamer
american
cacm
charact
decemb
inform
nation
present
process
propos
standard
.I 1794
cacm
decemb
fast
gener
ibm
number
random
seraphin
.I 1795
cacm
code
comput
decemb
fateman
optim
parallel
serial
.I 1796
algorithm
cacm
decemb
index
subject
.I 1797
algorithm
cacm
decemb
linear
program
proll
solut
.I 1798
algorithm
cacm
coulomb
decemb
function
kolbig
wave
.I 1799
algorithm
brai
cacm
continu
decemb
elementari
fraction
function
.I 1800
algorithm
cacm
decemb
parson
psif
.I 1801
algorithm
analysi
balanc
cacm
claringbold
decemb
experi
varianc
.I 1802
algorithm
cacm
claringbold
decemb
direct
matric
product
regress
.I 1803
algorithm
bach
cacm
complex
decemb
find
root
.I 1804
algorithm
cacm
color
decemb
herriot
polygon
region
.I 1805
abl
absenc
accord
actual
algorithm
altern
analyt
cacm
central
channel
characterist
comput
concurr
continu
control
cpu
decemb
detail
develop
discuss
effect
elig
enjoi
factor
featur
fraction
includ
input
intermitt
iter
lasser
memori
method
mode
multiprogram
nonquantit
oper
output
paper
phenomenon
predict
present
prioriti
proce
proceed
processor
product
program
progress
rate
readi
repres
resid
result
sensit
simul
simultan
singli
situat
test
topolog
unit
.I 1806
algorithm
analyt
applic
avoid
bach
base
breakdown
cacm
complex
converg
critic
decemb
difficulti
dilemma
downhil
equat
exampl
exist
fortran
function
fundament
improv
includ
introduct
literatur
method
modif
modifi
numer
origin
practic
present
program
propos
rate
relat
restrict
review
root
shown
solv
theori
.I 1807
analysi
arithmet
backward
base
branch
busam
cacm
calcul
code
common
compil
comput
decemb
definit
develop
effici
elimin
england
excel
express
fortran
index
invari
iter
linear
loop
made
method
object
optim
pass
point
present
process
produc
program
prove
provid
reduc
redund
refer
regist
remov
requir
scan
significantli
speed
structur
subexpress
subscript
usag
valu
variabl
.I 1808
advanc
cacm
characterist
comput
confidenti
cost
cryptograph
dealt
decemb
emphasi
includ
inform
maintain
make
method
paid
paper
prefer
process
rel
secur
special
tassel
techniqu
uniqu
van
.I 1809
analysi
appli
area
awar
background
broad
cacm
calcul
center
comput
decemb
depart
difficulti
educ
emphas
emphasi
experiment
implement
mathemat
method
need
numer
obtain
parter
ph
problem
procedur
program
question
scienc
scientif
solid
studi
.I 1810
aggrav
al
aris
automat
beladi
beset
brown
built
cacm
care
center
compar
comput
conclud
condit
decemb
demand
design
differ
disadvantag
discuss
displac
effici
examin
fold
ibm
import
interfac
larg
measur
mechan
memori
nelson
normal
number
oper
page
part
perform
prefold
program
requir
research
satisfactorili
sayr
shown
simpl
sourc
speed
storag
system
test
todai
troubl
unit
.I 1811
actual
affirm
answer
appli
approach
cacm
case
class
commun
comput
cooper
counter
data
decemb
decreas
demonstr
determin
distribut
effici
electr
execut
gather
import
improp
increas
independ
instruct
investig
job
larg
lead
mean
method
multiprocessor
network
number
parallel
partial
problem
processor
program
proper
provid
question
rosenfeld
run
separ
share
shown
simul
simultan
singl
solut
stabil
storag
studi
system
task
time
typic
written
.I 1812
cacm
fortran
gener
grosenbaugh
novemb
number
random
.I 1813
algorithm
cacm
gener
lexicograph
novemb
ord
order
permut
pseudo
smith
.I 1814
algorithm
cacm
direct
novemb
search
smith
.I 1815
algorithm
cacm
direct
novemb
search
smith
tomlin
.I 1816
algorithm
cacm
fit
gener
novemb
orthogon
polynomi
squar
watson
.I 1817
algorithm
cacm
coeffici
comput
fourier
hall
novemb
rai
.I 1818
algorithm
argument
cacm
cobb
function
imaginari
kind
legendr
novemb
real
.I 1819
algorithm
cacm
complex
error
function
gautschi
novemb
.I 1820
algorithm
cacm
gener
novemb
permut
random
robson
.I 1821
algorithm
cacm
dixon
eberlein
function
ii
matrix
novemb
perman
shriver
squar
.I 1822
algorithm
cacm
dial
forest
novemb
order
path
shortest
topolog
.I 1823
algorithm
analysi
cacm
factori
howel
novemb
varianc
.I 1824
algebra
algorithm
altern
aparel
balzer
bnf
build
cacm
capabl
check
code
command
complet
concern
conveni
dataless
debug
execut
extens
facil
farber
form
format
found
function
gener
includ
inform
initi
input
languag
level
line
macro
manipul
match
multipl
normal
novemb
output
pars
parser
pattern
piec
pl
power
preprocessor
program
proven
provid
purpos
request
rule
semant
sequenc
snobol
special
state
stream
string
subroutin
success
successfulli
syntax
system
time
tmg
translat
variabl
.I 1825
algol
backup
base
cacm
capabl
condit
construct
decreas
deriv
develop
effort
entir
equal
grammar
individu
input
involv
knuth
korenjak
length
lr
method
novemb
number
obtain
origin
pars
parser
part
partit
practic
present
procedur
processor
produc
recogn
relat
requir
satisfi
scan
singl
size
smaller
step
techniqu
.I 1826
activ
algorithm
cacm
collect
collector
compact
comput
criteria
decis
discoveri
discuss
easili
exhaust
fenichel
free
garbag
larg
lisp
list
made
memori
novemb
object
oper
paper
process
storag
system
virtual
yochelson
.I 1827
accur
action
analyz
applic
auxiliari
behavior
cacm
call
carefulli
collect
construct
data
date
dcf
dump
event
exampl
exist
explain
facil
futur
gener
guidelin
identifi
implement
inform
interfer
item
job
line
magnet
measur
michigan
minim
model
monitor
mt
normal
novemb
obtain
occurr
offer
oper
order
outlin
overhead
part
perform
pinkerton
process
program
purpos
record
share
shown
softwar
structur
supervisor
system
tape
termin
time
type
unrel
user
.I 1828
access
activ
allow
amount
assum
base
bernstein
cacm
compar
consid
data
directori
discuss
examin
graph
hierarchi
line
manipul
maxim
method
novemb
parallel
perform
problem
process
repres
rule
shoshani
simultan
synchron
system
valid
.I 1829
action
auxiliari
basi
batch
bond
cacm
call
capabl
carnegi
cdc
choic
command
comprehens
comput
constraint
design
develop
discuss
displai
entri
environ
equal
exist
gener
graphic
hardwar
human
interact
interfac
made
manageri
medium
mellon
monitor
novemb
part
place
process
program
provis
purpos
remot
resid
respond
respons
rightnour
routin
similar
small
structur
submonitor
swap
symmetr
system
take
transient
univers
user
version
.I 1830
access
bay
cacm
direct
invert
octob
pack
retriev
time
.I 1831
cacm
comment
octob
optim
stanfel
structur
tree
.I 1832
cacm
dunham
error
logarithm
minimax
octob
.I 1833
algol
ambigu
cacm
descript
herriot
octob
.I 1834
advantag
appli
argu
attempt
axiom
axiomat
basi
branch
cacm
comput
displai
elucid
exampl
explor
extend
final
follow
formal
foundat
geometri
hoar
import
infer
involv
later
logic
made
mathemat
octob
paper
practic
program
proof
properti
pursuanc
rule
set
simpl
studi
techniqu
theorem
theoret
topic
.I 1835
block
cacm
data
design
develop
dewar
discuss
featur
hochsprung
iitran
import
includ
languag
level
octob
orient
power
principl
procedur
program
structur
student
type
varieti
.I 1836
advantag
algorithm
bell
cacm
call
comput
concis
determin
dimension
function
grammar
inform
linear
matrix
method
obtain
octob
pair
possess
preced
precis
present
relat
repres
shown
vector
.I 1837
algol
algorithm
base
cacm
convolut
fast
fourier
octob
procedur
singleton
transform
.I 1838
adam
algorithm
cacm
curv
integr
normal
octob
.I 1839
algorithm
busing
cacm
complex
decomposit
goulub
matrix
octob
singular
.I 1840
algorithm
cacm
effici
gener
number
octob
prime
singleton
.I 1841
algorithm
cacm
gener
number
octob
prime
principl
singleton
treesort
.I 1842
algorithm
cacm
configur
gener
is
octob
simo
.I 1843
base
bit
brown
cacm
choic
compos
comput
consid
devic
digit
discuss
float
intern
memori
number
octob
point
represent
richman
sens
shown
sign
state
word
.I 1844
activ
altern
approach
arrang
arriv
assign
bank
baskin
batch
cacm
collect
compat
comput
conceptu
configur
connect
control
cost
crosspoint
dedic
depend
design
develop
disk
distribut
drive
econom
final
form
gener
highli
horowitz
inher
interact
interchang
job
low
machin
magnitud
manner
master
memori
messag
mix
modular
multitermin
network
octob
order
organ
pair
potenti
power
present
problem
process
processor
program
purpos
rang
ratio
reliabl
remot
requir
rittenhous
run
serv
share
simpl
simpler
simplest
size
span
supervis
switch
system
tennison
termin
time
user
.I 1845
actual
base
cacm
capabl
cdc
comput
concept
condit
convert
cost
critiqu
delin
descript
easili
effect
effici
experi
flexibl
ge
gener
histori
ibm
incorpor
increas
lanzano
larg
loader
maintain
memori
minimum
occup
octob
oper
overlai
overlaid
present
program
propos
recommend
short
simul
softwar
specif
standard
structur
system
trajectori
tree
univac
util
.I 1846
abstract
addit
admit
assum
briefli
cacm
case
common
commonli
comput
computation
convent
deal
dealt
develop
digit
discret
encount
event
extend
find
found
handl
inform
interconnect
introduc
major
method
network
occur
parallel
parna
prioriti
problem
process
provid
report
review
rule
separ
septemb
sequenti
shown
simpl
simul
simultan
solut
system
techniqu
unfeas
.I 1847
ad
algorithm
attain
await
bound
cacm
corneil
creas
cycl
depend
edg
effici
element
exactli
examin
fast
find
finit
fundament
gotlieb
graph
grown
inspect
involv
larg
list
method
paton
present
process
pushdown
random
remark
requir
septemb
set
shown
similar
span
speed
stage
storag
store
superior
take
term
testsshow
time
top
tree
turn
type
undirect
unexamin
vertic
welch
.I 1848
algorithm
cacm
damp
equat
nonlinear
septemb
silverman
solv
squar
sum
system
taylor
.I 1849
algorithm
boothroyd
cacm
function
hamilton
minim
septemb
.I 1850
algorithm
cacm
gener
leitch
lexicograph
order
permut
septemb
.I 1851
algorithm
cacm
gener
mcilroi
septemb
span
tree
.I 1852
algorithm
base
bootstrap
cacm
comput
contemporari
easili
experi
implement
languag
machin
macro
man
mobil
orgass
processor
program
septemb
system
transfer
wait
week
.I 1853
algorithm
attempt
cacm
chain
class
collect
collector
combin
compact
consider
conveni
definit
descript
design
detail
essenti
factor
final
garbag
hansen
implement
lisp
list
macro
make
memori
oper
permit
plex
pointer
present
process
rearrang
reloc
represent
septemb
sequenti
similar
storag
store
success
swym
system
temporari
uniqu
.I 1854
activ
author
avoid
basi
basic
cacm
code
comput
concept
concurr
construct
contribut
error
exampl
featur
feel
gener
heavili
hypothet
ibm
implement
includ
instruct
intend
interrupt
machin
make
manner
modern
multiprogram
oper
organ
parallel
permit
perspicu
pitfal
pl
potent
present
prime
process
program
pseudoconcurr
repres
routin
scheme
septemb
serv
set
simul
sourc
specif
supposedli
synchron
system
termin
test
unreli
wirth
written
.I 1855
account
analys
analysi
analyz
applic
august
avoid
bratlei
cacm
dewar
dictionari
dynam
english
exampl
featur
form
grammar
includ
inform
keep
left
limit
main
need
number
outlin
output
path
procedur
process
produc
program
pursu
reason
record
represent
respect
rule
sentenc
simultan
size
syntact
techniqu
time
transform
word
.I 1856
abil
actual
ad
adapt
addit
allow
assert
august
cacm
capabl
combin
comprehend
comprehens
copi
correctli
correspond
creat
design
encod
english
exampl
explicit
express
factual
form
format
found
futur
gener
great
help
implicit
increment
inform
input
kind
languag
larg
linguist
mean
memori
methodolog
need
notat
number
part
present
process
program
provid
put
quillian
relat
repres
requir
seen
sentenc
simul
singl
small
store
structur
successfulli
system
taught
teachabl
text
theori
tlc
world
.I 1857
algorithm
august
cacm
chase
filon
fosdick
quadratur
.I 1858
algorithm
analysi
attent
august
automat
cacm
chase
consider
control
devot
error
featur
filon
fosdick
includ
quadratur
round
truncat
.I 1859
approxim
august
bound
cacm
deriv
develop
error
explicit
fourth
function
hall
interpol
mesh
order
period
point
quintic
shown
sixth
spline
.I 1860
algol
applic
associ
august
base
cacm
code
comparison
complex
data
design
discuss
exampl
feldman
hash
high
implement
includ
languag
larg
level
program
structur
techniqu
underli
work
.I 1861
appear
arden
august
cacm
conclus
data
defin
definit
drawn
facil
form
futur
galler
graham
higher
inform
languag
level
mad
motiv
oper
predefin
type
user
write
written
.I 1862
absenc
academ
activ
adapt
allow
argentin
argentina
attempt
attribut
august
author
cacm
capabl
capac
chile
chilean
come
comput
condit
consciou
constraint
contrast
describ
develop
disciplin
discont
econom
emphasi
especi
european
excel
except
exclud
experienc
finerman
futur
govern
hard
ibm
larger
limit
mean
nation
novemb
number
particip
program
progress
quo
rare
report
resourc
respons
retard
scienc
servic
sever
situat
slowli
small
solut
statu
strengthen
strive
strong
student
superimpos
technolog
tradit
trip
univers
.I 1863
algorithm
cacm
juli
linear
messham
minit
program
.I 1864
algorithm
boothroyd
cacm
deriv
gener
hilbert
juli
matrix
test
.I 1865
algol
algorithm
cacm
editor
juli
languag
refer
sauer
.I 1866
cacm
characterist
clemm
juli
mathieu
solut
valu
.I 1867
asymptot
averag
cacm
cell
complex
expect
gener
hooker
interest
interv
juli
length
memori
number
ratio
replac
select
sequenc
shown
sign
sort
techniqu
th
theori
variabl
.I 1868
address
altern
approach
busi
cacm
comput
correct
correctli
data
detect
difficulti
error
essenti
explain
form
illustr
inform
input
involv
juli
kei
kennedi
keypunch
machin
method
obtain
origin
paper
phase
possibl
program
put
readabl
refer
rule
scientif
subsequ
suggest
techniqu
verifi
work
.I 1869
address
block
cacm
call
collect
collector
consequ
constraint
conveni
definit
desir
dialect
disappear
expens
explicit
extens
function
garbag
implement
implicit
includ
indirect
introduc
juli
kain
languag
modif
name
number
program
programm
provid
result
save
signific
snobol
structur
time
.I 1870
algorithm
assum
binari
bit
cacm
comput
construct
desir
donnelli
integ
juli
make
number
paramet
probabl
program
pseudorandom
simul
techniqu
uniform
word
.I 1871
author
automat
cacm
comparison
contour
cottafava
di
digit
discuss
ed
elettronica
elettrotecnica
fortran
implement
instruct
istituto
iv
juli
lemoli
map
mean
method
milano
number
perform
plotter
politencnico
present
program
propos
requir
simpl
small
.I 1872
cacm
chebyshev
degre
errata
formula
high
interpol
juli
quadratur
salzer
.I 1873
acceler
algorithm
applic
cacm
comput
fox
juli
lp
method
phase
price
product
relat
shown
.I 1874
absolut
approach
attract
cacm
complement
congruenti
consid
context
convent
criteria
desir
easili
econom
establish
examin
familiar
gener
hemmerl
ibm
involv
juli
loss
machin
multipl
neg
number
period
posit
previous
produc
properti
pseudorandom
relat
relationship
residu
sequenc
shown
simpli
statist
type
valu
.I 1875
amo
approach
approxim
bernstein
cacm
constraint
data
deriv
fit
function
juli
modifi
polynomi
present
problem
program
provid
quadrat
rang
requir
scheme
select
set
sign
slater
spline
studi
yield
.I 1876
cacm
class
diagon
gener
juli
matric
matrix
member
orthogon
pattern
posit
prescrib
present
schneider
sign
special
spectra
test
transform
.I 1877
algorithm
alloc
appendix
cacm
condit
continu
deadlock
design
determin
examin
gener
grant
habermann
handl
impos
introduc
juli
known
light
occas
oper
polici
possibl
present
prevent
problem
proof
publish
refus
request
resourc
restrict
safe
select
show
situat
solut
successfulli
suffici
suggest
system
task
.I 1878
abandon
abl
amend
append
assum
base
cacm
collect
collector
consequ
count
creat
depend
descend
emploi
eras
explicitli
find
free
function
garbag
identifi
impedi
juli
lisp
list
mark
modif
node
program
programm
reachabl
recov
recoveri
reentrant
refer
respons
scheme
slip
space
structur
system
trace
variabl
weizenbaum
wish
.I 1879
accompani
address
advantag
alloc
appar
block
cacm
caus
coexist
convent
decreas
distinguish
evid
exact
experi
extern
fragment
gener
inabl
increas
intern
investig
juli
larg
loss
main
make
method
note
number
page
paper
phenomenon
present
program
purpos
randel
reduc
request
requir
result
round
rule
save
segment
separ
seri
simul
size
storag
strike
take
techniqu
type
util
word
.I 1880
algorithm
cacm
chebyshev
golub
june
linear
overdetermin
solut
system
.I 1881
algorithm
arrai
cacm
june
macleod
store
transpos
vector
.I 1882
algorithm
cacm
definit
determin
duke
june
matrix
posit
root
squar
.I 1883
algorithm
cacm
fair
june
modifi
quadratur
romberg
weather
.I 1884
accompani
algorithm
anomal
anomali
behavior
beladi
cacm
case
characterist
constrain
decreas
discuss
experi
fifo
formal
gener
increas
inform
june
machin
nelson
page
present
program
replac
reveal
revers
run
shedler
size
space
store
time
treatment
true
.I 1885
algorithm
analysi
applic
aspect
attitud
cacm
chomski
comprehens
comput
consid
deal
definit
descript
design
detail
develop
direct
discuss
express
extend
featur
formal
friedman
full
gener
grammar
ibm
implement
import
includ
innov
insert
june
languag
lexic
line
model
orient
outlin
paper
phrase
present
problem
program
random
refer
simpl
special
structur
syntax
system
transform
underli
.I 1886
algorithm
amount
appli
applic
ascertain
assign
boolean
breuer
cacm
cell
code
compil
comput
computation
correct
effici
encount
evalu
execut
express
factor
feasibl
find
gener
global
heurist
hold
increas
inform
june
make
manipul
memori
method
minim
necessarili
need
number
object
occur
optim
order
polynomi
present
problem
procedur
produc
requir
result
retain
sequenc
set
storag
subexpress
switch
symbol
system
techniqu
temporari
time
total
.I 1887
cacm
calcul
determin
develop
eigenvalu
includ
june
lead
matrix
minor
numer
pentadiagon
princip
recurs
relat
sweet
.I 1888
alloc
approxim
block
blue
boundari
cacm
cubic
differ
differenti
dynam
easili
equat
error
function
june
mesh
method
nonlinear
nonuniform
numerov
point
problem
quintic
relax
result
satisfi
set
size
solut
solv
spline
standard
suit
tridiagon
typic
uniform
.I 1889
access
brook
cacm
campu
central
colleg
comput
curriculum
develop
discuss
document
educ
effect
evolutionari
experi
facil
ferrel
galli
import
includ
institut
introduc
involv
jr
june
lesson
mean
methodolog
necess
need
network
organ
organiz
parker
program
progress
provid
remot
report
repres
routin
separ
servic
small
smaller
special
statewid
support
technic
termin
train
univers
user
year
.I 1890
actual
area
base
behavior
bidirect
block
car
citi
comput
curv
deal
densiti
determin
dynam
empir
exampl
excel
express
flow
formula
japan
june
kyoto
larg
length
list
make
memori
meter
movement
nagao
network
numer
point
program
proper
repres
road
sakai
scheme
segment
simul
situat
speed
supposit
ten
trace
traffic
transfer
valu
varieti
versu
.I 1891
achiev
band
brad
brookhaven
cacm
calcul
color
comput
connect
creat
develop
dimension
displai
feed
filter
group
gun
imag
interact
june
larg
map
memori
monitor
object
ophir
optic
output
peopl
point
produc
project
raster
recent
refresh
result
rotat
screen
separ
shepherd
signal
spinrad
standard
stereograph
store
superimpos
system
televis
termin
time
video
view
.I 1892
analyz
base
begin
cacm
calcul
central
chain
comput
degre
demand
descript
design
discuss
drum
environ
execut
featur
graphic
impli
implic
job
june
kei
markov
mason
memori
model
multiprogram
number
numer
offer
optim
page
paramet
permit
present
preserv
process
program
properti
quantum
rang
rate
relationship
result
share
simpl
statist
stochast
system
time
traffic
understand
unit
util
wallac
wide
.I 1893
algorithm
cacm
noltemei
polynomi
result
root
routin
squar
.I 1894
algorithm
cacm
deviat
knop
normal
random
.I 1895
algorithm
cacm
formula
gaussian
hill
quadratur
.I 1896
algorithm
cacm
coulomb
function
gautschi
regular
wave
.I 1897
algorithm
cacm
coulomb
function
kolbig
wave
.I 1898
algorithm
cacm
coulomb
function
kolbig
regular
wave
.I 1899
algorithm
bartel
cacm
decomposit
emploi
golub
lu
method
procedur
simplex
.I 1900
achiev
applic
cacm
clarif
clarifi
complet
correct
effort
fortran
initi
interpret
languag
mainten
natur
need
prepar
program
progress
report
result
reveal
set
specif
standard
state
studi
unit
work
year
.I 1901
alloc
analyt
approach
behavior
beladi
cacm
combin
comput
concept
cost
defin
demonstr
develop
dynam
effici
formal
illustr
intent
investig
kuehner
method
paramet
present
problem
processor
program
relationship
sampl
shade
share
singl
space
system
task
term
unit
.I 1902
alter
assembl
automat
cacm
comput
control
data
discuss
exercis
final
grade
hext
includ
languag
made
mix
oper
program
programm
provis
recognit
record
result
run
scheme
simpl
special
suppli
system
test
typic
univers
wine
.I 1903
cacm
chebyshev
degre
formula
high
interpol
quadratur
salzer
.I 1904
analyt
cacm
error
estim
function
gaussian
integr
rabinowitz
readi
rough
.I 1905
algorithm
appear
background
bad
bartel
base
basic
behavior
cacm
comput
dantzig
decomposit
error
form
good
goulub
implement
interchang
invers
linear
lu
matrix
method
paper
program
properti
round
row
simplex
slow
standard
step
theoret
updat
.I 1906
apertur
arriv
autom
basi
board
cacm
circuit
comput
conflict
control
crosstalk
delet
discuss
effect
extens
feed
hole
horizont
interconnect
lass
line
long
lower
maxim
obtain
pattern
percent
pin
plan
print
problem
program
regular
rerout
resolv
rout
side
slit
step
techniqu
termin
top
typic
upper
usag
via
virtual
.I 1907
achiev
bartlett
cacm
circumst
comment
compar
duplex
final
full
group
half
link
literatur
made
note
procedur
propos
recent
relat
reliabl
scantleburi
scheme
shown
simpl
transmiss
type
unreli
.I 1908
aid
attain
attempt
attitud
batch
cacm
comparison
comput
conduct
cost
decad
decis
end
equal
evalu
experiment
favor
gold
higher
indic
known
level
logic
lower
made
make
mit
nonprogramm
paper
perform
popul
predomin
problem
process
profession
program
reach
result
share
signific
significantli
situat
solv
statist
stop
studi
system
time
usag
user
valu
work
.I 1909
approxim
april
cacm
comput
empir
error
integr
jn
kohli
numer
practic
represent
rule
shown
stroud
studi
trapezoid
.I 1910
addit
algorithm
april
bu
cacm
class
determin
elimin
equat
explicit
fast
form
formula
gaussian
invers
linear
matrix
method
present
rose
shown
solv
special
suggest
system
tridiagon
.I 1911
account
ad
analysi
appli
april
cacm
class
compon
condit
consid
coordin
definit
determin
form
frame
function
gener
grammar
includ
invers
languag
lisp
machineri
natur
outlin
paper
perform
petrick
phenomena
postal
precis
problem
procedur
propos
reduct
rosenbaum
rule
schemata
sentenc
sequenc
solut
specif
subtre
syntact
theori
transform
work
.I 1912
altern
appoint
april
block
cacm
clinic
comput
depart
effect
emploi
enabl
environ
evalu
experiment
hospit
individu
katz
kind
major
outpati
program
purpos
simul
system
user
.I 1913
algorithm
april
arbitrari
cacm
function
polygamma
precis
schwachheim
.I 1914
algorithm
april
cacm
integ
klimpel
matrix
program
scale
.I 1915
advantag
algorithm
april
cacm
case
comput
concav
consid
convex
edg
elimin
face
found
galimberti
hidden
hide
increas
line
montanari
number
object
obtain
perspect
pictur
plane
point
present
recogn
reduc
represent
result
roughli
sequenti
simpler
squar
take
time
view
.I 1916
addit
analysi
april
boolean
cacm
combin
complet
comput
contain
control
data
determin
direct
environ
execut
frequent
graph
inform
initi
instruct
load
logic
low
matric
model
nondirect
page
prior
program
refer
repres
segment
sequenc
share
specif
structur
techniqu
time
transform
turn
valuabl
yield
.I 1917
algol
algorithm
arbitrari
cacm
factor
fast
fourier
march
procedur
singleton
transform
.I 1918
algorithm
cacm
distinguish
distribut
grai
indistinguish
march
object
slot
.I 1919
algorithm
cacm
effici
march
minim
singleton
sort
storag
.I 1920
algorithm
cacm
march
morri
probabl
test
.I 1921
algol
algorithm
base
cacm
convolut
fast
fourier
march
procedur
singleton
transform
.I 1922
cacm
code
commun
control
data
inform
interchang
march
procedur
propos
standarad
standard
usa
.I 1923
approach
basic
cacm
command
commun
deepli
embed
facil
high
inexpens
input
interfac
languag
level
march
method
output
potenti
processor
program
provid
pseudofil
rosin
shown
support
system
techniqu
.I 1924
addit
algorithm
cacm
carefulli
case
coffman
design
enorm
examin
fault
fewer
function
induc
invers
jr
lead
main
manipul
march
matric
matrix
mckellar
memori
minim
multipl
number
occur
oper
organ
page
part
partit
pull
purpos
represent
requir
row
save
show
shown
small
studi
submatrix
system
time
total
.I 1925
adjac
aircraft
appli
cacm
characterist
concept
connect
consist
contour
determin
drawn
elev
flight
gener
geometr
graphic
ground
line
locat
make
map
march
mors
node
obtain
problem
process
properti
read
relat
repres
simplifi
solut
straight
structur
techniqu
topolog
track
util
.I 1926
aid
automat
bern
cacm
capabl
capit
column
comput
construct
descript
directli
document
edit
entir
facilit
featur
flexibl
form
format
fortran
free
good
includ
index
input
item
iv
march
minimum
nontext
page
perform
print
printer
process
product
program
small
system
text
total
written
.I 1927
append
area
bibliographi
briefli
cacm
comput
cours
curriculum
design
desir
februari
gener
graduat
inform
level
list
organ
ph
program
recommend
report
salton
sampl
scienc
subject
suitabl
system
.I 1928
achiev
activ
aspect
asynchron
behavior
boolean
cacm
clear
combin
convert
deal
descript
detail
deterior
digit
eas
economi
effect
elimin
essenti
event
exclus
execut
facil
fashion
februari
gener
grow
handl
improv
larg
length
logic
main
mixtur
model
network
object
obtain
passag
precis
procedur
process
quantit
queue
reduct
result
schedul
separ
serial
simul
simultan
sought
space
structur
synchron
system
task
techniqu
time
ulrich
.I 1929
cacm
commonli
comput
contain
continu
control
convers
data
devic
digit
effici
emploi
exampl
facil
februari
form
grai
graphic
half
illustr
imag
includ
inform
kind
method
microfilm
model
need
note
obtain
output
perman
photograph
pictori
pictur
plotter
present
process
produc
program
provis
put
regrett
represent
retriev
scale
schroeder
techniqu
tone
wide
.I 1930
algorithm
analysi
appli
base
bound
cacm
compar
consecut
core
covey
effici
entir
equal
establish
extrem
februari
fortran
fourier
function
gener
high
import
kruskal
librari
line
literatur
macpherson
maintain
meet
mention
method
moder
modulu
need
number
occur
paper
portabl
prevent
probabl
program
provid
qualiti
random
requir
small
sort
standard
subroutin
suffic
tupl
typic
univers
.I 1931
accuraci
applic
arithmet
bound
cacm
chebyshev
compar
comput
determin
effect
error
evalu
expect
februari
form
function
hansen
hasen
interv
matrix
method
paper
present
program
propos
recent
result
run
set
show
shown
smith
straightforward
system
test
time
.I 1932
appear
approxim
cacm
calcul
call
determin
error
februari
fit
good
initi
king
logarithm
measur
newton
obtain
optim
phillip
problem
rel
result
root
shown
simplifi
squar
start
type
valu
.I 1933
algorithm
arithmet
bit
bogyo
cacm
code
comput
construct
cycl
evalu
extend
factor
februari
gener
greater
increas
largest
lehmer
length
limit
mersenn
method
modular
modulo
number
payn
present
prime
primit
problem
produc
pseudo
quick
rabung
random
root
techniqu
.I 1934
accumul
algorithm
arithmet
cacm
choic
comput
descript
drawn
evalu
express
februari
graph
manner
need
number
order
present
problem
reduc
redziejowski
repres
represent
solv
specif
straightforward
theori
tree
.I 1935
arora
binari
cacm
dent
develop
document
februari
inform
list
mathemat
mean
method
model
natur
number
offer
potenti
random
randomli
receiv
recov
retriev
search
system
techniqu
trial
varianc
.I 1936
averag
binari
cacm
capac
case
chain
changeabl
characterist
close
code
compromis
comput
consid
construct
cost
defin
determin
develop
digit
doubli
effect
entir
express
fast
februari
filial
final
frequent
function
gener
guarante
implement
improv
length
level
lie
limit
method
minimum
node
number
obtain
organ
paper
patt
priori
procedur
properti
prove
reachabl
relax
requir
respect
restrict
search
serial
set
shown
signific
simpl
slow
storag
structur
studi
suffici
suggest
sussenguth
termin
time
total
treat
tree
updat
variabl
.I 1937
cacm
coda
command
custom
dai
data
design
displai
easi
elli
februari
format
gener
graph
languag
mansfield
mean
orient
paper
produc
public
readi
request
retriev
statement
system
tabl
user
.I 1938
articl
cacm
criteria
defin
difficult
essenti
evalu
full
januari
level
make
multiaccess
perform
permit
quantit
resourc
share
stimler
successfulli
system
termin
time
user
util
.I 1939
accept
aspect
base
block
cacm
chomski
comput
constrain
creat
devic
direct
discuss
english
form
fortran
frequent
friedman
gener
grammar
ibm
input
insert
interest
iv
januari
lexic
linguist
long
model
noam
offer
part
partial
phase
phrase
power
practic
present
problem
produc
program
pure
random
readi
restrict
satisfi
sentenc
simpl
solut
structur
subtre
syntax
system
theori
transform
tree
underli
unifi
user
written
.I 1940
algorithm
cacm
calcul
deriv
horner
januari
polynomi
scheme
smith
valu
.I 1941
algorithm
cacm
distribut
field
januari
.I 1942
algorithm
cacm
equat
find
function
januari
mesztenyi
solut
unknown
vandergraft
.I 1943
algorithm
cacm
complet
ellipt
farka
integr
januari
.I 1944
cacm
januari
levin
student
.I 1945
advanc
applic
arden
bibliographi
cacm
comput
consid
cours
discuss
empir
experiment
extens
formal
gener
good
graduat
head
import
includ
januari
matter
need
obtain
outlin
paper
ph
program
refer
relat
role
scienc
se
sequenc
subject
train
.I 1946
accuraci
adler
algorithm
bezout
cacm
case
caus
choic
coeffici
collin
comput
conclus
consider
depend
detail
determin
displai
elimin
equat
error
excel
extent
extran
factor
faster
implement
introduc
januari
kei
ku
memori
narrow
numer
perform
polynomi
preliminari
problem
propag
real
regard
repetit
report
requir
respect
result
round
sampl
show
solv
speed
stabil
step
studi
superior
system
test
truncat
univari
variabl
.I 1947
analyz
appli
cacm
code
common
compil
control
data
domin
effici
elimin
execut
express
flow
fortran
global
identif
implement
improv
indic
januari
loop
lowri
medlock
method
necessarili
object
optim
os
program
relationship
statement
time
transform
.I 1948
algorithm
appli
applic
area
automorph
bibliographi
cacm
calculu
cannon
charact
combinatori
commut
comput
contrast
coset
divers
enumer
exist
extens
finit
group
import
includ
increasingli
januari
larg
lattic
manipul
numer
obtain
present
problem
program
rang
result
simpl
subgroup
survei
symbol
system
tabl
theori
.I 1949
assumpt
cacm
comput
decemb
finit
intellectu
isol
scientist
wagner
.I 1950
binari
cacm
data
decemb
effici
handl
raduchel
.I 1951
approxim
cacm
character
commun
comput
data
decemb
decompos
describ
discret
discuss
distribut
element
elementari
estim
examin
exponenti
fuch
gamma
gener
independ
interact
interest
jackson
model
multiaccess
oper
process
random
robust
sens
shown
studi
system
traffic
underli
user
variabl
.I 1952
algorithm
cacm
decemb
index
subject
.I 1953
algorithm
cacm
decemb
ei
exponenti
integr
redish
.I 1954
algorithm
cacm
decemb
eigenvalu
eigenvector
matrix
real
stewart
symmetr
.I 1955
cacm
characterist
decemb
mathieu
sale
solut
valu
.I 1956
algorithm
analysi
appli
black
cacm
calcul
combin
configur
convent
core
correl
cpu
data
decemb
defin
deriv
displai
equat
explicit
fill
formula
found
graphic
hardwar
includ
involv
length
logarithm
mass
merg
minim
normal
numer
optimum
order
paramet
parameter
proport
rang
ratio
read
record
result
root
seek
short
simpl
size
sort
storag
sum
tabl
take
term
time
total
transcendent
transfer
unit
wide
yield
.I 1957
ad
algorithm
arriv
cacm
construct
decemb
defin
deriv
effici
evalu
express
final
gener
handl
involv
list
oper
parallel
process
result
set
shapiro
subexpress
system
.I 1958
adapt
addit
base
cacm
common
compar
comput
decemb
error
float
fortran
gill
heart
improv
includ
incomplet
kutta
languag
method
note
numer
obtain
oper
point
present
reduc
round
rung
scheme
shown
signific
significantli
statement
thompson
version
.I 1959
algorithm
aris
associ
base
cacm
code
concept
condit
conflict
construct
data
decemb
design
dpl
gener
illustr
implement
inform
interrupt
introduc
item
languag
larg
manag
morgan
newli
organ
present
process
program
propos
resolv
routin
schedul
share
structur
supervisori
system
.I 1960
abil
account
alloc
basic
behavior
betourn
bouleng
cacm
decemb
design
detail
dynam
emphasi
esop
featur
ferri
idea
implement
includ
inform
kaiser
krakowiak
main
manag
memori
mossier
multiaccess
oper
parallel
polici
primit
principl
process
recent
relationship
resourc
schedul
share
system
take
underli
user
.I 1961
algorithm
applic
arc
attribut
bound
cacm
circuit
complex
decemb
discuss
easili
effici
elementari
empir
exhaust
extens
find
give
graph
length
modifi
number
present
proof
relat
rigor
search
speed
theoret
tiernan
undirect
vertic
.I 1962
be
cacm
carefulli
compos
comput
control
creat
ddp
decemb
describ
disk
edit
effect
environ
fast
feedback
function
gener
groov
high
hour
human
import
input
interact
link
long
machin
make
man
mathew
moor
multipl
nurtur
oper
period
person
process
produc
program
purpos
rate
reaction
real
reproduc
sampl
small
sound
store
suffici
synthes
system
time
tool
typic
varieti
.I 1963
cacm
condit
matric
novemb
number
pei
rokn
.I 1964
behavior
bernstein
cacm
comment
model
novemb
program
set
work
.I 1965
arithmet
cacm
comput
correct
ehrman
novemb
.I 1966
argument
cacm
function
gener
method
novemb
valu
wilson
.I 1967
algorithm
bratlei
cacm
complex
improv
novemb
prime
produc
.I 1968
algorithm
cacm
eigenvalu
eigenvector
gener
knight
matrix
mersereau
novemb
real
.I 1969
algorithm
cacm
effici
emden
increas
novemb
quicksort
van
.I 1970
american
cacm
cpi
inform
interchang
magnet
nation
novemb
nrzi
pe
propos
standard
tape
track
unrecord
.I 1971
american
cacm
cpi
encod
inform
interchang
magnet
nation
novemb
phase
propos
record
standard
tape
.I 1972
algorithm
avoid
built
cacm
chenei
collector
compact
copi
garbag
lisp
list
need
nonrecurs
novemb
partial
present
recurs
scheme
simpl
structur
suitabl
track
.I 1973
algorithm
attribut
bell
cacm
code
data
desir
effici
exhaust
hash
hint
implement
kaman
linear
lookup
method
need
novemb
perform
possess
present
probe
quotient
shown
simpl
specif
time
.I 1974
accept
aid
analysi
cacm
case
code
compil
conrow
control
deck
develop
discov
earli
econom
error
execut
expect
featur
format
full
give
indent
insert
logic
major
maxim
mode
neater
novemb
number
oper
optim
option
output
pattern
pl
produc
program
provid
record
reformat
reformatt
run
smith
sourc
stage
statement
structur
time
trial
unit
usag
user
util
version
.I 1975
adjust
algebra
algorithm
cacm
cipher
depend
dividend
divis
divisor
equal
final
gener
greater
initi
integr
method
mifsud
multipl
novemb
oper
operand
origin
perform
posit
precis
present
quotient
relationship
replac
trial
uniqu
.I 1976
access
advantag
appear
attribut
avoid
bucket
cacm
case
combin
comput
convent
degener
deriv
design
drop
elimin
exist
fals
field
file
gener
index
input
intersect
invert
kei
long
lum
method
multi
multipl
novemb
number
organ
paper
perform
popular
qualifi
queri
record
redund
replac
requir
retriev
satisfi
scheme
secondari
set
similarli
singl
store
string
subset
time
trade
valu
work
.I 1977
approxim
auxiliari
cacm
coeffici
combin
condit
convex
data
determin
develop
displai
error
exampl
function
graphic
impos
includ
infin
interact
lafata
linear
mean
minim
monoton
norm
novemb
program
rosen
select
spline
system
user
.I 1978
accru
achiev
advantag
advent
area
cacm
capabl
comput
conclus
consider
data
design
develop
differenti
dimens
discuss
easi
empir
equat
fast
field
fit
futur
gener
graphic
greatli
human
implement
insight
interact
interfac
line
mathemat
numer
obtain
octob
ordinari
paper
peg
power
present
problem
program
purpos
restrict
result
routin
share
simpli
simplifi
smith
solv
solver
special
squar
system
take
termin
time
turnaround
user
visual
work
.I 1979
algorithm
cacm
invers
laplac
numer
octob
stehfest
transform
.I 1980
algorithm
cacm
effici
minim
octob
peto
sort
storag
.I 1981
algorithm
cacm
curv
holmgren
integr
normal
octob
.I 1982
algorithm
cacm
havi
integr
modifi
octob
wallick
.I 1983
algorithm
cacm
octob
seppanen
span
tree
.I 1984
algorithm
cacm
convers
date
octob
stone
tableless
.I 1985
algorithm
cacm
chang
gill
integ
octob
problem
program
.I 1986
cacm
hill
octob
student
.I 1987
cacm
hill
octob
student
.I 1988
action
answer
assembl
cacm
compil
complex
compon
decid
defin
describ
earlei
extend
formal
interact
interpret
languag
metaphas
octob
present
processor
produc
program
question
set
system
translat
.I 1989
action
advantag
allow
analys
analysi
arc
augment
briefli
build
cacm
condit
constitu
copi
deep
detail
discuss
exampl
experiment
grammar
guid
illustr
implement
inform
languag
meaningless
model
natur
network
obtain
octob
pars
power
produc
reorder
represent
restructur
rule
select
semant
sentenc
structur
system
take
transform
transit
type
wood
.I 1990
algorithm
cacm
constant
dunham
numer
septemb
.I 1991
automaton
automorph
bavel
cacm
gener
number
septemb
singli
.I 1992
bell
cacm
comment
lamport
septemb
.I 1993
algorithm
cacm
codi
coulomb
function
paciorek
regular
septemb
wave
.I 1994
algorithm
cacm
decis
dial
septemb
tabl
translat
.I 1995
abdali
algorithm
arbitrari
cacm
precis
septemb
seri
special
summat
.I 1996
algorithm
cacm
hyperbol
mccall
pde
septemb
smith
system
.I 1997
actual
analysi
approxim
assum
asymptot
averag
bound
cacm
choic
compar
comparison
comput
consid
contribut
decreas
deriv
distribut
easi
effici
element
emden
express
form
formula
gener
hoar
implement
impli
increas
interv
log
main
median
method
need
number
numer
origin
paper
partit
percent
present
probabl
program
quicksort
random
sampl
save
septemb
show
shown
simpl
singl
term
test
time
turn
van
version
.I 1998
accumul
bound
cacm
comparison
complex
ehrlich
eighth
elimin
error
extend
fast
gaussian
half
invers
made
matrix
product
real
round
septemb
shown
system
versu
.I 1999
approxim
cacm
classic
consid
divid
divis
gener
heron
initi
iter
machin
optim
polynomi
prefer
problem
root
scheme
septemb
slow
squar
start
tabul
wilson
.I 2000
appli
boundari
cacm
context
control
equat
estim
euler
fast
formul
give
goodman
improv
interpol
kimbl
lagrang
lanc
method
nearli
nonlinear
numer
optim
point
present
problem
publish
quantit
recent
result
septemb
signific
solut
variat
.I 2001
cacm
differenti
equat
integr
moler
numer
point
remov
root
septemb
simpl
singular
solomon
squar
trick
vanish
.I 2002
action
ad
alphabet
amesplot
artist
attribut
ax
axi
base
basic
cacm
charact
coastlin
combin
common
complex
configur
consist
construct
contain
convent
data
demonstr
descript
design
displai
divers
effect
element
enabl
entir
extens
formal
formul
freeli
fulli
function
handl
hardwar
higher
hirschsoln
implement
independ
inform
instal
integr
interact
interspers
label
languag
layout
level
locat
make
manufactur
map
marker
minimum
modul
multipl
neat
outlin
painless
plot
posit
produc
project
replac
rotat
scale
septemb
shift
simpl
softwar
specifi
structur
subplot
suppli
syntax
system
tablet
text
transform
type
user
util
varieti
.I 2003
adopt
aid
applic
assist
base
bracchi
cacm
characterist
circuit
coif
command
comput
constitut
control
criteria
describ
descript
design
effici
emphasi
examin
extend
extens
familiar
featur
fortran
function
gener
graphic
hand
high
imol
intend
interact
interfac
languag
learn
level
main
manipul
monitor
need
oper
order
orient
perform
present
problem
process
project
provid
septemb
simpl
softwar
somalvico
specif
step
suffici
system
type
user
variabl
.I 2004
achiev
algorithm
approach
bouknight
cacm
cdc
compar
comput
coordin
descript
develop
dimension
extens
gener
graphic
half
histori
illinoi
illumin
implement
increas
laboratori
lead
polygon
posit
present
procedur
produc
result
run
scienc
septemb
signific
sourc
speed
structur
surfac
system
tone
univers
utah
variabl
warnock
.I 2005
american
august
cacm
nation
propos
revis
standard
.I 2006
american
august
cacm
kerpelman
nation
propos
standard
.I 2007
algorithm
august
cacm
polici
revis
.I 2008
algorithm
august
cacm
formula
gaussian
jr
quadratur
wise
.I 2009
august
cacm
proll
simpson
.I 2010
algorithm
august
cacm
mckai
polynomi
symmetr
unitari
.I 2011
algorithm
august
cacm
function
hubner
order
sequenc
walsh
.I 2012
algorithm
august
binari
cacm
function
hubner
order
walsh
.I 2013
algorithm
august
cacm
function
hubner
rademach
.I 2014
algorithm
august
cacm
field
function
linear
minim
search
.I 2015
arboresc
august
cacm
correct
correspond
cost
defin
demonstr
develop
evan
floyd
formul
gener
grammar
graph
ichbiah
invers
mechan
merg
minimum
modifi
mors
obtain
optim
parser
preced
problem
product
techniqu
valid
weak
.I 2016
aid
arrai
august
cacm
channel
clock
combin
comput
data
demand
detail
devis
discuss
effect
facil
gener
gintel
hardwar
implement
includ
individu
insight
instrument
interest
lack
measur
multic
multiprogram
page
probe
program
prototyp
provid
purpos
record
saltzer
special
system
tool
util
.I 2017
analysi
arriv
august
brawn
broad
cacm
characterist
conceiv
concept
concern
context
descript
dynam
effort
environ
experiment
explor
extens
gain
guidelin
gustavson
ibm
implement
insight
machin
mankin
measur
memori
obtain
order
page
part
perform
present
procedur
program
project
research
result
set
sort
studi
system
undertaken
virtual
write
.I 2018
access
advantag
august
avoid
cacm
cluster
computation
dai
entri
experienc
form
full
half
hash
integ
length
linear
method
origin
point
present
prime
quadrat
residu
scatter
search
separ
shown
simpl
storag
sweep
tabl
.I 2019
achiev
amount
appli
august
base
cacm
charact
class
clerk
convex
degre
digit
evalu
famili
geometr
hand
hull
includ
involv
method
moment
nagi
normal
numer
obtain
overlap
pattern
principl
print
project
publish
quadrilater
respect
sale
shear
size
squar
standard
techniqu
term
transform
tuong
versu
.I 2020
adjust
advantag
alloc
answer
applic
attempt
attent
august
broader
cacm
clarifi
commun
complex
comput
concern
consid
consider
demonstr
disadvantag
discuss
dynam
effect
environ
extent
fit
flexibl
fluctuat
frequent
gener
harm
highlight
illustr
insul
led
lot
made
make
manner
mean
mechan
misconcept
misunderstand
mold
nielsen
number
oper
order
paper
persist
price
procedur
purpos
ration
recent
resourc
serv
subject
suggest
system
time
user
widespread
.I 2021
approach
axiomat
cacm
comment
hunt
juli
program
.I 2022
anomali
cacm
juli
note
page
pomeranz
.I 2023
baecker
base
cacm
data
deadlock
juli
note
.I 2024
cacm
comment
juli
low
millstein
paper
sattlei
.I 2025
algorithm
analysi
cacm
factori
juli
modifi
quadratur
romberg
sale
student
varianc
.I 2026
algorithm
cacm
exponenti
integr
juli
ng
.I 2027
algorithm
bessel
brai
cacm
function
juli
kind
ricatti
.I 2028
algorithm
bradlei
cacm
common
divisor
greatest
integ
juli
multipli
.I 2029
algorithm
cacm
exponenti
integr
juli
paciorek
.I 2030
addit
algorithm
amount
analys
analysi
appear
basic
block
cacm
canon
compar
complementari
complet
context
degre
depend
deriv
differ
discuss
essenti
find
form
gener
grammar
includ
infinit
involv
juli
kuno
loop
memori
modifi
paper
pars
parser
present
previou
requir
respect
rewrit
sensit
singl
space
store
system
time
trade
type
version
wood
.I 2031
acm
algorithm
appear
arithmet
bound
bradlei
cacm
case
comm
common
construct
divisor
euclidean
extend
find
fortran
gcd
greatest
integ
iter
juli
lame
linear
locat
minim
multipli
number
oper
present
program
set
storag
theorem
version
.I 2032
cacm
coffman
defin
deriv
distribut
ev
examin
explain
function
gener
hash
illustr
jr
juli
length
method
past
path
probabl
propos
relat
result
structur
studi
tree
type
.I 2033
accomplish
allow
amount
analysi
applic
area
bloom
cacm
code
commiss
compar
comput
conjunct
consid
consum
convent
core
data
demonstr
discuss
envisag
error
examin
exploit
factor
fals
feasibl
fraction
frequenc
hash
identifi
illustr
improv
increas
inform
intend
involv
juli
larg
member
messag
method
nonmemb
number
off
paper
paradigm
perform
permit
possibl
problem
reduc
reduct
reject
requir
resid
secondari
set
size
small
smaller
space
test
time
toler
trade
.I 2034
approach
bootstrap
cacm
characterist
comput
discuss
easili
effort
flexibl
implement
juli
level
machin
made
man
mobil
program
provid
run
sequenc
stage
success
summar
system
techniqu
vari
wait
week
wide
.I 2035
access
ad
address
aid
algorithm
assembl
augment
automat
cacm
charact
command
continu
convers
countri
criteria
delet
design
develop
directli
disk
displai
edit
effici
elast
environ
establish
facil
featur
file
focus
full
handl
held
influenc
interview
item
juli
lap
layer
limit
linc
line
logic
machin
mainten
manuscript
memori
minim
outlin
peopl
perform
period
posit
premark
prepar
prioriti
program
provid
randomli
run
scope
scroll
set
similar
simpli
small
sophist
specif
standard
string
strongli
structur
system
tape
techniqu
termin
text
uniform
user
wilk
word
work
.I 2036
accomplish
argu
cacm
command
commun
comput
consol
control
conversation
embed
environ
execut
exist
facil
function
gener
grant
help
implement
inform
interact
invok
juli
keyboard
languag
limit
man
mean
noninteract
output
overcom
permit
pertin
present
process
program
propos
receiv
respons
set
share
string
suggest
system
task
time
type
.I 2037
algorithm
cacm
chase
june
permut
repetit
set
.I 2038
algorithm
cacm
chase
combin
june
object
.I 2039
algorithm
cacm
dixon
eberlein
function
ii
june
matrix
perman
shriver
squar
.I 2040
algorithm
cacm
june
modifi
quadratur
romberg
wallick
.I 2041
algorithm
cacm
chandler
harrison
june
shellsort
.I 2042
algorithm
arrai
cacm
certif
correct
form
illustr
june
london
practic
proof
prove
sort
take
treesort
.I 2043
algorithm
cacm
eigenvalu
eigenvector
june
matrix
real
stewart
symmetr
.I 2044
algorithm
cacm
chase
june
permut
repetit
set
.I 2045
algorithm
cacm
chase
combin
june
object
.I 2046
activ
appli
applic
ari
aspect
bank
base
cacm
chang
codd
concept
consist
data
discuss
exist
extern
form
format
futur
gener
growth
inadequaci
infer
inform
intern
introduc
june
know
larg
logic
machin
model
natur
need
network
noninferenti
normal
oper
organ
problem
program
prompt
protect
provid
queri
redund
relat
remain
report
represent
result
satisfactori
section
servic
share
slightli
solut
store
structur
sublanguag
suppli
system
termin
traffic
tree
type
unaffect
univers
updat
user
.I 2047
acceler
algorithm
cacm
converg
degrad
diagon
direct
directli
drawback
effect
eigenvalu
element
implicit
incorpor
iter
june
loos
matric
matrix
mean
method
origin
paper
present
qr
retard
sequenc
shift
small
stewart
subtract
symmetr
tridiagon
unnecessarili
.I 2048
accuraci
adapt
approxim
base
cacm
compar
comparison
cote
definit
dx
evalu
hillstrom
integr
integrand
june
newton
peak
perform
point
quadratur
rel
report
routin
rule
scheme
set
.I 2049
accur
altern
bound
cacm
comparison
consider
describ
error
float
june
linz
method
number
paper
point
propag
round
sensit
set
show
standard
sum
summat
.I 2050
analysi
analyz
applic
approxim
automat
cacm
compar
content
correct
coverag
damerau
degre
favor
half
harvard
identif
june
languag
method
natur
object
occurr
pars
preliminari
process
produc
relev
requir
sampl
semant
show
stringent
studi
subject
syntact
text
total
unambigu
unrestrict
variabl
verb
.I 2051
align
arbitrarili
arrang
articl
assign
assist
cacm
chosen
cognat
compar
correspond
count
cutoff
data
determin
explain
found
frantz
frequenc
function
genet
hypothet
illustr
input
investig
june
languag
limit
linguist
list
occurr
output
pair
pl
point
portion
practic
process
program
regular
rel
relat
separ
show
small
sort
sound
suspect
tabul
techniqu
total
type
us
word
.I 2052
activ
addit
algorithm
cacm
compon
conflict
connect
constraint
corneil
correspond
defin
event
found
gotlieb
graph
grime
independ
june
linear
meet
reduc
relat
schedul
set
space
time
treat
undirect
.I 2053
algorithm
ambigu
attempt
author
cacm
clarifi
code
comparison
compil
comput
consequ
convers
convert
decis
detect
develop
diagnost
directli
discuss
economi
entri
execut
featur
form
fortran
gener
go
ibm
implement
import
imposs
inadequ
inform
intermedi
iv
june
limit
literatur
made
merit
method
mix
muthukrishnan
pinpoint
point
present
program
proper
propos
rajaraman
regard
resolv
result
shown
simplic
step
storag
tabl
time
translat
tree
.I 2054
accommod
algebra
audio
cacm
compil
complet
comput
condit
consid
depend
detail
devic
digit
econom
elder
error
experiment
feasibl
fortran
give
handl
ibm
implement
input
june
line
logic
machin
object
ordinari
output
present
process
processor
program
provid
rate
recognit
requir
resourc
respons
restrict
result
sequenc
set
show
simplifi
speaker
specif
spoken
system
techniqu
telephon
termin
time
user
vocabulari
voic
word
.I 2055
algorithm
cacm
lachenmai
matrix
perform
rectangular
situ
subroutin
transposit
.I 2056
algorithm
cacm
gomori
proll
.I 2057
algorithm
angl
cacm
knop
random
solid
uniform
vector
.I 2058
algorithm
brebner
cacm
laflin
matrix
rectangular
situ
transposit
.I 2059
algol
applic
area
cacm
comparison
compil
control
crespi
defin
delet
driven
extens
formul
graph
insert
intersect
languag
link
list
mean
morpurgo
network
node
oper
problem
reghizzi
repres
represent
research
syntact
syntax
theori
traffic
translat
travers
treat
union
.I 2060
accept
access
address
affect
algorithm
approach
arbitrari
assign
base
briefli
cacm
call
characterist
complet
compon
compound
comput
concept
construct
context
control
coroutin
data
declar
discuss
equival
exampl
exist
experiment
extens
formal
function
gedanken
gener
give
illustr
implicit
indirect
insur
intern
introduc
label
languag
limit
logic
meaning
mechan
oper
parallel
permiss
permit
possess
principl
process
program
quasi
refer
regardless
relat
represent
result
reynold
simpl
structur
treat
turn
type
typeless
unorthodox
valu
variabl
varieti
.I 2061
accept
algorithm
arbitrari
automata
bound
cacm
carri
claim
class
compil
connect
construct
context
defin
definit
design
discuss
ed
essenti
exhaust
exist
experi
final
free
gain
gener
grammar
introduc
languag
light
loeckx
notion
paper
parser
part
pushdown
recal
reduct
run
simultan
structur
studi
util
work
.I 2062
achiev
analysi
appli
applic
burdick
cacm
calcul
compar
comput
cost
data
experi
fix
gener
graham
inventori
item
level
method
model
multi
naylor
precis
procedur
requir
sampl
sasser
sequenti
simul
size
statist
time
versu
.I 2063
cacm
equat
errata
translat
vere
.I 2064
applic
arrai
cacm
code
codeword
compil
content
cumbersom
data
describ
descript
develop
devis
dimension
effici
element
featur
form
gener
geni
higher
hyperstructur
implement
impos
inform
interpret
length
locat
matric
multidimension
need
oper
provid
represent
restrict
scalar
sitton
sophist
standard
storag
structur
system
todai
vector
word
.I 2065
analysi
appli
applic
biomed
cacm
call
chromosom
commun
comput
conceiv
consid
data
defin
descript
develop
displai
emphasi
form
format
hode
idea
imag
intend
interact
karyotyp
laboratori
line
machin
mainten
man
manag
manipul
marvin
mathemat
method
minski
mit
oper
pictur
preliminari
produc
program
prototyp
separ
softwar
special
structur
symbol
system
task
transform
varieti
vehicl
wide
.I 2066
algol
april
cacm
construct
knight
paramet
procedur
.I 2067
april
cacm
comment
devri
lawler
.I 2068
april
cacm
comment
demand
multiprogram
page
smith
strategi
.I 2069
april
cacm
comment
heess
jr
mason
paper
wallac
.I 2070
april
cacm
formal
harari
hsiao
inform
retriev
system
.I 2071
algorithm
april
bo
cacm
einarsson
filon
fosdick
quadratur
.I 2072
algorithm
april
cacm
cook
modifi
quadratur
romberg
.I 2073
algorithm
april
cacm
enumer
guignard
implicit
linear
program
solut
variabl
.I 2074
algorithm
april
cacm
lyness
sqank
.I 2075
algorithm
april
cacm
discret
equat
method
newton
nonlinear
pankiewicz
simultan
solv
system
.I 2076
algorithm
april
arc
basi
cacm
cardin
comput
construct
cubic
easi
mesh
minim
nilson
nonperiod
period
permit
present
procedur
requir
simpl
spline
storag
suffic
trade
uniform
.I 2077
ad
april
cacm
cyclic
issu
jr
judg
major
pomeranz
present
problem
report
result
simul
weil
.I 2078
allow
altern
april
area
arrang
autom
cacm
call
compar
comput
consist
data
defin
deriv
distanc
eastman
function
graphic
involv
languag
object
plan
primarili
problem
represent
requir
space
structur
.I 2079
april
cacm
code
comput
machin
multiprogram
organ
wirth
.I 2080
alloc
april
cacm
commun
control
cooper
creation
describ
divers
dynam
environ
es
execut
extend
fundament
handl
hansen
hierarchi
input
multiprogram
nucleu
oper
output
paper
parallel
philosophi
primit
process
program
requir
resourc
schedul
set
simul
structur
suit
system
uniformli
.I 2081
algorithm
april
areext
bayer
cacm
calculi
calculu
call
complet
comput
consid
cumul
data
develop
effici
end
equival
express
find
form
found
high
intent
introduc
investig
languag
level
manipul
mathemat
matric
matrix
memori
normal
obtain
oper
paper
program
result
save
sens
sequenc
space
special
structur
suit
suitabl
superflu
symbol
util
witzgal
.I 2082
access
answer
april
automat
basi
cacm
call
concret
cross
defin
direct
document
facil
formal
format
found
grammar
idea
identifi
illustr
index
languag
literatur
mill
modifi
object
part
phrase
pl
program
programm
provid
question
result
retriev
small
storag
structur
syntact
syntax
trigger
type
understand
wai
want
work
.I 2083
allow
april
automat
base
cacm
cdc
common
commun
contain
control
creation
data
declar
definit
desalvio
dimens
easi
environ
equival
form
fortran
gener
ibm
implement
intern
invalu
larg
method
modifi
program
prove
purdi
rau
routin
scale
seri
system
type
user
.I 2084
ambigu
cacm
complement
context
free
inher
languag
march
maurer
note
.I 2085
anomali
cacm
comment
dempster
march
page
.I 2086
cacm
convert
decim
hexadecim
kaila
march
method
.I 2087
cacm
march
number
pager
permut
system
.I 2088
algorithm
brai
cacm
march
netflow
witzgal
.I 2089
algorithm
cacm
march
number
prime
rapp
scott
.I 2090
algebra
algorithm
cacm
expans
express
levin
march
symbol
.I 2091
briefli
cacm
cardena
character
comput
construct
consum
continu
conveni
convent
cumbersom
design
differenti
easi
equat
high
highlight
karplu
languag
learn
level
march
method
orient
outlin
partial
pdel
portion
practic
problem
signific
solv
studi
summar
system
time
translat
version
work
.I 2092
algorithm
answer
aspect
base
burger
cacm
capabl
complex
conclud
data
deduct
detail
develop
discuss
effect
emploi
enabl
exampl
exemplifi
facilit
featur
form
formal
greatli
iii
illustr
infer
inform
languag
larg
lisp
made
march
natur
oper
organ
practic
present
pro
procedur
process
properti
protosynthex
question
relat
requir
schwarcz
semant
share
shown
simmon
structur
system
time
top
totyp
work
written
.I 2093
adapt
assumpt
base
behavior
cacm
choic
comparison
consid
constant
curvatur
demonstr
differ
domin
error
estim
factor
found
improv
inclus
independ
integr
make
march
noninteg
parametr
polynomi
power
procedur
profus
realist
rule
schweikert
search
simpl
singular
slightli
stop
strategi
studi
trapezoid
usual
.I 2094
algorithm
applic
approxim
base
cacm
character
consid
convent
difficulti
due
exampl
exchang
gener
give
illustr
lead
mainli
march
method
minimax
nonlinear
osborn
paper
permit
problem
properti
reme
result
satisfactori
solut
solv
special
specialist
successfulli
type
watson
.I 2095
algol
batson
burrough
cacm
certainli
comput
con
design
discuss
distribut
dition
especi
featur
independ
influenc
instal
ju
larg
march
measur
number
oper
organ
page
percent
relev
respect
result
routin
scheme
segment
size
small
strike
system
util
variabl
wood
word
.I 2096
artifici
assign
back
base
cacm
comput
conclus
decis
demonstr
desir
dixon
experi
face
field
function
futur
game
highest
import
improv
inform
intellig
kalah
lack
lisp
lowest
make
march
max
min
mini
model
node
option
paper
plai
principl
procedur
program
purpos
search
serv
signific
significantli
slagl
statist
successor
superior
tree
uncertainti
valu
wide
work
written
.I 2097
appear
begin
cacm
clear
convers
cost
design
develop
discuss
eas
econom
elementari
experi
extend
faculti
fenichel
guid
improv
instruct
involv
languag
loos
make
march
mind
minim
mit
offer
outlin
pedagog
profound
program
reimplement
research
result
similar
skill
straightforward
student
success
system
teach
term
tutori
weizenbaum
yochelson
.I 2098
algorithm
cacm
februari
hill
loughhead
probabl
student
test
.I 2099
algorithm
cacm
eigen
eigenvalu
februari
gener
knobl
matrix
real
vector
.I 2100
algorithm
barrodal
cacm
februari
ortho
.I 2101
aco
algorithm
bx
cacm
februari
fit
spath
squar
.I 2102
algorithm
cacm
data
exponenti
februari
fit
spath
.I 2103
algorithm
cacm
februari
gener
partit
restrict
white
.I 2104
algorithm
cacm
doubli
februari
number
partit
restrict
white
.I 2105
beyer
cacm
comput
data
demonstr
descript
design
draw
effect
effici
environ
februari
flowchart
graphic
input
interact
interpret
iter
larg
method
modif
numer
oper
origin
perform
process
program
represent
requir
robin
sampl
scale
scope
signal
simul
specifi
success
system
termin
transmit
user
.I 2106
abl
access
aid
allow
belief
cacm
call
capabl
chosen
come
commit
comput
concept
construct
creativ
criteria
depth
design
diagnost
document
educ
effort
equip
evalu
experi
explain
expos
exposit
extens
februari
fulfil
graduat
great
green
inform
interest
interrupt
issu
languag
led
level
machin
manag
manufactur
martin
meet
moulton
ness
outstand
page
primer
prioriti
prism
problem
provid
pursu
rais
readi
refer
relat
requir
school
seful
signific
simul
softwar
solut
spuriou
student
system
technolog
understand
undu
year
.I 2107
analyt
base
bell
cacm
cluster
code
comparison
discuss
elimin
empir
februari
hash
ineffici
made
method
present
previou
quadrat
quotient
secondari
.I 2108
address
cacm
calcul
characterist
combin
detail
discuss
effici
februari
flowchart
import
includ
jone
merg
principl
program
propos
sort
step
techniqu
variat
yield
.I 2109
address
avoid
cacm
class
cluster
collis
complement
determin
easili
encount
entir
februari
half
hash
limit
linear
method
number
occur
previous
prime
properti
quadrat
radk
research
residu
search
set
shown
size
storag
suggest
tabl
.I 2110
algorithm
appear
bottom
bound
cacm
class
comparison
context
earlei
effici
empir
familiar
februari
free
gener
grammar
griffith
includ
known
knuth
languag
larg
length
linear
pars
petrick
practic
program
proport
run
similar
string
studi
superior
time
top
unambigu
.I 2111
algorithm
cacm
class
code
compil
consider
correct
debug
decreas
effici
error
februari
includ
incorpor
inform
keyword
limit
machin
morgan
number
oper
organ
perform
present
program
programm
restrict
run
sampl
save
semant
shown
special
spell
symbol
syntax
system
tabl
techniqu
time
.I 2112
automata
cacm
case
consist
context
deriv
describ
equat
express
februari
finit
form
formal
framework
free
input
interact
languag
left
limit
meali
mean
pars
problem
procedur
pushdown
recognit
semant
sensit
set
special
specif
stack
state
string
syntax
transduct
translat
treat
vere
.I 2113
altogeth
analyz
area
binari
bit
byte
cacm
classif
come
compos
comput
concaten
data
descript
determin
elimin
emphasi
english
exampl
experiment
express
februari
flow
form
frequent
fulli
function
glasersfeld
grammar
hierarch
implement
individu
inform
input
interpret
involv
item
larg
linear
list
locat
make
mask
match
mean
method
minimum
multistor
oper
parser
pattern
present
procedur
process
provid
reduc
repres
scale
search
sentenc
shift
singl
state
string
structur
substanti
syntact
system
time
trace
von
.I 2114
algorithm
cacm
concept
decod
defin
deriv
directori
februari
formal
frequent
gener
hsiao
index
inform
invert
keyword
multilist
present
provid
record
retriev
sequenti
structur
system
.I 2115
cacm
fortran
gener
januari
number
payn
pseudorandom
tausworth
.I 2116
american
cacm
inform
interchang
januari
nation
perfor
propos
roll
standard
tape
.I 2117
american
cacm
calen
dar
data
date
interchang
januari
machin
nation
propos
represent
standard
.I 2118
algorithm
cacm
effici
griffin
januari
minim
redish
sort
storag
.I 2119
algorithm
cacm
deriv
gautschi
januari
klein
.I 2120
algorithm
cacm
complex
csiev
dunham
januari
prime
produc
.I 2121
algorithm
cacm
januari
mckai
natur
order
partit
.I 2122
algorithm
butler
cacm
gener
januari
number
random
.I 2123
algorithm
cacm
distribut
gener
januari
number
poisson
random
satisfi
schaffer
.I 2124
algorithm
cacm
invers
januari
laplac
numer
stehfest
transform
.I 2125
account
algorithm
approxim
bond
cacm
chosen
comput
connect
constraint
contour
determin
digit
exampl
extract
graph
illustr
imag
januari
ledlei
length
list
method
minim
modifi
montanari
nonlinear
note
obtain
order
perimet
point
polygon
present
problem
program
reduc
scan
sequenc
smooth
solv
subject
take
time
variabl
weak
.I 2126
apprais
base
cacm
categori
effici
experi
extens
flexibl
iron
januari
languag
oper
respect
system
user
util
.I 2127
analysi
answer
applic
approach
aspect
base
begin
cacm
complex
conclud
correspondingli
develop
devis
dictionari
effect
effort
english
entail
entir
entri
evolv
experi
experiment
field
gener
grammar
guid
infer
invent
januari
languag
larg
logic
mean
method
minim
natur
order
paradigm
process
program
question
recent
requir
research
respect
review
scale
seen
semant
simmon
small
string
subset
subtl
summar
syntact
system
techniqu
thousand
.I 2128
algorithm
alloc
applic
cacm
chang
driscol
dynam
effici
gener
handl
head
implement
intend
januari
list
mean
method
minim
mulleri
problem
processor
propos
reduc
resourc
schedul
segment
share
task
time
.I 2129
cacm
co
comput
consid
deriv
differ
equat
error
gautschi
illustr
januari
linear
made
order
propag
recurs
studi
success
.I 2130
aris
automat
base
batch
cacm
circumst
compat
comput
connect
cyclic
discret
equip
execut
frequenc
frequent
gener
ideal
impos
januari
limit
low
manner
multiprogram
overlai
paper
peripher
physic
portion
prefer
processor
program
propos
ramamoorthi
reduc
requir
restrict
segment
share
size
storag
structur
subject
system
techniqu
time
transfer
.I 2131
algorithm
cacm
comput
decemb
gustafson
interpolatori
quadratur
rapid
rule
weight
.I 2132
algorithm
cacm
coeffici
comput
decemb
formula
gustafson
interpol
rapid
.I 2133
algorithm
assign
bourgeoi
cacm
decemb
lassal
matric
problem
rectangular
.I 2134
adapt
algol
algorithm
assign
author
bourgeoi
cacm
decemb
develop
discuss
extens
lassal
matric
munkr
obtain
permit
present
problem
procedur
propos
rectangular
relat
result
silver
size
solut
squar
time
version
.I 2135
algorithm
approxim
attempt
cacm
case
class
close
comput
continu
decemb
develop
formula
function
gener
gustafson
hermitian
includ
interpol
interv
lagrangian
let
linear
made
mechan
polynomi
quadratur
rapid
rule
select
special
wide
.I 2136
blumberg
cacm
decemb
foulk
method
note
point
.I 2137
addit
algorithm
appli
block
cacm
collect
combin
compact
compil
concept
creat
customari
decemb
dynam
effect
elimin
emploi
environ
exhaust
exit
featur
flag
free
garbag
global
introduc
lisp
list
local
make
mean
method
minim
moment
need
number
page
partial
perform
procedur
represent
rochfeld
storag
system
techniqu
total
variabl
.I 2138
abil
access
algorithm
allow
bliss
cacm
code
compil
contribut
cope
data
decemb
definit
design
effici
element
especi
evolutionari
featur
goal
hardwar
highli
host
languag
machin
major
mean
mechan
natur
object
oper
pdp
permit
prime
produc
product
program
provid
ration
realiz
relev
represent
russel
softwar
specif
structur
suitabl
system
term
write
wulf
.I 2139
appropri
cacm
chosen
code
consider
decemb
determin
harrison
hash
implement
low
oper
preced
probabl
satisfi
shown
speed
string
substr
techniqu
test
.I 2140
acm
cacm
combin
commun
condit
cost
curv
decemb
decreas
develop
examin
fraction
group
increas
index
indic
introduc
lum
minim
mullin
name
novemb
paper
partial
permit
retriev
show
space
speed
storag
techniqu
time
tradeoff
updat
usag
.I 2141
akin
algorithm
altern
amidon
applic
avoid
cacm
choic
code
compar
compress
data
decemb
develop
direct
dozen
encod
forest
gener
illustr
map
method
photograph
reduct
relationship
resourc
select
sequenc
string
techniqu
wide
.I 2142
algorithm
analysi
angl
applic
asymmetr
cacm
carlo
decemb
design
desir
determin
digit
dimension
electron
estim
field
find
gordon
grai
herman
import
individu
larg
level
line
medicin
method
micrograph
microscopi
mont
natur
number
particl
photographi
pictur
point
possibl
problem
project
rai
reconstruct
scienc
situat
solv
straight
sum
vari
.I 2143
algorithm
approxim
bolub
cacm
chebyshev
continu
function
novemb
smith
system
.I 2144
accumul
accur
accuraci
ad
addit
algorithm
auxiliari
base
cacm
case
comput
condit
consid
correct
digit
error
expon
final
float
form
full
ibm
malcolm
novemb
number
part
perform
point
qn
rang
rel
split
sum
summat
typic
usual
valu
yield
.I 2145
applic
approach
aramaki
autom
base
board
bring
cacm
circuit
close
closer
compon
computer
connect
consum
design
develop
discret
dual
emploi
error
etch
function
help
heurist
human
ic
import
interest
kawabata
kazuhiko
layer
layout
lee
line
logic
maze
method
novemb
number
packag
path
pattern
percent
perform
point
print
product
program
prone
requir
resistor
respect
run
simul
stage
step
success
tediou
theoret
time
transistor
vital
wire
.I 2146
achiev
addit
algorithm
approxim
base
begin
cacm
close
complic
discuss
dispers
displai
estim
examin
fairli
fourth
half
horizont
improv
logic
minim
modifi
novemb
number
optim
optimum
percent
polyphas
present
procedur
read
requir
shell
simpl
sort
straightforward
string
todai
total
unit
util
write
.I 2147
associ
attain
bachelor
cacm
comput
conduct
continu
cours
data
decemb
degre
educ
foundat
goal
half
hamblen
hardwar
higher
improv
laboratori
lack
made
nation
nearli
need
novemb
offer
past
pierc
plea
point
program
publish
qualiti
recommend
regard
report
review
rosser
scienc
state
statu
studi
support
survei
technolog
test
.I 2148
action
algol
attempt
branquart
briefli
cacm
composit
design
explain
featur
fundament
introduct
languag
lewi
made
main
minimum
novemb
obtain
orthogon
permit
point
primit
program
recurs
review
rule
semant
set
shown
simpl
sintzoff
structur
syntax
ultim
valu
view
wodon
.I 2149
algorithm
analyt
cacm
coeffici
entcaf
entcr
evalu
function
lyness
normal
octob
taylor
.I 2150
access
cacm
case
class
concurr
control
couroi
delai
discuss
distinct
earli
exclus
heyman
independ
known
minimum
mutual
octob
parna
place
present
problem
process
reader
section
share
simultan
solut
take
wish
write
.I 2151
cacm
characterist
comput
descript
discuss
environ
facil
final
gener
hardwar
implement
laboratori
lincoln
measur
mit
nemeth
octob
present
program
provid
report
rovner
scenario
scheme
share
show
shown
similar
softwar
system
time
tx
user
.I 2152
altern
approach
avers
avoid
cacm
call
comput
condition
defin
design
devic
discuss
displai
element
emploi
euler
exampl
facilit
gener
graphic
illustr
implement
includ
inform
input
interact
languag
newman
number
octob
paper
permit
pictur
point
present
problem
procedur
process
restrict
simplifi
specif
speed
structur
suggest
system
techniqu
tend
transform
us
widespread
.I 2153
accept
allow
autom
cacm
cdc
classroom
comput
cont
control
convent
cost
cours
design
develop
divid
effect
experi
independ
initi
instruct
instructor
intervent
investig
lesson
lieu
measur
method
mode
numer
octob
oldehoeft
oper
portion
present
press
purdu
result
semest
student
studi
system
teach
teletyp
termin
test
undergradu
unit
univers
.I 2154
achiev
acm
ansi
applic
cacm
clarif
clarifi
commun
continu
correct
effort
fortran
initi
interpret
languag
mainten
natur
need
octob
prepar
program
publish
report
result
reveal
set
specif
standard
state
studi
subcommitte
unit
work
year
.I 2155
addit
algorithm
base
cacm
data
describ
direct
earlei
edg
effici
express
facil
formal
gain
graph
implement
languag
name
notat
octob
order
paper
part
present
program
programm
semant
structur
term
transform
understand
.I 2156
cacm
chenei
comment
fenichel
septemb
.I 2157
averag
binari
cacm
dens
flore
length
list
madpi
order
search
septemb
.I 2158
algorithm
cacm
criterion
differenti
equat
implicit
integr
linig
method
multistep
newton
nonlinear
ordinari
raphson
septemb
stop
system
.I 2159
approxim
cacm
note
phillip
septemb
side
.I 2160
algebra
allow
arbitrari
atom
attribut
base
basi
boolean
cacm
canon
chiang
claim
depend
desir
determin
discuss
function
gener
highli
intersect
involv
list
mainten
organ
pair
paper
permit
process
properti
propos
prove
queri
question
rang
retriev
septemb
singl
specif
structur
take
uniqu
valu
wong
.I 2161
algorithm
block
cacm
corrigendum
cutnod
graph
paton
septemb
.I 2162
alloc
amount
bit
block
bookkeep
cacm
dynam
effici
goto
idea
implement
incorpor
isoda
languag
list
memori
minim
number
process
processor
purpos
requir
septemb
storag
tabl
techniqu
test
word
.I 2163
acm
administr
approach
cacm
carri
classifi
colleg
committe
comput
conclus
cours
curricula
curriculum
describ
discuss
educ
effect
foundat
framework
grant
inform
initi
manag
nation
need
organ
outlin
paper
plan
posit
preliminari
present
profession
program
relat
requir
role
scienc
septemb
societi
studi
suggest
survei
system
teichroew
univers
.I 2164
algorithm
approach
august
cacm
class
decad
definit
degre
differenti
elementari
equat
find
function
gener
hermit
horowitz
integr
intellig
led
manipul
manov
mathemat
mose
problem
program
ration
reexamin
richardson
risch
slagl
solv
special
stormi
symbol
unsolv
.I 2165
algebra
applic
attent
august
barton
cacm
case
classif
deriv
describ
difficulti
drawn
encount
equat
field
fitch
gener
includ
manipul
matter
metric
paper
petrov
presenc
problem
rel
simpl
solut
strictli
symbol
system
work
.I 2166
algebra
algorithm
appendix
applic
attent
august
autom
briefli
cacm
celesti
compar
consid
direct
futur
gener
illustr
integr
jefferi
made
manipul
mechan
outlin
packag
paid
paper
perturb
poisson
problem
processor
rel
requir
research
seri
simplic
system
theori
typic
.I 2167
akin
algebra
algorithm
approach
august
automat
cacm
capabl
class
comprehend
conjectur
construct
decreas
delin
describ
design
discuss
divid
effici
examin
exist
express
facil
final
guid
includ
intellig
larg
make
manipul
mose
need
nonexist
number
perplex
point
posit
power
relat
reli
result
simplif
spectrum
substitut
system
techniqu
theoret
thesiz
type
user
view
want
.I 2168
allow
arbitrarili
august
cacm
cell
configur
fenichel
list
multipl
paper
possibl
process
run
singl
size
system
time
trace
type
.I 2169
altran
amount
august
cacm
coeffici
complet
comput
consider
data
depend
descript
design
eas
easili
effici
effort
ensur
function
hall
handl
implement
instal
integ
jr
languag
larg
machin
manipul
minimum
paper
permit
problem
quickli
ration
run
spent
structur
survei
symbol
system
time
variabl
varieti
.I 2170
activ
applic
august
cacm
comput
electrodynam
emphasi
hearn
manipul
occur
paper
physic
problem
quantum
survei
symbol
techniqu
theoret
.I 2171
cacm
equat
juli
nonlinear
raduchel
simultan
solut
.I 2172
algorithm
cacm
cermak
graph
juli
plotter
.I 2173
algorithm
cacm
juli
marriag
mcviti
problem
procedur
stabl
wilson
.I 2174
algorithm
appli
assign
cacm
condit
criterion
deriv
extend
find
gale
juli
marriag
mcviti
method
origin
paper
problem
prove
satisfi
shaplei
stabl
wilson
work
.I 2175
arithmet
broken
buffer
cacm
combin
compon
configur
consider
decreas
depend
earlier
environ
evalu
exce
execut
express
gonzalez
hardwar
juli
main
memori
minim
mode
multiprocessor
number
observ
optim
order
paper
parallel
postpon
procedur
processor
provid
ramamoorthi
rang
requir
sequenc
serial
show
subexpress
time
unbuff
uniprocessor
valid
.I 2176
alloc
analysi
arm
buffer
cacm
complet
conclud
control
convent
data
depend
determin
disk
distribut
equal
expect
ferguson
fix
function
improv
input
introduc
juli
make
merg
method
minim
movabl
number
oper
optimum
order
output
present
random
reduc
result
seek
significantli
similar
size
sort
standard
suggest
terminolog
time
yield
.I 2177
adjac
algorithm
analyz
approach
arbitrari
attain
bear
belong
block
bound
cacm
case
compar
cutnod
denot
depend
deriv
detail
edg
effici
emploi
essenti
extens
famili
final
find
gener
grammar
graph
grown
ii
increas
juli
label
length
list
machin
matrix
method
node
order
pack
paton
present
propos
read
repres
represent
requir
span
storag
suitabl
test
time
tree
type
undirect
valu
web
win
word
.I 2178
advantag
assign
cacm
commonli
consist
data
defin
definit
direct
disadvantag
discuss
easili
element
embed
emphasi
explan
explicit
extens
formal
friedman
graph
grasp
host
illustr
implement
involv
juli
languag
lisp
manipul
mean
method
oper
pratt
precis
primit
process
program
represent
semant
set
simpl
sole
structur
syntact
syntax
term
type
.I 2179
cacm
call
class
comparison
construct
context
cover
defin
derem
direct
extend
free
grammar
implement
includ
juli
knuth
lr
parser
preced
proper
prove
rang
result
shown
simpl
size
slr
speed
subset
superior
techniqu
weak
.I 2180
albani
area
arrang
bernstein
black
cacm
comput
cours
curriculum
discuss
field
job
juli
organ
program
programm
project
purpos
resid
schenectadi
select
train
.I 2181
academician
acm
administr
alloc
analysi
apprais
art
background
base
broad
busi
cacm
chairman
committe
common
comput
concentr
concern
condens
consid
consider
cours
cover
cross
curricula
curricular
daniel
develop
discuss
econom
educ
establish
experi
foundat
function
gener
grant
held
improv
inform
institut
invit
involv
issu
juli
man
manag
materi
mckennei
meet
michigan
minut
nation
need
ongo
orient
particip
pedagog
practition
preliminari
prepar
present
provid
rais
recommend
region
relat
report
requir
resourc
reveal
school
scienc
section
seri
set
similar
state
student
studi
substant
summari
support
system
task
teichroew
ten
tong
topic
unit
univers
.I 2182
cacm
driven
interrupt
juli
program
zelkowitz
.I 2183
binari
cacm
juli
summat
walker
.I 2184
abstract
assum
base
basic
cacm
church
concept
context
data
deal
directori
discuss
equival
express
extens
extent
found
fraser
function
idea
identifi
juli
lambda
languag
length
list
manipul
mean
mu
name
nice
notat
note
object
oper
order
overlap
program
regard
similar
simpl
storabl
suggest
system
term
type
view
.I 2185
addit
algorithm
appli
binari
cacm
characterist
code
compil
constant
degre
determin
develop
effici
fix
glaswin
involv
june
multipl
note
object
point
sequenc
shift
signific
simplic
subtract
test
.I 2186
accuraci
algorithm
appli
approach
bosarg
cacm
compar
comparison
comput
computation
concern
condit
control
definit
describ
design
determin
devot
direct
equat
establish
faster
feasibl
feedback
implement
improv
integr
johnson
jr
june
matrix
method
modif
numer
optim
paper
part
point
problem
procedur
properti
real
reason
regul
repres
requir
riccati
ritz
shown
significantli
solut
speed
stabl
standard
state
storag
techniqu
time
tradit
trefftz
valid
.I 2187
activ
amarel
approach
attempt
broad
cacm
captur
chang
characterist
comput
conceptu
consid
contact
continu
curriculum
disciplin
exist
expect
fact
featur
field
focus
framework
global
guid
import
increas
june
kind
knowledg
local
plan
present
problem
relat
relationship
scienc
situat
structur
term
view
work
.I 2188
accomplish
altern
analysi
analyz
applic
approach
averag
base
cacm
capabl
chosen
combin
comput
configur
consider
constraint
cost
data
design
develop
difficult
displai
distribut
driven
face
find
folei
found
function
gener
give
graphic
guidelin
hardwar
help
intellig
june
larg
major
mathemat
mean
model
number
numer
object
obtain
optim
optimum
paramet
predict
procedur
process
processor
quantit
queue
report
requir
respons
select
simul
storag
subject
subsystem
support
system
task
time
turn
understand
work
.I 2189
adjac
algorithm
basic
cacm
circuit
circular
class
complet
comput
consist
construct
correspond
cover
cycl
defin
deriv
determin
easi
edg
effici
element
equival
express
fairli
fundament
gener
graph
hamiltonian
hamitonian
harada
imag
june
mirror
nonori
number
oper
order
pair
perform
permut
posit
present
problem
procedur
recurs
revers
rosari
schedul
set
specif
start
success
system
systemat
take
term
transposit
treat
vertic
.I 2190
cacm
function
hous
minim
.I 2191
algorithm
cacm
chamber
partial
sort
.I 2192
applic
cacm
defin
equival
function
induct
interpret
jr
languag
method
morri
partial
principl
program
proof
prove
recurs
shown
thing
.I 2193
allow
cacm
calendar
clock
convention
error
fail
fenichel
fine
grain
implement
label
mode
program
recent
techniqu
trap
variabl
varieti
.I 2194
address
algorithm
amount
arithmet
assembl
assum
begin
bit
block
cacm
class
code
column
compil
comput
counter
cover
demonstr
distanc
elementari
formul
full
instruct
interpret
iter
keep
length
locat
matrix
mean
memori
minim
mutual
oper
origin
paper
permit
predetermin
present
prespecifi
problem
procedur
produc
refer
rel
richard
separ
short
simpl
solvabl
sum
ternari
type
vector
wide
.I 2195
abl
accord
achiev
adequaci
algorithm
approach
approxim
cacm
complex
comput
curv
decis
detect
discuss
due
embed
equal
express
figur
flexibl
global
greater
heurist
input
length
line
log
merit
method
montanari
multistag
noisi
number
oper
optim
parallel
pictur
present
problem
process
recogn
recognit
rel
relat
stage
state
structur
suitabl
system
techniqu
.I 2196
abil
advantag
aid
amount
approach
artifici
ask
attack
belong
brute
cacm
class
comput
data
describ
direct
distribut
easili
exactli
felt
field
forc
form
heurist
human
import
intellig
interact
krolak
larg
machin
man
marbl
mathemat
meager
method
moder
modest
number
organ
paper
point
problem
procedur
propos
real
result
rout
salesman
schedul
slightli
solv
special
subproblem
success
take
techniqu
test
time
todai
travel
warehous
.I 2197
area
assist
awaken
awar
bai
benefit
bring
cacm
capabl
central
comput
construct
deliv
develop
effect
expertis
facil
foster
found
francisco
higher
idea
impact
import
institut
judg
kei
learn
lesson
major
mean
merit
network
nielsen
oper
paper
particip
past
plai
power
provid
purveyor
qualiti
raw
region
report
role
san
school
servic
share
spread
stanford
stimul
suggest
univers
varieti
year
.I 2198
act
analyz
art
assess
base
basi
bind
bodi
cacm
capabl
cater
cobol
codasyl
committe
complex
consid
contain
convent
data
design
develop
differ
discuss
effect
exist
face
featur
final
found
full
function
futur
gener
group
handl
high
host
identifi
independ
initi
interrog
introduct
languag
length
level
lowest
main
major
manag
mention
network
outlin
paper
parametr
problem
program
propos
provid
publish
report
respect
review
section
separ
similar
state
store
structur
system
task
technic
ten
termin
topic
transact
updat
user
volum
work
.I 2199
algorithm
april
cacm
matrix
mcname
packag
part
spars
.I 2200
algorithm
april
base
basi
binari
cacm
complement
condit
consid
dealt
deriv
devis
divis
express
form
greater
implement
includ
munro
number
oper
overflow
permit
problem
produc
quotient
radix
remaind
repres
result
scheme
select
serv
stein
theorem
yield
.I 2201
allow
anim
anticip
april
cacm
carr
comput
contribut
convent
convers
coulter
dec
design
dimension
disadvantag
element
error
expositori
facil
film
gener
hwang
iii
inher
input
instruct
jr
light
line
maintain
make
mode
movi
overcom
pen
pictur
primari
produc
professor
provis
pushbutton
sequenc
serv
stage
strip
system
talbot
techniqu
teletyp
termin
trial
user
.I 2202
access
adder
analyz
april
assembl
assign
bit
cacm
character
characterist
code
combinatori
compar
consid
control
convent
cycl
data
develop
differ
dynam
effici
examin
exampl
facil
final
flexibl
flynn
instruct
involv
languag
linkag
machin
masker
micro
microassembl
microinstruct
microprogram
microstorag
normal
nsec
oper
organ
orient
overhead
paper
perform
permit
presenc
problem
processor
program
pure
read
resourc
result
scheme
sequenc
shifter
similar
simultan
small
softwar
storag
stress
subroutin
system
technolog
test
time
tucker
version
word
write
.I 2203
access
addit
address
appli
april
bucket
cacm
creat
discuss
dodd
exist
factor
final
format
fundament
guidelin
kei
larg
load
lum
method
number
obtain
outlin
overflow
peculiar
perform
pertin
practic
present
propos
quantit
rang
record
requir
result
set
size
specif
state
studi
summar
take
techniqu
term
transform
valu
vari
variabl
wide
yuen
.I 2204
activ
april
art
cacm
code
concern
conclus
consid
creativ
data
decis
decomposit
design
develop
distinguish
drawn
exampl
exhibit
illustr
instruct
nontrivi
number
process
program
refin
regard
sequenc
serv
short
specif
stepwis
structur
subtask
success
task
taught
techniqu
wirth
.I 2205
algorithm
cacm
differenti
difsub
equat
gear
march
ordinari
solut
.I 2206
algorithm
arithmet
cacm
equat
exact
howel
linear
march
residu
solut
.I 2207
algorithm
appear
approxim
automat
cacm
criterion
differenti
discuss
embodi
equat
gear
increas
initi
integr
march
object
option
order
ordinari
permit
problem
program
propos
reduc
select
set
size
solut
step
techniqu
time
.I 2208
algorithm
area
assign
attempt
cacm
deriv
divid
effect
entir
entri
exampl
expect
express
fast
file
full
function
hash
hierarchi
level
march
mean
measur
memori
number
perform
place
size
slower
space
storag
store
studi
total
util
william
.I 2209
algorithm
assist
cacm
comput
defin
educ
implement
logic
march
notat
paper
polici
present
registr
result
schedul
system
tennesse
term
univers
winter
.I 2210
appli
approach
automat
cacm
construct
defin
desir
detail
dwell
elementari
emphas
explor
extract
form
frequent
function
gain
illustr
induc
induct
ineffici
iter
list
loop
major
manna
march
mathemat
method
natur
number
oper
order
outlin
principl
program
proof
prove
recurs
relat
rule
satisfi
specif
synthesi
technic
techniqu
theorem
transform
tree
version
walding
.I 2211
amount
arrai
bit
cacm
comput
convers
convert
coordin
core
data
ddp
displai
fast
flicker
frame
free
graphic
honeywel
imag
implement
instal
interact
larg
march
memori
noll
output
point
rate
reason
rectangular
result
scan
size
softwar
storag
store
successfulli
system
televis
word
.I 2212
cacm
distribut
februari
tolman
.I 2213
algorithm
cacm
dell
eigenvalu
februari
gener
matrix
pencil
problem
root
thompson
weil
.I 2214
arithmet
assur
cacm
complex
defin
divis
februari
interv
lancast
real
result
rokn
smallest
.I 2215
analog
analogu
applic
approach
author
back
cacm
chanc
charact
classifi
competit
comput
develop
diagnosi
directli
easili
experi
featur
februari
game
gamma
incorpor
lee
medic
natur
paper
pattern
person
plai
power
present
procedur
promis
receiv
recognit
result
search
select
sequenti
simul
slagl
spr
strictli
suggest
techniqu
test
tree
unknown
view
virtual
.I 2216
advanc
agreement
algorithm
analysi
analyt
applic
assum
binari
branch
cacm
case
comput
deriv
discuss
distribut
effort
emden
empir
equat
expect
famili
februari
function
gener
hoar
hurwitz
integr
jr
make
minor
moment
nonuniform
point
previous
probabl
publish
ratio
reduc
reduct
reflect
result
satisfactori
singleton
solut
sort
statist
substanti
test
thousand
tree
uniform
uniformli
valu
van
varianc
.I 2217
achiev
analysi
analyz
appli
automat
cacm
calculu
capabl
claus
coeffici
collect
creat
data
demonstr
develop
domain
dramat
effect
evalu
experi
farrel
featur
februari
function
gener
goal
guid
handl
heurist
implement
improv
learn
linear
multipl
multipurpos
number
optim
pass
perform
polynomi
pp
predic
present
problem
produc
program
proof
prove
regress
resolut
result
routin
search
show
shown
simultan
slagl
solut
specif
successfulli
summar
term
test
theorem
thirteen
tree
variat
varieti
written
.I 2218
analysi
base
burrough
cacm
capabl
characterist
data
delai
design
discuss
disk
dynam
earli
effect
environ
februari
find
framework
indic
investig
minim
model
nielsen
oper
organ
overlai
plan
present
procedur
program
reflect
reloc
rotat
segment
share
simul
simula
size
summari
swap
system
techniqu
time
type
variabl
vehicl
volum
.I 2219
actual
algorithm
amount
avoid
batch
belong
bernstein
cacm
character
class
cost
count
differ
driven
dynam
februari
function
gener
ij
implement
interact
job
keep
level
number
oper
overhead
polici
previou
prioriti
process
promis
provid
purpos
receiv
reduc
resourc
schedul
servic
share
sharp
significantli
specifi
sum
swap
system
time
unit
user
.I 2220
algorithm
cacm
code
commun
compil
complet
comput
concept
convers
convert
decis
entri
entropi
execut
februari
flowchart
global
guarante
limit
minim
modif
optim
pollack
program
propos
reli
result
rule
shannon
shwayder
solut
subsequ
tabl
test
theorem
time
.I 2221
cacm
comment
comput
convers
decis
januari
pollack
program
tabl
.I 2222
cacm
comment
januari
london
redish
.I 2223
algorithm
cacm
dahlstrand
januari
kolm
linear
minit
program
.I 2224
algorithm
cacm
complex
function
gamma
januari
jr
luca
terril
.I 2225
algorithm
cacm
circular
coleman
integ
januari
partit
taylor
.I 2226
addit
al
algorithm
analysi
cacm
comput
error
evid
experi
gue
januari
linear
note
problem
program
proll
purpos
recent
report
suboptim
summar
.I 2227
algorithm
cacm
code
conclus
construct
correct
descript
drawn
error
exercis
final
find
gener
hoar
inform
intrus
januari
logic
method
methodolog
prevent
process
program
proof
purpos
relat
separ
systemat
techniqu
termin
treat
.I 2228
alloc
block
cacm
comment
deadlock
defin
discuss
elimin
habermann
holt
introduc
januari
method
necessarili
perman
prevent
process
receiv
request
resourc
schedul
shown
situat
state
system
.I 2229
addit
approach
articl
basic
binomi
bruck
cacm
case
chebyshev
classic
comput
construct
converg
elementari
end
experi
final
formal
formula
fourier
fraction
gener
improv
iter
januari
known
method
multipl
neg
numer
obtain
oper
point
poisson
posit
power
properti
ration
relationship
seri
shown
subtract
theorem
.I 2230
architectur
automat
block
bracchi
cacm
cadep
circuit
criteria
design
diagram
dimension
featur
ferrari
gener
geometr
illustr
integr
januari
languag
logic
mask
orient
paper
pattern
placement
plan
posit
present
problem
represent
space
specif
structur
suit
treat
turn
urban
.I 2231
algorithm
ambigu
binari
cacm
chang
character
construct
develop
dimens
finit
frame
give
horizont
januari
origin
paper
pattern
perfectli
project
reconstruct
shown
similar
time
unambigu
vertic
.I 2232
algorithm
altern
angl
boundari
cacm
calcul
case
clarifi
comparison
comput
concept
conclus
consist
contain
definit
demonstr
descript
difficult
easili
extract
featur
focu
found
function
geometr
graphic
illustr
inform
investig
januari
klinger
made
magnitud
matter
object
obtain
paper
part
pattern
precis
princip
radiu
recognit
recommend
relat
result
review
set
subject
substanti
tabular
theorem
theoret
variat
vector
width
word
work
.I 2233
activ
advantag
ag
ago
aid
alleg
allegedli
analys
analyt
analyz
armi
attempt
author
beal
bedford
benefit
bonanza
buford
cacm
clear
clue
code
common
complet
comput
consecut
construct
convinc
correct
counti
cryptanalyst
cryptograph
cryptographi
cypher
data
declar
decod
deeper
depend
deposit
devot
dig
document
doubt
emploi
encod
entir
evid
expend
fill
final
find
fortun
gener
grader
grandios
hammer
hand
help
herculean
hill
histori
hoax
hunter
imagin
includ
independ
insight
intens
januari
jefferson
known
labor
letter
locat
machin
man
match
matter
mere
messag
method
mile
modern
moment
mr
nag
number
numer
obtain
obvious
perform
perpetr
pertin
primit
process
promis
provid
random
reason
rel
roll
scheme
secur
seeker
sequenc
signatur
simpli
simul
sought
sourc
strongli
student
studi
subject
success
superb
synthet
technolog
text
thoma
time
tode
treasur
try
turn
type
uniniti
univac
unsanit
untold
varieti
vast
vault
version
virginia
volum
wealth
word
work
written
year
yield
.I 2234
algorithm
cacm
decemb
heiberg
matrix
pencil
root
.I 2235
algorithm
cacm
decemb
decis
marshal
tabl
translat
.I 2236
algorithm
cacm
characterist
decemb
differenti
equat
exponenti
frisch
hyperbol
integr
mathieu
remark
solut
system
valu
.I 2237
algorithm
bandsolv
cacm
decemb
schuegraf
.I 2238
algorithm
cacm
decemb
fit
schuegraf
squar
surfac
.I 2239
algorithm
cacm
decemb
hallet
mund
squank
.I 2240
algorithm
cacm
decemb
number
pseudo
random
sullin
.I 2241
algorithm
boland
cacm
decemb
gauss
integr
legendr
point
product
simpson
type
.I 2242
algorithm
boland
cacm
decemb
gauss
integr
legendr
point
product
simpson
type
.I 2243
boland
cacm
decemb
product
simpson
type
.I 2244
algorithm
boland
cacm
decemb
integr
product
trapezoid
type
.I 2245
absolut
accur
algorithm
alter
analysi
baskett
brown
cacm
call
carri
come
comput
conclud
control
cpu
data
decemb
drive
driven
dynam
easili
effect
environ
event
hold
iii
includ
isol
job
level
long
method
microscop
model
multiprogram
obtain
perform
period
predictor
preemptiv
prevent
probe
product
rel
relationship
replica
robin
round
schedul
serv
sherman
softwar
stream
success
system
systemat
techniqu
test
theori
time
trace
tradit
vari
variat
worst
.I 2246
accomplish
amount
assembl
brown
cacm
compar
decemb
design
desir
discuss
encod
factor
form
high
implement
increas
independ
kei
languag
level
low
machin
macro
map
merit
object
oper
paper
pitch
popular
portabl
present
processor
rel
result
softwar
special
.I 2247
ad
advantag
allow
altern
approach
arriv
assumpt
cacm
case
comprehens
consist
convent
criteria
decemb
decompos
decomposit
depend
design
develop
discuss
distinct
divid
effect
effici
flexibl
goal
implement
improv
mechan
modul
modular
outlin
paper
parna
present
problem
shorten
shown
sketch
subroutin
system
time
unconvent
.I 2248
advantag
approxim
bound
cacm
cauchi
decemb
defin
depend
differ
differenti
domain
equat
error
finit
increment
inher
initi
integr
involv
method
moor
order
parabol
partial
problem
represent
robinson
size
solut
success
unbound
.I 2249
barr
base
basi
cacm
comparison
comput
covari
decemb
determin
execut
factor
gaussian
gener
ibm
made
matrix
memori
method
multivari
normal
number
outcom
present
random
requir
result
sezak
space
standard
time
triangular
util
varianc
vector
.I 2250
ahren
cacm
comput
corrigendum
decemb
dieter
distribut
exponenti
method
normal
sampl
.I 2251
address
appli
cacm
cluster
comparison
complex
comput
cost
decemb
effici
elimin
full
function
hash
increment
kei
known
linear
low
luccio
method
practic
present
primari
scatter
search
size
step
tabl
term
weight
.I 2252
algol
appli
ar
batch
cacm
caizergu
call
command
compil
construct
data
decemb
earlei
edit
editor
entir
especi
essenti
factor
frequent
gener
global
handl
increment
individu
insof
intern
languag
line
maintain
method
modifi
nest
occur
pars
part
partial
permit
pl
point
present
process
program
purpos
receiv
recompil
relationship
repres
restrict
routin
sens
set
skeleton
sourc
statement
structur
syntax
text
.I 2253
address
algorithm
aris
attempt
author
bayer
cacm
calcul
calculi
code
complic
data
decemb
describ
express
gener
goal
handl
index
machin
manipul
matrix
necessit
optim
origin
paper
posit
preoccupi
previou
product
program
rang
scheme
structur
symbol
tediou
transform
witzgal
.I 2254
adam
arbitrari
arrai
cacm
classic
consist
control
data
decemb
defin
definit
deriv
descript
design
detail
develop
dynam
exampl
extend
gener
illinoi
illustr
implement
inform
interest
languag
maintain
manner
mode
motiv
nearli
ol
oper
origin
paper
partit
phillip
present
process
realist
structur
subarrai
suffici
tree
type
univers
vari
.I 2255
cacm
comment
moorer
novemb
smoliar
.I 2256
cacm
comment
dijkstra
eisenberg
mcguir
novemb
.I 2257
cacm
chain
doubli
kennedi
note
novemb
optim
tree
.I 2258
addit
address
cacm
exist
format
fundament
kei
larg
lum
novemb
perform
result
studi
techniqu
transform
yuen
.I 2259
algorithm
cacm
fullerton
function
gamma
incomplet
modifi
novemb
.I 2260
algorithm
cacm
conting
exact
march
novemb
probabl
tabl
.I 2261
approxim
base
cacm
comput
continu
develop
distribut
easi
empir
essenti
fast
frequent
function
gener
invers
lambda
memori
method
novemb
number
practition
ramberg
random
requir
schmeiser
simul
sourc
symmetr
theoret
turkei
uniform
valu
variabl
.I 2262
baecker
cacm
collect
compar
comput
demand
discuss
examin
execut
garbag
grow
growth
implic
list
memori
method
novemb
paper
practic
process
program
propos
simul
space
system
techniqu
tradit
typic
virtual
.I 2263
account
algorithm
appli
approach
cacm
calcul
call
case
compar
comparison
complex
comput
conclus
condit
contract
convers
decis
deriv
drawn
effort
entri
equal
execut
exist
fewer
find
flowchart
frequenc
gener
greater
includ
justifi
larg
lead
limit
minim
necessarili
need
novemb
obtain
optim
optimum
present
produc
real
reduct
requir
result
rule
shown
simpl
small
tabl
take
test
time
treat
truli
valid
verhelst
.I 2264
accept
action
cacm
check
concept
construct
correct
cours
defin
definit
deriv
descript
effect
execut
express
flowchart
formal
henderson
implement
inform
introduc
involv
languag
machin
make
novemb
order
program
proof
rigor
semant
side
simpl
sole
step
term
translat
valu
.I 2265
abstract
activ
algol
answer
applic
aris
attempt
attend
base
cacm
calculu
call
character
check
class
compat
compil
comput
constant
construct
correct
decid
determin
discuss
elimin
execut
express
face
form
function
incorrect
inform
isol
label
lambda
languag
ledgard
made
map
model
normal
notion
novemb
number
object
oper
operand
paper
partial
present
problem
program
properli
question
reduc
relat
resolv
solut
string
subset
treat
type
wise
.I 2266
algorithm
approxim
base
cacm
comput
conceptu
converg
deflat
determin
guarante
highli
method
multipl
newton
novemb
parallel
patrick
point
polynomi
readili
real
simultan
start
suitabl
valu
zero
.I 2267
algorithm
arithmet
cacm
chop
comput
digit
float
form
fortran
machin
malcolm
method
novemb
number
point
present
properti
radix
reveal
round
run
shown
subroutin
work
.I 2268
appendix
appli
base
cacm
compar
comput
corrector
criteria
differenti
equat
evalu
extrapol
found
fox
includ
integr
investig
kutta
method
multistep
novemb
ordinari
perform
polynomi
predictor
problem
procedur
program
ration
report
repres
rung
set
show
singl
step
studi
system
test
.I 2269
algorithm
cacm
convers
date
octob
robertson
tableless
.I 2270
akima
algorithm
base
cacm
curv
fit
interpol
local
octob
procedur
smooth
.I 2271
aesthet
cacm
corrigendum
ershov
factor
human
octob
program
.I 2272
algorithm
applic
cacm
discuss
extens
famili
frazer
fuller
implic
longer
make
member
memori
natur
octob
present
propos
result
select
simul
sort
space
string
wong
yield
.I 2273
advantag
algorithm
allow
applic
base
cacm
combin
comput
condit
consider
convers
dath
decis
degre
end
entri
execut
extend
gener
handl
immedi
instantli
interpret
limit
logic
mark
mask
method
mix
need
octob
oper
perform
process
program
reduc
rule
tabl
test
time
tree
.I 2274
algorithm
attent
author
cacm
case
comput
deep
design
determin
develop
discours
embed
english
express
find
form
function
gener
grammar
impos
inform
initi
linguist
lisp
mean
method
mood
net
network
node
octob
order
path
primarili
program
pronomin
regard
relat
report
rule
select
semant
sens
sentenc
set
simmon
slocum
string
structur
studi
substitut
surfac
syntact
system
tens
tool
transform
underli
voic
word
.I 2275
actual
analyz
approxim
basic
cacm
case
comput
consid
consist
constrain
curv
data
decomposit
deriv
distribut
equat
essenti
experiment
fit
fredholm
function
hanson
immunolog
integr
invers
kind
known
nonneg
number
octob
point
present
probabl
problem
procedur
properti
repres
set
singular
stabil
strategi
success
test
unknown
yield
.I 2276
ahren
algorithm
approach
cacm
case
choic
compar
comput
consum
continu
convert
definit
dieter
directli
distribut
effici
expans
exponenti
faster
known
made
memori
method
normal
number
octob
procedur
quantiti
random
recommend
remain
requir
sampl
seri
shorter
slower
space
speed
step
taylor
term
transform
uniformli
.I 2277
action
ad
aris
associ
basic
cacm
characterist
comput
condit
demand
den
descript
design
discuss
final
full
hardwar
ii
implement
introduc
maniac
memori
model
morri
octob
oper
page
scheme
set
specif
system
util
work
.I 2278
cacm
foster
septemb
tan
.I 2279
braill
cacm
control
feldman
rubinstein
septemb
termin
.I 2280
cacm
comment
deadlock
habermann
method
parna
prevent
septemb
.I 2281
block
cacm
eigen
khalil
matric
problem
septemb
tridiagon
.I 2282
cacm
comparison
float
gregori
method
point
septemb
summat
.I 2283
algorithm
approach
arrai
balanc
cacm
compar
conclud
conjunct
deutsch
develop
featur
found
hexagon
imag
irregular
nois
number
oper
perform
pictori
point
present
produc
rectangular
reduc
rel
report
result
sensit
septemb
strike
thin
triangular
yield
.I 2284
algorithm
ax
bartel
cacm
equat
matrix
septemb
solut
stewart
xb
.I 2285
algorithm
base
cacm
comput
extens
extrem
lemk
linear
pivot
present
problem
program
quadrat
rang
ravindran
result
routin
satisfactori
septemb
solv
test
wide
.I 2286
accuraci
achiev
analysi
arithmet
automat
cacm
calcul
comput
consid
data
desir
determin
directli
easili
error
evalu
express
final
float
gener
interv
low
nonrat
oper
perform
point
precis
problem
ration
requir
result
richman
septemb
techniqu
toler
trial
variabl
.I 2287
algorithm
analyz
approach
automat
base
cacm
call
color
comput
contour
control
detect
develop
digit
discuss
distinguish
gener
involv
label
lamdan
line
map
memori
method
minim
mor
normal
practic
problem
program
properti
recognit
scan
septemb
shown
simplifi
solut
solv
space
structur
suffic
suggest
topolog
util
.I 2288
base
cacm
condit
consecut
design
discuss
enabl
establish
exist
ghosh
import
inform
invari
minim
organ
outlin
paper
properti
prove
queri
record
redund
relat
remain
retriev
search
septemb
set
storag
system
theorem
time
.I 2289
achiev
adjac
advantag
algorithm
amount
analysi
applic
arrai
bit
cacm
case
cell
cellular
challeng
chart
checkerboard
chief
column
combin
commun
comput
determin
dimension
direct
distanc
easili
effect
element
especi
exceed
exhibit
exploit
graph
grow
ident
implement
improv
inher
interconnect
kautz
known
levitt
log
logic
mainli
major
map
matrix
memori
modul
neighbor
network
node
noncellular
number
offer
oper
paper
parallel
path
pert
possibl
present
problem
process
rate
readili
requir
rout
row
septemb
serial
shown
simpl
small
solut
span
speed
step
store
straightforward
suit
time
tree
type
typic
virtu
wire
.I 2290
algorithm
august
cacm
direct
graph
jr
moor
predomin
purdom
.I 2291
algorithm
august
cacm
local
polynomi
root
squir
.I 2292
august
cacm
gener
note
permut
read
rosari
.I 2293
august
averag
binari
cacm
comment
jone
length
search
.I 2294
august
bonu
cacm
jr
morri
van
wijngaarden
.I 2295
algol
august
cacm
comment
composit
der
poel
semant
van
.I 2296
august
bernstein
cacm
compil
fix
multipl
point
.I 2297
abl
alloc
aspect
august
averag
cacm
characterist
comput
concern
configur
content
cpu
demand
demonstr
distribut
equal
except
execut
expect
explicitli
express
fix
fraction
frame
heurist
increas
interv
load
long
machin
main
materi
memori
model
multiprogram
number
numer
obtain
oden
oper
page
paper
partit
point
present
problem
program
repres
requir
resourc
result
run
shedler
statist
system
time
vari
.I 2298
achiev
appear
august
buffalo
cacm
consid
consist
decis
definit
develop
earli
eckhous
emphasi
emul
environ
evalu
frieder
goal
group
jr
machin
microprogram
organ
phase
project
purchas
report
research
result
rosin
state
superior
support
univers
york
.I 2299
actual
august
basic
benjamin
cacm
data
design
develop
disk
eas
edit
editor
emploi
extens
function
illustr
implement
machin
manipul
merit
number
philosophi
power
program
small
sophist
storag
structur
subroutin
term
text
type
util
versatil
.I 2300
accept
aid
algorithm
august
boundari
bureau
cacm
censu
compact
comput
congression
consid
contigu
council
counti
criteria
data
discuss
district
equal
feasibl
helbig
includ
loui
method
missouri
natur
nonpartisan
orr
polit
popul
present
preserv
problem
redistrict
result
roedig
seat
specif
st
state
ten
.I 2301
affix
algol
algorithm
applic
august
base
bottom
briefli
cacm
class
conclud
convers
convert
crow
definit
derem
discuss
equal
extens
floyd
fpl
gener
grammar
includ
inventor
koster
languag
larg
level
paper
pars
parser
power
present
procedur
product
recurs
scheme
shown
similar
suit
van
wijngaarden
.I 2302
affect
amount
argument
attitud
autom
borodin
cacm
central
chang
color
comput
conclus
contradictori
delin
disciplin
due
economist
effect
elimin
employ
entir
extens
forc
gener
gotlieb
impact
import
increas
individu
issu
job
juli
labor
natur
obviou
occup
overton
part
polit
present
product
psychologist
relat
relationship
scientist
singl
sociologist
structur
studi
subject
support
technolog
viewpoint
wish
work
worker
.I 2303
acm
alt
archaeolog
cacm
characterist
comput
develop
domin
eniac
foreshadow
found
juli
larg
later
period
preced
reminisc
.I 2304
articl
cacm
commerci
comput
develop
digit
earli
eastern
emphasi
event
field
happen
heavi
histori
imperson
juli
organ
part
peopl
period
person
record
spragu
statesar
technolog
tend
unit
univers
view
western
year
.I 2305
advanc
approach
art
attempt
bauer
cacm
earli
extent
featur
forerunn
histor
insight
interest
juli
konrad
korrad
languag
lead
literatur
modern
plan
plankalkul
practic
present
program
provid
publish
reconstruct
standard
state
system
term
terminolog
todai
wossner
write
zuse
.I 2306
algorithm
ancient
aspect
babylonian
cacm
comput
discuss
earli
emphas
english
greatest
interest
juli
knuth
mathemat
number
origin
quot
scienc
standpoint
tablet
translat
.I 2307
ad
autom
automat
base
briefli
cacm
cluster
collect
comput
continu
control
document
dynam
earli
earlier
environ
fulfil
function
growth
inform
interact
item
juli
librari
mechan
method
modif
need
normal
outlin
power
procedur
process
promis
propos
provid
queri
reason
reorgan
retir
retriev
role
salton
search
store
tool
user
.I 2308
activ
analyst
applic
benefit
broad
cacm
citi
civil
comput
cost
cover
decis
design
digniti
effici
expans
expect
factor
forward
found
futur
human
imagin
improv
invent
juli
liberti
limit
look
maker
outweigh
process
programm
properli
rang
respect
scope
signific
societi
sturman
survei
system
urban
usag
.I 2309
applic
cacm
comput
contribut
develop
direct
educ
effect
instruct
juli
process
profession
research
suggest
survei
system
zinn
.I 2310
accept
analysi
analyz
area
argu
cacm
composit
comput
concord
construct
critic
data
desir
detail
entail
establish
exhaust
facilit
gather
human
implic
import
indic
juli
languag
list
literatur
model
orient
paper
precis
recogn
rigor
scienc
sedelow
student
teach
test
wide
widespread
write
.I 2311
benjamin
cacm
categor
commonli
comput
develop
examin
gener
inform
juli
parallel
perspect
point
project
scope
system
technolog
view
world
.I 2312
applic
cacm
comput
expect
forecast
futur
happen
juli
pessimist
physic
present
rice
scienc
scientif
.I 2313
adopt
bachman
base
cacm
commerci
complex
comput
concept
data
diagram
evolut
exist
graphic
grown
histori
illustr
juli
manag
origin
point
power
process
rapidli
refer
relat
split
storag
structur
system
techniqu
term
year
.I 2314
advanc
algorithm
allow
altern
applic
aspect
author
backtrack
bobrow
cacm
code
commun
complex
composit
condit
control
coroutin
data
debug
design
direct
domain
dualiti
edit
effici
entri
environ
evalu
extend
extens
facil
facilit
featur
feel
focus
form
framework
function
gener
good
highlight
implement
import
improv
includ
input
interact
invoc
juli
languag
larg
list
made
manag
manipul
mechan
method
model
modifi
monitor
multiprocess
need
number
optim
output
overview
packag
paper
pattern
present
procedur
process
product
program
programm
rang
regim
requir
retriev
run
sophist
storag
store
stress
structur
symbol
syntax
system
test
view
wide
work
.I 2315
activ
area
cacm
center
coordin
creation
effort
focu
fosdick
juli
made
mathemat
need
observ
product
softwar
step
suggest
.I 2316
cacm
chronolog
concept
develop
difficulti
discuss
futur
happen
higher
histori
import
interrelationship
juli
kei
languag
level
list
major
paper
part
period
previou
program
prolifer
reason
sammet
section
show
signific
specif
time
topic
tree
write
.I 2317
algol
ambiti
area
cacm
cobol
compar
comput
contribut
deal
develop
directli
evalu
extens
forese
fortran
function
futur
gain
great
greatli
impact
import
impress
includ
increas
interest
juli
languag
major
manufactur
measur
microprogram
multiprogram
number
oper
orient
pl
practic
principl
problem
produc
program
project
ran
remain
rosen
set
similar
spite
system
techniqu
ten
theoret
trend
understand
univers
world
year
.I 2318
cacm
circumst
comput
constitut
establish
evalu
examin
interrelationship
investig
juli
kimbleton
mean
method
model
paper
perform
role
system
.I 2319
abl
analyz
aspect
cacm
clearli
common
comput
deal
design
develop
except
exist
futur
gap
great
impact
increasingli
inform
interact
juli
knowledg
larg
lynch
model
modular
number
oper
overview
perform
philosophi
posit
project
respect
sever
subsystem
system
todai
total
.I 2320
associ
cacm
caught
clarifi
class
combin
compet
compil
concept
concurr
control
critic
data
defin
degre
depend
desir
enabl
error
event
explicitli
hansen
high
juli
languag
larg
level
mean
multiprogram
notat
oper
paper
permit
present
process
program
programm
propos
region
represent
resourc
safe
schedul
share
structur
suffici
system
time
user
variabl
.I 2321
addit
cacm
combin
commun
comput
connect
consider
control
coordin
data
design
detail
digit
discuss
equip
error
focu
fraser
function
futur
interdepend
interfac
juli
mean
minim
multiplex
obtain
optim
present
problem
reconsider
requir
respect
respons
signal
specif
stream
subsystem
switch
synchron
system
technolog
termin
tradit
.I 2322
architectur
attempt
cacm
chip
comput
design
develop
devic
extens
field
foster
function
incident
inexpens
juli
logic
made
microcomput
noncomput
predict
provid
singl
standard
superscal
view
year
.I 2323
algebra
algorithm
cacm
claim
defin
develop
differenti
discuss
effort
equat
exponenti
field
function
gener
hypergeometr
juli
knowledg
list
made
make
manipul
mathemat
mose
natur
number
ordinari
prefer
properti
prospect
recent
solut
special
system
theori
usual
.I 2324
actual
algorithm
breakthrough
cacm
comparison
consolid
construct
continu
contribut
demonstr
document
forecast
histori
integ
juli
known
like
made
manag
mathemat
nonlinear
obstacl
orient
practic
present
problem
program
scienc
shanno
softwar
specif
standard
techniqu
test
theoret
user
view
weil
year
.I 2325
algorithm
analysi
cacm
complex
compon
comput
continu
discuss
error
finit
foundat
juli
librari
mathemat
number
numer
precis
program
scienc
synthesi
system
traub
view
.I 2326
approach
cacm
comput
correct
defin
equival
exist
extens
fix
handl
includ
juli
justif
manna
manner
point
program
properti
recurs
scott
semant
techniqu
term
termin
theori
uniform
verif
vuillemin
.I 2327
arbib
automata
brain
cacm
contribut
develop
evolv
idea
inform
juli
mathemat
paper
process
push
sourc
studi
suggest
theori
understand
wai
year
.I 2328
cacm
cai
gener
individu
instruct
june
koffman
tutor
.I 2329
cacm
circl
comput
june
kandel
scienc
viciou
.I 2330
algorithm
cacm
calcul
einarsson
fourier
integr
june
.I 2331
algorithm
cacm
integ
johnson
june
kernighan
problem
program
.I 2332
algorithm
arbitrari
cacm
june
precis
sale
seri
special
summat
.I 2333
algorithm
angl
cacm
june
random
schrack
solid
uniform
vector
.I 2334
algorithm
cacm
gener
june
number
proll
random
.I 2335
algorithm
cacm
eigenvalu
eigenvector
gener
june
matrix
niessner
real
.I 2336
algorithm
cacm
complex
error
function
june
kolbig
.I 2337
algorithm
cacm
comparison
complex
element
fewest
find
june
max
maximum
min
minimum
norm
optim
pohl
problem
prove
set
sort
techniqu
.I 2338
cacm
equat
exampl
fourth
iguchi
integr
june
kind
method
nonlinear
numer
order
present
solv
start
volterra
.I 2339
accomplish
assign
cacm
clearli
clerk
code
coder
comput
computer
conduct
construct
convers
convert
descript
desir
emphasi
feasibl
gener
june
multidigit
numer
primari
procedur
program
refer
respons
result
show
studi
test
translat
verbal
.I 2340
action
algorithm
bell
boolean
cacm
class
comput
condit
conflict
correct
detect
exist
free
function
grammar
illustr
indic
june
linear
martin
matric
matrix
method
modifi
preced
prove
relat
suffici
version
.I 2341
absorb
adapt
addit
aggreg
appear
applic
bargraph
basi
block
cacm
call
charact
compos
concaten
concept
connect
data
defin
devic
diagram
dimens
dimension
easi
environ
equat
especi
extens
extern
flowchart
form
format
gener
gimpel
good
graphic
implement
includ
independ
june
justif
languag
larg
logic
mainli
mathemat
mechan
merg
natur
nonnumer
oper
output
overstrik
parallelepip
point
prepar
print
printabl
printer
problem
program
purpos
readili
requir
shape
size
snobol
special
string
structur
suitabl
syntax
text
thought
type
varieti
work
.I 2342
applic
attempt
cacm
calcul
chandler
collect
commun
configur
correct
data
dictat
dijkstra
discredit
examin
exclus
exist
form
format
formul
gilbert
hardwar
inclus
incorrect
inform
interfer
june
kind
knuth
machin
mechan
mutual
paper
parallel
partial
pertin
problem
proce
procedur
process
program
proof
properti
prove
question
regard
requir
respect
rule
sequenc
set
shown
softwar
solut
state
subproblem
symmetri
system
transit
valu
verifi
yield
.I 2343
addit
aid
appear
balanc
briefli
cacm
capabl
combin
complement
complex
comput
configur
content
decid
design
detail
discuss
displai
effect
establish
execut
exist
fact
featur
final
found
graphic
includ
june
larg
memori
note
order
overlai
present
problem
program
programm
propos
pseudo
requir
scheme
size
solv
spacek
storag
structur
system
task
techniqu
tool
util
virtual
writabl
.I 2344
affect
algorithm
allow
analyt
appear
ascertain
auxiliari
base
benefit
blatni
cacm
clark
comparison
control
cost
cpu
cycl
delai
effect
equat
execut
favor
featur
finit
found
improv
includ
infinit
job
june
made
manner
mark
mean
measur
model
noncontigu
nonpreempt
number
obtain
optim
optimum
orient
overhead
paramet
perform
predict
process
quantum
requir
result
robin
round
rourk
schedul
select
share
shown
signific
simul
simultan
size
slice
speed
store
studi
supervisor
system
techniqu
time
variabl
variat
.I 2345
ashenhurst
cacm
consid
cours
curriculum
descript
detail
discuss
educ
graduat
identifi
implement
incorpor
inform
master
need
organ
present
profession
program
propos
question
recommend
relat
system
univers
.I 2346
algorithm
alphabet
cacm
code
hu
method
minimum
redund
tucker
yohe
.I 2347
algorithm
cacm
cosin
fourier
integr
linz
.I 2348
algorithm
bron
cacm
merg
sort
.I 2349
algorithm
cacm
correl
gener
hurst
knop
normal
random
variabl
.I 2350
algorithm
cacm
clenshaw
curti
gentleman
quadratur
.I 2351
cacm
harter
optim
winograd
.I 2352
approxim
cacm
dunham
minimax
nonlinear
subset
.I 2353
applic
biharmon
cacm
converg
crack
differ
equal
equat
essenti
fast
finit
greenspan
made
method
navier
number
numer
order
problem
process
result
reynold
schultz
set
simpl
smooth
solut
solv
stroke
system
treat
type
.I 2354
applic
automat
cacm
case
chebyshev
circumst
clenshaw
companion
comput
convent
cosin
cost
curti
drawback
effect
experi
fast
formula
fourier
frequenc
gentleman
high
ii
implement
integr
integrand
interpol
largest
low
modif
numer
overcom
paper
part
point
polynomi
problem
quadratur
recurr
refin
relat
requir
sampl
save
scheme
show
shown
sine
storag
transform
troubl
unstabl
valu
.I 2355
accuraci
algorithm
arithmet
automat
cacm
clenshaw
companion
comput
cosin
cost
curti
discuss
error
especi
estim
experi
fast
fourier
gentleman
high
implement
import
integrand
methodolog
modif
obtain
overcom
paper
part
prohibit
quadratur
reason
receiv
requir
scheme
strategi
summar
transform
valu
varieti
.I 2356
addit
approach
cacm
complet
exampl
goal
illustr
includ
inform
interact
main
mean
meet
modul
paper
parna
part
piec
precis
present
provid
secondari
softwar
specif
suffici
system
techniqu
tutori
varieti
write
written
.I 2357
approach
aspect
basic
batch
cacm
cdc
checkout
christman
comput
cost
criteria
design
develop
element
execut
fabric
implement
includ
initi
input
line
man
modifi
mux
normal
oper
overhead
part
project
provid
reaction
requir
result
simpl
softwar
submit
system
user
year
.I 2358
access
accomplish
achiev
address
allow
appar
assumpt
attribut
bensoussan
cacm
carri
clingen
concept
consider
contemporari
dalei
data
degre
design
direct
discuss
effect
experi
grown
hardwar
honeywel
implement
increasingli
independ
inform
input
larg
limit
line
locat
main
memori
multic
need
oper
output
page
permit
physic
potenti
privileg
program
resid
secondari
segment
sharabl
share
shown
size
softwar
storag
store
system
user
virtual
.I 2359
access
alloc
cacm
chain
compar
condit
constraint
convent
dedic
depend
devic
disk
hash
head
import
improv
index
investig
isam
kei
lack
link
list
locat
long
manag
method
mode
moveabl
mullin
oppos
overflow
percentag
record
satisfi
sequenti
signific
size
small
space
studi
superior
system
techniqu
tight
time
total
treat
unconvent
volum
.I 2360
april
cacm
chain
comment
doubl
hu
tree
.I 2361
april
cacm
chenei
note
walden
.I 2362
algorithm
april
cacm
equat
linear
moler
solver
.I 2363
algorithm
april
cacm
minim
span
tree
whitnei
.I 2364
algorithm
april
cacm
complex
control
error
function
gamma
kuki
.I 2365
april
cacm
common
comput
convent
effici
fortran
improv
larg
loop
matrix
modest
modif
moler
nest
oper
order
page
problem
produc
program
revers
run
save
signific
situat
system
.I 2366
accumul
addit
algorithm
appear
april
cacm
complex
comput
continu
control
data
effect
error
estim
experiment
fortran
function
gamma
includ
insur
issu
kuki
log
modifi
object
present
program
reduc
regard
respect
round
section
standard
time
valu
variabl
.I 2367
april
cacm
compon
comput
concern
cours
cultur
defin
describ
discuss
divid
easier
econom
effect
exampl
format
hope
horowitz
impact
initi
issu
list
main
make
moral
morgan
outlin
paper
part
polit
portion
present
propos
purpos
refer
relev
remain
respons
scientist
select
set
shaw
social
societi
subject
topic
.I 2368
algorithm
april
cacm
case
chase
comput
connect
cut
exist
explain
fact
game
goal
good
graph
guarante
implement
know
major
move
need
nonsimilar
paper
plai
player
program
routin
shannon
simpl
strategi
switch
tutori
valid
win
.I 2369
addit
approach
april
ax
axi
cacm
chang
classifi
comparison
defin
describ
determin
dimension
discuss
elimin
extend
fix
hidden
invis
line
long
matsushita
mean
method
object
pair
paper
part
polygon
present
rapidli
relationship
remain
rotat
scheme
simultan
tabl
tree
type
visibl
work
.I 2370
analog
applic
april
cacm
camera
center
charact
comput
control
design
digit
displai
dot
equip
experiment
facil
fly
herbst
ibm
imag
includ
input
interact
interfac
laboratori
mode
oper
optic
output
pattern
present
process
program
recognit
research
scan
scanner
signal
special
spot
support
system
thoma
tv
typic
varieti
vector
watson
year
.I 2371
applic
april
cacm
commun
comput
discuss
distribut
exist
extend
hypothet
interprocess
network
process
resourc
share
system
time
walden
.I 2372
access
april
cacm
check
column
conwai
data
decis
depend
distinguish
element
enabl
execut
exist
explain
featur
framework
function
gener
implement
independ
indic
inform
item
matrix
maxwel
measur
model
morgan
perform
propos
repeatedli
repres
row
rule
secur
serv
set
system
time
todai
translat
user
.I 2373
algorithm
assess
assumpt
averag
cacm
character
definit
den
depend
deriv
distinct
distribut
effect
effici
ensembl
estim
gener
independ
interpag
interrefer
interv
lru
march
miss
model
observ
page
program
properti
quantiti
rate
recent
refer
referenc
relat
schwartz
set
shown
size
statist
time
work
.I 2374
cacm
coffman
dynam
effici
examin
experi
fix
gaussian
increas
jr
justifi
local
march
mathemat
mean
model
multiprogram
oper
partit
procedur
process
program
provid
requir
ryan
shown
stationari
storag
studi
substanti
system
util
.I 2375
algorithm
analysi
analyt
cacm
choic
compar
condit
criteria
differenti
discrimin
discuss
disk
expect
function
head
implement
includ
individu
input
introduc
known
load
march
maximum
meaning
measur
movabl
obtain
orient
perform
pinkerton
polici
rang
request
result
schedul
seek
select
show
simul
system
teorei
time
total
util
varianc
wait
wide
.I 2376
buffer
cacm
commun
concurr
consist
correctli
deadlock
defin
demonstr
deposit
descript
easi
formal
frame
habermann
make
march
mechan
messag
oper
overflow
process
prove
receiv
remov
run
send
sender
synchron
system
underflow
.I 2377
access
achiev
address
allow
architectur
argument
aspect
associ
automat
boundari
cacm
call
case
companion
comput
concentr
cross
decreas
describ
hardwar
ident
implement
import
includ
inform
march
mechan
memori
occur
paper
part
pass
perform
privileg
procedur
processor
protect
refer
referenc
ring
saltzer
scheme
schroeder
segment
subsequ
subsystem
supervisor
system
trap
user
util
valid
.I 2378
abl
action
activ
advantag
approach
base
cacm
combin
complic
compound
comput
concept
detail
devic
directori
discuss
error
event
execut
extern
function
gain
handl
implement
independ
manag
march
memori
occurr
oper
organ
outlin
part
primit
process
program
remaind
request
schedul
set
small
softwar
supervisor
supervisori
system
view
wait
.I 2379
architectur
cacm
combin
complex
comput
concurr
defin
design
develop
effect
emphasi
experiment
exploit
featur
guid
liskov
machin
march
microprogram
multiprogram
oper
paper
principl
produc
simpli
small
softwar
support
system
test
unusu
user
venu
.I 2380
achiev
arpa
augment
bbn
beranek
bobrow
burchfiel
cacm
capabl
checkout
clean
comprehens
compromis
dec
describ
design
develop
flexibl
goal
hardwar
implement
import
includ
interact
intim
larg
machin
major
march
memori
met
month
multiprocess
murphi
network
oper
page
pdp
power
provid
reliabl
report
requir
servic
set
share
site
special
specif
specifi
structur
system
tenex
termin
time
tomlinson
uniform
virtual
.I 2381
averag
binari
cacm
corrigendum
dens
februari
flore
length
list
madpi
order
search
.I 2382
cacm
corrigendum
februari
gordon
herman
pictur
project
reconstruct
.I 2383
alien
aspect
cacm
characterist
composit
comput
discov
discrimin
discuss
februari
fragment
gener
harmoni
human
illiac
includ
kind
known
melodi
moorer
music
output
popular
present
previou
probabl
problem
program
relev
sampl
scheme
sequenc
short
show
simul
sound
strang
suit
theori
theoriz
unfamiliar
western
work
written
.I 2384
algorithm
cacm
februari
hidden
line
plot
program
williamson
.I 2385
algorithm
cacm
complex
februari
jenkin
polynomi
traub
zero
.I 2386
cacm
corrigendum
dynam
februari
microprogram
organ
processor
program
tucker
.I 2387
analysi
assist
cacm
central
compar
comput
cost
decis
deriv
econom
factor
februari
halstead
instal
involv
larg
machin
mathemat
maximum
model
multimachin
oldehoeft
polici
power
problem
simpl
singl
versu
.I 2388
ad
algorithm
averag
binari
branch
cacm
compar
discuss
februari
form
grown
item
length
log
longer
make
martin
ness
number
optim
present
proport
quicksort
reduc
restructur
retriev
sort
time
tree
uniform
.I 2389
accord
algol
algorithm
allow
arrang
cacm
class
comput
constraint
detail
eastman
express
extens
februari
formul
gener
heurist
includ
languag
manipul
mean
object
plan
preliminari
problem
program
reli
report
repres
result
search
set
solv
space
system
test
varieti
.I 2390
assum
author
background
base
bring
cacm
comment
commun
comput
condit
contribut
creat
describ
drawback
explos
februari
interact
know
knowledg
maintain
mathemat
mean
minimum
multitermin
obtain
organ
pager
paper
place
problem
propos
provid
read
reader
requir
research
result
role
scienc
scientif
select
store
subtre
suggest
system
terminolog
theorem
tree
updat
user
work
writer
.I 2391
algorithm
cacm
januari
polynomi
schrack
symmetr
unitari
.I 2392
algorithm
cacm
januari
macleod
matrix
rectangular
situ
transposit
.I 2393
algorithm
cacm
calcul
einarsson
fourier
integr
januari
.I 2394
cacm
januari
monoton
order
posit
salzer
.I 2395
algorithm
cacm
constraint
diagon
jacm
januari
juli
linear
magnifi
method
nonlinear
program
publish
quadrat
regress
shrager
.I 2396
action
add
addit
allow
ambigu
analysi
answer
appli
base
cacm
compat
compon
comput
concept
content
demonstr
direct
earli
edit
elimin
emploi
english
exampl
familiar
find
form
format
gener
includ
indirect
inform
input
interpret
intersect
januari
languag
mccalla
memori
model
muse
natur
network
notat
pars
perform
present
procedur
process
purpos
question
quillian
rang
repertoir
report
resolv
restrict
rule
sampson
semant
sentenc
similar
simpl
simplifi
special
structur
syntact
text
tlc
tree
understand
unrestrict
valid
verif
.I 2397
cacm
corrigendum
januari
optim
polyphas
shell
sort
.I 2398
advanc
advantag
applic
attach
author
basic
cacm
cai
call
capabl
catalyst
catalystincorpor
comput
discuss
dwyer
experi
extens
featur
flexibl
function
gener
guid
illustr
implement
independ
interact
januari
level
mix
mode
newbas
orient
pedagog
preliminari
provid
purpos
scan
school
secondari
set
show
student
system
teacher
urban
user
.I 2399
applic
aspect
button
cacm
cathod
cost
crt
discuss
displai
djorup
economi
edit
entri
function
implement
iron
januari
keyboard
low
manipul
oper
potenti
program
rai
station
system
test
tube
.I 2400
altern
angl
cacm
comput
computation
curv
detect
duda
effici
explain
fit
gener
hart
hough
intercept
interest
interpret
januari
line
method
paper
paramet
pictur
point
procedur
propos
radiu
show
simplifi
slope
sourc
todetect
transform
.I 2401
algorithm
analog
binari
cacm
complex
configur
count
descript
determin
disconnect
discuss
element
emploi
envis
featur
hardwar
implement
integr
isol
januari
larg
levialdi
matrix
maximum
mcculloch
merg
method
natur
network
neural
number
obtain
parallel
pattern
pictur
pitt
possibl
present
princip
problem
procedur
process
regard
regardless
review
scale
shrink
singl
small
step
technolog
term
window
.I 2402
adapt
advantag
algorithm
applic
approach
autocorrel
avail
base
basi
biolog
bound
build
cacm
chemic
comput
computation
continu
correct
correl
coupl
cross
crystallograph
crystallographi
data
demonstr
determin
develop
digit
dimension
effect
encourag
environ
especi
experiment
fact
field
frame
function
fundament
graphic
hasbeen
hinder
incomplet
inform
intens
interact
interest
intrins
januari
larg
lesk
macromolecul
make
measur
model
molecular
number
pattern
patterson
phase
pictori
power
problem
rai
recognit
refer
refin
signific
simpl
standard
structur
system
techniqu
test
upper
usual
.I 2403
algorithm
cacm
decemb
herriot
interpol
natur
procedur
spline
.I 2404
algorithm
cacm
decemb
exponenti
gautschi
integr
.I 2405
algorithm
cacm
decemb
kubicek
linear
matrix
system
tridiagon
.I 2406
advanc
appar
applic
aspect
base
cacm
comput
concentr
concern
data
decemb
declar
definit
describ
discuss
distribut
increasingli
kei
languag
logic
manag
map
need
paper
past
physic
realiz
review
sa
siblei
structur
system
taylor
work
.I 2407
cacm
couger
cours
curriculum
decemb
descript
detail
discuss
educ
identifi
implement
incorpor
inform
materi
need
organ
present
problem
program
propos
recommend
relat
system
undergradu
.I 2408
biharmon
cacm
compar
decomposit
direct
directli
ehrlich
eigenvalu
eigenvector
equat
iter
method
novemb
poisson
semidirect
solv
squar
versu
.I 2409
algorithm
appli
approxim
assum
cacm
classic
depend
equat
explicit
explicitli
fourier
hopf
integr
known
novemb
paramet
posit
solut
stenger
techniqu
transform
wiener
.I 2410
cacm
chebyshev
clenshaw
combin
convert
expans
finit
formula
gener
ham
novemb
orthogon
pn
polynomi
recurr
salzer
satisfi
scheme
seri
sum
term
.I 2411
cacm
novemb
program
structur
tree
wegner
.I 2412
brent
cacm
comment
feldman
low
novemb
.I 2413
algorithm
arithmet
cacm
comparison
counterexampl
den
discuss
execut
express
gener
graham
heurist
note
novemb
optim
order
present
schedul
subexpress
suppos
task
time
tree
unequ
.I 2414
algorithm
arithmet
cacm
field
finit
lam
mckai
novemb
overa
.I 2415
algorithm
automat
cacm
finit
integr
interv
novemb
numer
patterson
.I 2416
algorithm
brenner
cacm
matrix
novemb
place
transposit
.I 2417
algorithm
cacm
combinatori
ehrlich
novemb
.I 2418
cacm
hill
novemb
student
.I 2419
algorithm
cacm
eigenvalu
matrix
novemb
real
reinsch
symmetr
tridiagon
.I 2420
account
algorithm
automat
axiom
base
built
cacm
close
comprehens
descript
detail
develop
effici
embodi
experi
found
havingparti
hyper
infer
involv
made
mind
modifi
need
norton
novemb
order
paper
paramodul
partial
perform
power
predic
present
problem
program
prove
prover
relationship
replac
resolut
rule
shown
slagl
solv
theorem
transit
version
.I 2421
accommod
accumul
algorithm
area
barrett
binari
buffer
cacm
caus
convers
convert
core
crt
data
descript
devic
displai
draw
entir
execut
fast
format
fulli
gener
graphic
group
hand
hardcopi
hardwar
imag
increas
jordan
jr
larg
line
link
list
maintain
memori
multipl
novemb
output
pass
percent
pictur
plot
portion
primari
procedur
process
provid
publish
random
raster
reduc
requir
reserv
result
reus
scan
screen
singl
slight
slow
small
softwar
storag
strip
structur
system
time
translat
xy
.I 2422
adapt
cacm
correct
corrigendum
jame
novemb
partridg
program
statement
.I 2423
algol
appli
approach
bit
bnf
cacm
call
card
cdc
code
compil
compress
comput
construct
core
correspond
describ
empti
entri
fortran
gener
grammar
input
link
memori
mickuna
minut
novemb
occupi
paper
pars
parser
pass
pg
possibl
program
purdu
rule
schneider
sourc
speed
subroutin
syntact
system
tabl
translat
typic
univers
word
xpl
.I 2424
addit
amount
avail
berkelei
cacm
california
check
consist
construct
continu
cost
data
decis
design
dynam
effect
ensur
experiment
fabri
fault
gratuit
happen
hardwar
impli
improperli
independ
lead
made
make
modest
multipl
novemb
oper
perform
presenc
prime
privaci
properti
reinforc
requir
share
singl
softwar
system
techniqu
time
univers
unreli
user
verif
.I 2425
bachman
cacm
navig
novemb
programm
.I 2426
algorithm
cacm
comput
determin
gener
lewart
octob
plot
scale
.I 2427
algorithm
bivari
cacm
distribut
donnelli
normal
octob
.I 2428
algorithm
burkowski
cacm
class
cubic
differenti
equat
function
hoskin
octob
solut
spline
.I 2429
algorithm
altern
cacm
calcul
direct
implicit
octob
optimum
paramet
procedur
saylor
sebastian
.I 2430
algorithm
cacm
circuit
elementari
graph
octob
syslo
.I 2431
algorithm
approxim
cacm
discret
interv
linear
octob
program
rober
.I 2432
addendum
algorithm
bohlen
cacm
divis
mifsud
multipl
octob
precis
.I 2433
algorithm
alloc
cacm
call
characterist
code
compil
conclus
control
crucial
data
design
develop
discuss
drawn
effort
expect
exploit
express
extend
featur
fortran
hardwar
illiac
implement
implic
influenc
iv
ivtran
languag
layout
mean
method
millstein
octob
optim
paper
parallel
part
present
problem
review
satisfactori
singl
storag
structur
suitabl
unconvent
util
.I 2434
assumpt
cacm
den
dene
examin
interrefer
interv
introduc
model
modifi
note
octob
omiss
overcom
page
paramet
priev
reconsid
rederiv
resid
select
set
work
.I 2435
advantag
algorithm
alloc
anew
cacm
case
class
dynam
fibonacci
gener
hirschberg
includ
introduc
memori
mention
octob
similar
special
system
.I 2436
attempt
boundari
cacm
caller
condit
confin
exampl
execut
explor
inform
justifi
lampson
note
octob
problem
program
set
solut
stake
state
transmit
.I 2437
abstract
accord
address
algorithm
analysi
analyt
appli
approach
assum
averag
cacm
classifi
concept
distribut
gener
group
identifi
kei
lum
method
number
octob
paper
partial
perform
potenti
present
probabilist
randomli
select
space
suitabl
transform
weight
.I 2438
access
activ
alloc
applic
argument
assum
automat
backtrack
basic
block
bobrow
cacm
case
control
coordin
coroutin
dealloc
discuss
durat
dynam
environ
exist
expens
explicitli
flow
function
hold
ident
implement
initi
label
link
model
multipl
multiprocessor
multitask
necessarili
nest
octob
paper
pass
present
procedur
process
processor
properti
real
requir
retent
run
simpl
singl
space
stack
storag
straightforward
structur
techniqu
ti
time
usual
valu
variabl
wegbreit
.I 2439
cacm
commun
control
dartmouth
describ
environ
execut
facil
implement
input
instruct
interact
languag
mcgeachi
multipl
octob
output
paper
program
remot
requir
share
simultan
standard
system
termin
time
user
written
.I 2440
algorithm
cacm
driessen
hunt
lem
local
polynomi
root
septemb
.I 2441
algorithm
cacm
hidden
line
plot
program
septemb
williamson
.I 2442
algorithm
cacm
lawrenc
matrix
packag
septemb
spars
.I 2443
algorithm
cacm
gener
lexicograph
order
permut
roi
septemb
.I 2444
algorithm
bron
cacm
cliqu
find
graph
kerbosch
septemb
undirect
.I 2445
algorithm
cacm
fencl
problem
rout
septemb
.I 2446
algorithm
analysi
cacm
group
hunter
represent
septemb
skew
symmetr
william
.I 2447
analysi
barnhil
bivari
cacm
comput
cubatur
error
function
graph
kernel
numer
obtain
pilcher
remaind
result
sard
septemb
.I 2448
cacm
execut
revers
septemb
zelkowitz
.I 2449
automata
base
cacm
cobol
compil
determinist
gate
handl
lookup
manner
nondeterminist
offer
pl
poplawski
present
problem
septemb
simpl
solut
structur
symbol
tabl
techniqu
theori
variabl
.I 2450
algorithm
alloc
base
basi
behavior
cacm
commonli
data
deal
dearth
design
empir
encount
evid
experiment
field
find
hope
literatur
measur
model
page
program
propos
publish
recent
resourc
rodriguez
rosel
schedul
septemb
set
substanti
theoret
word
work
worker
year
.I 2451
academ
afford
algorithm
applic
attract
base
bit
cacm
casei
collect
comparison
concept
consid
data
design
desir
determin
effici
essenti
experiment
express
format
hand
ideal
illustr
implement
inform
intuit
locat
mean
model
observ
oper
optim
ordinarili
paper
perform
pose
potenti
practic
problem
procedur
process
queri
record
repres
represent
respons
retriev
satisfi
scheme
search
sens
septemb
serv
show
small
standard
structur
studi
techniqu
term
tree
valu
vector
.I 2452
access
affect
averag
base
cacm
cardena
character
conveni
cost
data
design
devic
discuss
elus
estim
evalu
facilit
factor
methodolog
model
organ
perform
present
primarili
process
program
queri
relat
select
septemb
situat
specif
storag
structur
studi
subject
system
time
tool
total
work
.I 2453
action
algorithm
appli
applic
averag
cacm
code
compar
comput
condit
convers
convert
cost
decis
develop
easi
entri
equal
felt
flowchart
ganapathi
gener
heurist
idea
inform
limit
method
minimum
optim
paper
practic
previous
process
program
publish
rajaraman
reinwald
requir
rule
septemb
singl
smaller
soland
structur
suit
tabl
take
test
theori
time
translat
tree
.I 2454
algorithm
alloc
base
buzen
cacm
close
comput
consider
custom
deriv
detail
dimension
distribut
effici
equilibrium
evalu
examin
exponenti
express
highli
implement
iter
margin
method
network
order
present
queue
septemb
server
simpl
storag
strategi
techniqu
.I 2455
amount
august
avl
balanc
basi
cacm
case
compar
correct
correspond
data
decreas
deriv
duli
earlier
expect
experi
experiment
factor
foster
found
gener
good
imbal
includ
increas
integ
mean
paper
perform
permit
propos
reason
requir
restructur
result
retriev
shape
shown
small
standard
ten
theoret
time
tree
triangl
unit
worst
.I 2456
august
begin
cacm
capabl
control
convert
defin
definit
discuss
enter
exit
flowchart
form
implic
kasami
level
loop
multi
nest
node
peterson
practic
program
properli
repeat
sequenc
shown
singl
split
statement
suffic
tokura
written
.I 2457
applic
approach
august
cacm
clarif
comput
detail
differ
discuss
emphasi
examin
exampl
extens
includ
induct
known
main
manna
method
methodsfor
ne
paper
power
practic
present
program
properti
prove
purpos
recurs
result
structur
theoret
vuillemin
.I 2458
algorithm
august
cacm
local
polynomi
root
william
.I 2459
algorithm
alphabet
august
byrn
cacm
code
hu
method
minimum
redund
tucker
.I 2460
algorithm
august
cacm
clenshaw
curti
good
quadratur
.I 2461
algorithm
august
cacm
graph
plotter
watkin
.I 2462
algorithm
august
cacm
demorgan
effici
gener
number
prime
.I 2463
algorithm
andrejkova
august
cacm
complex
function
gamma
vinar
.I 2464
algorithm
august
cacm
complex
constrain
kuester
method
optim
richardson
.I 2465
algorithm
august
bromwich
cacm
formula
gaussian
integr
piessen
quadratur
.I 2466
algorithm
august
cacm
combin
enumer
liu
object
tang
.I 2467
algorithm
august
cacm
chi
goldstein
quantil
squar
.I 2468
algorithm
august
cacm
function
machura
minim
mulawa
rosenbrock
.I 2469
asynchron
august
cacm
circuit
demonstr
design
develop
emphas
implement
independ
investig
lead
method
misuna
model
modul
net
oper
petri
processor
realiz
speed
studi
us
.I 2470
abstract
accur
appendix
appli
argu
assign
august
axiomat
basi
bodi
briefli
build
cacm
call
combin
complet
composit
concern
concis
condit
consid
contrast
data
defin
demonstr
deriv
descript
detail
determinist
discuss
elementari
environ
fen
formal
function
global
govern
imper
includ
inform
introduc
item
iter
languag
local
maclennan
mechan
mode
model
natur
nondeterminist
notion
oper
paper
paradox
paramet
pass
present
primit
program
proof
question
recurs
relat
row
semant
set
shown
simper
singleton
statement
structur
suitabl
system
techniqu
theorem
theori
touch
type
unit
web
.I 2471
adapt
advi
analysi
approxim
artifici
august
basic
cacm
championship
checker
chess
choos
chosen
complet
construct
defeat
determin
domino
emploi
entri
evalu
game
incomplet
indic
inform
intellig
interact
learn
linear
move
paramet
partnership
plai
player
polynomi
principl
probabl
program
sabil
signatur
situat
smith
strategi
tabl
third
tournament
weight
win
written
.I 2472
algorithm
cacm
juli
kernighan
minim
span
tree
.I 2473
algorithm
cacm
collin
hidden
juli
line
macleod
plot
program
.I 2474
algorithm
cacm
differenti
difsub
equat
juli
nikolai
ordinari
solut
.I 2475
algorithm
cacm
fiala
juli
linear
problem
program
solut
variabl
.I 2476
cacm
context
equival
free
grammar
graph
hall
juli
.I 2477
bochmann
cacm
exit
goto
juli
loop
multipl
.I 2478
cacm
comput
juli
kandel
scienc
seminar
undergradu
.I 2479
acm
activ
addendum
addit
administr
cacm
committe
comput
cours
curriculum
design
educ
effect
felt
format
framework
futur
graduat
import
includ
inform
juli
justifi
manag
mcfarlan
nolan
object
oper
origin
outlin
prepar
profession
program
propos
reason
recommend
report
system
understand
work
.I 2480
cacm
cours
critic
cultur
demonstr
design
enrich
enter
expect
familiar
final
form
function
goal
graduat
inform
instrument
involv
juli
languag
learn
live
music
numer
offer
organ
paper
plai
present
prior
process
produc
profession
program
provid
purpos
rosin
rule
serv
set
similar
skill
sourc
student
taught
teach
teacher
user
utter
vital
.I 2481
buffer
cach
cacm
central
comput
consid
cost
distribut
express
fast
fraction
function
gelenb
integr
juli
manag
maxim
memori
nonswap
obtain
optim
polici
primari
process
program
storag
studi
swap
system
time
unit
virtual
.I 2482
alloc
avoid
base
cacm
concept
construct
deadlock
detect
effect
frequent
hierarch
howard
individu
jr
juli
method
mix
mixtur
occur
oper
paper
practic
present
prevent
problem
provid
resourc
solut
subproblem
subsystem
suggest
system
tailor
techniqu
.I 2483
achiev
action
addit
algorithm
cacm
calcul
call
catastroph
chess
clear
close
club
coko
command
comparison
conceptu
control
cooper
cpu
curb
definit
deploy
desir
distinct
entir
environ
experiment
exponenti
extent
fischer
fortran
game
growth
heart
human
ibm
iii
interest
juli
koz
kozdrowicki
larg
lasker
level
logist
lower
made
map
minim
move
multipl
mysteri
optim
phenomenon
plagu
plai
player
preanalysi
procedur
program
prune
rate
region
represent
search
sec
select
set
simpl
specif
standard
strateg
structur
tactic
time
tree
trim
written
.I 2484
algorithm
base
basi
binari
cacm
concept
constraint
construct
data
defin
design
develop
element
formal
formul
gener
graph
huang
import
inform
juli
list
logic
method
natur
note
object
organ
present
problem
process
provid
reduc
relat
repres
result
ring
select
serv
set
storag
structur
subject
subset
theori
tree
valuabl
view
.I 2485
acquisit
activ
base
budget
cacm
chang
charact
comput
control
correl
data
descript
develop
evolv
expenditur
hypothesi
ii
iii
individu
intens
iv
juli
manag
nolan
organ
orient
pattern
period
plan
present
process
prolifer
relat
resourc
roughli
servic
stage
studi
suggest
system
task
time
user
.I 2486
accent
alphabet
alt
american
aris
aspect
assist
begin
break
cacm
charact
comput
correct
devis
diacrit
end
error
float
foreign
formula
gener
highli
includ
inform
input
institut
june
keyboard
kirk
line
mark
materi
mathemat
mean
overprint
partli
photocompos
photocomposit
physic
posit
precis
problem
represent
solut
special
symbol
system
technic
text
typeset
word
yuni
.I 2487
approxim
boundari
cacm
case
cubic
delta
differ
differenti
equat
error
finit
fourth
hoskin
june
local
order
problem
recurr
reduc
relat
relationship
represent
shown
simpli
solut
special
spline
term
truncat
.I 2488
arrai
cacm
continu
cubic
curv
data
deriv
determin
ferguson
fit
formul
function
involv
june
linear
matric
piecewis
planar
possess
problem
squar
stalei
.I 2489
algorithm
beyer
cacm
june
multipli
number
partit
restrict
swinehart
.I 2490
access
algorithm
biconnect
cacm
compon
comput
connect
dynam
edg
effici
execut
graph
hopcroft
iter
june
manipul
max
number
partit
path
present
produc
proport
random
requir
simpl
space
start
tarjan
time
vertex
vertic
.I 2491
altern
bell
cacm
code
concept
extens
hardwar
interpret
june
languag
machin
mention
need
optim
present
realiz
softwar
thread
.I 2492
action
avoid
base
cacm
characterist
chart
complex
condit
decis
defin
descript
develop
format
grid
june
limit
minim
pars
problem
propos
repetit
requir
result
situat
strunz
syntact
tabl
techniqu
.I 2493
access
base
cacm
caus
cost
data
due
examin
frequent
high
increas
ineffici
june
optimum
organ
paper
point
prohibit
reduc
reorgan
scheme
select
shneiderman
strategi
structur
updat
.I 2494
aid
analysi
appli
brought
cacm
charact
cluster
comparison
comput
conjunct
consist
correl
correspond
dark
data
dissimilar
distinct
element
factor
gener
glanc
graphic
group
hierarch
illustr
june
known
ling
matrix
method
overstrik
plot
principl
print
psycholog
rearrang
represent
scheme
set
shade
show
similar
small
symbol
test
.I 2495
adapt
arithmet
cacm
code
comput
dai
express
gener
instruct
june
optim
present
set
stockhausen
.I 2496
access
cacm
call
collect
comput
determin
disciplin
drum
entir
fuller
instantan
june
known
latenc
length
longer
minim
minimum
necessarili
optim
popular
posit
practic
record
revolut
schedul
sequenc
shortest
show
sltf
stone
system
time
total
vari
.I 2497
advantag
branch
cacm
call
clear
content
cycl
dec
develop
dual
effect
encount
event
examin
gener
hill
immedi
implement
instruct
interlock
interrupt
june
locat
lock
memori
method
modul
multiprocessor
paus
pdp
processor
read
real
repertoir
requir
result
scheme
sequenc
set
special
synchron
system
time
type
uninterrupt
write
.I 2498
algorithm
assign
cacm
choos
combin
consid
convex
densiti
discuss
erlang
expect
express
finit
fragment
function
gelenb
implement
intern
june
memori
minim
number
page
partit
probabl
problem
segment
simpl
size
solv
space
system
tabl
total
virtual
wast
.I 2499
account
adjust
algorithm
alloc
amount
appli
applic
arbitrari
broader
cacm
case
channel
charg
close
complet
compon
connect
control
criterion
depend
detail
dynam
effici
enabl
essenti
execut
extens
fair
gain
gener
hamlet
hold
idl
input
involv
june
machin
maxim
meet
memori
minim
monitor
multiprogram
omit
oper
output
overcharg
overhead
paid
paramet
principl
problem
processor
program
prove
provid
question
rais
rel
repeat
requir
resourc
respons
result
serv
share
small
suggest
system
thought
time
turn
uncharg
unfair
usag
virtual
weight
.I 2500
activ
addit
alloc
amount
approach
avoid
cacm
comprehens
conflict
cost
deadlock
detect
due
effici
environ
expens
frailei
gener
implement
incorpor
infrequ
involv
keep
larg
level
link
list
maintain
manag
massiv
multiprogram
number
oper
overcom
overhead
part
permit
portion
practic
prevent
program
purpos
regard
requir
resourc
run
scale
schedul
share
situat
space
state
system
task
techniqu
time
usag
.I 2501
address
align
appear
borgelt
cacm
comprehens
comput
conjunct
connect
content
describ
descript
edit
entri
extern
facil
fajman
featur
gener
includ
interact
intern
job
justif
kind
letter
major
manipul
manuscript
method
oper
orvyl
paper
power
program
provid
purpos
remot
retriev
share
short
structur
system
termin
text
time
typewrit
wylbur
.I 2502
aspect
cacm
comment
comput
educ
estel
practic
scienc
.I 2503
cacm
comment
comput
music
wexelblat
.I 2504
cacm
composit
comput
concern
linguist
mcmorrow
music
.I 2505
adjac
algorithm
cacm
free
permut
reflect
roi
rosari
transposit
.I 2506
algorithm
cacm
matrix
packag
sale
spars
.I 2507
algorithm
arithmet
cacm
equat
exact
howel
linear
residu
solut
.I 2508
algorithm
cacm
effici
increas
quicksort
wheeler
.I 2509
algorithm
cacm
linear
minit
obradov
program
.I 2510
algorithm
cacm
holmgren
kolm
linear
minit
obradov
program
.I 2511
algorithm
bayer
cacm
maxflow
.I 2512
algorithm
cacm
coulomb
function
vo
wave
.I 2513
addit
algorithm
bit
cacm
destroi
effici
lisp
list
mark
move
node
nonrecurs
number
origin
proport
reingold
requir
run
storag
structur
time
type
.I 2514
arrai
cacm
choic
consist
control
deriv
design
develop
exampl
fortran
geometr
grammar
instanc
interact
involv
languag
matric
mercer
packag
parallel
pars
pattern
permit
procedur
program
random
raster
rosenfeld
rule
scheme
select
simpl
system
test
user
weight
.I 2515
activ
algorithm
arc
cacm
construct
corneil
counterexampl
cover
event
exponenti
fisher
gotlieb
grow
includ
lee
liebman
minim
minima
nemhaus
network
node
number
parallel
preced
present
preserv
problem
procedur
produc
project
relat
repres
requir
set
show
time
.I 2516
access
analysi
assum
cacm
capabl
cell
comput
connect
consist
core
data
deriv
determin
disk
effect
emploi
equat
extend
fast
hardwar
hierarch
increas
inform
level
linearli
link
list
memori
multipl
oper
organ
predict
probabilist
random
retriev
salasin
semiconductor
sequenti
storag
structur
system
time
.I 2517
action
ambigu
applic
argu
cacm
comment
comput
convent
convers
decis
discuss
johnson
king
mask
mean
method
multi
paper
place
program
publish
recent
rule
set
similar
singl
tabl
tale
techniqu
translat
usag
work
.I 2518
applic
approach
aspect
cacm
class
combin
compromis
construct
decis
discuss
effect
element
exist
gener
larg
low
predefin
problem
program
propos
purpos
questionnair
questionnairi
scale
select
signific
sourc
special
statement
tabl
.I 2519
analyz
augment
base
cacm
circl
commun
complex
comput
control
devic
difficulti
effect
examin
exhibit
includ
inform
inher
interact
involv
languag
linguist
mathemat
natur
notat
pager
problem
process
psycholog
result
retriev
scientist
sophist
structur
system
term
turn
viciou
wai
written
.I 2520
algorithm
april
cacm
common
divisor
good
greatest
integ
multipli
ragland
.I 2521
algorithm
april
brouck
cacm
chebyshev
manipul
seri
subroutin
ten
.I 2522
algorithm
alloc
analysi
announc
april
base
behavior
cacm
case
compet
comput
control
data
depend
design
develop
direct
discuss
dispatch
dupui
emploi
evalu
futur
implement
larg
method
model
page
permit
present
principl
process
program
propos
recent
report
research
resourc
result
rodriguez
rosel
set
share
sourc
strategi
system
time
work
.I 2523
accord
analysi
appli
april
base
broken
cacm
clean
cloud
color
compar
construct
convert
correspond
cover
criteria
detect
differ
edg
iii
map
merg
method
obtain
pictur
process
propag
region
result
rosenfeld
satellit
scene
size
solid
strong
surround
techniqu
textur
topolog
.I 2524
achiev
algorithm
approach
april
burkhard
cacm
closest
compar
comparison
concept
defin
deriv
desir
discuss
effici
empir
find
graph
inequ
intend
kei
keller
match
method
metric
number
present
problem
queri
reduc
requir
result
satisfi
search
set
space
structur
suitabl
term
theoret
.I 2525
accuraci
analyt
approxim
april
arithmet
binari
cacm
case
chop
codi
combin
comput
differ
digit
equival
error
estim
evalu
float
found
guard
hexadecim
inaccuraci
kuki
mode
modifi
number
paper
point
present
product
represent
result
round
save
sens
shown
statist
studi
sum
superior
system
test
usual
.I 2526
analyt
april
asymmetr
back
cacm
continu
convent
develop
devic
differ
emphasi
hierarchi
holograph
implic
introduc
memori
model
multiprogram
oper
optic
past
place
present
ratio
rca
read
rel
requir
respect
roughli
secondari
shown
situat
small
storag
store
studi
symmetr
system
time
wai
william
write
.I 2527
actual
alloc
apl
april
arrai
cacm
call
check
comput
convert
correctli
describ
detect
directli
error
execut
fulli
function
hassitt
high
implement
lageschult
languag
level
lyon
machin
memori
number
oper
past
programm
propos
report
scalar
statement
subscript
type
vector
.I 2528
algorithm
binari
cacm
lau
march
pattern
project
reconstruct
.I 2529
algorithm
binari
cacm
chang
march
pattern
project
reconstruct
.I 2530
algorithm
cacm
extract
fashion
march
optim
phrase
space
wagner
.I 2531
cacm
educ
glut
graduat
march
payn
ph
.I 2532
bookstein
cacm
harrison
march
.I 2533
cacm
code
grai
march
order
salzer
sequenc
sign
.I 2534
abandon
accommod
assist
batch
cacm
characterist
comment
compat
compil
complet
consid
consider
construct
content
continu
control
conwai
costli
customarili
degre
demonstr
design
diagnost
dialect
domin
effect
effici
effort
emploi
encount
environ
error
establish
execut
explicit
extens
facil
fast
ibm
implement
implicit
introduc
languag
limit
march
maximum
need
object
offer
option
part
permit
persever
pl
process
processor
program
prohibit
provid
reach
remark
repair
requir
sophist
sourc
spite
submit
test
translat
user
wilcox
.I 2535
affect
analyt
approxim
arriv
asynchron
base
cacm
chang
commun
comput
conclud
condit
delai
descript
divis
effect
exponenti
gener
impos
improv
includ
made
march
model
multiplex
multiplexor
natur
notic
offset
output
pack
paramet
perform
poisson
process
queue
reduc
result
schedul
sens
server
share
simul
singl
stochast
studi
system
tandem
time
transmiss
user
valu
.I 2536
access
acquir
advantag
assess
cacm
comput
consid
control
decentr
discuss
effect
embed
emphasi
end
feinroth
franceschini
front
goldstein
hard
hardwar
implement
intellig
larg
line
link
main
march
minicomput
oper
problem
process
processor
provid
remot
scale
shown
simplifi
softwar
specif
system
telecommun
termin
vari
vastli
wire
.I 2537
algorithm
appli
cacm
charact
common
compil
determin
diagnost
dynam
exist
grow
hand
linearli
march
mathemat
messag
method
minim
minimum
nontrivi
number
optim
overlap
paper
phrase
present
problem
program
reli
requir
rise
save
select
set
solv
space
storag
store
string
techniqu
text
time
wagner
.I 2538
acm
advanc
appoint
aust
author
cacm
ccc
colleg
committe
comput
consid
constraint
cours
curriculum
descript
detail
discuss
engel
extens
faculti
implement
includ
librari
limit
list
made
make
march
object
problem
program
purpos
recommend
regard
report
resourc
satisfi
school
scienc
set
small
specif
subcommitte
suggest
suppli
uniqu
univers
varieti
wide
work
.I 2539
algorithm
cacm
crowlei
equat
exp
februari
fritsch
shafer
solut
transcendent
.I 2540
cacm
corrigendum
den
februari
model
properti
schwartz
set
work
.I 2541
advantag
algorithm
alloc
alter
balzer
cacm
commun
compil
comput
concept
concurr
construct
correctli
creat
decis
describ
design
domain
effect
enabl
endang
explor
featur
februari
freedom
function
hierarch
implement
import
incorpor
increment
integr
interact
ispl
laboratori
languag
machin
mainten
mechan
microcod
move
oper
overview
paper
perform
program
resourc
schedul
separ
simplifi
subsystem
suggest
synergist
system
.I 2542
actual
advers
affect
analysi
base
cacm
clanci
correct
costli
critic
describ
descript
design
detect
devanei
develop
difficulti
direct
earli
evalu
evolv
explor
failur
februari
feedback
graham
high
implement
inform
input
integr
jr
languag
level
major
methodolog
obtain
overcom
paper
perform
problem
propos
reason
reimplement
routin
simpl
simul
softwar
sourc
stage
system
.I 2543
brent
cacm
carlo
compar
consider
effici
enter
entri
expect
experi
februari
fortran
full
hash
implement
inform
intend
look
method
mont
nearli
number
predict
probe
reduc
retriev
scatter
storag
tabl
techniqu
theoret
time
verifi
.I 2544
analyt
arithmet
automat
bessel
bound
cacm
cauchi
complex
comput
converg
error
exampl
extend
februari
function
includ
interv
iter
kind
newton
numer
ostrowski
polynomi
real
rokn
root
simpl
theorem
variabl
zero
.I 2545
algorithm
approach
bottom
cacm
creat
deduc
discret
februari
formal
gener
gimpel
implement
kind
languag
notion
pars
pattern
properti
shown
snobol
specif
theori
top
.I 2546
algorithm
appli
approach
cacm
class
construct
context
crespi
deriv
design
exampl
exist
extend
face
februari
free
gener
grammar
grammat
implement
infer
input
interact
languag
larger
lichten
melkanoff
oper
outlin
preced
present
problem
program
propos
reason
reghizzi
restrict
sampl
sentenc
structur
subclass
submit
.I 2547
ad
algebra
applic
area
attribut
basic
boundari
cacm
close
comput
computation
contain
contour
coverag
data
determin
distanc
easi
effici
featur
februari
gener
geometr
handl
illustr
inform
intersect
larg
li
line
make
map
mean
merril
minimum
neighbor
pictori
point
posit
practic
properti
rapid
region
repres
represent
requir
search
searchabl
storag
structur
terrain
union
util
.I 2548
algorithm
cacm
davi
deviat
hill
januari
normal
.I 2549
algorithm
cacm
deviat
dipol
distribut
januari
knop
random
.I 2550
adapt
algorithm
cacm
carlo
gallah
januari
mont
multidimension
quadratur
sampl
stratifi
.I 2551
algol
atkin
cacm
compil
januari
mutual
recurs
restrict
.I 2552
access
bai
cacm
chain
direct
item
januari
note
overflow
tabl
.I 2553
aspect
blount
cacm
comput
discuss
educ
januari
practic
scienc
.I 2554
algorithm
ax
band
bandwidth
block
bx
cacm
calcul
case
condit
crawford
definit
determin
eigenvalu
error
form
gener
invers
januari
lambda
larg
matric
matrix
mn
oper
order
ordinari
partit
posit
problem
reduc
reduct
requir
respect
round
rutishaus
schwartz
similar
step
sum
symmetr
term
.I 2555
algorithm
appli
arithmet
bound
cacm
call
co
comput
denot
desir
effici
ei
error
evalu
expans
exponenti
express
handl
involv
januari
log
oper
order
paper
perform
precis
present
previou
ration
recomput
richman
seri
similarli
simpl
sin
sum
toler
variabl
.I 2556
adapt
analyz
approxim
area
artifici
cacm
confin
consider
correct
extract
featur
feedback
final
improv
inaccuraci
incorpor
intellig
investig
involv
jame
januari
languag
mainli
match
method
oper
partridg
pilot
preliminari
present
principl
process
program
propos
result
section
specif
statement
strategi
studi
survei
toler
tree
.I 2557
algorithm
cacm
column
comput
conform
constraint
discuss
evalu
januari
kuck
machin
matric
matrix
minimum
multipl
muraoka
ordinari
organ
paper
parallel
pars
present
product
properli
requir
row
sequenc
serial
squar
subject
time
vector
.I 2558
access
attempt
authent
cacm
consid
distinguish
function
januari
jr
languag
limit
linguist
made
mechan
morri
produc
program
protect
scheme
subprogram
tag
type
.I 2559
accomplish
alloc
alter
bai
cacm
chang
code
conjunct
delet
discuss
effici
elimin
entri
flag
function
hash
independ
januari
length
linear
method
present
previous
realloc
rescatt
space
statist
tabl
techniqu
theoret
util
.I 2560
access
analysi
busi
cacm
comput
cpu
depend
devic
express
gain
januari
level
long
model
multiprogram
numer
obtain
presenc
present
probabilist
probabl
quantifi
queu
result
run
sequenti
shedler
storag
system
type
util
.I 2561
algorithm
alter
approach
base
cacm
cluster
condit
correct
data
decemb
delet
develop
experi
fact
fals
formal
found
gener
heurist
implement
impos
incomplet
inconsist
induct
infer
inform
introduc
involv
languag
list
make
model
nonnumer
part
perform
present
procedur
program
properti
purpos
queri
respons
retriev
similar
skinner
structur
system
test
varieti
.I 2562
algorithm
cacm
decemb
problem
rout
tesch
.I 2563
algorithm
bron
cacm
decemb
merg
sort
.I 2564
algorithm
cacm
decemb
elli
hidden
line
plot
program
.I 2565
algorithm
brent
cacm
decemb
gaussian
gener
number
pseudo
random
.I 2566
algorithm
cacm
cumul
decemb
distribut
exact
kolmogorov
pomeranz
sampl
small
smirnov
statist
.I 2567
appear
applic
berman
biolog
cacm
case
chu
coeffici
compar
comput
constant
coupl
deal
decemb
design
differenti
effici
equat
especi
explicit
exponenti
faster
favor
forc
fourth
frequent
gener
highli
implement
initi
kutta
linear
magnitud
method
natur
nonstiff
numer
order
ordinari
present
problem
purpos
put
rang
requir
result
routin
rung
singl
solut
standard
step
stiff
system
term
time
usag
.I 2568
algorithm
anarc
applic
approxim
cacm
classic
connect
decemb
definit
discuss
exam
examin
extens
find
formul
gener
graph
includ
introduct
kirchgassn
largest
length
limit
literatur
logic
lower
member
minim
network
node
nondirect
number
oakford
object
obviou
paper
partit
period
present
previou
problem
prove
salazar
schedul
school
size
solut
strongli
subgraph
subset
terminolog
theori
titl
upper
variabl
weight
work
.I 2569
accuraci
approxim
cacm
call
combin
common
comput
conclud
decemb
digit
due
effici
exact
exactli
gamma
gener
greater
integr
johnk
method
mix
non
paper
paramet
present
probabl
procedur
random
reject
shape
shown
simpl
straightforward
switch
variabl
variat
wallac
yield
.I 2570
adam
algorithm
analyz
cacm
case
chandi
coffman
comparison
consist
decemb
determinist
dickson
dynam
execut
graham
list
literatur
minim
optim
order
parallel
partial
present
problem
process
processor
program
random
schedul
set
shown
significantli
solut
studi
suggest
system
task
time
vari
variabl
.I 2571
activ
analyt
bound
cacm
case
chain
control
cpu
decemb
develop
dispatch
effect
emploi
execut
give
hasp
hierarchi
histori
improv
invers
investig
lock
memori
model
modifi
monitor
order
os
paper
perform
period
preemptiv
prevent
prioriti
rearrang
simpl
speed
strategi
strauss
studi
system
task
util
vari
.I 2572
accept
approach
argument
articl
author
cacm
carefulli
commun
complementari
computer
conclus
construct
decemb
decentr
demand
design
desir
drawn
effect
establish
evalu
examin
exist
extern
favor
feasibl
framework
group
implement
inevit
inform
intern
involv
justifi
man
moratorium
polici
posit
press
project
propos
prototyp
prudent
question
repres
side
societi
step
supplementari
sure
system
take
techniqu
technolog
think
ultim
urg
user
util
view
wait
widespread
world
.I 2573
art
cacm
comput
decemb
knuth
program
.I 2574
cacm
evan
exist
label
loop
multipl
novemb
.I 2575
cacm
document
match
novemb
problem
retriev
rijsbergen
van
.I 2576
cacm
fortran
hanson
iv
novemb
repres
simpl
string
techniqu
.I 2577
applic
archaeolog
brown
cacm
data
field
manag
novemb
site
system
werner
.I 2578
cacm
control
dijkstra
distribut
novemb
spite
stabil
system
.I 2579
algorithm
alloc
base
basi
cacm
commonli
compar
comput
count
describ
develop
elimin
evid
freiburghous
introduc
notion
novemb
paper
present
provid
redund
regist
show
significantli
techniqu
usag
.I 2580
addit
address
appear
applic
author
blown
cacm
compos
comput
decid
extent
full
fundament
gener
hardwar
heurist
implement
layman
level
mediocr
method
music
musician
need
novemb
oper
piec
pleas
present
product
profession
rader
requir
result
round
rule
scientist
set
simpl
sound
structur
theori
tradit
tri
weight
.I 2581
ambigu
build
cacm
candid
complet
continu
describ
design
error
garbl
guid
highli
input
local
lpar
miller
novemb
organ
paper
pars
parser
phonem
process
recogn
reliabl
search
sens
speech
spoken
string
structur
system
utter
word
.I 2582
accord
approach
base
cacm
case
concept
critic
data
editor
experiment
extract
ferrari
improv
interact
literatur
local
manag
memori
method
modul
novemb
obtain
oper
optimum
primari
program
propos
refer
restructur
result
set
shown
special
strategi
substanti
suit
superior
system
text
trace
work
.I 2583
cacm
computer
guidelin
hous
human
inform
novemb
report
stanlei
sterl
system
.I 2584
administr
aim
basi
cacm
censu
consid
consider
cours
data
depart
earlier
educ
emploi
enumer
estim
figur
full
gilchrist
justifi
labor
number
octob
programm
recommend
report
suggest
time
train
vocat
weber
year
.I 2585
algorithm
cacm
effici
errata
implement
krogh
nonlinear
octob
problem
project
squar
variabl
.I 2586
adapt
arithmet
cacm
code
comput
dai
errata
express
gener
instruct
octob
optim
present
set
stockhausen
.I 2587
cacm
construct
errata
kleinman
octob
repres
sreenivarsan
synthet
workload
.I 2588
algorithm
cacm
function
kleme
klemsa
minim
octob
rosenbrock
.I 2589
algorithm
cacm
comput
linear
octob
problem
program
proll
quadrat
routin
.I 2590
algorithm
cacm
hypergeometr
kopelaar
octob
.I 2591
algorithm
cacm
invers
laplac
numer
octob
transform
veillon
.I 2592
accuraci
adequ
arbitrari
assum
cacm
capac
characterist
charn
code
comput
correct
effect
evalu
failur
gener
illustr
implement
instal
justif
known
larg
linear
method
necess
numer
octob
paper
permit
present
problem
program
provid
raik
rang
rare
readili
realiz
reason
scale
size
solut
stutz
test
theoret
user
walter
wide
.I 2593
accept
access
advantag
approach
april
back
base
cacm
call
canadai
codasyl
command
comput
conclus
configur
data
dedic
discuss
drawn
end
experiment
function
group
harrison
high
host
implement
ivi
languag
level
manag
octob
propos
report
result
ryder
secondari
storag
system
task
wehr
xdm
.I 2594
accomplish
addit
arbitrari
cacm
check
class
complic
correct
creat
creation
data
declar
delet
element
enabl
ensur
execut
explicit
facil
gaug
guarante
link
list
octob
oper
paper
perform
permiss
permit
program
properli
propos
protect
remedi
restrict
result
scheuermann
shneiderman
situat
structur
suffici
system
time
unreach
user
.I 2595
arbitrari
asymptot
averag
bound
cacm
calcul
consid
den
deriv
develop
discuss
effici
exact
express
finit
follow
function
infinit
interrefer
interv
length
lower
miss
note
obtain
octob
page
paper
pass
properti
rate
refer
relat
replac
satisfi
schwartz
set
shown
singl
size
slutz
statist
string
structur
term
traiger
upper
work
.I 2596
achiev
addit
algorithm
alloc
allow
bit
block
buddi
cacm
call
compar
cost
distribut
dynam
exponenti
extens
fragment
memori
method
octob
origin
peterson
present
request
result
shen
simul
size
smaller
storag
system
total
uniform
weight
.I 2597
alarm
bound
brinch
buffer
cacm
clock
concept
describ
develop
disk
exampl
form
hansen
head
hoar
illustr
implement
includ
introduc
method
monitor
octob
oper
optim
paper
pool
problem
proof
reader
resourc
rule
schedul
semaphor
singl
structur
suitabl
synchron
system
term
version
writer
.I 2598
ad
addit
algorithm
analog
approach
cacm
code
compar
compil
complex
comput
condit
consid
convert
decis
depth
develop
earlier
effici
effort
entri
execut
explor
extend
final
flowchart
global
greater
improv
inform
justifi
limit
literatur
minim
modifi
necessarili
need
noiseless
obtain
optim
paper
perform
problem
program
propos
recent
result
save
search
septemb
shwayder
solut
solv
subsequ
suffici
tabl
theori
time
understood
verhelst
.I 2599
approxim
cacm
checkpoint
interv
optimum
order
septemb
young
.I 2600
algorithm
cacm
comput
eidson
factor
method
schumak
septemb
spline
.I 2601
algorithm
argument
bessel
burrel
cacm
complex
evalu
function
modifi
septemb
.I 2602
algorithm
cacm
dimension
mask
plot
program
rotat
septemb
watkin
.I 2603
bauer
cacm
class
context
determinist
eickel
equival
extend
fact
free
introduc
languag
morri
paper
paul
preced
proper
reduc
result
samelson
schkolnick
septemb
show
shown
simpl
superclass
transit
.I 2604
area
boundari
cacm
center
cheung
convers
cost
design
displai
easili
exampl
function
graphic
implement
includ
interact
linear
manner
minimum
modifi
nonoverlap
obtain
partit
problem
program
proport
region
septemb
servic
solv
subregion
system
total
user
.I 2605
aberth
accord
accuraci
analysi
arithmet
bound
cacm
comput
concept
correct
decim
descript
detail
digit
discard
execut
interv
involv
limit
midpoint
multipl
non
number
numer
oper
place
precis
problem
program
septemb
signific
small
solut
specif
standard
suppli
.I 2606
accuraci
algorithm
approxim
base
bulirsh
cacm
compar
continu
design
differenti
discuss
equat
expans
fail
final
found
fraction
gragg
implement
initi
integ
integr
manipul
method
obtain
order
ordinari
pass
pole
problem
procedur
program
requir
seen
septemb
seri
shown
singular
small
solut
solv
speed
step
stoer
sum
superior
taylor
truncat
willer
.I 2607
acm
cacm
committe
comput
concern
issu
list
polici
problem
public
septemb
.I 2608
acton
august
cacm
fresnel
integr
recurr
relat
similar
.I 2609
august
bend
cacm
call
composit
continu
deriv
effici
extend
fortran
function
infinit
interpol
introduc
lagerlof
obtain
point
program
ramp
round
set
shown
smooth
variabl
.I 2610
approxim
assum
august
bound
boundari
cacm
combin
comput
connect
dirichlet
discuss
formula
function
gauss
harmon
interpol
let
linear
method
open
plane
point
problem
region
respect
select
simpli
solut
starlik
stroud
term
valu
.I 2611
algorithm
august
cacm
complex
constrain
method
optim
shere
.I 2612
algorithm
august
bultheel
cacm
function
minim
rosenbrock
.I 2613
algorithm
august
cacm
mckai
regen
set
transit
.I 2614
algorithm
arrow
august
cacm
crandal
network
preced
transform
.I 2615
algorithm
august
cacm
comput
interpol
lych
natur
procedur
schumak
smooth
spline
.I 2616
august
cacm
cavoura
comput
convers
convert
debug
decis
extens
investig
mainli
method
object
optim
practic
problem
program
suggest
tabl
theori
.I 2617
arithmet
august
cacm
den
evalu
express
graham
note
order
subexpress
.I 2618
august
cacm
compon
continu
despit
dijkstra
exclus
failur
individu
lamport
mutual
oper
present
problem
simpl
solut
system
.I 2619
addit
august
cacm
class
color
condit
constraint
convert
correspond
establish
exist
gotlieb
graph
meet
neufeld
place
preassign
precondit
present
problem
recent
relationship
requir
restrict
result
shown
solut
suffici
tartar
teacher
timet
unavail
.I 2620
addit
analyz
assembl
august
cacm
cdc
charact
cipher
coeffici
comput
conduct
consid
consist
constant
cost
cpu
data
discuss
doubl
effect
enciph
encipher
equival
error
establish
execut
experi
fetch
fortran
friedman
idea
intermitt
introduc
kei
languag
mean
measur
move
offman
paper
program
protect
pseudo
random
rang
rate
ratio
requir
result
run
simpli
store
test
time
word
.I 2621
achiev
august
avoid
cacm
cipher
code
comput
deriv
discuss
high
involv
log
modulu
password
polynomi
prime
procedur
protect
purdi
purpos
risk
sannon
secur
select
share
store
suggest
suitabl
superior
system
time
unauthor
user
.I 2622
access
appli
argu
argument
aspect
attempt
august
authent
base
cacm
code
compar
comput
data
depend
determin
difficult
discuss
engin
enter
entri
evan
exceedingli
final
function
human
includ
input
integr
interpret
intrud
invert
issu
jr
kantrowitz
keep
know
known
match
oper
output
paper
password
penetr
plausibl
present
problem
produc
program
record
relat
relev
requir
result
rigor
scheme
secreci
secret
select
sole
suitabl
surround
system
tabl
unabl
unlik
user
weiss
.I 2623
august
blank
block
cacm
case
code
compar
compress
consid
data
decreas
describ
effici
encod
factor
fix
group
hahn
handl
inform
involv
larg
lead
method
need
number
paper
pertin
point
produc
program
size
special
statist
storag
store
symbol
system
techniqu
tendenc
text
trail
uniqu
widespread
.I 2624
architectur
cacm
comput
condit
cp
dec
deriv
develop
empir
formal
gener
goldberg
ibm
implement
juli
known
limit
machin
model
number
paper
pdp
popek
precis
previou
requir
studi
suffici
support
system
techniqu
test
virtual
virtualiz
.I 2625
absolut
access
address
associ
avoid
base
basi
cacm
capabl
code
comput
convent
deal
difficulti
direct
discuss
domin
effici
examin
explain
fabri
hardwar
hash
identifi
implement
inadequaci
juli
lack
main
make
mean
memori
modif
need
object
obtain
overcom
predict
present
program
protect
recent
regist
represent
requir
scheme
segment
set
share
shown
simplic
substanti
suggest
superior
system
tabl
tag
trace
translat
uniqu
.I 2626
access
authent
cacm
control
design
discuss
end
help
hierarch
identif
includ
inform
insight
juli
kei
known
list
mechan
memori
multic
paper
primari
principl
protect
provid
saltzer
share
specif
system
tradeoff
user
weak
.I 2627
addit
admit
algorithm
analyz
bruno
cacm
coffman
complet
deriv
desir
determinist
enum
extend
finish
gener
hold
incomplet
independ
introduc
jr
juli
known
mean
minim
model
non
paper
point
polynomi
present
problem
reduc
requir
result
schedul
sequenc
sethi
shown
solut
storag
system
task
tend
time
unlik
user
.I 2628
advantag
algorithm
allow
applic
arriv
articl
cacm
case
compar
comput
consid
consum
cylind
disciplin
disk
distinct
drum
emphasi
fix
fuller
head
implement
intra
investig
juli
latenc
merit
minim
move
mtpt
offer
phase
prefer
present
procedur
process
random
rel
request
requir
respect
result
rotat
schedul
shortest
show
shown
simul
sltf
sort
storag
studi
superior
time
total
uncondition
unit
.I 2629
abil
asynchron
basi
cacm
command
compat
comput
corpor
demount
devic
digit
discuss
dozen
equip
featur
found
gener
hierarch
implement
includ
incorpor
initi
inter
interact
interfac
juli
languag
larger
multi
natur
number
offer
oper
paper
pdp
process
purpos
ritchi
seldom
select
share
subsystem
system
thompson
time
user
volum
.I 2630
algorithm
cacm
comput
construct
dantzig
direct
find
floyd
gener
graph
june
minieka
pair
path
present
set
shortest
vertic
.I 2631
access
advantag
approach
attempt
barton
bibliograph
bound
cacm
charact
choos
comput
consider
cost
creasei
devic
dictionari
direct
distribut
frequenc
greater
hyperbol
implement
index
inform
infrequ
june
kei
larg
lynch
made
mainten
map
member
method
occurr
organ
overcom
part
present
problem
promis
rectangular
result
retriev
search
simplifi
snell
space
storag
string
subset
suit
system
text
theoret
treat
type
word
.I 2632
applic
basi
cacm
call
carnegi
cohen
coher
corwin
creation
deal
defin
describ
design
direct
extens
facil
gener
highli
hydra
improp
includ
introduct
jone
june
kernel
levin
mechan
mellon
mini
mmp
multi
multiprocessor
notion
object
oper
paper
philosophi
physic
pierson
pollack
present
processor
protect
provid
realiz
refer
respect
secur
share
specif
system
type
virtual
wulf
.I 2633
adam
cacm
compact
contour
cost
feel
gari
grade
intend
june
line
method
phone
plot
reduc
represent
test
transmiss
transmit
voic
.I 2634
basi
bmd
cacm
colleg
comput
cost
data
evalu
gener
hundr
instal
june
made
offer
order
osiri
packag
perform
provid
result
scienc
select
slysz
social
softwar
spss
statist
summar
system
test
text
tsar
type
univers
user
wide
.I 2635
algorithm
boulton
cacm
conting
exact
june
probabl
tabl
.I 2636
algorithm
cacm
correl
gener
june
normal
page
random
variabl
.I 2637
algorithm
cacm
elli
hidden
june
line
plot
program
.I 2638
algorithm
cacm
gaither
hidden
june
line
plot
program
.I 2639
algorithm
cacm
calcul
fourier
integr
june
piessen
.I 2640
algorithm
cacm
havi
integr
june
modifi
piessen
.I 2641
algorithm
cacm
cluster
june
method
minim
page
span
tree
.I 2642
algorithm
barrodal
cacm
equat
june
norm
overdetermin
robert
solut
system
.I 2643
access
bit
cacm
charact
compact
comput
consid
cover
describ
develop
digit
fast
gimpel
individu
june
minim
multiplex
need
paper
problem
reduc
reduct
retain
set
shown
spatial
storag
tabl
techniqu
.I 2644
abil
altern
autom
cacm
consider
develop
discuss
easi
especi
experiment
extend
extens
featur
gener
henschen
includ
infer
instruct
june
languag
larg
need
number
orient
overbeek
paper
permit
present
program
prove
rule
strategi
system
theorem
wo
.I 2645
addit
algebra
algol
algorithm
analysi
cacm
call
ccohen
command
compil
comput
consist
direct
discuss
effici
enabl
estim
exampl
execut
featur
formula
includ
inform
interact
june
knuth
languag
limit
manipul
oper
output
present
procedur
processor
produc
program
provid
relat
repres
research
result
set
sound
symbol
syntax
system
time
translat
usag
user
wish
written
zuckerman
.I 2646
algorithm
alloc
amount
anticipatori
background
base
basic
behavior
block
buffer
cacm
class
comput
consid
data
differenti
discuss
disk
drum
dynam
equat
exampl
gold
independ
input
kuck
latenc
mask
matrix
memori
method
model
mono
natur
numer
output
paper
partial
permut
predict
present
primari
program
restrict
rotat
schedul
shown
size
small
system
typic
variat
.I 2647
algorithm
arithmet
cacm
float
gentleman
marovich
point
properti
reveal
unit
.I 2648
assembl
cacm
code
condit
design
determin
divis
doubli
factor
heavi
ibm
integ
languag
larg
link
list
macro
make
multiprecis
number
optim
packag
routin
selfridg
store
structur
theori
trial
uniqu
wunderlich
.I 2649
cacm
deriv
determin
digit
distribut
error
float
gener
integ
law
logarithm
mixtur
oper
point
random
reciproc
result
roundoff
signific
tsao
uniform
.I 2650
applic
artifici
belong
cacm
calcul
charact
correct
edit
erron
find
inform
input
intellig
intend
languag
method
number
oper
order
origin
possibl
present
proport
reason
regular
requir
retriev
spell
string
system
time
view
wagner
.I 2651
behavior
cacm
code
compact
compil
construct
context
control
convers
data
defin
design
effici
el
featur
flexibl
gener
implement
includ
issu
kei
languag
manner
natur
notat
number
oper
orient
permit
problem
program
programm
provid
provis
purpos
represent
requir
result
routin
satisfi
set
simultan
specif
suffici
treatment
type
wegbreit
.I 2652
achiev
actual
algorithm
approach
cacm
compil
construct
contract
cost
decreas
describ
effect
express
featur
function
gener
group
increas
languag
moder
need
paper
power
predict
program
purpos
reduct
remov
result
save
sharpli
shaw
simul
suggest
tailor
techniqu
unwant
user
.I 2653
algorithm
april
cacm
einarsson
equat
exp
solut
transcendent
.I 2654
algorithm
april
cacm
ehrich
exactli
gener
partit
set
subset
.I 2655
algorithm
april
cacm
cline
curv
fit
spline
subprogram
tension
.I 2656
applic
april
attempt
avoid
cacm
cline
close
comput
contour
critic
cubic
curv
defin
determin
discuss
effici
equat
fit
imit
import
induc
introduc
line
mention
method
open
paramet
planar
plane
point
present
problem
result
scalar
schweikert
spline
spuriou
standard
tension
valu
.I 2657
achiev
algorithm
analysi
analyz
april
base
cacm
chang
complet
correct
green
improv
invent
lee
mechan
modifi
obtain
problem
program
proof
propos
prove
satisfi
soon
specif
synthes
theorem
trace
translat
variabl
walding
.I 2658
algol
altern
approach
april
balfour
cacm
compil
mutual
recurs
restrict
.I 2659
abraham
april
cacm
lookup
remark
structur
variabl
.I 2660
addendum
april
cacm
paper
patrick
simmon
.I 2661
april
cacm
ideal
languag
machin
pedagog
pollack
problem
solut
sterl
teach
.I 2662
april
cacm
educ
freeman
glut
graduat
malcolm
payn
ph
rebutt
respons
.I 2663
april
busi
cacm
comput
graduat
jr
larrech
luca
montgomeri
school
studi
.I 2664
achiev
approxim
april
cacm
divisor
emploi
goal
method
natur
number
parallel
present
process
processor
reduc
sort
tape
time
.I 2665
absenc
achiev
aid
algorithm
april
assum
attract
averag
bit
bound
cacm
cell
concern
copi
cycl
cyclic
deliv
demonstr
foreknowledg
interest
lindstrom
linear
list
mark
nlogn
noncycl
open
perform
practic
present
primarili
problem
result
show
solv
speed
stack
structur
supplement
tag
task
theoret
time
variat
workspac
.I 2666
april
cacm
construct
continu
differ
discret
equival
essenti
exist
feasibl
interpret
lion
long
method
nondiscret
problem
requir
satisfi
school
sefton
set
smith
solut
term
timet
week
.I 2667
analysi
analyz
april
boys
built
cacm
characterist
collect
commonli
compar
compil
comput
core
cpu
data
demand
distribut
editor
empir
execut
exponenti
facil
fortran
function
geometr
hyperexponenti
interact
interv
larg
line
monitor
normal
number
oper
page
present
probabl
program
result
scale
share
show
simpl
softwar
supervisor
system
task
theoret
thing
time
type
.I 2668
algorithm
appli
april
assum
base
behavior
cacm
calcul
chain
comput
control
demand
detail
diagram
fault
franklin
gener
gupta
illustr
lru
markov
memori
model
nonpredict
oper
order
page
present
probabl
program
random
recent
replac
repres
represent
rule
sens
size
state
step
substat
system
transit
virtual
.I 2669
algorithm
amount
applic
approxim
april
arrang
automat
cacm
charg
choos
combin
composit
core
demand
divers
easi
effect
estim
except
experiment
increas
inform
linear
linearli
manag
manipul
mean
measur
memori
model
multic
multilevel
number
optimum
page
pattern
perform
predict
problem
produc
program
propos
recent
refer
remark
reproduc
requir
result
rough
saltzer
share
simpl
singl
size
statement
store
suffic
suggest
system
usag
virtual
.I 2670
advantag
algorithm
appear
aris
cacm
design
develop
earlier
effici
frequent
gener
implement
krogh
linear
march
nonlinear
paper
part
problem
project
recent
separ
slightli
solv
squar
structur
take
variabl
version
.I 2671
burnett
cacm
coffman
combinatori
march
note
problem
stone
.I 2672
cacm
consid
content
danger
emot
march
smoliar
.I 2673
ackerman
cacm
hash
march
quadrat
search
size
tabl
.I 2674
algorithm
alphanumer
applic
barrett
cacm
capabl
cdc
cell
charact
comput
convent
convers
cost
develop
displai
execut
extend
fordan
fortran
fundament
gener
graphic
implement
improv
includ
interact
jr
limit
march
non
noninteract
obtain
organ
present
previous
raster
reduc
requir
respons
result
scan
show
significantli
storag
suitabl
support
time
.I 2675
algorithm
cacm
comput
linear
march
problem
program
quadrat
ravindran
routin
.I 2676
algorithm
cacm
complex
march
polynomi
wither
zero
.I 2677
algorithm
battist
beta
bosten
cacm
incomplet
march
ratio
.I 2678
algorithm
cacm
march
plot
program
surfac
visibl
wright
.I 2679
acm
algorithm
arrai
author
cacm
claim
comparison
demonstr
descend
detail
discuss
evalu
evid
fewest
loeser
march
perform
present
qsort
quickersort
quicksort
random
refin
requir
shellsort
sort
stringsort
test
.I 2680
actual
affect
alloc
amount
assign
bottleneck
cacm
case
comput
decis
decreas
devic
disk
exce
facil
heurist
ineffici
issu
line
made
march
model
morgan
mount
mountabl
nonresid
number
oper
optim
optimum
pack
perman
present
reduc
request
requir
resid
space
statu
storag
suggest
time
turnaround
.I 2681
altern
approach
balkovich
benefici
cacm
chiu
condit
degrad
delin
deriv
determin
discuss
dynam
exercis
express
improv
interfer
introduc
lead
main
march
maximum
memori
model
multiprogram
oper
order
origin
perform
presser
probabilist
process
repack
system
throughput
wood
.I 2682
account
activ
appli
cacm
calibr
case
character
characterist
conduct
consist
construct
cpu
data
demand
densiti
determin
drive
experi
express
gener
job
joint
kleinman
march
match
method
month
number
obtain
paramet
probabl
program
real
realiz
relat
repres
resourc
second
sreenivasan
synthet
system
vari
variabl
workload
.I 2683
assert
assist
boundari
cacm
class
complet
condit
consid
correct
deriv
difficult
discuss
error
evalu
extract
facilit
heurist
induct
input
interpret
loop
machin
march
mechan
method
obtain
paper
partial
predic
produc
program
prone
reason
requir
specif
synthes
synthesi
techniqu
tediou
verif
weak
wegbreit
.I 2684
abstract
actual
applic
aris
author
block
bnf
cacm
call
compat
complet
consid
context
correspond
declar
defin
definit
detail
develop
difficult
explor
februari
formal
free
identifi
illustr
interest
issu
languag
ledgard
notabl
notat
numer
paper
paramet
pl
practic
present
previou
product
program
provid
readabl
requir
sensit
signific
small
stem
structur
subset
syntax
system
translat
univers
.I 2685
applic
arrai
asynchron
cacm
compil
comput
consid
design
develop
discuss
execut
februari
iter
lamport
loop
method
multiprocessor
parallel
practic
.I 2686
addit
advantag
algorithm
approxim
asymmetr
author
cacm
complic
distribut
februari
find
fit
gener
method
paramet
previous
problem
provid
ramberg
random
schmeiser
symmetr
tukei
unimod
valu
variabl
.I 2687
alphanumer
arbitrari
barrett
cacm
capabl
cell
charact
complex
compromis
comput
constraint
convent
deriv
design
displai
dot
draw
extend
feasibl
februari
gener
graphic
ident
includ
jordan
jr
limit
line
memori
minimum
number
organ
pattern
pictur
previous
process
qualiti
raster
read
requir
result
satisfi
scan
shown
synthes
synthesi
time
typic
.I 2688
access
analys
approach
articl
attempt
attribut
base
cacm
call
care
characterist
combin
cost
data
environ
exact
factor
februari
formul
hash
heurist
high
impli
improv
invers
invert
jr
kei
lozano
mathemat
memori
method
minim
multi
multipl
need
organ
page
prefer
program
propos
retriev
rothni
similar
simpl
solut
specif
techniqu
traffic
typic
.I 2689
cacm
crt
gener
januari
jr
luca
report
system
.I 2690
cacm
combin
januari
knott
number
system
.I 2691
algorithm
cacm
comment
convers
decis
entri
flowchart
januari
johnson
king
limit
tabl
verhelst
.I 2692
abl
achiev
addit
algorithm
angl
applic
arbitrari
begin
boundari
cacm
capabl
chosen
clip
code
collect
common
complex
comput
consider
contrast
convex
corner
cut
depth
describ
detect
difficult
dimens
diment
easili
edg
face
famili
field
fix
format
handl
heretofor
hidden
hodgman
ideal
ident
introduc
irregular
januari
lie
limit
mark
method
need
newli
order
output
parallel
part
permit
perspect
plane
polygon
practic
preserv
problem
procedur
proceed
process
project
pyramid
rang
readi
reenter
reentrant
remov
repetit
repres
represent
requir
screen
separ
sequenc
serv
shape
simpl
simplic
singl
soon
spite
stage
store
subsequ
surfac
sutherland
truncat
valu
vertex
vertic
view
volum
window
.I 2693
akima
algorithm
base
bivari
cacm
fit
interpol
januari
local
procedur
smooth
surfac
.I 2694
algorithm
cacm
coeffici
comput
januari
legendr
piessen
seri
.I 2695
absenc
advantag
algebra
algorithm
arbitrari
arithmet
assign
cacm
class
column
compar
comparison
comput
consid
determin
earli
error
examin
explicit
favor
form
gibb
graph
import
improv
includ
increment
januari
jr
linear
matric
matrix
method
number
numer
occur
permut
pool
reject
requir
round
row
similar
spars
standard
theoret
time
tool
transform
tridiagon
.I 2696
akima
author
avoid
base
bicub
bivari
cacm
cell
design
develop
earlier
emphasi
excess
extens
fit
function
grid
interpol
januari
likewis
local
method
plane
point
polynomi
procedur
propos
rectangular
smooth
surfac
undul
univari
valu
.I 2697
achiev
arithmet
arrai
bound
cacm
class
coeffici
comput
consid
consider
constant
converg
decomposit
diagon
discuss
domin
element
entir
exploit
fact
fast
float
gener
januari
limit
linear
lower
lu
machin
malcolm
matric
matrix
method
need
number
obtain
oper
order
palmer
paramet
point
precis
prove
ratio
real
reduc
requir
result
roughli
save
solut
solv
storag
subdiagon
subscript
superdiagon
symmetr
system
take
term
tridiagon
upper
word
.I 2698
algorithm
analysi
analyz
approach
aspect
bellman
cacm
class
consist
context
correct
count
design
develop
direct
driver
earlei
element
emphas
error
finit
free
gener
grammar
help
inform
input
januari
known
languag
lyon
practic
program
recogn
recognit
rel
string
syntax
take
version
.I 2699
allow
analysi
automat
base
cacm
choic
data
decemb
describ
domain
emploi
establish
estim
extend
fact
finit
flow
high
includ
inclus
interest
kind
known
languag
level
map
membership
method
object
optim
order
orient
paper
prove
rang
relat
repertoir
schwartz
semant
set
setl
singl
structur
tabul
techniqu
theoret
tupl
usabl
valued
.I 2700
assum
assumpt
cacm
condit
conveni
correct
decemb
greatli
halt
indivis
interleav
lipton
method
obtain
parallel
preserv
program
proof
properti
prove
reduct
relax
rest
show
simplifi
statement
suffici
system
.I 2701
abstract
algorithm
analysi
bound
cacm
case
class
code
complet
control
decemb
edg
entri
exampl
exit
extend
fast
flow
function
gener
global
graham
graph
improv
jacm
januari
larger
linear
log
loop
number
oper
paper
present
problem
program
proport
reduc
relax
restrict
shown
solv
space
structur
term
time
treat
wegman
worst
.I 2702
algorithm
analyz
arbitrari
binari
cacm
carri
case
chosen
class
complet
complex
consid
context
decemb
depend
determin
easili
exist
exponenti
express
fix
free
grammar
hand
hunt
iii
integ
lc
ll
lr
member
nondeterminist
np
paramet
parameter
pars
problem
properti
question
represent
result
shown
size
slr
specif
strong
strongli
subclass
subject
szymanski
test
time
ullman
unari
.I 2703
actual
algorithm
amount
attribut
cacm
case
circular
complex
computation
context
decemb
defin
determin
determinist
devis
exponenti
extens
fact
free
gener
grammar
improv
includ
infinit
intract
intrins
jazayeri
knuth
languag
mechan
ogden
problem
program
prove
round
semant
sentenc
shown
solv
specif
syntax
time
version
.I 2704
approach
cacm
condit
deal
decemb
defici
defin
discuss
except
featur
goodenough
handl
highlight
issu
languag
notat
orderli
paper
propos
reliabl
remedi
requir
satisfi
serv
show
.I 2705
abstract
analog
appli
artifici
aspect
auxiliari
avenu
base
cacm
cobol
come
construct
decemb
design
develop
domin
flexion
fortran
found
gener
high
histori
illumin
incid
influenc
languag
literatur
long
mathemat
natur
naur
order
program
promis
pure
qualiti
question
relat
remain
seen
similar
similarli
social
speak
split
studi
style
suggest
time
type
util
wide
word
work
.I 2706
basi
cacm
charact
cliqu
compact
cover
discuss
kou
note
novemb
problem
reduct
relat
set
wong
.I 2707
allow
backtrack
bitner
cacm
case
combinatori
comput
consider
exposit
gener
histori
known
macro
novemb
open
paper
previous
problem
program
purpos
reduct
reingold
seri
shorten
shown
solut
substanti
techniqu
term
time
twofold
.I 2708
cacm
comparison
conclud
cost
describ
diagnost
empir
error
gener
good
graham
high
inform
low
made
novemb
paper
practic
previou
qualiti
recoveri
research
rhode
scheme
suggest
summar
syntact
syntax
techniqu
topic
.I 2709
abstract
argu
bohm
cacm
classic
complet
conclus
control
controversi
discuss
equival
evid
explor
foot
genealog
heat
histori
idea
impact
implic
import
includ
insuffici
issu
jacopini
ledgard
limit
marcotti
notion
novemb
numer
oper
paper
power
practic
program
programm
put
recent
rel
relat
result
review
solid
space
structur
theorem
theoret
time
variant
warrant
.I 2710
ad
altern
avoid
background
base
bound
boyc
cacm
calculu
call
chamberlin
complet
comput
data
delet
english
express
facil
hoc
iii
includ
insert
intend
interact
kei
king
languag
limit
made
mathemat
model
non
novemb
paper
present
problem
quantifi
queri
relat
relation
requir
shown
solv
specialist
squar
sublanguag
suggest
syntax
tabular
updat
user
variabl
word
.I 2711
appear
approach
automat
base
cacm
choos
circumst
collect
compar
comput
correl
demonstr
densiti
document
entiti
environ
evalu
express
function
incom
index
invers
li
match
model
novemb
object
optimum
pattern
perform
properti
request
result
retriev
salton
search
shown
space
store
system
typic
us
vector
vocabulari
wong
yang
.I 2712
algorithm
base
cacm
close
combinatori
constant
cost
count
direct
evalu
express
extra
gener
grow
homogen
horner
impract
kobayashi
mean
multinomi
neglig
network
normal
number
obtain
octob
oper
queue
reiser
requir
separ
show
shown
size
solut
summat
term
throughput
.I 2713
cacm
corrigendum
cotton
data
deviat
mean
octob
remark
stabli
standard
updat
.I 2714
algorithm
batcher
cacm
case
compar
consid
constant
favor
gavril
gener
integ
km
linearli
log
magnitud
merg
octob
order
paper
parallel
perform
present
previou
processor
requir
set
special
step
synchron
work
.I 2715
access
ad
algorithm
arbitrari
astrahan
cacm
chamberlin
comput
cover
data
design
english
hoc
implement
intend
interact
interpret
languag
memori
minim
model
non
octob
oper
optim
paper
previou
problem
prototyp
purpos
queri
relat
requir
respond
review
sequel
solv
specialist
structur
sublanguag
system
version
xrm
.I 2716
algebra
algorithm
analysi
analyz
approach
automat
basic
cacm
call
chang
codd
compos
concurr
coordin
data
databas
design
detail
directori
disjoint
effici
emploi
exploit
global
high
idea
implement
interfac
level
local
maintain
methodolog
minim
octob
oper
optim
order
page
perform
pipelin
program
propos
queri
refer
refin
relat
respons
seek
smith
sort
space
specif
squiral
suppli
support
tang
techniqu
temporari
time
user
util
view
yen
.I 2717
base
bear
cacm
capabl
chosen
concept
confus
convei
convers
convert
data
definit
describ
design
enabl
flexibl
form
high
highli
housel
languag
level
lum
make
nonprocedur
octob
paper
power
process
program
purpos
restructur
shu
simpl
simpler
task
translat
underli
user
visual
.I 2718
anticip
approach
automat
base
cacm
capabl
comput
conform
data
databas
dbtg
declar
deriv
design
function
gener
gerritsen
goal
group
introduc
octob
oper
preliminari
procedur
program
queri
set
specif
structur
support
system
task
technolog
typic
util
.I 2719
abl
analysi
analyz
behavior
cacm
close
deriv
describ
discuss
execut
explain
express
form
implement
input
limit
lisp
mean
mechan
metric
oper
paper
perform
present
produc
program
reason
run
septemb
simpl
size
system
term
time
wegbreit
.I 2720
alloc
analyt
balanc
cacm
character
characterist
combin
condit
decreas
densiti
determin
devic
differ
disk
distribut
drive
effici
examin
exampl
factor
faster
function
higher
load
minim
model
number
oper
optim
piepmeier
polici
probabl
queue
repres
request
respons
result
septemb
servic
set
specif
standard
sum
techniqu
tend
theori
time
total
type
uniform
util
vari
.I 2721
accur
accuraci
actual
addit
annual
approxim
aquat
asterionella
base
cacm
chemic
claudson
columbia
condit
cycl
deal
demonstr
densiti
determin
develop
digit
dynam
ecolog
ecosystem
environment
examin
express
fairli
fortran
found
gener
growth
illustr
import
includ
investig
involv
iv
made
mathemat
mechan
method
model
order
paper
paramet
pattern
phytoplankton
plan
plankton
pollut
popul
predict
previous
rate
relationship
respons
reveal
river
septemb
simul
specif
studi
thermal
total
type
us
vari
veloc
zooplankton
.I 2722
advantag
algorithm
applic
associ
averag
bentli
binari
cacm
data
defin
delet
develop
dimension
effici
empir
exampl
felt
focu
gener
guarante
handl
inform
insert
intersect
kei
known
log
logarithm
main
match
maximum
multidimension
nearest
neighbor
node
observ
optim
paper
partial
perform
potenti
present
proven
queri
random
record
requir
retriev
root
run
search
septemb
shown
signific
singl
space
storag
structur
surpass
task
theoret
time
tree
type
util
.I 2723
aim
algorithm
allow
attent
briefli
cacm
capabl
case
cell
collect
collector
commun
compactifi
complet
complex
continu
defin
discuss
examin
explain
garbag
interlock
interprocessor
involv
jr
lisp
list
mark
multiprocess
oper
perform
present
primari
primit
problem
procedur
process
processor
reclaim
reloc
run
septemb
simpl
standard
steel
storag
unimped
.I 2724
august
cacm
constant
corrigendum
lemnisc
todd
.I 2725
algorithm
august
cacm
comparison
corrigendum
duval
event
list
simul
vaucher
.I 2726
appli
attain
august
benefit
cacm
circuit
clariti
combin
compar
consider
decid
decis
equival
execut
find
frequenc
further
human
impli
implic
improv
logic
low
machin
mccluskei
memori
merit
method
minim
number
object
occur
optim
overspecifi
potenti
preprocess
prime
quien
reader
reduc
requir
rule
shown
shwayder
simplif
simplifi
tabl
techniqu
time
.I 2727
alphanumer
august
byte
cacm
charact
comput
conting
data
datum
execut
full
instruct
item
lamport
method
multipl
oper
ordinari
pack
parallel
process
requir
small
techniqu
word
.I 2728
applic
august
cacm
class
compar
consecut
crwr
develop
ghosh
invert
kei
locat
minimum
obtain
organ
paper
properti
provid
queri
record
reduc
redund
relev
set
storag
store
studi
theorem
tool
.I 2729
august
cacm
chen
comment
ho
paper
smith
.I 2730
accept
argu
august
cacm
command
consult
demonstr
easi
give
help
instruct
interact
kwasni
languag
line
make
natur
program
programm
provid
regard
request
script
sharo
significantli
system
turn
weizenbaum
.I 2731
august
cacm
cotton
data
deviat
mean
remark
stabli
standard
updat
.I 2732
activ
allow
altern
august
block
build
cacm
calculu
call
command
compon
construct
deriv
determin
dijkstra
evok
express
final
formal
guard
initi
introduc
necessarili
nondeterminaci
nondeterminist
program
repetit
shown
state
term
uniqu
.I 2733
aho
ambigu
august
bnf
cacm
class
consid
construct
context
convent
describ
descript
determinist
directli
effici
flexibl
free
grammar
involv
johnson
languag
ll
lr
method
natur
pars
parser
program
resolv
rule
shown
specif
syntact
syntax
ullman
wai
.I 2734
alloc
approxim
august
block
cacm
coeffici
comparison
consist
contigu
data
depend
differ
distort
distribut
effect
effici
encourag
end
equal
experi
exponenti
extern
fit
fragment
frequenc
gener
greater
grow
hyperexponenti
hypothes
hypothesi
larg
like
memori
normal
observ
obtain
order
outperform
percent
perform
popul
preferenti
produc
product
publish
reason
rel
request
result
seri
shore
show
simul
size
small
space
storag
strategi
suffici
support
time
underli
understand
uniform
uniti
variat
wai
.I 2735
cacm
comput
discrimin
employ
gilchrist
industri
juli
weber
women
.I 2736
bobrow
cacm
hash
juli
link
note
.I 2737
arbitrari
area
cacm
capabl
close
colinear
consist
contain
convex
curv
describ
determin
edg
encas
enclos
find
freeman
interest
introduc
juli
layout
method
minim
minimum
optimum
pack
paper
perimet
plane
polygon
problem
rectangl
select
shapira
show
side
theorem
.I 2738
abstract
cacm
concept
cost
deal
design
develop
evalu
exampl
hardwar
hierarch
illustr
juli
machin
method
number
paper
parna
program
programm
real
requir
siewiorek
softwar
structur
system
transpar
work
.I 2739
adequ
analysi
augment
base
cacm
compact
comprehens
comput
computer
conform
context
coverag
defin
design
develop
effici
embodi
english
essenti
found
free
grammar
grishman
group
implement
increas
juli
languag
linguist
natur
number
order
paper
pars
parser
past
perspicu
present
program
project
relat
represent
restrict
routin
sager
sentenc
set
specif
statement
string
syntax
system
ten
tree
valid
year
.I 2740
altern
base
cacm
carefulli
construct
cooper
describ
dijkstra
discuss
embrac
explain
extend
free
intern
juli
justifi
larg
lauesen
manag
mean
multiprogram
number
oper
paper
parallel
perform
process
project
prove
queue
rc
semaphor
sequenti
set
structur
synchron
system
.I 2741
aggreg
analysi
approach
base
behavior
borrow
bring
cacm
circumst
complet
comput
concept
courtoi
critic
decompos
definit
dynam
econometr
evalu
identifi
ii
instabl
juli
lead
load
model
multiprogram
nearli
oper
order
page
perform
propos
regim
satur
set
state
step
system
techniqu
unstabl
variabl
.I 2742
addit
amount
applic
attribut
bookkeep
burdensom
cacm
complex
comput
converg
difficulti
discret
earn
eat
effect
event
fact
futur
hour
improv
june
larg
li
list
mechan
method
model
occasion
paper
part
present
problem
proper
reduc
reput
requir
scan
sequenc
signific
significantli
simul
slow
spent
stochast
time
wyman
.I 2743
cacm
harper
june
payn
savag
sort
strau
.I 2744
add
addit
applic
arbitrari
base
byte
cacm
cobol
convers
digit
discuss
displai
format
gener
hexadecim
includ
june
loop
mix
number
paper
present
program
radix
repres
requir
size
soul
store
subtract
suffici
sum
techniqu
unnecessari
.I 2745
algorithm
cacm
common
comput
find
hirschberg
june
linear
longest
maxim
present
problem
quadrat
solv
space
string
subsequ
time
.I 2746
aho
aid
algorithm
bibliograph
cacm
consist
construct
corasick
describ
effici
factor
finit
improv
independ
june
keyword
length
librari
locat
machin
made
match
number
occurr
paper
pass
pattern
process
program
proport
search
simpl
singl
speed
state
string
sum
take
text
time
transit
.I 2747
addit
bit
buddi
buffer
cacm
calcul
cranston
fibonacci
june
present
recombin
repetit
requir
scheme
simplifi
system
tabl
thoma
.I 2748
amen
arrang
bell
cacm
code
dewar
effici
implement
independ
indirect
interpret
june
machin
relat
requir
space
thread
.I 2749
aid
automobil
babich
cacm
call
choos
clock
compar
comput
conclud
develop
effici
event
exampl
experi
found
grason
high
import
interact
june
level
low
mathemat
method
model
organ
paper
parna
puls
rel
run
signific
simpl
simul
suffici
system
time
trade
traffic
.I 2750
accur
ad
aid
algorithm
alloc
assumpt
avenu
base
basi
cacm
clear
configur
consid
cost
data
decis
design
desir
detail
devic
element
find
forward
greatli
hierarchi
hoc
improv
intract
involv
june
ling
lum
make
migrat
number
obtain
optim
orient
paper
paramet
present
problem
provid
qualit
quantifi
quantit
senko
set
signific
simplifi
situat
solut
stage
step
storag
straight
system
todai
usefulli
util
wang
.I 2751
algorithm
cacm
cathod
comput
consid
depend
determin
develop
dimension
fundament
gener
hidden
human
illumin
imag
increas
interconnect
june
law
method
model
object
optic
paint
part
percept
phong
pictur
present
qualiti
rai
realism
relat
remov
rule
scene
screen
shade
strongli
surfac
techniqu
tube
visual
.I 2752
algorithm
basic
cacm
cycl
gener
gibb
graph
june
set
.I 2753
accur
achiev
action
altern
appli
architectur
cacm
characterist
chosen
comput
constraint
control
convex
creat
defin
demonstr
describ
design
diagnost
difficulti
dimension
direct
dp
easili
engin
equip
extens
feasibl
furnitur
gener
give
heurist
idea
inform
involv
layout
limit
locat
manag
manipul
method
metric
natur
need
object
optim
paper
perform
pfefferkorn
phase
plan
polygon
prefix
problem
procedur
process
program
recov
remedi
represent
resourc
scope
search
select
sens
simpl
slow
solut
solv
solver
space
spatial
specif
system
task
test
topolog
updat
urban
.I 2754
accur
algorithm
allow
amplitud
applic
approxim
cacm
cardiographi
context
demonstr
detect
digit
durat
electrocardiogram
enabl
horowitz
identifi
incorpor
line
linear
measur
paramet
pars
peak
piecewis
process
real
serv
shape
speed
suffici
syntact
tabular
techniqu
time
waveform
.I 2755
cacm
comput
corrigendum
math
mill
program
.I 2756
cacm
care
comput
concern
health
issu
list
polici
problem
public
wasserman
.I 2757
cacm
fox
kth
path
shortest
.I 2758
cacm
evan
factor
hatzopoulo
lu
matrix
note
symmetr
.I 2759
algorithm
cacm
equat
fritsch
hindmarsh
norm
overdetermin
solut
system
.I 2760
algorithm
cacm
doran
plot
program
surfac
visibl
.I 2761
algorithm
cacm
mashburn
plot
program
surfac
visibl
.I 2762
algorithm
cacm
chebyshev
manipul
merten
piessen
seri
subroutin
ten
.I 2763
algorithm
basic
cacm
cycl
gener
gibb
.I 2764
analysi
analyz
approach
base
cacm
call
choic
contrast
core
deep
describ
english
gener
handl
input
intellig
languag
length
linguist
natur
orient
paper
paragraph
pattern
preferenti
problem
program
prove
semant
syntax
system
theorem
understand
wilk
work
.I 2765
access
analysi
analyz
architectur
aspect
averag
base
block
cacm
cardena
characterist
complex
conjunct
consid
content
criteria
data
deriv
determin
directori
effect
envis
estim
formal
formul
framework
hierarch
identifi
implement
index
interact
invers
invert
kei
larg
level
logic
machin
need
optimum
order
organ
orient
perform
present
queri
read
realist
requir
select
set
specif
storag
stress
structur
subject
system
time
view
.I 2766
achiev
algorithm
applic
arbitrari
bit
bound
cacm
contigu
copi
cyclic
fisher
fix
linear
list
log
memori
method
node
oper
previou
requir
restrict
section
size
structur
tag
time
variabl
workspac
.I 2767
adapt
advantag
algorithm
april
base
cacm
chosen
comparison
concept
consid
discret
distribut
duval
emploi
end
especi
event
fruit
gener
index
languag
limit
linear
list
notic
order
perform
promis
purpos
replac
requir
routin
schedul
set
show
shown
simul
stochast
structur
studi
system
test
tree
typic
vaucher
.I 2768
adjac
algorithm
alloc
applic
april
block
buddi
cacm
determin
hind
locat
rel
scheme
simpl
storag
system
type
.I 2769
algorithm
april
binari
boolean
cacm
closur
comput
environ
execut
faster
jr
matric
matrix
modif
page
relat
repres
similar
spars
transit
warren
warshal
.I 2770
april
batagelj
cacm
case
coeffici
compon
composit
deriv
full
function
hash
integ
limit
mainli
method
number
period
previou
prime
quadrat
result
shown
size
squar
tabl
work
.I 2771
ad
addit
advantag
algorithm
april
begin
bound
braid
build
cacm
class
complex
compos
comput
concis
cube
cylind
design
easili
face
imagin
move
object
oper
perform
practic
present
primit
readili
rotat
scale
sequenc
short
solid
store
subtract
suffic
synthes
synthesi
techniqu
term
wedg
.I 2772
april
base
cacm
class
compon
condit
exist
framework
gener
list
mainten
method
opportun
princip
problem
procedur
set
smith
solut
specif
teacher
timet
.I 2773
alloc
april
buddi
cacm
corrigendum
dynam
method
peterson
shen
storag
weight
.I 2774
algorithm
april
cacm
frederick
remark
.I 2775
algorithm
april
argument
cacm
dilogarithm
function
ginsberg
real
zaborowski
.I 2776
advanc
april
arpa
base
cacm
california
carolina
center
chamber
colleg
comput
conduct
consider
depth
develop
econom
educ
experi
factor
final
futur
higher
identifi
includ
inform
iowa
major
michigan
minor
nationwid
net
network
north
number
oper
polit
poor
present
recommend
regard
research
result
socio
state
studi
survei
triad
triangl
univers
.I 2777
cacm
cigarett
claim
concept
condit
dijkstra
discuss
elimin
establish
examin
gener
introduc
introduct
march
need
oper
paper
parna
patil
problem
program
report
restrict
semaphor
show
smoker
solut
statement
strong
suggest
techniqu
.I 2778
cacm
corrigendum
eigenvalu
march
matric
non
normal
perturb
slui
.I 2779
algorithm
cacm
classic
data
discret
explain
fit
improv
march
numer
orthogon
perform
polynomi
present
properti
reason
recurr
relat
shampin
squar
variant
wide
.I 2780
al
algorithm
applic
base
cacm
comment
comput
cost
depend
deriv
develop
element
erisman
examin
factor
formula
gener
invers
lu
made
march
matrix
recurs
relationship
spars
stabil
takahashi
tinnei
.I 2781
access
algorithm
altern
cacm
index
march
method
sequenti
sullenberg
whitt
.I 2782
cacm
gentleman
karp
march
marovich
repli
.I 2783
algorithm
cacm
element
find
floyd
ith
march
rivest
select
smallest
.I 2784
algorithm
averag
bound
cacm
comparison
deriv
effici
expect
floyd
formula
ith
lower
march
min
number
percent
practic
present
rivest
select
shown
smallest
theoret
time
.I 2785
algol
algorithm
allow
architectur
baer
base
cacm
characterist
comput
describ
design
discuss
earliest
exist
explicitli
extend
glypnir
goal
illiac
iv
languag
lawri
layman
march
paper
parallel
philosophi
problem
program
programm
randal
syntax
term
vector
word
.I 2786
accord
author
cacm
cherri
command
compil
context
convent
describ
design
directli
draw
easi
except
experi
express
fewer
font
format
formula
forward
free
grammar
half
handl
hour
implement
infin
input
interfac
kernighan
know
languag
learn
line
make
march
mathemat
mayb
mixtur
motion
output
paper
peopl
phototypesett
pi
posit
print
produc
program
revers
rule
secretari
simpli
size
small
sum
syntax
system
termin
text
translat
typeset
typic
typist
.I 2787
adapt
advantag
algorithm
aris
basi
binari
cacm
choic
code
compact
complet
data
describ
design
develop
effici
fit
fuller
gener
good
high
hoar
john
johnston
knowledg
languag
level
lion
low
march
matric
matrix
method
paper
practic
previou
problem
process
program
reader
readili
realist
reduct
represent
school
shown
structur
tabl
take
techniqu
test
time
timet
.I 2788
accumul
arrai
balard
cacm
circl
februari
find
kimm
sklanski
.I 2789
algorithm
cacm
cluster
februari
magnuski
method
minim
span
tree
.I 2790
algorithm
cacm
circuit
elementari
februari
graph
syslo
.I 2791
algorithm
cacm
conting
exact
februari
hancock
probabl
tabl
.I 2792
algorithm
cacm
februari
jacobi
polynomi
skovgaard
.I 2793
algorithm
cacm
chi
februari
knight
quantil
squar
.I 2794
algorithm
analog
base
basi
bidirect
cacm
claus
cock
concept
determin
discuss
emploi
februari
formal
illustr
infer
input
interpret
languag
linear
logic
manner
method
minker
mode
multipl
note
oper
order
output
paper
pars
present
problem
prove
prover
recognit
reduct
refer
relationship
repres
represent
resolut
set
space
spacer
state
suggest
system
terminolog
theorem
type
vanderbrug
view
.I 2795
abl
analyz
base
cacm
capabl
class
combin
conceptu
conjunct
context
deduct
demonstr
dictionari
discrimin
divers
emploi
encompass
execut
februari
formal
free
gener
goldman
grammar
grammat
includ
infer
inform
knowledg
languag
linguist
mean
memori
model
natur
net
oper
paraphras
produc
program
properti
relat
represent
respect
retriev
role
sens
sentenc
store
structur
surfac
syntact
test
underli
understand
word
.I 2796
cacm
concept
corrigendum
februari
hoar
monitor
oper
structur
system
.I 2797
approxim
cacm
checkpoint
corrigendum
februari
interv
optim
order
young
.I 2798
analysi
analyt
averag
blockag
buffer
burnett
cacm
carlo
coffman
cycl
data
determin
discuss
displai
distribut
februari
group
import
increas
instruct
interleav
investig
jr
measur
memori
model
modul
mont
number
observ
oper
perform
present
request
result
scheme
send
separ
simul
structur
studi
substanti
system
.I 2799
accumul
base
cacm
comput
consid
constant
data
deal
deviat
fit
formul
function
given
hanson
januari
matrix
mean
method
numer
present
procedur
process
remov
requir
root
sampl
set
squar
stabl
stabli
standard
storag
transform
updat
weight
.I 2800
accuraci
arbitrari
bound
cacm
class
concern
condit
connect
constraint
criteria
depend
deriv
differenti
emphasi
equat
extran
famili
formula
impli
inf
januari
linear
linig
mean
multistep
numer
order
ordinari
paper
paramet
properti
psi
root
satisfi
shown
solut
stabil
stabl
step
stiff
strict
upper
.I 2801
actual
algorithm
asymptot
base
bcd
bit
block
cacm
case
chen
chi
code
combin
compress
comput
convent
data
decim
differ
digit
effici
encod
field
fix
half
hardwar
ho
januari
length
long
manual
map
messag
minimum
optim
percent
redund
remov
repres
represent
requir
result
revers
separ
simpl
small
storag
subdivid
variabl
.I 2802
algebra
cacm
character
compound
comput
correct
creat
defin
design
develop
displai
elementari
entir
environ
equat
execut
expans
express
final
formula
freedom
function
gener
identifi
import
independ
involv
januari
known
math
methodolog
mill
model
nest
paramet
permit
program
properti
prove
reduct
refin
reformul
select
singl
solut
stepwis
structur
subexpress
systemat
term
.I 2803
cacm
conjug
connect
devot
direct
gradient
hesten
januari
matric
paper
pseudoinvers
routin
studi
.I 2804
access
cacm
combinatori
consequ
divisor
easili
elementari
interest
januari
known
linear
marcu
paper
point
product
proof
result
robinson
short
tensor
transform
year
.I 2805
attain
bound
cacm
consid
departur
der
deriv
eigen
eigenvalu
finit
frobeniu
give
januari
matric
matrix
multipl
non
nonnorm
norm
normal
perturb
problem
set
shown
simpl
slui
system
term
van
.I 2806
altern
birkhoff
bound
cacm
determin
discuss
eigen
entri
function
hadamard
januari
known
linear
matric
matrix
merit
norm
number
relat
squar
system
theorem
.I 2807
absolut
algorithm
back
cacm
commonli
compar
condit
elimin
equat
error
gauss
gaussian
gener
greater
ill
januari
jordan
linear
partial
peter
pivot
regard
residu
respect
shown
solut
stabil
strictli
substitut
suspect
suspicion
system
unfound
wilkinson
.I 2808
acceler
account
actual
cacm
comput
constant
deriv
develop
elementari
enorm
evalu
histor
interest
januari
lemnisc
made
materi
mathemat
method
part
plai
problem
purpos
relev
teach
todd
.I 2809
algebra
applic
archimedian
bauer
cacm
charact
concern
contract
demonstr
gener
household
januari
joint
lattic
line
method
necessarili
norm
oper
order
posit
properti
result
theori
total
unit
valu
vector
work
.I 2810
academ
achiev
analysi
appli
bestow
broad
cacm
comput
contribut
definit
earn
educ
emploi
examin
field
finerman
gener
govern
help
improv
industri
institut
januari
make
mean
mold
note
peopl
practition
profession
recommend
regard
regul
research
role
shortcom
social
societi
specif
standard
statu
suggest
technic
term
thing
type
univers
.I 2811
ag
analysi
appli
applic
arteri
cacm
cardiovascular
carotid
compil
data
decemb
detect
diseas
driven
enter
gener
good
import
induc
inform
kanal
kyle
measur
medic
model
pars
pattern
puls
recognit
result
specif
stockman
structur
syntax
system
user
variat
wave
waveform
.I 2812
accur
activ
ad
addit
aid
algorithm
altern
analysi
analyz
applic
cacm
command
complet
compon
comput
consist
creat
databas
decemb
defin
definit
describ
design
develop
evalu
financi
form
gener
ho
inform
integr
jr
konsynski
languag
logic
major
manag
materi
modul
navi
nmcsa
nunamak
optim
order
paper
perform
problem
procedur
process
program
requir
select
set
singer
soda
softwar
specif
statement
structur
supplement
support
system
translat
written
.I 2813
arden
area
briefli
cacm
chairmen
committe
comput
coser
decemb
engin
identifi
member
motiv
nsf
organ
panel
refer
research
schedul
scienc
steer
studi
subject
support
.I 2814
cacm
decemb
languag
program
roster
sammet
.I 2815
agreement
bind
cacm
caus
compil
complex
data
defici
design
detect
easi
editor
enforc
error
exist
forestal
hamlet
high
implement
inconsist
level
link
linker
loader
low
matter
modul
novemb
obscur
run
scheme
separ
static
time
type
usag
work
.I 2816
access
base
basic
cacm
caus
characterist
consid
cost
databas
defin
describ
devic
disk
disorgan
distribut
due
establish
exampl
excess
exist
free
function
increas
insert
maruyama
minim
novemb
numer
obtain
optim
optimum
organ
paper
perform
physic
point
problem
proper
reduc
reorgan
smith
space
storag
structur
tradeoff
updat
.I 2817
access
argu
assumpt
cacm
concept
condit
consist
constraint
data
databas
defin
eswarran
grai
implement
lock
logic
lori
need
notion
novemb
paper
physic
predic
releas
request
requir
satisfi
schedul
share
show
subset
suggest
system
traiger
transact
user
.I 2818
baskett
cacm
comput
corrigendum
interfer
interleav
memori
multiprocessor
novemb
smith
system
.I 2819
algorithm
analysi
appli
attempt
cacm
charact
code
compar
compress
consist
data
decod
degre
differ
digit
earlier
encod
english
equal
experi
find
gener
high
method
novemb
obtain
oper
optim
paramet
pl
present
program
propos
repres
rubin
sampl
set
slightli
string
substr
system
text
view
.I 2820
abil
analysi
assist
begin
cacm
cap
charact
check
cobolin
compil
complet
compon
comput
conjunct
correct
cours
davi
debug
design
diagnos
diagnost
displai
driven
edit
enter
error
execut
fairli
featur
find
flexibl
fortran
graphic
help
highli
implement
increas
interact
interpret
introductori
learn
multilingu
need
novemb
perform
pl
prepar
program
programm
reduc
remark
run
scienc
semant
simpl
space
student
subsequ
syntax
system
tabl
termin
time
tindal
wilcox
.I 2821
an
cacm
cave
cobol
code
constrain
control
cost
custom
data
deploi
develop
environ
exist
extrem
fact
form
languag
larg
ledgard
limit
live
maintain
multipl
novemb
offer
practic
produc
program
prove
reduc
requir
sampl
set
softwar
standard
structur
subset
syntax
system
time
typic
util
valuabl
.I 2822
acm
associ
cacm
comput
copyright
data
fact
gener
grant
homili
humbl
issu
machineri
made
materi
novemb
part
permiss
privileg
profit
provid
public
refer
reprint
republish
ross
standard
.I 2823
academ
action
affirm
analysi
cacm
comput
concern
data
degre
discrimin
effect
employ
enlarg
faculti
graduat
jr
later
mamrak
minor
montanelli
need
number
octob
present
program
qualifi
recruit
result
reveal
scienc
statu
student
survei
women
year
.I 2824
cacm
comput
duong
function
hoffmann
improv
kien
linear
martin
muth
octob
preced
.I 2825
bmd
bmdp
cacm
comput
frane
octob
program
seri
statist
.I 2826
achiev
anim
appli
basic
burtnyk
cacm
capabl
compat
complex
compon
composit
control
design
develop
drive
dynam
encourag
enhanc
figur
frame
high
imag
increas
interact
kei
level
motion
movement
octob
permit
represent
requir
select
sequenc
signific
simplic
skeleton
stage
stick
techniqu
wein
.I 2827
algorithm
bound
cacm
calcul
coeffici
compos
coordin
curv
dimension
discuss
distinguish
draw
easili
emphasi
equat
find
fourth
hidden
intersect
levin
limit
made
method
object
octob
order
osic
paramet
parameter
parametr
patch
pictur
point
qsic
quadric
quartic
remov
repres
scheme
set
solid
surfac
type
.I 2828
access
algorithm
amount
assist
cacm
clark
clip
coher
complex
comput
defin
definit
descent
detail
dimension
environ
extens
fast
field
final
fix
fourth
fraction
frame
geometr
graphic
greatli
grow
hierarch
hierarchi
improv
increas
inform
inher
limit
linearli
logarithm
meaning
model
motion
object
octob
part
pictur
placement
potenti
present
primari
problem
produc
provid
rang
recurs
rel
resolv
scene
search
shape
signific
solv
store
structur
suggest
surfac
system
techniqu
time
total
tradit
upper
vari
view
visibl
.I 2829
accur
ad
algorithm
amount
area
averag
bivari
blinn
cacm
catmul
chosen
come
comput
coordin
defin
definit
describ
develop
digit
direct
element
exampl
extens
function
gener
imag
includ
intens
kei
light
manner
map
mirror
model
newel
normal
obtain
octob
paper
parameter
patch
pattern
permit
pictur
process
reflect
region
render
shape
signal
similar
simul
size
surfac
synthes
system
techniqu
textur
theori
weight
.I 2830
cacm
duhn
practition
septemb
sever
.I 2831
algorithm
analysi
cacm
chu
corrigendum
markov
model
opderbeck
pff
replac
semi
septemb
.I 2832
addit
algorithm
auxiliari
base
built
cach
cacm
collect
context
conveni
corrigendum
data
delet
faster
garbag
hierarchi
improv
infrequ
make
note
observ
outlin
posit
present
previou
provid
rapid
rel
retriev
search
septemb
speed
start
store
structur
tree
typic
view
wegbreit
.I 2833
access
accur
address
algorithm
alloc
automat
bobrow
cacm
cell
collector
compact
copi
count
depend
describ
design
deutsch
discret
effici
exactli
fact
garbag
give
heap
increment
indic
item
larg
level
linear
lisp
longer
multipl
need
non
paper
problem
programm
propos
reclaim
reclam
refer
referenc
referenti
reorgan
requir
scheme
septemb
solv
space
storag
store
structur
system
tabl
transact
user
virtual
work
.I 2834
algorithm
applic
binari
bit
bitner
cacm
code
codeword
combin
composit
constant
discuss
effici
ehrlich
element
fix
gener
grai
integ
multiset
permut
present
reflect
reingold
requir
septemb
thing
time
weight
.I 2835
algorithm
analysi
assum
cacm
common
compil
consider
detect
determin
discret
discuss
enumer
implement
improv
label
method
modif
optim
paramet
pascal
present
procedur
recurs
septemb
set
simpl
small
subset
take
type
valu
variabl
walter
.I 2836
addit
algorithm
appli
cacm
combinatori
construct
context
correct
deriv
establish
free
function
grammar
involv
loui
method
node
optim
pars
present
probabilist
problem
septemb
structur
tree
vocabulari
weight
.I 2837
algorithm
applic
bound
cacm
case
compar
comparison
complex
consid
extend
favor
gener
hadian
hyafil
improv
kirkpatrick
minimum
number
problem
rang
recent
select
septemb
sobel
standard
th
upper
vi
wider
worst
yap
.I 2838
algorithm
analysi
analyz
averag
avoid
behavior
cacm
case
collect
collector
condit
determin
discard
effici
equal
garbag
list
long
manner
measur
nearli
need
oper
parallel
perform
power
present
process
processor
program
real
recov
regular
requir
septemb
share
shown
singl
structur
suffici
suitabl
suspend
system
techniqu
time
typic
wadler
wait
worst
.I 2839
august
balanc
binari
bit
cacm
capabl
cost
extra
fast
half
height
hirschberg
increas
insert
maintain
memori
node
present
reduc
requir
restrict
search
seen
side
techniqu
time
tree
.I 2840
acquir
algorithm
appropri
argu
assumpt
august
cacm
case
comput
configur
decid
determin
discuss
fact
gener
harrison
implic
mechan
model
object
oper
present
problem
protect
restrict
ruzzo
safe
shown
situat
subject
surprisingli
system
ullman
weak
.I 2841
aid
assum
august
basi
cacm
clark
comput
control
design
dimens
dimension
displai
draw
examin
experiment
featur
form
formul
free
head
interact
isoparametr
knowledg
line
mathemat
mount
movement
parametr
part
point
practic
princip
real
render
repres
shape
space
spline
surfac
system
time
user
.I 2842
applic
approach
august
cacm
class
comput
concept
consid
continu
definit
demonstr
denot
develop
due
elementari
environ
featur
final
formal
gedanken
introduc
introduct
languag
loop
mathemat
mere
methodolog
model
motiv
notat
outlin
paper
present
program
scott
semant
specif
store
strachei
survei
tennent
theori
tutori
underli
.I 2843
activ
allow
augment
august
basic
cacm
compil
concept
cours
describ
donovan
econom
educ
excit
found
grader
includ
instructor
mit
monitor
paper
past
philosophi
program
project
relev
set
simul
softwar
student
teach
tool
year
.I 2844
appli
cacm
driven
event
gonnet
heap
juli
mechan
.I 2845
alloc
block
buddi
burton
cacm
coincid
condit
cylind
disk
forc
function
gener
integr
juli
logic
make
meaning
permit
physic
satisfi
set
size
storag
system
track
valu
variat
.I 2846
achiev
analysi
analyz
ari
bit
cacm
call
collect
compress
cost
data
databas
decreas
discuss
field
flexibl
hold
improv
increas
inform
inspect
juli
kei
larg
log
logm
long
mali
measur
method
node
order
paper
paramet
part
pointer
present
requir
retriev
shown
static
storag
structur
system
term
time
tree
tri
trie
underli
updat
.I 2847
ahren
albeit
appear
cacm
comput
cost
costli
describ
dieter
distribut
domin
experiment
fishman
gamma
gener
juli
larg
lewi
method
paper
proport
recent
reject
robinson
sampl
small
suggest
techniqu
variat
wallac
.I 2848
aid
autom
cacm
cheng
complet
decis
develop
effect
interview
juli
logic
paper
procedur
process
provid
purpos
rabin
record
result
rule
set
structur
synthes
synthesi
tabl
tool
.I 2849
access
address
arbitr
base
bogg
branch
broadcast
build
cabl
cacm
carri
central
coaxial
commun
complet
comput
contend
control
coordin
coupl
data
design
destin
digit
distribut
error
estim
ether
ethernet
experi
heavi
implement
includ
juli
kilomet
load
local
loos
mechan
medium
metcalf
model
multiprocessor
network
node
oper
packet
passiv
perform
principl
protocol
provid
receiv
recognit
station
statist
switch
system
transmit
transport
view
.I 2850
abil
arbitrari
aris
branch
cacm
call
condit
debug
describ
difficult
discuss
effigi
execut
express
featur
formula
includ
input
interest
interpret
issu
juli
king
languag
manag
normal
number
paper
pl
proce
program
prove
relationship
repres
simpl
standard
statement
style
suppli
symbol
system
test
thing
type
valu
verifi
written
.I 2851
abstract
allow
appendix
arbitrarili
assert
cacm
call
capabl
case
comput
concept
conceptu
condit
control
correct
data
deadlock
demonstr
discuss
distinguish
enumer
exampl
exclus
execut
express
extens
floyd
form
formal
formula
global
ground
implement
includ
incomplet
induct
infinit
instruct
introduc
juli
keller
local
logic
method
model
mutual
observ
orient
parallel
permit
place
pointer
present
previou
principl
problem
process
program
proof
relat
represent
satisfi
set
share
shown
special
state
treat
variabl
verif
work
yield
.I 2852
acm
ad
administr
cacm
case
center
committe
comput
cont
cours
curriculum
educ
entitl
graduat
halstead
inform
juli
made
manag
mcfarlan
nolan
paper
past
profession
program
propos
purdu
report
scienc
strong
suitabl
system
technolog
year
.I 2853
cacm
combin
june
knott
number
permut
system
.I 2854
cacm
collect
compactifi
corrigendum
garbag
jr
june
multiprocess
steel
.I 2855
algorithm
arbitrari
bit
cacm
clark
constant
copi
destroi
discuss
distinguish
effici
execut
extens
hold
june
list
mark
move
origin
pointer
present
previou
problem
program
requir
speed
storag
structur
superior
variabl
variat
workspac
.I 2856
approach
averag
base
bound
branch
cacm
comput
condit
convers
convert
creat
decis
decomposit
dynam
effici
enumer
execut
gener
implicit
increas
june
locat
optim
paper
permit
previou
problem
program
respect
schumach
select
sevcik
smaller
space
stage
storag
substanti
synthes
synthet
tabl
techniqu
ten
test
time
tree
twelv
.I 2857
addit
adjac
algorithm
allow
cacm
cell
circular
doubl
easier
edg
effici
end
enhanc
exclus
famou
header
instanc
june
link
list
node
nonrecurs
null
pair
pointer
redund
refer
referenc
replac
requir
space
structur
thread
travers
trick
wise
yield
.I 2858
achiev
address
algorithm
arbitrari
assign
cacm
case
choic
code
condit
constraint
criteria
criterion
determin
distanc
exist
format
frieder
function
impli
instruct
june
length
long
minim
number
optim
point
preferenti
present
process
program
saal
smallest
structur
subject
suitabl
target
total
vari
variabl
.I 2859
analyz
approxim
baskett
behavior
cacm
caus
class
comput
degre
deriv
exect
expect
good
includ
increas
indic
interfer
interleav
june
larger
limit
measur
memori
model
modul
multiprocessor
nearli
paper
perform
processor
program
provid
real
refer
rel
result
simpl
simul
simultan
size
smith
suggest
system
test
type
valid
yield
.I 2860
address
algorithm
analyz
applic
attent
bucket
cacm
characterist
commerci
common
consid
consolid
cost
databas
design
determin
devic
discuss
duhn
effect
explicitli
factor
focus
guidelin
heurist
identifi
june
larg
load
mathemat
model
number
order
overflow
paper
paramet
popular
practition
present
primari
reason
record
rule
secondari
select
sever
size
solv
space
specif
storag
suggest
system
techniqu
thumb
time
tradeoff
transform
.I 2861
cacm
cont
employ
june
ph
product
taulbe
.I 2862
abl
algorithm
analysi
analyt
behavior
cacm
chu
comput
determin
distanc
distinct
distribut
estim
evalu
event
fault
frequenc
inter
interv
lru
markov
model
number
opderbeck
page
paramet
perform
permit
pff
present
probabl
program
reduc
refer
referenc
replac
repres
requir
semi
significantli
simul
stack
studi
time
valu
.I 2863
algorithm
cacm
call
compar
criterion
demonstr
den
fabri
improv
known
memori
optim
optimum
page
partit
present
priev
program
realiz
replac
respect
result
shown
simul
space
variabl
virtual
vmin
.I 2864
actual
algol
batson
behavior
cacm
character
characterist
concept
constitut
data
definit
denot
detect
discuss
displai
distribut
empir
exampl
execut
exist
explicit
formal
hierarchi
implic
lifetim
local
made
madison
manag
mechan
memori
model
paper
phase
product
program
reason
refer
resid
result
sampl
size
string
subset
support
system
term
time
transit
virtual
.I 2865
ad
aid
applic
approach
auxiliari
axiom
axiomat
cacm
case
complet
correct
crucial
deadlock
deduct
defin
dine
exclus
freedom
gri
hoar
illustr
inform
method
mutual
number
owicki
paper
parallel
partial
philosoph
power
present
problem
program
proof
properti
prove
sens
set
strong
system
techniqu
termin
variabl
verifi
.I 2866
appli
behavior
bound
cacm
defin
discuss
exampl
freedom
histor
howard
indefinit
interest
length
monitor
oper
overtak
proof
properti
prove
queue
record
repeat
rule
schedul
sequenti
signal
state
techniqu
unnecessari
upper
variabl
wait
.I 2867
cacm
coincid
concept
construct
cooprid
describ
design
famili
flon
function
habermann
hierarchi
implement
level
lowest
member
modul
modular
oper
paper
philosophi
result
run
share
shown
softwar
system
time
.I 2868
ad
bad
berkelei
build
cacm
capabl
cdc
design
develop
discuss
distinct
earlier
facil
featur
gener
good
hierarchi
lampson
later
layer
level
main
maintain
malfunct
memori
multiaccess
oper
organ
point
present
problem
protect
provid
purpos
reflect
retrospect
sequenc
solut
sturgi
system
.I 2869
access
axiom
cacm
carri
comput
control
correct
describ
enforc
formal
hardwar
kernel
mechan
millen
paper
pdp
practic
program
proof
prove
respect
secur
softwar
specif
step
system
techniqu
valid
.I 2870
accord
approach
automat
cacm
central
certif
class
classif
compon
comput
concis
construct
den
deriv
enabl
enforc
examin
exist
facilit
flow
formul
framework
guarante
inform
investig
justifi
lattic
lead
mathemat
mechan
model
object
paper
permit
program
properti
requir
restrict
secur
semant
structur
suggest
suitabl
system
unifi
verifi
view
.I 2871
actual
analysi
approach
april
assert
automat
cacm
check
comput
conduct
correct
criteria
devot
diagnosi
error
examin
express
gener
implic
includ
incomplet
incorrect
induct
intermedi
invari
katz
logic
manna
manual
occur
paper
part
present
problem
program
proven
provid
simultan
solut
suggest
system
techniqu
termin
treat
unifi
user
verif
.I 2872
april
cacm
comput
corrigendum
counterintuit
fagin
page
.I 2873
analyt
april
aspect
cacm
capabl
characterist
close
collect
comput
consist
convers
definit
design
displai
easi
element
figur
flexibl
geometr
geometri
implement
languag
learn
lg
loci
natur
nonprogramm
object
orient
paramet
possibl
program
raymond
result
specif
user
.I 2874
april
arrang
articl
basic
cacm
compar
comparison
comput
cost
earlier
evalu
featur
grown
incept
languag
lientz
minim
process
propos
scope
standard
ten
term
time
usag
version
.I 2875
april
cacm
comput
develop
intern
legal
program
protect
smoot
system
.I 2876
abil
achiev
admit
allow
amount
appear
approach
behavior
cacm
call
chang
concern
condit
control
databas
demonstr
develop
dimens
discuss
exampl
import
impos
independ
inform
intend
intent
interact
intern
involv
march
minski
model
paper
piec
practic
privaci
process
protect
radic
realiz
resolut
shown
suppli
system
tradit
tradition
understood
user
.I 2877
allen
analysi
cacm
cock
codifi
control
data
definit
determin
edg
expos
flow
global
graph
handl
indistinguish
irreduc
list
march
method
node
order
paper
possibl
procedur
program
reduc
relationship
static
structur
.I 2878
aim
arriv
babad
batch
bound
cacm
capac
charg
class
comput
consid
control
decis
expect
fill
formul
join
limit
loss
lower
march
markov
minim
modiano
multiclass
multiprior
number
optim
paper
polici
process
queue
semi
servic
singl
system
toll
upper
user
wait
.I 2879
cacm
comput
empir
inquiri
march
newel
scienc
search
simon
symbol
.I 2880
adapt
algorithm
artzi
binari
cacm
constant
directli
divis
divisor
fast
februari
foundat
hardwar
hind
implement
machin
mathemat
measur
method
microcod
ona
perform
present
prove
saal
techniqu
.I 2881
cacm
comput
concern
conjectur
counterexampl
counterintuit
exhibit
fagin
februari
group
independ
minim
miss
model
natur
optim
organ
page
ratio
record
refer
.I 2882
altern
analyz
attempt
cacm
cellular
combin
complex
cost
data
databas
demonstr
design
difficulti
discuss
due
effect
enabl
estim
evalu
experiment
februari
hybrid
impact
includ
invert
larg
list
methodolog
model
organ
paper
prohibit
queri
reduc
research
retriev
scale
scarc
significantli
siler
simul
stochast
studi
system
thread
valuat
work
workload
.I 2883
algorithm
allow
amount
applic
approach
cacm
comput
contour
depend
detect
discuss
dynam
edg
embed
experiment
extract
februari
figur
graph
heurist
improv
inform
known
lead
martelli
merit
method
minim
nois
noisi
object
paper
path
pictur
present
problem
program
properti
relat
repres
represent
result
search
separ
shape
shortest
show
solv
substanti
time
touch
.I 2884
addit
algorithm
arithmet
arrai
assign
attribut
boothroyd
cacm
case
classic
compar
comparison
comput
count
ehrlich
encount
enumer
exchang
execut
februari
gener
infrequ
iv
mark
nth
occur
oper
perform
permut
produc
refer
requir
rule
shown
simpl
singl
special
statement
subscript
superior
test
.I 2885
approxim
assum
averag
cacm
class
constant
distribut
effici
element
empir
evid
examin
fact
factor
februari
fix
heurist
independ
list
maintain
optim
order
organ
paper
perform
previou
probabl
requir
respect
rivest
rule
search
sequenti
shown
suggest
time
transposit
.I 2886
adapt
algol
algorithm
aspect
assur
attribut
bochmann
cacm
compil
concentr
condit
decid
definit
deriv
describ
discuss
eas
effici
evalu
explain
februari
formal
gener
grammar
import
includ
languag
left
notion
paper
pass
practic
program
question
rel
rule
scheme
scope
semant
singl
term
tree
.I 2887
algorithm
base
cacm
categori
classifi
cobol
compil
contain
correct
data
davi
densiti
design
diagnosi
econom
effect
error
exist
feedback
found
frequenc
high
identifi
impli
import
improv
inaccur
includ
induc
interfer
januari
lack
languag
learn
litecki
minim
misspel
optim
orient
paper
percent
pilot
potenti
previou
program
prone
research
reserv
run
softwar
student
studi
surprisingli
teach
total
type
usag
user
widespread
word
.I 2888
action
assign
busi
cacm
code
collect
connect
control
correct
data
databas
discuss
extens
florentin
framework
futur
identifi
inform
integr
item
januari
kei
larg
later
logic
maintain
method
model
principl
process
program
refer
reflect
set
shown
system
theoret
vital
.I 2889
allow
analyt
averag
avl
back
balanc
cacm
cost
delet
discuss
drop
execut
experiment
fuller
function
hb
height
imbal
increas
independ
insert
investig
item
januari
kaehler
karlton
larg
maintain
node
number
oper
order
paper
perform
present
procedur
properti
requir
restor
restructur
result
revisit
scrogg
search
sharpli
show
shown
simul
size
statist
suffici
time
trace
tree
.I 2890
adapt
agnew
algorithm
altern
analysi
analyt
bia
cacm
commun
condit
confirm
consid
construct
decis
direct
equilibrium
find
form
forward
futur
illustr
impact
januari
linear
maintain
messag
model
modif
network
node
optim
overus
path
present
quadrat
requir
result
rout
satisfi
show
simpl
simul
state
stationari
store
substitut
suggest
tabl
tend
term
theoret
underus
.I 2891
access
anomali
arriv
base
cacm
comparison
condit
develop
disk
empir
fcf
highli
illustr
januari
length
lower
mean
measur
model
present
probabl
publish
queue
schedul
seek
sens
sequenc
show
simpl
sstf
superior
wilhelm
.I 2892
anticip
arpanet
cacm
characterist
commun
compar
consid
deriv
effect
effici
extent
extrapol
form
head
heavili
hierarchi
januari
kleinrock
level
line
load
measur
model
naylor
network
opderbeck
overhead
present
propos
protocol
recent
result
separ
similar
sourc
studi
summar
system
.I 2893
address
adopt
american
applic
autom
cacm
central
citi
comput
conduc
control
counti
danzig
data
decemb
decis
determin
differ
distribut
domin
dutton
edp
electron
establish
explain
explanatori
extens
extent
extern
factor
final
financi
find
framework
fund
govern
higher
hypothes
identifi
impact
import
includ
innov
kei
larger
level
local
major
measur
milieu
need
oper
paper
polit
presenc
process
provid
question
rate
reveal
signific
sophist
stream
substanti
suggest
support
technolog
test
unexpect
valu
variat
.I 2894
adram
analyz
applic
assess
cacm
collect
comput
data
decemb
demonstr
emploi
enabl
evalu
extern
figur
frequent
includ
interact
lead
measur
merit
methodolog
nb
network
orient
perform
pragmat
primari
purpos
result
servic
system
techniqu
teract
ternal
tool
user
.I 2895
behavior
cacm
commun
comput
constrain
decemb
event
formal
greif
languag
occur
order
parallel
prioriti
problem
process
reader
specif
tend
ts
write
writer
.I 2896
cacm
collector
complic
correct
decemb
degre
develop
difficult
difficulti
dijkstra
discuss
especi
exercis
fine
greatli
gri
make
method
owicki
parallel
program
proof
prove
terleav
understand
.I 2897
advantag
allow
block
cacm
carter
case
code
compar
compil
concaten
context
convent
decemb
design
detail
develop
difficult
elabor
emerg
evid
expand
expans
fairli
favor
gener
good
higher
identifi
improv
investig
level
lower
object
optim
paper
pars
perform
pl
produc
recent
result
sequenc
set
simpl
sourc
special
statement
step
strategi
studi
tailor
take
task
techniqu
tradition
translat
.I 2898
allow
cacm
conceptu
concurr
decemb
describ
evalu
execut
explicitli
facil
forc
framework
freeli
gener
high
irrelev
kessel
languag
level
manner
modul
nest
nonprocedur
oper
order
paper
prescrib
problem
program
programm
provid
relev
remov
requir
sequenc
sequenti
solut
task
.I 2899
art
cacm
colleg
comput
cours
curricular
decemb
determin
develop
encourag
expand
half
liber
lopez
offer
paper
program
pursu
raymond
recent
result
scienc
small
student
summar
survei
tardiff
terest
topic
type
usual
.I 2900
aid
alloc
appli
belford
cacm
complet
copi
find
gener
grapa
heurist
includ
known
locat
need
network
novemb
optim
paper
polynomi
present
priori
problem
set
site
solut
solv
theorem
.I 2901
applic
blasgen
cacm
casei
charact
consid
control
encod
eswaran
field
import
impos
index
length
maximum
method
multifield
need
novemb
occur
order
origin
preced
preserv
produc
purpos
recov
relat
reserv
restrict
scheme
sequenc
singl
sort
string
symbol
variabl
.I 2902
algorithm
alloc
block
cacm
case
compar
comput
dynam
emploi
extern
favor
fifo
fragment
free
gener
investig
lifo
list
main
measur
memori
nielsen
novemb
oper
order
paper
perform
poorli
power
process
program
repres
requir
separ
servic
simpl
simul
size
space
surprisingli
tain
tend
term
test
time
unfavor
usag
.I 2903
algorithm
appli
bird
cacm
call
deriv
effici
elimin
fast
improv
introduct
knuth
linear
manipul
match
method
morri
nonlinear
novemb
occur
oper
pattern
pratt
problem
produc
program
recurs
run
shown
simpl
solv
stack
step
subject
techniqu
time
transform
translat
troduct
.I 2904
algorithm
cacm
cock
connect
discuss
extens
fit
function
includ
index
integr
linear
local
novemb
oper
optim
packag
perform
present
reduct
region
replac
simpl
strength
strongli
tabl
temporari
test
.I 2905
address
applic
build
cacm
comparison
complet
consid
construct
conveni
directli
distribut
element
extend
found
function
give
hash
identifi
item
kind
larger
mechan
method
minim
nonuniformli
novemb
ordinari
perfect
practic
present
probe
refin
result
retriev
rough
sens
set
show
shown
singl
small
smallest
spars
sprugnoli
static
store
tabl
techniqu
transform
uniqu
.I 2906
aim
applic
bdl
busi
cacm
calcul
compon
concept
data
defin
definit
describ
develop
evolv
explor
form
hammer
high
increasingli
kruskal
labor
languag
level
method
mimic
novemb
organ
ow
problem
process
program
recent
result
solut
sublanguag
tensiv
todai
wladawski
write
year
.I 2907
amount
approach
cacm
choos
classic
contrast
defin
discuss
embed
embodi
emphasi
exampl
fix
implic
inform
manna
maxim
novemb
optim
poin
practic
present
program
properti
prove
recurs
shamir
suggest
techniqu
troduct
valuabl
.I 2908
cacm
enumer
free
note
novemb
permut
reflect
roi
.I 2909
cacm
definit
divers
notat
novemb
syntact
unnecessari
wirth
.I 2910
cacm
curv
detect
equival
hough
match
novemb
stockman
templat
.I 2911
accord
addit
alloc
anomal
approxim
assumpt
averag
basi
behavior
block
briefli
cacm
coeffici
combin
consider
contigu
convent
correl
data
decreas
degre
depend
deriv
differ
direct
discuss
distribut
dynam
effect
effici
end
extent
fifti
free
frequent
group
hypothes
hypothesi
implic
increas
invers
make
markovian
memori
natur
non
novemb
order
paper
percent
placement
practic
predict
previou
process
ratio
refer
releas
report
request
resid
result
rule
select
shore
show
shown
simul
statist
storag
strategi
strongli
support
systemat
tend
time
vari
variat
violat
.I 2912
algorithm
assum
asynchron
cacm
concurr
consid
data
gener
illustr
includ
incorrect
lamport
mechan
messag
modifi
novemb
obtain
permit
present
problem
process
prove
read
repeat
result
share
solut
synchron
techniqu
theorem
time
transmit
write
written
.I 2913
accompani
algorithm
alias
annoy
applic
attenu
cacm
comput
crow
cure
defect
defocus
detail
digit
disappear
discuss
displai
edg
effect
evalu
exampl
explain
filter
gener
hidden
imag
implement
increas
inher
jag
lead
long
method
novemb
observ
paper
phenomenon
prefilt
present
problem
recogn
resolut
sampl
shade
shown
signal
surfac
term
tiler
understand
.I 2914
behavior
cacm
comput
depth
deriv
distribut
exampl
express
famili
fault
final
headwai
kind
lru
member
memori
model
need
novemb
page
probabl
publish
set
simpl
simul
size
stack
strecker
turner
virtual
work
.I 2915
activ
addit
anomali
basic
cacm
cobol
condit
consider
document
error
exist
extens
formal
fortran
futur
includ
inclus
item
languag
lee
made
novemb
paper
pl
program
propos
publish
respect
review
standard
state
.I 2916
actual
algorithm
alphabet
analysi
arrai
assum
avail
averag
behavior
boyer
cacm
case
charact
conclus
decreas
empir
end
english
evid
execut
fast
fewer
find
function
gain
implement
inform
inspect
instruct
jump
larg
length
linear
locat
machin
match
number
occurr
octob
oper
pat
patlen
pattern
present
proce
properti
random
search
size
space
start
string
support
tabl
text
theoret
typic
unusu
worst
.I 2917
cacm
comput
corrigendum
interact
jr
octob
process
schneider
sitar
small
system
text
watt
.I 2918
address
advantag
altern
analysi
attent
cacm
compar
comparison
comput
concentr
conclus
drawn
driven
effect
examin
gener
home
interfer
memori
multiprocessor
nonin
octob
organ
possess
previou
problem
processor
purpos
reduc
reliabl
result
share
shown
simul
smith
space
special
structur
suit
system
terfer
terleav
term
trace
verifi
work
.I 2919
advantag
altern
approach
area
assumpt
basic
benefici
cacm
call
comput
concept
consid
dedic
describ
develop
discuss
environ
eventu
function
gener
inadequ
ivi
machin
made
main
octob
oper
outlin
paper
product
program
programm
project
prove
purpos
run
section
separ
situat
softwar
special
subject
suggest
system
tenanc
total
troduc
unavail
util
.I 2920
approach
avoid
bipartit
cacm
concept
construct
deadlock
defin
determin
devil
endang
explicitli
flowchart
formal
futur
game
global
graph
inform
interpret
need
octob
oper
phenomenon
priori
problem
process
properti
realiz
represent
resourc
risk
run
safe
safeti
set
smooth
specifi
state
step
studi
system
terpret
.I 2921
advantag
altern
bound
cacm
call
case
cf
class
concis
consid
context
convert
describ
determin
diagram
end
express
finit
formal
found
free
fsm
grammar
handl
includ
inform
lalond
languag
left
length
lr
machin
mechan
nondeterminist
octob
paper
parser
part
pascal
product
program
regular
requir
resembl
rrp
special
state
symbol
syntax
troduc
understand
.I 2922
accord
advantag
aim
allow
altern
approach
attempt
attitud
basic
cacm
choic
comput
context
control
coordin
critic
defer
design
desir
direct
discuss
effort
environ
exampl
express
extens
feasibl
featur
formul
free
function
gener
guidelin
hold
idea
implement
inspect
interrog
keep
languag
leav
level
lisp
local
main
manag
montangero
nd
node
nondeterminist
nontermin
octob
pacini
poin
problem
process
program
proper
propos
puriti
recogn
reconsid
retain
search
singl
solv
state
strategi
stress
structur
style
term
time
track
tree
ts
turini
.I 2923
advanc
analysi
analyz
applic
aris
aspect
avoid
cacm
certif
compil
construct
contrast
control
cost
data
deal
deriv
escap
essenti
exploit
facilit
familiar
flow
free
gener
global
graph
help
high
illustr
implicit
incur
inform
involv
jump
larg
level
live
low
method
need
octob
optim
paper
pars
predomin
present
problem
program
propos
recent
reflect
repeatedli
rosen
simpl
solv
sourc
statement
termedi
text
time
tree
updat
variabl
work
.I 2924
abel
algorithm
analyt
applic
approach
arbitrari
basic
cacm
cardin
chuan
combin
commun
complex
comput
creat
curv
develop
dimension
displai
dynam
emploi
enabl
featur
gener
graphic
greenberg
inform
interact
join
loft
machin
man
mean
medic
method
modif
modifi
number
octob
process
rapid
repres
represent
routin
section
separ
shape
sheng
softwar
spatial
spline
stage
static
structur
successfulli
surfac
synthesi
system
techniqu
teract
terfac
terpol
theori
uniform
user
varieti
wu
.I 2925
aid
algorithm
analysi
area
automat
bound
cacm
close
compos
comprehens
consecut
construct
contour
cost
cross
cycl
describ
determin
develop
dimension
direct
endeavor
execut
express
fast
find
form
fuch
gener
graph
head
human
illustr
includ
involv
kedem
manipul
minimum
number
object
octob
oper
optim
pair
paper
planar
poin
present
problem
reconstruct
reduc
requir
scientif
section
separ
serial
set
solid
solut
surfac
technic
term
tile
toroid
triangular
ts
upper
uselton
util
.I 2926
access
analyz
applic
cacm
compar
distribut
exist
fast
length
mccreight
pagin
perform
present
record
result
septemb
shallow
strategi
time
tree
uniformli
variabl
wide
.I 2927
addit
algorithm
arithmet
bit
bound
cacm
complex
comput
doubli
equival
eratosthen
find
gener
integ
involv
link
list
log
logn
lower
mairson
method
modifi
multipl
number
preprocess
prime
reduc
requir
septemb
shown
siev
space
storag
techniqu
theoret
time
tradeoff
upper
yield
.I 2928
access
addit
allow
approxim
associ
bill
cacm
characterist
comput
configur
conjectur
consist
control
demonstr
displai
emploi
estim
experiment
extens
giffor
hardwar
honeywel
insensit
level
memori
minor
miss
multic
multiprogram
page
primari
process
processor
program
rate
referenc
regist
requir
result
septemb
shift
system
tabl
track
tune
usag
version
word
workload
.I 2929
algorithm
analysi
analyz
approxim
base
bodi
cacm
call
clu
code
compil
conclus
consist
constrain
copi
degre
depend
elimin
execut
formul
gener
increas
inlin
invoc
known
languag
low
minim
modifi
optim
percent
preliminari
present
problem
procedur
program
propos
recurs
replac
result
run
save
scheifler
septemb
size
small
solut
statist
structur
subject
substitut
techniqu
time
ts
.I 2930
advanc
aust
cacm
comput
content
describ
discuss
establish
event
examin
gener
graduat
gre
includ
lead
program
question
rational
recent
record
report
sampl
scienc
septemb
set
specif
test
troduc
.I 2931
abstract
actual
advanc
algebra
answer
appli
applic
approach
aspect
automata
big
bound
cacm
clean
comparison
complet
complex
comput
concentr
conceptu
content
continu
data
decis
definit
demonstr
depend
descript
develop
direct
dynam
effici
enter
exact
exampl
experi
explain
explan
featur
field
final
find
finit
flexibl
forc
formal
give
higher
idea
implement
independ
infinit
inform
involv
languag
lattic
level
logic
long
machin
made
map
mathemat
mean
method
natur
net
object
obviou
offer
opportun
order
outcom
part
partial
pass
portion
possibl
precis
principl
problem
process
program
proof
provid
put
queri
question
rang
real
recent
remain
repres
requir
sai
scott
semant
septemb
show
signific
simul
state
static
structur
syntact
terest
theori
transform
type
understand
undu
unifi
wide
worker
.I 2932
cacm
complex
comput
direct
discuss
divers
emphas
exampl
framework
illustr
method
practic
problem
rabin
research
seemingli
septemb
signific
terrel
theoret
theori
.I 2933
advantag
august
cacm
commun
francez
keyword
notat
paramet
subprogram
.I 2934
august
cacm
comment
comput
graph
lawler
path
shortest
.I 2935
august
cacm
comput
cont
corrigendum
employ
ph
product
scienc
taulbe
.I 2936
algorithm
aspect
august
averag
cacm
case
commonli
complex
conduct
data
discret
distribut
effici
estim
event
exhibit
franta
gener
improv
independ
insensit
link
list
mali
nearli
number
paper
perform
present
previous
publish
purpos
realiz
recent
routin
schedul
set
show
simpl
simul
skew
structur
suitabl
superior
system
test
worst
.I 2937
analysi
august
cacm
compar
convent
data
detail
difficulti
discuss
effect
environ
error
evalu
experi
experiment
gannon
increas
languag
made
manipul
number
paper
problem
program
reason
reliabl
represent
result
run
show
small
solut
static
subject
substanti
type
written
.I 2938
adher
analyt
august
cacm
categori
complex
concurr
constrain
disciplin
divid
drastic
execut
express
high
increas
languag
level
major
make
modula
mold
multiprogram
outlin
practic
program
real
reason
reduc
reliabl
sequenti
strict
suitabl
system
term
time
ts
ultim
valid
verifi
wirth
.I 2939
abstract
addit
atkinson
august
cacm
check
clu
compil
complet
construct
control
convent
data
design
develop
discuss
especi
exampl
illustr
implement
increment
kind
languag
led
librari
linguist
liskov
mean
mechan
methodolog
paper
perform
permit
procedur
process
program
realiz
schaffert
shown
snyder
subroutin
support
time
troduct
type
util
work
written
.I 2940
abstract
allow
alphard
august
cacm
case
common
construct
control
data
deal
defin
definit
depend
develop
entiti
essenti
explicit
express
extend
form
function
gener
great
ident
implement
import
interact
iter
languag
loop
mean
obtain
paper
poin
programm
proof
properti
provid
represent
result
rule
shaw
show
simpl
special
specif
statement
structur
techniqu
termin
troduc
type
verif
wulf
.I 2941
abstract
address
algorithm
august
benefit
breach
cacm
coercion
data
defin
difficulti
discuss
earli
equival
experi
facil
geschk
implement
implic
jr
languag
make
mesa
modul
morri
occasion
program
record
safe
satterthwait
similar
specif
structur
suggest
system
topic
treatment
type
variant
.I 2942
algol
base
brownle
cacm
implement
juli
pattern
snobol
.I 2943
ashcrof
assign
axiom
cacm
carri
condit
convent
easi
equat
follow
formal
function
help
infer
irrelev
iter
juli
languag
logic
look
loop
lucid
need
nonprocedur
order
proce
produc
program
proof
reason
rule
simpli
special
statement
straightforward
structur
system
thing
unconvent
wadg
written
.I 2944
achiev
action
affect
analysi
assum
automat
barth
bobrow
cacm
cancel
cell
code
collect
compil
count
deduc
deutsch
discuss
effici
enabl
execut
featur
find
flow
garbag
global
group
implement
improv
inform
juli
optim
orient
overhead
paper
partial
perform
program
propos
reclam
refer
requir
scheme
shift
shown
sourc
storag
summar
techniqu
time
transact
.I 2945
analysi
applic
cacm
certif
class
compil
confidenti
confin
correct
data
den
depend
easili
exist
exploit
flow
import
includ
inform
input
juli
lattic
mechan
nonconfidenti
paper
phase
present
problem
procedur
program
properti
prove
result
secur
semant
simpl
structur
suffici
supposedli
verifi
.I 2946
altern
brinch
buffer
cacm
concept
condit
correct
describ
effici
event
exampl
express
finit
hansen
hoar
implement
inform
juli
kessel
monitor
nearli
oper
paper
pool
present
primit
problem
proof
propos
queue
reader
share
stream
synchron
term
wait
writer
.I 2947
addit
analysi
bibliograph
cacm
circular
combin
command
compar
comput
consist
context
convers
cost
crt
delimit
deliv
design
desir
edit
experi
extens
featur
function
handl
hit
implement
interact
invok
jr
juli
languag
local
low
memori
microprogram
nontechn
orient
part
pdp
power
process
produc
retriev
schneider
search
share
show
simpl
sitar
small
string
structur
sum
system
templat
teract
text
textual
time
user
wai
watt
.I 2948
algorithm
attach
cacm
charact
commun
comput
connect
consist
correct
describ
design
detect
directli
duplex
echo
error
full
heckel
juli
lampson
larg
line
local
medium
multiplex
number
orient
output
paper
present
problem
remot
servic
share
small
solv
specif
speed
system
telephon
termin
time
type
.I 2949
baran
base
cacm
central
commun
comput
constrain
control
correct
crash
distribut
doctrin
explain
gener
heurist
implement
inform
involv
juli
link
main
major
merit
need
network
node
order
potato
present
proof
protocol
rout
scheme
tajibnapi
tenanc
topolog
ts
updat
.I 2950
abstract
algorithm
approach
base
bernstein
cacm
class
classifi
commonli
criterion
defin
definit
depend
deriv
develop
discuss
driven
effici
exist
fabri
flexibl
formal
framework
implement
includ
invari
juli
model
notion
oper
paper
polici
present
prioriti
process
rate
real
relat
result
ruschitzka
schedul
scheme
sharp
system
time
unifi
.I 2951
achiev
activ
aim
analyt
applic
arpa
assist
cacm
capabl
clearli
compar
compon
comput
data
depend
describ
detail
divers
dynam
emploi
evalu
feasibl
fulli
goal
human
inform
investig
juli
level
load
mamrak
measur
monitor
network
node
obtain
particip
perform
predict
process
provid
research
resourc
respons
reveal
share
simul
statist
step
store
studi
suffici
system
technic
time
tool
ultim
user
vast
wish
.I 2952
cacm
function
jr
june
logic
parallel
realiz
warren
word
.I 2953
algorithm
appli
aris
basi
bird
cacm
compar
connect
elimin
fi
form
fx
gener
gx
involv
june
method
note
proc
procedur
px
recurs
remov
run
schemat
solut
sort
stack
time
travers
tree
.I 2954
algorithm
alloc
assumpt
bound
cacm
case
copi
cyclic
distinct
featur
high
june
languag
left
level
like
linear
list
make
oper
present
previou
robson
similar
span
storag
structur
system
techniqu
time
travers
tree
unlik
workspac
.I 2955
algorithm
alloc
analys
binari
block
buddi
cacm
class
compar
correspond
dynam
extern
fibonacci
fragment
implement
june
norman
peterson
present
provid
recurr
relat
result
set
simul
size
storag
system
ternal
total
weight
.I 2956
allow
arrai
cacm
concern
convers
data
domain
element
explor
fashion
finit
gehani
gri
high
idea
issu
iter
june
languag
level
narrow
need
notat
notion
number
oper
paramet
primit
problem
restrict
result
set
simpl
type
valu
.I 2957
abstract
aggreg
ari
cacm
call
collect
complementari
conceptu
concern
criteria
data
databas
decis
defin
defined
design
detail
develop
distinct
form
hierarchi
higher
identif
implement
import
incorpor
invari
june
kei
languag
level
main
methodolog
normal
notion
object
oper
preserv
program
real
relat
relationship
separ
shown
smith
specifi
structur
suggest
support
tain
top
transform
troduc
type
updat
world
.I 2958
abstract
algebra
applic
block
cacm
complet
consist
construct
correct
data
develop
discuss
effici
exampl
flexibl
guttag
involv
june
languag
paper
plai
present
problem
proof
reliabl
role
signific
softwar
specif
structur
symbol
tabl
techniqu
top
type
.I 2959
applic
autom
busi
cacm
comput
databas
de
describ
dimension
displai
execut
expert
form
give
gradual
inform
jong
june
languag
manipul
manual
nonprogramm
pictur
program
queri
report
sba
subset
system
tabl
termin
user
view
zloof
.I 2960
abstract
cacm
data
june
ledgard
taylor
view
.I 2961
aid
cacm
call
composit
comprehens
control
debug
describ
detail
differ
experi
experiment
flowchart
group
heller
investig
june
mayer
mckai
modif
nonflowchart
paper
previou
program
question
research
seri
shneiderman
shown
signific
statist
suggest
test
util
.I 2962
area
breakdown
cacm
calendar
compar
comparison
cont
data
degre
depart
employ
faculti
gather
graduat
grant
includ
june
made
note
ph
present
produc
product
profil
signific
specialti
statist
student
taulbe
trend
year
.I 2963
algorithm
applic
cacm
case
common
comput
expect
fast
find
hunt
length
log
longest
match
number
order
pair
posit
present
previous
problem
publish
run
sequenc
subsequ
szymanski
time
total
worst
.I 2964
approach
cacm
databas
design
milman
optim
paramet
storag
.I 2965
boolean
cacm
evalu
express
hanani
onlin
optim
queri
system
.I 2966
achiev
algorithm
cacm
calcul
choic
cluster
comput
data
discuss
distanc
exhaust
extend
improv
involv
larg
locat
match
method
multipl
paper
poin
preprocess
present
previou
previous
proper
refer
result
search
shapiro
show
shown
simul
step
ts
.I 2967
address
advantag
apld
approach
area
associ
berra
cacm
comparison
comput
consist
context
cost
creat
data
delet
dimension
draw
duplic
effect
flexibl
function
graphic
hardwar
illustr
input
laboratori
languag
leap
lincoln
line
major
memori
modifi
output
poin
problem
process
rectangl
requir
retriev
simul
softwar
speed
stillman
storag
store
structur
system
technolog
triangl
ts
tx
util
.I 2968
algorithm
analysi
analyz
aspect
avl
baer
balanc
bb
believ
binari
build
cacm
code
compar
comparison
compil
criteria
depend
detail
effici
encompass
extens
guidelin
height
implement
independ
insert
languag
length
level
machin
measur
method
oper
overhead
path
present
qualiti
queri
restructur
result
run
schwab
search
spent
subsequ
terest
theoret
time
total
tree
wb
weight
.I 2969
account
algorithm
alloc
applic
cacm
comput
convert
data
depend
gain
heterogen
insight
levin
locat
model
morgan
network
occur
optim
present
problem
procedur
program
real
search
take
.I 2970
accuraci
achiev
analysi
appli
assumpt
cacm
chanc
check
complet
consider
costli
describ
due
empti
enter
error
estim
extend
fewer
fishman
frequent
idl
illustr
includ
job
make
method
normal
obtain
output
page
paper
preliminari
procedur
properti
queue
reduc
reduct
regen
reli
requir
result
run
sequenti
simul
specif
state
statist
system
techniqu
test
varianc
.I 2971
actual
applic
barnard
busi
cacm
calcul
call
chosen
compat
compil
comput
concept
confus
construct
cordi
data
defin
design
easi
elimin
encourag
featur
holt
implement
includ
languag
learn
make
non
numer
pl
preced
precis
problem
process
program
redund
result
retain
scientif
sequenc
solv
sp
structur
subset
suitabl
system
teach
troduc
wortman
.I 2972
abstract
appli
applic
april
automat
cacm
contain
correct
describ
encourag
formal
hierarch
indic
larg
level
levitt
method
nonprocedur
oper
paper
preliminari
present
program
proof
repres
result
robinson
semi
simplifi
specif
structur
system
techniqu
term
.I 2973
algorithm
april
arrai
cacm
comparison
comput
connect
constant
dimension
element
extens
factor
higher
kung
log
mesh
optim
paper
parallel
present
previou
processor
requir
rout
shown
small
sort
step
take
thompson
time
.I 2974
april
bandyopadhyai
cacm
comment
increment
linear
scatter
search
tabl
weight
.I 2975
april
cacm
data
holland
insert
remark
structur
uniform
.I 2976
access
approxim
april
block
cacm
databas
organ
yao
.I 2977
altern
analysi
april
basi
budget
cacm
california
comput
concept
contradictori
counti
curv
data
develop
evid
fail
growth
hypothesi
invalid
jr
lucac
model
nolan
organ
paper
present
process
research
resourc
result
separ
shape
stage
studi
suggest
support
sutton
test
.I 2978
altern
analysi
analyz
april
averag
basic
boundari
cacm
case
choic
class
combin
compar
comparison
compress
cost
cross
delet
design
entri
environ
express
formula
includ
index
insert
kei
main
maruyama
memori
numer
page
qualit
reorgan
retriev
search
smith
strategi
structur
studi
sum
tenanc
virtual
wieght
.I 2979
advic
answer
applic
april
behavior
cacm
choic
cognit
complex
conceptu
concern
construct
decis
deduct
descript
effort
enabl
environ
establish
experi
fairli
findler
form
framework
game
go
hand
heurist
human
incorpor
induct
infer
investig
judgment
larg
learn
machin
make
mode
model
norm
optim
plai
poker
present
problem
process
program
progress
provid
question
rang
reach
recent
report
repres
research
result
risk
rule
scale
similar
solv
strategi
studi
system
take
techniqu
teract
terest
theori
uncertainli
us
vehicl
wide
.I 2980
adjac
analysi
april
base
basi
cacm
contrast
definit
edit
elimin
equival
exampl
fast
graph
grow
inform
initi
larg
local
major
number
oper
pavlidi
perform
pictur
present
problem
process
properti
region
result
satisfi
scheme
segment
semant
shown
size
spuriou
tanimoto
techniqu
.I 2981
altern
april
assert
cacm
commonli
comput
condit
directli
explor
form
guarante
induct
input
invari
jr
loop
major
method
morri
output
present
proof
prove
relat
rule
set
shown
special
specif
step
strong
subgoal
suffici
supplement
valid
view
virtu
wegbreit
.I 2982
bertsch
cacm
march
pars
preced
requir
storag
.I 2983
bai
cacm
comparison
fit
march
.I 2984
borovit
cacm
coeffici
comput
cost
dor
effect
ein
evalu
extent
factor
imbal
includ
march
measur
method
perform
present
represent
system
techniqu
term
total
util
visual
.I 2985
advanc
appli
assert
attitud
base
behavior
cacm
categori
chang
characterist
chargeout
comput
conform
control
develop
edp
effect
environ
evid
expect
factor
gener
growth
high
hypothesi
import
increas
inform
investig
involv
level
main
manag
march
mark
method
nolan
organiz
part
pattern
place
posit
prerequisit
price
provid
relationship
research
result
scienc
servic
stage
system
take
tenanc
ternal
train
user
.I 2986
algorithm
asymptot
boolean
cacm
closur
common
composit
comput
condit
context
direct
effici
express
faster
free
function
gener
give
grammar
grammer
graph
heart
hunt
iii
invers
linear
march
matric
oper
operand
practic
preced
relat
shown
size
spars
step
suffici
szymanski
theorem
transit
ullman
union
weber
wirth
.I 2987
algorithm
arrang
binari
burton
cacm
collect
consecut
curv
disadvantag
discuss
essenti
examin
exampl
fast
fix
grid
hierarchi
ideal
inclus
intersect
line
locat
march
method
overcom
poin
polygon
practic
process
rapid
region
repres
represent
search
set
shown
side
speed
test
tree
ts
.I 2988
accur
actual
analys
analysi
analyt
appli
applic
base
broadli
brown
cacm
chandi
comput
computation
displai
distribut
effect
empir
finit
graphic
includ
job
manag
march
measur
memori
methodolog
model
multiaccess
multiphas
network
nonpag
paper
perform
present
propos
queue
relat
report
requir
respons
size
solubl
studi
swap
system
teract
time
tractabl
util
variabl
workload
.I 2989
analysi
analyz
answer
architectur
base
briefli
cacm
concept
dec
desir
detect
discuss
empir
evalu
execut
exist
experiment
featur
instruct
isp
life
live
lund
march
method
non
number
obtain
overhead
paper
present
problem
processor
program
question
reduc
regist
result
run
save
set
simultan
suffici
system
term
time
trace
troduc
.I 2990
accuraci
automat
averag
base
cacm
case
collect
concept
construct
difficult
document
effect
evalu
experiment
formal
frequenc
gener
give
index
inform
invers
march
measur
number
occurr
optim
perform
phrase
present
probabl
proof
publish
queri
relat
relev
respect
retriev
salton
situat
specif
studi
successfulli
system
term
thesauru
troduc
unfortun
user
wai
weight
work
yu
.I 2991
access
ad
address
bucket
cacm
chain
clapson
cluster
combin
decreas
devic
divis
effect
empir
hash
improv
kei
lead
load
locat
march
maximum
need
nonuniform
number
open
perform
pre
probe
properti
random
record
reduc
remov
search
secondari
sequenc
sequenti
set
shadow
shown
smooth
storag
studi
techniqu
time
transform
.I 2992
binari
cacm
februari
knott
number
system
tree
.I 2993
aris
attempt
averag
cacm
case
class
comput
condit
constrain
cycl
data
encount
error
fact
februari
formul
frequent
function
give
ibm
ill
indefinit
indic
infeas
input
instanc
investig
known
kotiah
linear
maxim
minim
model
mp
object
observ
occur
occurr
packag
perturb
phenomena
prevent
primari
problem
program
queue
reason
result
round
set
size
small
solv
steinberg
subject
suffici
suggest
.I 2994
addit
algorithm
arc
bresenham
cacm
cathod
circl
circular
closet
describ
devic
digit
displai
dot
drawn
elementari
februari
increment
linear
matrix
methodolog
paper
pattern
plotter
prin
produc
rai
sign
step
subtract
ter
test
true
tube
.I 2995
cacm
corrigendum
courtoi
decompos
februari
instabl
multiprogram
satur
system
.I 2996
amount
averag
bennett
bias
cacm
calcul
comput
condit
content
defin
depend
discuss
distanc
distinct
easton
estim
expect
express
februari
finit
free
handl
hold
length
long
main
method
miss
name
number
obtain
page
pair
perform
probabl
provid
rate
record
refer
sampl
set
shown
size
start
stationar
statist
storag
string
term
terrefer
terval
transient
unbias
unknown
us
work
.I 2997
algorithm
cacm
complex
conquer
constant
convex
determin
dimens
februari
finit
hong
hull
log
merg
multipl
nonin
oper
optim
poin
preparata
present
procedur
propos
requir
set
tersect
time
ts
.I 2998
analyz
assumpt
atom
bit
cacm
car
cdr
clark
consecut
content
discuss
effici
empir
entropi
especi
februari
found
frequenc
govern
greatli
green
inform
languag
larg
linear
lisp
list
locat
measur
memori
natur
nearbi
obei
observ
pair
paper
physic
poin
pointer
predict
program
reason
regular
report
represent
reveal
roughli
shown
space
static
strengthen
structur
studi
substanti
success
ter
word
zipf
.I 2999
approach
arrai
attent
bank
base
cacm
capabl
comput
data
develop
februari
gener
handl
identifi
muller
multidimension
present
problem
process
purpos
recent
retriev
statist
summari
system
tabl
work
world
wrap
.I 3000
abstract
algol
aspect
batson
behavior
brundag
cacm
characterist
construct
contour
design
discuss
distribut
empir
evid
hold
implic
januari
johnston
lifetim
machin
measur
memori
model
present
program
provid
real
request
requir
result
sampl
segment
simpl
size
system
term
thesiz
time
virtual
.I 3001
achiev
analysi
cacm
carlson
case
chang
combin
conjunct
desir
detect
effici
eleg
empir
error
faster
final
finit
free
involv
januari
jr
larg
larger
method
negat
number
occurr
paper
pi
pn
possibl
problem
properti
rang
report
slightli
solut
studi
subject
subset
suitabl
sum
suppos
system
take
time
unusu
valu
variabl
xi
xn
zobrist
.I 3002
access
babad
cacm
cost
data
deriv
design
devic
distribut
gener
independ
inform
integ
item
januari
known
length
librari
made
main
mix
model
mutual
nonlinear
object
optim
paper
paramet
partit
pertin
present
primari
probabl
program
record
reduct
request
requir
routin
select
storag
store
subrecord
system
transfer
type
variabl
.I 3003
activ
appear
approxim
aust
barn
bibliographi
cacm
categori
comput
cours
curriculum
descript
educ
hundr
januari
literatur
materi
organ
philosophi
preced
profession
program
public
refer
report
scienc
survei
.I 3004
adapt
applic
approach
cacm
cobol
code
defin
design
disciplin
discuss
drawn
exampl
flowchart
form
frequent
gelder
implement
inform
januari
nonmathemat
practic
present
previou
program
programm
proper
prove
specif
step
structur
techniqu
terminolog
theorem
top
van
verif
work
write
.I 3005
account
address
architectur
assign
base
byte
cacm
call
care
code
compact
consequ
consist
decod
design
effici
empir
encod
ensur
execut
factor
field
fix
frequent
goto
highli
huffman
implement
implic
instruct
languag
length
line
machin
march
method
minim
op
percent
present
program
propos
reduc
respect
scheme
singl
size
space
special
specif
statement
structur
studi
tanenbaum
text
time
unlik
util
variabl
written
.I 3006
algorithm
alloc
anomal
anomali
behavior
cacm
concern
discuss
examin
exampl
fact
fault
franklin
gener
graham
gupta
implic
inclus
increas
march
mean
memori
occur
oper
page
partit
potenti
present
properti
rate
redefin
refer
result
string
system
term
type
variabl
virtual
.I 3007
cacm
complex
comput
corrigendum
march
rabin
.I 3008
adjac
altern
arrai
asymptot
averag
binari
bound
cacm
choos
combinatori
consid
consider
data
demillo
design
eisenstat
elementari
embed
examin
forc
graph
impli
import
instanc
involv
kind
linear
lipton
list
logic
loss
major
march
model
optim
order
present
preserv
problem
programm
proof
proxim
result
row
scheme
shown
storag
store
strategi
structur
tree
.I 3009
answer
balanc
cacm
delet
establish
height
hirschberg
insert
kosaraju
log
march
open
perform
pose
problem
prove
recent
side
step
tree
.I 3010
aloof
anderson
attent
cacm
close
complex
comput
confirm
contrast
found
investig
major
march
minnesota
nontechnolog
orient
rate
scienc
social
special
structur
student
technolog
univers
.I 3011
activ
american
applic
bear
cacm
clearli
common
comput
concept
control
decis
depart
design
despit
dutton
exist
extent
final
govern
impact
implement
improv
inform
involv
kraemer
local
manag
march
mi
natur
orient
practic
preval
profession
relat
support
surprisingli
system
tend
top
tradit
unsophist
user
util
vari
.I 3012
addit
built
cacm
chosen
comput
computer
data
design
discuss
frequent
gath
implic
import
influenc
inform
interact
jr
laboratori
leader
luca
march
medic
monitor
paper
plai
present
provid
questionnair
reaction
red
refer
research
result
retriev
role
show
similar
storag
studi
system
usag
user
.I 3013
appli
approxim
briefli
cacm
center
centroid
compar
consid
describ
detect
differ
digit
distanc
edg
equival
februari
gradient
grai
laplacian
level
max
mean
median
method
neighborhood
note
obtain
oper
output
pictur
ramp
respond
rosenfeld
schachter
set
similar
standard
step
sum
test
turn
.I 3014
appli
approach
assert
burstal
cacm
complement
continu
control
convent
correct
counterpart
directli
document
exampl
explor
februari
final
hand
intermitt
introduc
involv
manna
markedli
method
need
number
oper
paper
pass
point
present
program
promis
proof
prove
provid
rephras
shown
simpler
simultan
techniqu
termin
time
transform
true
valid
valuabl
walding
.I 3015
approach
area
assumpt
attract
bodi
cacm
case
choic
coeffici
compar
computation
consequ
consist
converg
densiti
discuss
distribut
equat
exact
experiment
februari
fewer
function
gener
gray
great
herman
human
imag
import
inequ
inform
integr
larg
lent
linear
lutz
ly
make
medicin
method
minimum
nonzero
norm
number
obtain
paper
paramet
percent
practic
previous
problem
procedur
project
propos
rai
reconstruct
recov
relax
relaxarion
result
scientif
sequenc
shown
size
solut
solv
sparsiti
special
strictli
strip
success
system
techniqu
thin
translat
typic
variabl
vector
version
wai
.I 3016
cacm
comparison
consid
correct
decompos
decomposit
error
estim
examin
fail
februari
final
inher
markov
markovian
mean
method
model
mortem
nearli
numer
obtain
paper
post
present
probabl
result
reveal
standard
stationari
stewart
system
techniqu
vector
yield
.I 3017
applic
aris
basic
cacm
databas
dealt
directori
examin
februari
frequenc
held
increas
multius
penalti
perform
potenti
problem
propos
re
static
stonebrak
storag
structur
tradit
tree
variant
.I 3018
admit
algorithm
approxim
cacm
cliqu
color
combinatori
complet
conflict
connect
consequ
construct
cover
determin
edg
equival
establish
factor
februari
graph
heurist
intersect
kellerman
keyword
kou
method
minim
np
number
object
optim
optimum
polynomi
present
problem
produc
regard
relationship
shown
solut
solv
stockmey
subgraph
time
watson
wong
.I 3019
advanc
aust
cacm
comput
februari
gre
scienc
test
.I 3020
achiev
aim
algorithm
amplifi
appli
ausland
briefli
cacm
comparison
complex
conclus
cost
demonstr
describ
discuss
displai
februari
final
illustr
integr
knuth
linkag
major
measur
obtain
paper
part
perform
pl
presenc
present
procedur
process
program
recurs
remov
result
save
strong
systemat
techniqu
walker
.I 3021
adleman
applic
cacm
consequ
courier
cryptosystem
deciph
decrypt
deni
difficulti
digit
divid
divisor
enciph
encrypt
factor
februari
forg
fund
held
import
intend
kei
know
larg
later
mean
messag
method
mod
need
number
obtain
obviou
part
power
present
prime
privat
product
properti
public
publicli
publish
rais
recipi
remaind
repres
rest
result
reveal
rivest
secret
secur
shamir
signatur
signer
similar
system
take
transfer
transmit
valid
verifi
.I 3022
academ
analysi
background
cacm
compar
comput
conduct
data
determin
equal
faculti
fall
februari
gener
grant
jr
load
mamrak
member
men
minor
montanelli
present
profession
public
record
research
respect
result
salari
scienc
statu
survei
teach
verdict
women
.I 3023
achiev
architectur
cacm
case
comment
consider
control
cover
data
debug
describ
design
discuss
distinguish
effort
error
experi
extend
extens
facil
final
handl
ibm
implement
import
input
instruct
januari
machin
manipul
monitor
multiprocess
object
oper
origin
output
padg
paper
paramet
program
reason
section
storag
system
tabul
time
virtual
.I 3024
access
account
achiev
addit
ansi
architectur
benefit
built
cacm
capabl
cft
commonli
compat
compil
comput
contemporari
crai
date
describ
design
develop
discuss
effort
erda
evolut
extens
float
fortran
give
innermost
januari
loop
manufactur
million
modif
nonstandard
oper
optim
overcom
paper
point
problem
process
program
protect
requir
russel
satisfi
scientif
sourc
standard
statement
support
system
user
vector
vi
.I 3025
acceler
batch
bell
cacm
chang
circa
comput
contribut
cover
dec
design
develop
evolut
evolv
gener
hardwar
hast
hill
implement
includ
interact
januari
known
kotok
languag
manufactur
microcomput
minicomput
model
oper
orient
origin
pdp
present
price
rang
requir
serv
share
singl
softwar
support
system
technolog
term
time
timeshar
transfer
transit
user
.I 3026
analysi
architectur
base
batch
begin
bit
borgherson
cacm
compat
complement
comput
configur
design
environ
evolut
frame
hanson
hardwar
hartlei
high
introduc
januari
larg
latest
main
model
multiprocessor
multiprogram
obtain
oper
operand
progress
project
provid
regist
scale
seri
simultan
speed
sperri
storag
structur
success
support
symmetr
system
timeshar
tori
transact
univac
word
.I 3027
access
address
aim
arrai
associ
background
cacm
capon
code
compil
complet
complex
comput
conduc
descript
design
develop
discuss
effici
element
featur
final
function
high
ibbett
idea
includ
indic
initi
instruct
involv
januari
languag
level
mechan
mu
multistag
number
outlin
perform
pipelin
predict
prefetch
present
processor
product
program
project
queue
set
sourc
structur
system
trace
view
.I 3028
address
architectur
area
atla
cacm
comput
concept
contemporari
context
dai
describ
design
develop
discuss
evalu
evolv
gener
impact
innov
januari
lavington
manag
manchest
mark
paper
perform
period
perspect
place
present
progress
softwar
stand
store
system
terminolog
toric
univers
wider
year
.I 3029
architectur
cacm
comput
foreword
fuller
issu
januari
special
.I 3030
appli
cacm
claim
construct
decemb
describ
design
discuss
eas
extens
formal
help
hierarch
implement
increas
increasingli
languag
larg
levitt
list
method
number
paper
predict
problem
process
produc
product
program
proof
recogn
reliabl
robinson
signific
specif
spitzen
substanti
techniqu
user
.I 3031
abstract
accomplish
algebra
autom
automat
axiom
axiomat
cacm
convent
correct
data
decemb
deriv
design
emploi
formal
guttag
horowitz
implement
independ
level
limit
major
musser
natur
paper
permit
process
program
proof
prove
represent
semi
show
shown
simplifi
softwar
specif
success
test
thrust
time
tool
twofold
type
valid
virtu
.I 3032
accomplish
accord
add
address
algorithm
altern
analysi
base
broadcast
cacm
complex
comput
dalal
data
decemb
deliveri
develop
exist
exploit
forward
hot
implement
includ
known
list
metcalf
method
metric
multidestin
network
node
optim
packet
paper
path
potato
practic
procedur
requir
revers
rout
separ
sourc
span
store
structur
switch
transmiss
tree
.I 3033
accord
algorithm
approach
aspect
bound
branch
cacm
clutter
combin
compress
convers
decemb
decis
deriv
direct
doubl
dynam
effect
enorm
expand
exponenti
find
good
guid
handl
heurist
ident
increas
independ
introduc
larg
literatur
martelli
method
montanari
number
optim
paper
posit
produc
program
quasi
recogn
requir
search
solut
space
subproblem
suggest
tabl
tackl
techniqu
test
time
top
tree
variabl
.I 3034
action
algorithm
assum
base
cacm
condit
control
decemb
decis
detect
determin
develop
embed
entri
equal
error
express
fortran
free
ibramsha
implement
inequ
iv
limit
linear
logic
loop
occur
paper
program
rajaraman
relat
set
solut
stub
tabl
transfer
variabl
.I 3035
address
administr
assess
cacm
comput
contrast
control
decemb
deliveri
design
develop
dock
educ
effect
effort
empir
emploi
enhanc
evalu
find
higher
implement
improv
institut
instruct
major
methodolog
plan
present
press
problem
research
result
role
servic
significantli
strateg
studi
term
test
univers
wetherb
year
.I 3036
achiev
algorithm
altern
bitner
cacm
charact
comput
decemb
determin
document
featur
fix
gener
heurist
howard
implement
matrix
minim
need
note
number
optim
percent
peterson
prepass
print
reduc
repres
requir
select
set
stop
tab
termin
transmiss
transmit
.I 3037
algorithm
arithmet
assum
cacm
complex
decemb
easili
eleg
execut
extend
factor
find
gri
integ
larger
linear
mairson
method
misra
multipl
number
perform
present
prime
proport
siev
simpler
time
unit
version
.I 3038
achiev
algorithm
authent
basi
cacm
commun
comput
connect
consid
convent
decemb
discuss
document
encrypt
establish
guarante
integr
kei
larg
mail
manag
needham
network
present
protocol
public
schroeder
signatur
verif
.I 3039
achiev
activ
addit
cacm
collect
complex
comput
con
constraint
cooper
data
despit
detect
develop
devot
dijkstra
engend
exclus
exercis
fly
frequent
garbag
illustr
interfer
lamport
larg
manipul
martin
mutual
nearli
need
novemb
oper
perform
process
processor
proper
scholten
sequenti
sever
share
space
steffen
synchron
techniqu
weak
.I 3040
achiev
algorithm
altern
backtrack
cacm
combinatori
consist
constraint
desir
determin
develop
effici
explicitli
express
find
formul
freuder
function
level
network
novemb
order
preprocess
present
problem
relat
represent
search
set
solut
subject
subsequ
synthes
theori
tree
valu
variabl
.I 3041
achiev
applic
balanc
binari
bound
built
cacm
contrast
cost
discuss
distribut
effici
fast
forc
frequenc
frequent
high
highli
kei
left
lexic
log
lookup
maxim
median
minim
mst
node
novemb
obtain
occur
oppos
optimum
order
partit
perfectli
perform
present
remain
represent
respect
search
set
sheil
skew
space
speed
split
stabl
subtre
success
techniqu
time
tree
unlik
valu
.I 3042
advantag
analyz
asymptot
averag
avl
balanc
behavior
buildabl
cacm
case
class
close
consid
extens
famili
grow
height
ii
insert
ipk
ipo
luccio
main
maintain
node
novemb
number
pagli
path
pk
power
present
procedur
reduc
requir
restrict
restructur
run
set
simul
studi
tree
worst
.I 3043
applic
buffer
cacm
call
case
class
common
commun
concept
concurr
control
coroutin
distribut
exampl
express
guard
hansen
includ
input
introduc
languag
mean
microcomput
monitor
network
novemb
output
paper
path
procedur
process
program
propos
real
region
semaphor
show
special
storag
synchron
time
variabl
.I 3044
altern
cacm
condit
content
diverg
evalu
express
field
friedman
node
note
novemb
record
succe
wise
.I 3045
attempt
cacm
complex
continu
enabl
error
gener
good
handl
increas
made
method
neglig
novemb
pars
parser
preced
procedur
process
recov
recoveri
repair
result
riplei
semant
simpl
space
syntax
tabl
time
.I 3046
ahren
cacm
comput
constant
core
dieter
effort
fairli
faster
fishman
gamma
gener
ii
larg
medium
method
nonintegr
novemb
obtain
paramet
program
propos
random
reject
remain
requir
shape
similar
simpler
storag
superior
tadikamalla
time
valu
variabl
variat
wallac
.I 3047
achiev
addit
align
analysi
angl
automat
bachman
benefit
cacm
calcul
classif
conveni
correctli
deal
describ
digit
effect
exact
function
gradient
horn
illustr
imag
imageri
improv
industri
inspect
intens
known
landsat
light
map
match
mean
model
navig
novemb
number
obtain
part
posit
radar
real
reflect
regist
registr
requir
satellit
slope
sourc
sun
surfac
synthet
task
techniqu
terrain
vari
visibl
.I 3048
altern
appear
architectur
bottleneck
buffer
cach
cacm
case
comput
concurr
configur
construct
control
cpu
data
davidson
design
detail
determinist
discuss
emul
evalu
experi
fix
high
highli
ibm
implement
instruct
kumar
major
memori
model
necess
need
novemb
perform
pipelin
point
practic
present
real
replac
resourc
result
reveal
simplement
simul
sophist
speed
statist
stream
studi
subsystem
system
techniqu
time
unit
usag
yield
.I 3049
aim
applic
assumpt
bagdam
basic
batch
built
cacm
capabl
common
commonli
commun
complet
compon
comput
conceptu
content
data
describ
descript
design
devic
displai
easi
entiti
environ
extend
facil
found
fulli
function
graphic
grow
handl
hardwar
held
input
interact
larg
lead
major
manag
manipul
mean
meet
modifi
need
novemb
oper
outlin
output
packag
paper
perform
present
program
provid
receiv
retriev
sembeg
simpli
store
system
true
varieti
view
wendorf
.I 3050
administr
approach
bound
cacm
center
choic
comput
configur
control
cost
demand
design
detail
educ
face
game
hypothet
instal
job
lyon
made
manag
meet
mix
novemb
oper
paper
player
present
problem
real
receiv
report
run
servic
set
simul
situat
system
vari
varieti
world
.I 3051
cacm
comparison
event
franta
heap
mali
octob
set
simul
structur
tl
.I 3052
approxim
assumpt
behavior
belief
cach
cacm
capac
cast
cold
comput
constant
curv
doubt
easton
effect
empti
fagin
fill
function
hand
hierarchi
incur
interrupt
larg
length
level
lifetim
long
made
main
maintain
measur
miss
multiprogram
number
observ
obtain
octob
oper
page
period
program
properti
ratio
reciproc
refer
shown
signific
simpl
start
storag
store
string
studi
switch
system
task
valu
versu
warm
widespread
.I 3053
access
address
approxim
arrai
auxiliari
benefit
cacm
code
compar
convent
cost
cutoff
degrad
depth
dictionari
displac
enhanc
entri
enum
exact
exhaust
fix
frequenc
function
import
improv
introduct
known
larg
limit
linear
lyon
method
octob
op
open
optim
pack
possibl
primarili
provid
recurs
refer
remain
resembl
retriev
scatter
search
size
solut
spell
substanti
suit
tabl
techniqu
unsuccess
weight
.I 3054
algorithm
analyt
appli
assembl
cacm
code
combin
comput
consid
describ
detail
discuss
effect
extra
illustr
implement
improv
includ
languag
method
neglig
octob
optim
paper
perform
practic
program
quicksort
real
requir
result
sedgewick
situat
sort
special
standpoint
storag
studi
summar
techniqu
variant
varieti
.I 3055
algorithm
analysi
arriv
asymptot
cacm
complex
differ
dijkstra
dutch
expect
flag
improv
mcmaster
meyer
nation
number
octob
problem
program
refin
shown
simpl
solut
start
swap
valu
.I 3056
advantag
approxim
bit
byte
cacm
control
count
counter
error
event
expect
experi
hardwar
independ
larg
monitor
morri
multichannel
number
octob
percent
precis
process
regist
rel
result
small
softwar
substanti
techniqu
time
track
.I 3057
absolut
accumul
algorithm
assign
assort
box
cacm
chang
complet
complex
digit
drop
ensur
equival
error
find
function
grai
investig
level
linearli
match
minim
monoton
np
object
octob
optim
order
overpack
pack
paper
pictur
place
placement
point
polynomi
present
problem
properti
refer
restrict
search
size
solut
space
sum
time
togram
transform
tree
wong
.I 3058
altern
appeal
applic
binari
cacm
classic
discuss
evalu
explor
fast
feasibl
jump
level
multipl
number
octob
optimum
paper
perform
record
root
scheme
search
sequenti
shneiderman
size
squar
strategi
structur
techniqu
variabl
variant
.I 3059
analysi
appli
applic
approxim
balanc
brown
cacm
chandi
cpu
decomposit
degre
develop
formul
found
greatest
improv
individu
intern
low
model
multiprogram
network
octob
overlap
paper
parallel
percentag
perform
problem
process
program
queue
solut
system
systemtem
techniqu
term
towslei
util
.I 3060
brainerd
cacm
complet
describ
design
develop
featur
fortran
inform
languag
octob
offici
paper
refer
replac
standard
titl
.I 3061
algorithm
cacm
dynam
search
septemb
sequenti
simul
tenenbaum
.I 3062
approxim
cacm
contour
map
plot
real
septemb
time
ward
.I 3063
cacm
index
mali
memori
note
septemb
virtual
.I 3064
access
addit
address
appar
cacm
capabl
caus
concaten
consist
count
creat
deal
dealt
desir
diagnos
discret
econom
effici
event
execut
familiar
featur
flexibl
grow
handl
includ
infinit
larg
loop
maintain
major
manipul
number
part
point
practic
present
problem
proper
provid
requir
schedul
septemb
simul
simultan
system
time
ulrich
.I 3065
algorithm
appear
brother
cacm
carri
class
close
delet
difficult
import
inher
insert
log
obtain
oper
ottmann
perform
provid
relationship
result
revers
septemb
side
stem
time
tree
wood
.I 3066
abil
amount
base
cacm
code
comput
control
cost
data
describ
detect
effect
emploi
error
experi
experienc
find
found
highli
independ
inspect
method
myer
pair
paper
pl
pool
popular
process
profession
program
result
septemb
show
small
studi
subject
term
test
tremend
type
vari
variabl
walk
walkthrough
.I 3067
actual
aggreg
algorithm
allow
cacm
case
class
comput
concept
cost
curv
data
defin
demand
den
develop
effici
empir
entir
exce
extend
fetch
function
gener
gopt
gw
includ
inclus
keep
known
load
memori
minim
model
oper
optim
point
polici
procedur
program
properti
refer
resid
retent
retriev
satisfi
segment
septemb
set
show
simul
size
slutz
special
stack
string
structur
swap
system
usag
vmin
work
.I 3068
appli
applic
approach
architectur
assur
basi
cacm
comput
data
definit
develop
discuss
enforc
farber
form
gener
kernel
method
model
oper
popek
precis
program
promis
properti
provid
reliabl
secur
septemb
share
suitabl
system
term
ucla
uncircumvent
verif
verifi
.I 3069
algorithm
analysi
analyz
aris
associ
asymptot
barth
cacm
call
complex
comput
data
deal
flow
implement
inform
interprocedur
larg
modifi
optim
paramet
pass
pattern
possibl
power
practic
prepass
present
preserv
procedur
program
recurs
refer
relationship
requir
septemb
share
singl
subcal
suffici
time
uniqu
variabl
.I 3070
accur
accuraci
activ
analyt
arriv
base
cacm
central
combin
compar
comput
cost
demonstr
describ
discret
effici
equival
event
hybrid
hypothet
job
model
network
oper
paper
processor
produc
queue
result
schwetman
septemb
server
simpl
simul
structur
system
techniqu
.I 3071
algebra
algorithm
appendix
bel
book
cacm
calcul
classif
coeffici
complet
coordin
design
determin
exampl
field
formac
formal
gravit
harri
illustr
implement
invari
note
permit
petrov
present
propos
scheme
septemb
special
spin
symbol
system
techniqu
tensor
type
weyl
zund
.I 3072
activ
alloc
amount
assign
attent
august
basic
brice
brown
buffer
cacm
comput
continu
control
coupl
cpu
data
demand
distribut
driven
dynam
effect
environ
execut
featur
feedback
flow
greatest
heavi
ident
imbed
improv
input
integr
measur
memori
model
multiprocessor
multiprogram
optim
output
perform
polici
preempt
present
process
rate
requir
resourc
resum
schedul
shown
simpl
simul
space
static
structur
studi
system
techniqu
time
trace
user
variabl
workload
.I 3073
august
basic
cacm
combin
commun
composit
concept
develop
dijkstra
exercis
familiar
fundament
hoar
illustr
input
method
output
paper
parallel
primit
process
program
sampl
sequenti
solut
structur
suggest
surprisingli
varieti
versatil
.I 3074
accomplish
algorithm
area
august
bit
cacm
collect
compact
differ
effici
eman
encod
end
garbag
linear
list
locat
mark
mass
morri
node
oper
order
pass
point
pointer
rearrang
rel
revers
revis
scatter
show
singl
situat
size
space
storag
task
termin
time
wish
.I 3075
algorithm
arbitrari
august
bucket
cacm
comput
content
fast
fetch
hirschberg
integ
locat
log
make
memori
model
number
parallel
permit
present
procedur
processor
product
realist
requir
simultan
sort
space
techniqu
time
.I 3076
analys
analyz
arrang
articl
august
autom
base
begun
benefit
cacm
choic
comput
concern
conflict
context
conveni
credit
custom
debit
develop
discuss
eft
electron
examin
financi
full
fund
group
held
help
implement
implicit
import
incent
institut
kling
larg
larger
learn
legal
market
organ
pace
paper
parti
posit
potenti
privaci
problem
promis
propos
public
qualiti
question
rais
record
reflect
rel
relat
reliabl
resolv
scale
signific
social
solv
specif
system
technic
topic
transact
transfer
wai
year
.I 3077
algebra
altern
ancestor
applic
argument
august
backu
basic
behavior
build
cacm
carri
chosen
class
close
combin
common
complex
comput
condit
construct
convent
coupl
creat
data
deal
declar
defect
detail
divis
effect
enorm
equat
exist
express
fat
form
found
function
gener
give
grow
hierarch
high
higher
inabl
inher
inherit
lack
languag
larg
law
level
liber
loos
machineri
major
mathemat
neumann
nonrecurs
nonrepetit
occur
oper
power
primit
procedur
program
properti
rang
reason
requir
rule
school
semant
solv
state
statement
stronger
structur
style
system
termin
theorem
time
transform
transit
unlik
variabl
von
weak
word
world
written
.I 3078
aid
algebra
analysi
analyt
analyz
applic
avail
cacm
chattergi
comput
consider
construct
demonstr
difficulti
juli
major
manipul
markov
model
obtain
paper
physic
pooch
potenti
present
problem
process
processor
program
purpos
rang
reduc
relat
result
semi
solut
symbol
system
techniqu
unreli
wider
.I 3079
algorithm
cacm
complet
correct
equal
fast
formula
function
ground
juli
present
proof
reason
shostak
simpl
symbol
techniqu
.I 3080
abil
bypass
cacm
class
code
compil
correct
correctli
demonstr
detect
error
exampl
fact
faster
gener
genr
hand
handl
heurist
high
implement
interest
juli
languag
level
low
memori
need
oper
optim
paper
pinpoint
post
primari
program
prove
recurs
result
samet
save
size
stack
start
step
substanti
system
term
translat
us
wide
written
.I 3081
access
activ
addit
affect
amount
assoc
baker
bind
bound
cacm
call
chang
combin
complet
comput
concept
context
control
correctli
deep
dijkstra
dynam
eleg
environ
execut
final
gener
indivis
interpret
invari
invok
jr
juli
leav
lisp
long
model
multipl
oper
option
present
primit
process
program
programm
reroot
revers
scheme
semant
sens
shallow
shown
speed
structur
switch
transform
tree
variabl
.I 3082
algorithm
bound
cacm
clock
concept
defin
deriv
distribut
event
examin
happen
illustr
juli
lamport
logic
method
order
partial
physic
problem
shown
solv
special
synchron
synchroni
system
time
total
.I 3083
address
analysi
cacm
cell
chain
collis
deriv
effici
fact
field
halatsi
half
hash
item
juli
link
method
open
overflow
ow
paper
permit
philokypr
present
pseudochain
resolut
tabl
tradeoff
.I 3084
access
assum
averag
avni
cacm
comput
confirm
cumul
desir
distribut
estim
experi
extra
function
hold
interpol
itai
juli
kei
known
log
logn
low
method
number
order
perl
record
requir
result
retriev
search
shown
statist
uniformli
.I 3085
affect
algorithm
associ
averag
cacm
case
chain
chin
comput
condit
determin
discuss
find
form
juli
longer
matric
matrix
mi
mn
number
oper
optim
order
paper
percent
present
product
suffici
take
time
topt
yield
.I 3086
ai
allow
analysi
bi
bound
cacm
comparison
complex
comput
decis
demonstr
determin
discuss
eas
effect
endpoint
excel
exist
fredman
function
interv
juli
linear
log
lower
measur
model
number
opportun
overlap
possibl
problem
produc
provid
real
result
shown
tree
union
weid
.I 3087
abil
abl
aircraft
answer
augment
brows
cacm
call
case
casual
clarifi
complex
compon
concept
construct
context
data
databas
design
detail
dialogu
discuss
domain
ellipsi
english
exampl
explicit
flight
formal
frame
gener
handl
illustr
implement
import
includ
issu
judg
juli
keeper
languag
larg
limit
mainten
match
mean
meaning
method
natur
network
number
obtain
oper
optim
order
partial
phrase
plane
portion
problem
process
program
pronoun
provid
queri
question
refer
regist
relat
relationship
request
resolv
search
specif
system
tori
transit
type
understood
user
vagu
waltz
.I 3088
applic
balanc
cacm
comput
condit
configur
consist
cpu
deriv
devic
directli
effect
equat
estim
exampl
expect
gener
ideal
ident
illustr
june
main
maximum
model
multiprogram
overlap
partit
process
provid
record
resourc
respons
set
storag
system
task
teori
time
timeshar
unbalanc
user
util
.I 3089
assum
avail
cacm
checkpoint
deriv
derochett
ensur
failur
gelenb
includ
inform
intermitt
june
mathemat
measur
method
model
oper
orient
perform
point
princip
process
propos
recoveri
reliabl
respons
rollback
satur
system
time
transact
.I 3090
administr
agenc
attract
autom
base
cacm
casework
client
comput
demand
economi
effici
enhanc
ey
featur
fit
funder
group
illustr
impact
increas
inform
integr
intern
joint
june
kling
major
oper
organiz
polit
product
report
servic
system
technic
track
welfar
.I 3091
amount
basic
begun
cacm
characterist
chrysler
comput
contain
creat
determin
develop
emerg
equat
evid
examin
experi
fifteen
forecast
found
gave
good
hypothes
increas
influenc
june
major
measur
multipl
object
power
predict
preprogram
process
product
program
programm
propos
reduc
regress
relat
relationship
requir
research
specif
task
techniqu
time
ultim
.I 3092
analysi
analyz
applic
area
attent
cacm
categori
characterist
constitut
consum
cost
cycl
demand
develop
enhanc
estim
extens
group
high
import
june
lientz
life
literatur
mainten
major
manag
organ
orient
packag
percent
portion
pretest
problem
program
questionnair
rang
resourc
respond
respons
result
rough
signific
softwar
spss
statist
submit
swanson
system
technic
tend
tompkin
total
user
view
.I 3093
appear
approach
automat
base
cacm
detect
directli
driven
error
graham
inform
june
levi
lr
mickuna
modri
obtain
paper
pars
parser
pattern
power
present
program
provid
recov
recoveri
rhode
scheme
simpl
syntax
.I 3094
accept
actual
algorithm
analys
analyz
appli
applic
approach
arithmet
averag
benchmark
bind
bottom
bui
cacm
call
cohen
compil
configur
defin
deriv
descent
describ
determin
determinist
effici
elementari
estim
examin
execut
express
final
form
formula
grammar
illustr
input
iter
june
languag
length
ll
machin
maximum
minimum
numer
oper
paper
pars
parser
pdp
perform
pop
present
program
propos
push
quantiti
recurs
rel
repres
roth
rule
sentenc
simpl
slr
specif
string
subscript
substanti
symbol
time
top
valu
variabl
wish
.I 3095
accord
algorithm
binari
cacm
call
condit
consid
consum
data
driscol
effici
examin
field
item
june
lien
list
minim
node
number
paper
present
problem
process
rang
retriev
satisfi
search
select
tag
time
travers
tree
visit
.I 3096
accomplish
acl
advantag
advers
affect
arbitrari
avl
balanc
basic
binari
bit
cacm
complex
coupl
delet
earlier
equal
exactli
gener
greater
height
hirschberg
inform
insert
june
left
logn
magnitud
mcdonald
method
modif
node
number
oper
optim
order
problem
reduc
requir
result
retriev
sens
shown
side
subtre
tree
zweben
.I 3097
allow
amount
bit
block
bound
boundari
cacm
call
ccd
come
compos
comput
critic
definit
drum
field
iin
involv
known
maximum
memori
minim
minimum
number
occur
optim
page
paper
pass
purpos
quickli
random
rate
reach
refresh
regist
request
requir
rotat
serial
shift
shortli
simpli
site
slowli
speed
start
strategi
time
transfer
vari
variabl
view
wait
.I 3098
ahren
cacm
compar
comput
core
dieter
distribut
effort
fishman
gamma
gener
method
nonintegr
paramet
program
propos
random
recent
requir
shape
similar
simpler
storag
tadikamalla
variabl
wallac
.I 3099
applic
base
cacm
class
code
complementar
condit
construct
difficult
dual
fleisher
gener
integ
known
linear
meyer
mix
optim
present
primal
problem
program
pure
purpos
report
set
solut
suffici
test
thought
.I 3100
abstract
adequaci
algorithm
cacm
common
concern
consid
descript
direct
discuss
exampl
exemplar
find
futur
hay
induc
interfer
knowledg
match
mcdermott
method
present
problem
program
properti
propos
relat
research
roth
sequenc
solv
task
techniqu
train
.I 3101
accomplish
activ
addit
argument
bind
cacm
call
compon
control
coroutin
data
decompos
definit
describ
environ
exampl
function
goal
griswold
hanson
integr
invoc
languag
level
mechan
method
object
orient
paper
part
permit
problem
procedur
program
programm
readili
record
recurs
result
separ
sl
sourc
suit
transmiss
treat
.I 3102
aid
amp
automat
base
cacm
consid
convers
discuss
feet
iii
incorpor
introduct
issu
karr
keep
languag
loveman
method
physic
program
propos
relationship
sec
subsequ
syntax
track
unit
volt
watt
yard
.I 3103
abstract
autom
automat
cacm
choos
construct
data
design
detail
discuss
effici
fill
gener
help
implement
ineffici
issu
level
librari
list
low
maintain
overview
paper
past
process
produc
program
programm
prove
provid
purpos
review
save
select
set
singl
space
structur
system
time
type
.I 3104
accur
addit
aid
applic
cacm
correct
data
demonstr
detect
error
geller
guarante
introduc
long
method
paper
procedur
process
program
proof
prove
provid
recurs
simplifi
specif
techniqu
tediou
tend
test
.I 3105
abstract
access
account
appli
applic
approach
bank
cacm
check
compon
constraint
control
data
declar
desir
enforc
express
extend
extens
inform
jone
languag
larger
liskov
mechan
need
notion
object
oper
paper
permit
program
provid
record
share
show
similar
simpl
state
static
strongli
suitabl
support
system
type
.I 3106
algorithm
arbitrarili
auxiliari
bit
block
built
cacm
cell
clark
classif
come
contigu
copi
destroi
effici
enabl
fast
faster
fisher
fix
fold
linear
link
list
locat
mainli
mark
need
number
oper
optim
origin
present
problem
process
program
shown
significantli
speed
stack
storag
structur
techniqu
time
travers
type
variabl
.I 3107
advantag
april
beta
cacm
cheng
combin
compar
comput
especi
gener
method
nonintegrel
paramet
previou
previous
program
publish
reject
shape
simplic
speed
suggest
theoret
time
valu
variat
.I 3108
april
cacm
comma
compar
cost
delimit
econom
encod
extra
increas
insert
length
method
present
prolong
rodeh
small
string
symbol
term
vanishingli
.I 3109
april
cacm
collect
data
delet
earliest
insert
item
manipul
oper
primit
prioriti
queue
repres
search
structur
uni