%A K. Samuelson
%A F.L. Bauer
%T Sequential formula translation
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 9-13

%A Edgar T. Irons
%T A syntax directed compiler for Algol 60
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 14-16

%A Edward H. Sussenguth,\ Jr.
%T Use of tree structures for processing files
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 17-20

%A E.W. Dijkstra
%T Solution of a problem in concurrent programming control
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 21-22

%A Joseph Weizenbaum
%T ELIZA - a computer program for the study
of natural language communication between man and machine
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 23-28

%A Jack B. Dennis
%A Earl C. Van\ Horn
%T Programming semantics for multiprogrammed computations
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 29-35

%A W.D. Maurer
%T An improved hash code for scatter storage
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 36-38

%A Robert Morris
%T Scatter storage techniques
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 39-42

%A Peter J. Denning
%T The working set model for program behavior
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 43-48

%A Edsger W. Dijkstra
%T The structure of "THE" multiprogramming system
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 49-52

%A C.A.R. Hoare
%T An axiomatic basis for computer programming
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 53-56

%A Jay Earley
%T An efficient context-free parsing algorithm
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 57-61

%A James R. Bell
%T The quadratic quotient method:
a hash code eliminating secondary scattering
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 62-63

%A E.F. Codd
%T A relational model of data for large shared data banks
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 64-69

%A Niklaus Wirth
%T Program development by stepwise refinement
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 70-74

%A D.L. Parnas
%T A technique for software module specification with examples
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 75-78

%A H. Kuki
%A W.J. Cody
%T A statistical study of the accuracy of floating point number systems
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 79-83

%A Dennis M. Ritchie
%A Ken Thompson
%T The UNIX time-sharing system
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 84-89

%A Robert M. Metcalfe
%A David R. Boggs
%T Ethernet: distributed packet switching for local computer networks
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 90-95

%A R.L. Rivest
%A A. Shamir
%A L. Adleman
%T A method for obtaining digital signatures
and public-key cryptosystems
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 96-99

%A C.A.R. Hoare
%T Communicating sequential processes
%J Communications of the ACM
%K cacm
%V 26
%N 1
%D January 1983
%P 100-106

%A Ahmed S. Zaki
%T Regulation of electronic funds transfer: impact and legal issues
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 112-118

%A Gordon Bell
%T The computer museum's first field trip:
the Northbay AN/FSQ7 SAGE site
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 119-120

%A William Kent
%T A simple guide to five normal forms in relational database theory
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 120-125

%A R. Charles Bell
%T Monte Carlo debugging: a brief tutorial
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 126-127

%A Iris Vessey
%A Ron Weber
%T Some factors affecting program repair maintenance: an empirical study
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 128-134

%A B. Srinivasan
%T On the synthesis of decision tables
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 135-136

%A Michael J. Manthey
%A Bernard M.E. Moret
%T The computational metaphor and quantum physics
%J Communications of the ACM
%K cacm
%V 26
%N 2
%D February 1983
%P 137-145

%A Margrethe H. Olson
%T Remote office work: changing work patterns in space and time
%J Communications of the ACM
%K cacm
%V 26
%N 3
%D March 1983
%P 182-187

%A Michael A. Pechura
%T Comparing two microcomputer operating systems: CP/M and HDOS
%J Communications of the ACM
%K cacm
%V 26
%N 3
%D March 1983
%P 188-195

%A A. Chesnais
%A E. Gelenbe
%A I. Mitrani
%T On the modeling of parallel access to shared data
%J Communications of the ACM
%K cacm
%V 26
%N 3
%D March 1983
%P 196-202

%A Simon S. Lam
%A Y. Luke Lien
%T A tree convolution algorithm for the solution of queueing networks
%J Communications of the ACM
%K cacm
%V 26
%N 3
%D March 1983
%P 203-215

%A Hitohisa Asai
%A C.K. Cheng
%T Speeding up an overrelaxation method of division in radix-2^n machine
%J Communications of the ACM
%K cacm
%V 26
%N 3
%D March 1983
%P 216-220

%A P.J. Brown
%T Error messages: the neglected area of the man/machine interface ?
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 246-249

%A Dalia Motzkin
%T Meansort
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 250-251

%E Michael L. Schneider
%E John C. Thomas
%T The humanization of computer interfaces
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 252-253

%A Donald A. Norman
%T Design rules based on analyses of human error
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 254-258

%A Robert J.K. Jacob
%T Using formal specifications
in the design of a human-computer interface
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 259-264

%A Teresa L. Roberts
%A Thomas P. Moran
%T The evaluation of text editors: methodology and empirical results
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 265-283

%A Steven L. Sauter
%A Mark S. Gottlieb
%A Karen C. Jones
%A Vernon N. Dodson
%A Kathryn M. Rohrer
%T Job and health implications ob VDT use:
initial results of the Wisconsin-NIOSH study
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 284-294

%A John D. Gould
%A John Conti
%A Todd Hovayecz
%T Composing letters with a simulated listening typewriter
%J Communications of the ACM
%K cacm
%V 26
%N 4
%D April 1983
%P 295-308

%A T.R. Grill
%A Clement H. Luk
%T DOCUMENT: an interactive, online solution
to four documentation problems
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 328-337

%A Tarek K. Abdel-Hamid
%A Stuart E. Madnick
%T The dynamics of software project scheduling
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 340-346

%A R.E.A. Mason
%A T.T. Carey
%T Prototyping interactive information systems
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 347-354

%A H.J. Will
%T ACL: a language specific for auditors
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 356-361

%A Richard N. Taylor
%T A general purpose algorithm for analysing concurrent programs
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 362-376

%A John Konvalina
%A Stanley A. Wileman
%A Larry J. Stephens
%T Math proficiency: a key to success for computer science students
%J Communications of the ACM
%K cacm
%V 26
%N 5
%D May 1983
%P 377-381

%A Stephen A. Cook
%T An overview of computational complexity
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 401-408

%A Jonathan P. Jacky
%A Ira J. Kalet
%T A general purpose data entry program
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 409-417

%A R.W. Bemer
%T Coordinated text and transparencies
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 418

%A Henry Lieberman
%A Carl Hewitt
%T A real-time garbage collector based on the lifetimes of objects
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 419-429

%A M. Lynne Markus
%T Power, politics, and MIS implementation
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 430-444

%A H. Rudy Ramsey
%A Michael E. Atwood
%A James R. Van\ Doren
%T Flowcharts versus program design languages:
an experimental comparison
%J Communications of the ACM
%K cacm
%V 26
%N 6
%D June 1983
%P 445-449

%A National Commission on Excellence in Education
%T A nation at risk: the imperative for educational reform
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 469-478

%A Eric A. Weiss
%T Self-assessment procedure XI: one part of early computing history
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 479-482

%A D. Verne Morland
%T Human factors guidelines for terminal interface design
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 484-494

%A T.K. Landauer
%A K.M. Calotti
%A S. Hartwell
%T Natural command names and initial learning:
a study of text editing terms
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 495-503

%A Mann-may Yau
%A Sargur N. Srihari
%T A hierarchical data structure for multidimensional digital images
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 504-515

%A M. Fushimi
%A S. Tezuka
%T The K-Distribution of
generalized feedback shift register pseudorandom numbers
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 516-524

%A Mark J. Cloutier
%A Matthew J. Friedman
%T Precision averaging for real-time analysis
%J Communications of the ACM
%K cacm
%V 26
%N 7
%D July 1983
%P 525-529

%A Jon Bentley
%T Programming pearls: cracking the oyster
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 550-552

%A William E. Burr
%T An overview of the proposed American National Standard
for local distributed data interfaces
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 554-561

%A James V. Hansen
%T Audit considerations in distributed processing systems
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 562-569

%A James K. Mullin
%T A second look at bloom filters
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 570-571

%A David L. Parnas
%T A generalized control structure and its formal definition
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 572-581

%A Frank Milne
%A Ron Weber
%T The economics of designing generalized software
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 582-589

%A Stephen C. Hora
%T Estimation of the inverse function for random variate generation
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 590-594

%A Jurgen Peemoller
%T A correction to Brelaz's modification of Brown's coloring algorithm
%J Communications of the ACM
%K cacm
%V 26
%N 8
%D August 1983
%P 595-597

%A Jon Bentley
%T Programming pearls: aha! algorithms
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 623-628

%A Pamela McCorduck
%T An introduction to the fifth generation
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 629-630

%A Paul S. Licker
%T The Japanese approach: a better way to manage programmers ?
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 631-636

%A Ehud Y. Shapiro
%T The fifth generation project - a trip report
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 637-641

%A Rosalie Steier
%T Cooperation is the key: an interview with B.R. Inman
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 642-645

%A Tan Watanabe
%A Tsuneharu Ohsawa
%A Takaji Suzuki
%T A simple database language for personal computers
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 646-653

%A Andrew S. Tanenbaum
%A Hans van\ Staveren
%A E.G. Keizer
%A Johan W. Stevenson
%T A practical tool kit for making portable compilers
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 654-662

%A Jeffrey L. Eppinger
%T An empirical study of insertion and deletion in binary search trees
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 663-669

%A Ronald Prescott Loui
%T Optimal paths in graphs with stochastic or multidimensional weights
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 670-676

%A Piraye Bayman
%A Richard E. Mayer
%T A diagnosis of beginning programmers' misconceptions
of BASIC programming statements
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 677-679

%A Hanan Samet
%T A quadtree medial axis transform
%J Communications of the ACM
%K cacm
%V 26
%N 9
%D September 1983
%P 680-693

%A Jon Bentley
%T Programming pearls: data structures programs
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 726-730

%A Gerardine DeSanctis
%A James F. Courtney
%T Toward friendly MIS implementation
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 732-738

%A Tor Guimaraes
%T Managing application program maintenance expenditures
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 739-746

%A Douglas Comer
%T A computer science research network CSNET:
a history and status report
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 747-753

%A M.A. Pechura
%A J.D. Schoeffler
%T Estimating file access time of floppy disks
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 754-763

%A Ivor Durham
%A David Lamb
%A James Saxe
%T Spelling correction in user interfaces
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 764-774

%A John Rockart
%A Lauren Flannery
%T The management of end-user computing
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 776-784

%A Blake Ives
%A Margrethe Olson
%A Jack Baroudi
%T The measurement of user information satisfaction
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 785-793

%A Beverly K. Kahn
%T Some realities of data administration
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 794-799

%A John Ivancevich
%A H. Albert Napier
%A James Wetherbe
%T Occupational stress, attitudes, and health problems
in the information systems professional
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 800-806

%A Kathryn M. Bartol
%T Turnover among DP personnel: a causal analysis
%J Communications of the ACM
%K cacm
%V 26
%N 10
%D October 1983
%P 807-811

%A James F. Allen
%T Maintaining knowledge about temporal intervals
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 832-843

%A Wolfgang Bibel
%T Matings in matrices
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 844-852

%A Elliot Soloway
%A Jeffrey Bonar
%A Kate Ehrlich
%T Cognitive strategies and looping constructs: an empirical study
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 853-860

%A Richard J. Miara
%A Joyce A. Musselman
%A Juan A. Navarro
%A Ben Shneiderman
%T Program indentation and comprehensibility
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 861-867

%A You-Dong Liang
%A Brian A. Barsky
%T An analysis and algorithm for polygon clipping
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 868-877

%A J.T. Postmus
%A A.H.G. Rinnooy Kan
%A G.T. Timmer
%T An efficient dynamic selection method
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 878-881

%A Russell J. Abbott
%T Program design by informal English descriptions
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 882-894

%A J.L.W. Kessels
%T On-the-fly optimization of data structures
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 895-901

%A David S. Wile
%T Program developments: formal explanations of implementations
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 902-911

%A Gaston H. Gonnet
%A Frank W. Tompa
%T A constructive approach to the design of algorithms and their data structures
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 912-920

%A James F. Korsh
%A Gary Laison
%T A multiple-stack manipulation procedure
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 921-923

%A R. Charles Bell
%A Bryan Floyd
%T A Monte Carlo study of Cichelli hash-function solvability
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 924-925

%A Jack P.C. Kleijnen
%A Anton J. van\ Reeken
%T Principles of computer charging in a university-type organization
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 926-932

%A Antoni Olive\ I\ Ramon
%T Information derivability analysis in logical information systems
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 933-938

%A Kyu-Young Whang
%A Gio Wiederhold
%A Daniel Sagalowicz
%T Estimating block accesses in database organizations:
a closed noniterative formula
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 940-944

%A W.S. Luk
%T On estimating block accesses in database organizations
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 945-947

%A Nicholas P. Vitalari
%A Gary W. Dickson
%T Problem solving for effective systems analysis: and experimental exploration
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 948-956

%A Lee Schruben
%T Simulation modeling with event graphs
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 957-963

%A George S. Fishman
%A Baosheng D. Huang
%T Antithetic variates revisited
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 964-971

%A Raymond E. Barber
%A Henry C. Lucas,\ Jr.
%T System response time, operator productivity, and job satisfaction
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 972-986

%A Ron Dagwell
%A Ron Weber
%T System designers' user models:
a comparative study and methodological critique
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 987-997

%A Gabriel M. Silberman
%T Stack processing techniques in delayed-staging storage hierarchies
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 999-1007

%A W.P. Petersen
%T Vector Fortran for numerical problems on CRAY-1
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 1008-1021

%A Gerard Salton
%A Edward A. Fox
%A Harry Wu
%T Extended boolean information retrieval
%J Communications of the ACM
%K cacm
%V 26
%N 11
%D November 1983
%P 1022-1036

%A Jon Bentley
%T Programming pearls: writing correct programs
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1040-1045

%A Stephen S. Yau
%A Robert W. Ritchie
%A Warren Semon
%A Joseph Traub
%A Andries van\ Dam
%A Stanley Winkler
%T Meeting the crisis in computer science
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1046-1050
%K Snowbird

%A Perry R. Morrison
%T A survey of attitudes toward computers
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1051-1057

%A Marc Eisenstadt
%T A user-friendly software environment for the novice programmer
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1058-1064

%A Paul J. Jalics
%A Thomas S. Heines
%T Transporting a portable operating system: Unix to an IBM minicomputer
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1066-1072

%A Gaston H. Gonnet
%T Balancing binary trees by internal path reduction
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1074-1081

%A Seichi Nishihara
%A Katsuo Ikeda
%T Reducing the retrieval time of hashing method by using predictors
%J Communications of the ACM
%K cacm
%V 26
%N 12
%D December 1983
%P 1082-1088

%A Jon Bentley
%T Programming pearls: about the column
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 12-13

%A Gerald M. Berns
%T Assessing software maintainability
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 14-24

%A John W. Geils
%T Why students reject engineering teaching careers
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 25-28

%A Robert I. Winner
%A Edward M. Carter
%T Self-assessment procedure XII: computer architecture
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 29-36

%A Peter J. Wallis
%A Brian A. Wichmann
%T Requirements analysis for Ada compilers
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 37-41

%A Victor R. Basili
%A Barry T. Perricone
%T Software errors and complexity: an empirical investigation
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 42-51

%A Paul Pritchard
%T Some negative results concerning prime number generators
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 53-57

%A Henry C. Lucas,\ Jr.
%T Organizational power and the information services department
%J Communications of the ACM
%K cacm
%V 27
%N 1
%D January 1984
%P 58-65

%A Jon Bentley
%T Programming pearls: code tuning
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 91-96

%A Brian A. Wichmann
%T Is Ada too big ? a designer answers the critics
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 98-103

%A Pamela Zave
%T The operational versus the conventional approach
to software development
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 104-118

%A Gordon E. Anderson
%T The coordinated use of five performance evaluation methodologies
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 119-125

%A Raymond C. Houghton,\ Jr.
%T Online help systems: a conspectus
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 126-133

%A Eric C.R. Hehner
%T Predicative programming part I
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 134-143

%A Eric C.R. Hehner
%T Predicative programming part II
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 144-150

%A Nicola Santora
%T Chain multiplication of matrices
of approximately or exactly the same size
%J Communications of the ACM
%K cacm
%V 27
%N 2
%D February 1984
%P 152-156

%A Jon Bentley
%T Programming pearls: the back of the envelope
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 180-184

%A Gene Dallaire
%T Should congress provide special tax incentives
for firms donating computers to schools ?
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 185

%A Fortney H. Stark
%T The best way to put computers into schools today
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 186-187

%A Hal Berghel
%T Tax incentives for computer donors is a bad idea
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 188-192

%A Jean B. Rogers
%A Davig G. Moursund
%A Greald L. Engel
%T Preparing precollege teachers for the computer age
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 195-200

%A Robert W. Blanning
%T Conversing with management information systems in natural language
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 201-207

%A Thomas A. D'Auria
%T Special report: an ACM visit to the People's Republic of China
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 208-215

%A Paul J. Jalics
%T COBOL vs PL/1: some performance comparisons
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 216-221

%A Gerald Bozman
%T The software lookaside buffer reduces search overhead with linked lists
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 222-227

%A Dov Dori
%A Moshe Ben-Bassat
%T Efficient nesting of congruent convex figures
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 228-234

%A T.Y. Zhang
%A C.Y. Suen
%T A fast parallel algorithm for thinning digital patterns
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 236-240

%A George Diehr
%A Bruce Faaland
%T Optimal pagination of B-trees with variable length items
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 241-247

%A Markku Tamminen
%T Comment on quad- and octtrees
%J Communications of the ACM
%K cacm
%V 27
%N 3
%D March 1984
%P 248-249

%A Jon Bentley
%T Programming pearls: how to sort
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 287-291

%A Gene Dallaire
%T American universities need greater access to supercomputers
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 292-298

%A Edward F. Hayes
%T Access to supercomputers: an NSF perspective (interview)
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 299-303

%A Lofti A. Zadeh
%T Coping with the imprecision of the real world (interview)
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 304-311

%A Donn B. Parker
%A Susan H. Nycum
%T Computer crime
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 313-315

%A Willis H. Ware
%T Information system security and privacy
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 315-321

%A Allen B. Tucker,\ Jr.
%T A perspective on machine translation: theory and practice
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 322-329

%A Michael C. Mulder
%A John Dalphin
%T Computer science program requirements and accreditation
- interim report of the ACM/IEEE Computer Society Joint Task Force
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 330-335

%A Jean E. Sammet
%A Bernard Rous
%T Progress report on the ACM Guide to Computing Literature
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 336-342

%A Donald E. Knuth
%T The complexity of songs
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 344-346

%A Guy L. Steele,\ Jr.
%T The TELNET song (control-uparrow Q)
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 347-348

%A R. Lawrence Clark
%T A linguistic contribution to GOTO-less programming
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 349-351

%A Preet J. Nedginn
%A Trebor L. Bworn
%T CLOG: an Ada package for automatic footnote generation in UNIX
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 351

%A Peter Brown
%T Languages: three interviews by Peter Brown
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 352-355

%A J.B. Cadwaller-Cohen
%A W.W. Zysick
%A R.B. Donnelly
%T The Chaostron: an important advance in learning machines
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 356-357

%A Joseph J. Pollock
%A Antonio Zamora
%T Automatic spelling correction in scientific and scholarly text
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 358-368

%A David C. Blair
%T The data-document distinction in information retrieval
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 369-375

%A Izak Benbasat
%A Yair Wand
%T Command abbreviation behaviour in human-computer interaction
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 376-382

%A C.C. Chang
%T The study of an ordered minimal perfect hashing scheme
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 384-387

%A Dorothy E. Denning
%T Digital signatures with RSA and other public-key cryptosystems
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 388-392

%A Ronald R. Rivest
%A Adi Shamir
%T How to expose an eavesdropper
%J Communications of the ACM
%K cacm
%V 27
%N 4
%D April 1984
%P 393-395

%A Jon Bentley
%T Programming pearls: squeezing space
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 416-421

%A Robert L. Graham
%T The legal protection of computer software
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 422-427

%A Richard V. Giddings
%T Accommodating uncertainty in software design
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 428-434

%A G.K. Gupta
%T Self-assessment procedure XIII: binary search trees and B-trees
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 435-443

%A Ben Tsutom Wada
%T A virtual memory system for picture processing
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 444-454

%A Gerard D. Finn
%T An algorithm for optimized boolean evaluation
in information management systems
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 455-465

%A John L. King
%A Kenneth L. Kraemer
%T Evolution and organizational information systems:
an assessment of Nolan's stage model
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 466-475

%A Izak Benbasat
%A Albert S. Dexter
%A Donald H. Drury
%A Robert C. Goldstein
%T A critique of the stage hypothesis: theory and empirical evidence
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 476-485

%A Richard A. Becker
%A John M. Chambers
%T Design of the S system for data analysis
%J Communications of the ACM
%K cacm
%V 27
%N 5
%D May 1984
%P 486-495

%A Jon Bentley
%T Programming pearls: graphic output
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 529-536

%A Gene Dallaire
%T Computer matching: should it be banned ?
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 537

%A John Shattuck
%T Computer matching is a serious threat to individuals
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 538-541

%A Richard P. Kusserow
%T The government needs computer matching to root out waste and fraud
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 542-545

%A Larry Fujitani
%T Laser optical disk: the coming revolution in on-line storage
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 546-555

%A Maryam Alavi
%T An assessment of the prototyping approach
to information systems development
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 556-563

%A Anthony J. Hinxman
%T Updating a database in an unsafe environment
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 564-566

%A Ephraim P. Glinert
%A Richard E. Ladner
%T A large font virtual terminal interface:
a software prosthesis for the visually impaired
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 567-572

%A Robert Wilensky
%A Yigal Arens
%A David Chin
%T Talking to UNIX in English: an overview of UC
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 574-593

%A Ten-Hwang Lai
%A Sartaj Sahni
%T Anomalies in parallel branch-and-bound algorithms
%J Communications of the ACM
%K cacm
%V 27
%N 6
%D June 1984
%P 594-602

%A Jon Bentley
%T Programming pearls: updates
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 630-636

%A Andries van\ Dam
%T Computer graphics comes of age (interview)
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 638-648

%A David Gifford
%A Alfred Spector
%T The TWA reservation system
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 649-669

%A Per-Ake Larson
%A Ajay Kajla
%T File organization:
implementation of a method guaranteeing retrieval in one access
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 670-677

%A John Kaunitz
%A Louis Van Ekert
%T Audit trail compaction for database recovery
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 678-683

%A Robert B. Tilove
%T A null-object algorithm for constructive solid geometry
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 684-694

%A Hsi Chang
%A S. Sitharama Iyengar
%T Efficient algorithms to globally balance a binary search tree
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 695-702

%A Jeffrey Scott Vitter
%T Faster methods for random sampling
%J Communications of the ACM
%K cacm
%V 27
%N 7
%D July 1984
%P 703-718

%A Yair M. Babad
%A Jeffrey A. Hoffer
%T Even no data has a value
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 748-757

%A Dennis M. Ritchie
%T Reflections on software research
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 758-760

%A Ken Thompson
%T Reflections on trusting trust
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 761-763

%A Nazim H. Madhavji
%T Visibility aspects of programmed dynamic data structures
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 764-776

%A James A. Haskett
%T Pass-algorithms: a user validation scheme
based on knowledge of secret algorithms
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 777-781

%A Douglas W. Jones
%T Improved interpretation of UNIX-like file names embedded in data
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 782-784

%A H.M. Markowitz
%A A. Malhotra
%A D.P. Pazel
%T The EAS-E application development system:
principles and language summary
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 785-799

%A John M. Carroll
%A Caroline Carrithers
%T Training wheels in a user interface
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 800-806

%A D.R.K. Brownrigg
%T The weighted median filter
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 807-818

%A D. Julian M. Davies
%T Memory occupancy patterns in garbage collection systems
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 819-825

%A Lee J. Gremillion
%T Determinants of program repair maintenance requirements
%J Communications of the ACM
%K cacm
%V 27
%N 8
%D August 1984
%P 826-832

%A Jon Bentley
%T Programming pearls: algorithm design techniques
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 865-871

%A Alfred Spector
%A David Gifford
%T Case study: the Space Shuttle primary computer system
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 872-900

%A Charles E. Trevathan
%A Thomas D. Taylor
%A Raymond G. Hartenstein
%A Ann C. Merwarth
%A William N. Stewart
%T Development and application
of NASA's first standard spacecraft computer
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 902-913

%A William A. Madden
%A Kyle Y. Rone
%T Design, development, integration:
Space Shuttle primary flight software system
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 914-925

%A Gene D. Carlow
%T Architecture of the Space Shuttle primary avionics software system
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 926-937

%A H. Gomaa
%T A software design method for real-time systems
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 938-949

%A Tim Maude
%A Derwent Maude
%T Hardware protection against software piracy
%J Communications of the ACM
%K cacm
%V 27
%N 9
%D September 1984
%P 950-959

%A Jean Ichbiah
%T Ada: past, present future (interview)
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 990-997

%A Elliot P. Koffman
%A Philip L. Miller
%A Caroline E. Wardle
%T Recommended curriculum for CSI, 1984
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 998-1001

%A Anthony Ralston
%T The first course in computer science needs a mathematical corequisite
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 1002-1007

%A C.M. Krishma
%A Kang G. Shin
%A Yann-Hang Lee
%T Optimization criteria for checkpoint placement
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 1008-1012

%A Reinhold P. Weicker
%T Dhrystone: a synthetic systems programming benchmark
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 1013-1031

%A Michael D. Good
%A John A. Whiteside
%A Dennis R. Wixon
%A Sandra J. Jones
%T Building a user-derived interface
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 1032-1043

%A Robert Marcus
%T An application of artificial intelligence to operations research
%J Communications of the ACM
%K cacm
%V 27
%N 10
%D October 1984
%P 1044-1047

%A Jon Bentley
%T Programming pearls: perspective on performance
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1087-1092

%A Patricia F. Campbell
%A George P. McCabe
%T Predicting the success of freshmen in a computer science major
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1108-1113

%A Walter M. Mathews
%A Kaye Reifers
%T The computer in cartoons: a retrospective from the Saturday Review
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1114-1121

%A Larry R. Medsker
%T An interactive decision support system for energy policy analysis
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1122-1128

%A James V. Hansen
%A William F. Messier
%T A relational approach to decision support for EDP auditing
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1129-1133

%A L.G. Valiant
%T A theory of the learnable
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1134-1142

%A Tim Hickey
%A Jacques Cohen
%T Performance analysis of on-the-fly garbage collection
%J Communications of the ACM
%K cacm
%V 27
%N 11
%D November 1984
%P 1143-1154

%A Paul Attewell
%A James Rule
%T Computing and organisations: what we know and what we don't know
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1184-1192

%A Blake Ives
%A Gerard P. Learmonth
%T The information system as a competitive weapon
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1193-1201

%A Charles Franz
%A Daniel Robey
%T An investigation of user-led system design:
rational and political perspectives
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1202-1209

%A Jon A. Turner
%T Computer mediated work:
the interplay between technology and structured jobs
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1210-1217

%A Rob Kling
%A Suzanne Iacono
%T The control of information systems developments after implementation
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1218-1226

%A John D. Litke
%T An improved solution to the traveling salesman problem
with thousands of nodes
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1227-1236

%A Richard B. Wilmot
%T Foreign keys decrease adaptability of database designs
%J Communications of the ACM
%K cacm
%V 27
%N 12
%D December 1984
%P 1237-1243

%A David A. Patterson
%T Reduced instruction set computers
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 8-21
%K risc

%A Charles L. Seitz
%T The cosmic cube
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 22-33

%A J.R. Gurd
%A C.C. Kirkham
%A I. Watson
%T The Manchester prototype dataflow computer
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 34-52

%A Jack Minker
%T Computer professionals whose scientific freedom and human rights
have been violated - 1984
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 69-79

%A R.E. Berry
%A B.A.E. Meekings
%T A style analysis of C programs
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 80-88

%A John C. Nash
%T Design and implementation
of a very small linear algebra program package
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 89-95

%A Susan M. Merritt
%T An inverted taxonomy of sorting algorithms
%J Communications of the ACM
%K cacm
%V 28
%N 1
%D January 1985
%P 96-99

%A Jon Bentley
%T Programming pearls: tricks of the trade
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 138-141

%A Phillip Ein-Dor
%T Grosch's law re-visited: CPU power and the cost of computation
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 142-151

%A Ronald S. Lemos
%T Rating the major computer periodicals on readability
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 152-158

%A Niklaus Wirth
%T From programming language design to computer construction
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 159-165

%A Bernard C. Reimann
%A Allan D. Waren
%T User-oriented criteria for the selection of DSS software
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 166-179

%A Sephen Jose Hanson
%A Richard R. Rosinski
%T Programmer perceptions of productivity and programming tools
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 180-189

%A C. Michael Overstreet
%A Richard E. Nance
%T A specification language
to assist in analysis of discrete event simulation models
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 190-201

%A Daniel D. Sleator
%A Robert E. Tarjan
%T Amortized efficiency of list update and paging rules
%J Communications of the ACM
%K cacm
%V 28
%N 2
%D February 1985
%P 202-208

%A Jon Bentley
%T Programming pearls: thanks, heaps
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 245-250

%A James Martin
%T Excerpts from: an information system manifesto
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 252-255

%E Leonard Kleinrock
%T DP and academia: the communication gap
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 256-262

%A D.F. Butcher
%A W.A. Muth
%T Predicting performance in an introductory computer science course
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 263-268

%A Task force on curriculum for secondary school computer science
%T Computer science for secondary schools: course content
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 270-274

%A Task force on teacher certification in computer science
%T Proposed curriculum for programs
leading to teacher certification in computer science
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 275-279

%A Ian H. Witten
%A Bob Bramwell
%T A system for interactive viewing of structured documents
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 280-288

%A David C. Blair
%A M.E. Maron
%T An evaluation of retrieval effectiveness
for a full-text retrieval system
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 289-299

%A John D. Gould
%A Clayton Lewis
%T Designing for usability: key principles and what designers think
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 300-311

%A Halm Mendelson
%T Pricing computer services: queueing effects
%J Communications of the ACM
%K cacm
%V 28
%N 3
%D March 1985
%P 312-321

%A W. David Arnett
%T Computational astrophysics
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 254-357

%A B. Lautrup
%T Monte Carlo methods in theoretical high energy physics
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 358-362

%A Scott Kirkpatrick
%A Robert H. Swendsen
%T Statistical mechanics and disordered systems
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 363-373

%A David Campbell
%A Jim Crutchfield
%T Experimental mathematics:
the role of computation in nonlinear science
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 374-384

%A Robert B. Pearson
%A John L. Richardson
%A Doug Toussaint
%T Special purpose processors in theoretical physics
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 385-389

%A Stephen Wolfram
%T Symbolic mathematical computation
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 390-395

%A Roger L. Wainwright
%T A class of sorting algorithms based on quicksort
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 396-403

%A Jon L. Bentley
%A Catherine C. McGeoch
%T Amortized analyses of self-organizing sequential search heuristics
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 404-411

%A Marek Kubale
%A Boguslaw Jackowski
%T A generalized implicit enumeration algorithm for graph coloring
%J Communications of the ACM
%K cacm
%V 28
%N 4
%D April 1985
%P 412-418

%A Jon Bentley
%T Programming pearls: a spelling checker
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 456-462

%A Michael Conrad
%T On design principles for a molecular computer
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 464-480

%A Jane P. Devlin
%A William A. Lowell
%A Anne E. Alger
%T Self-assessment procedure XIV: the legal issues of computing
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 481-489

%A John Tartar
%T The 1984 Snowbird report: future issues in computer science
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 490-493

%A Tor Guimaraes
%T A study of application program development techniques
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 494-499

%A Jack Gostl
%A Irwin Greenberg
%T An application of queueing theory
to the design of a message-switching computer system
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 500-505

%A Rodney R. Oldehoeft
%A Stephen J. Allan
%T Adaptive exact-fit storage management
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 506-511

%A Nicholas P. Vitalari
%A Alladi Venkatesh
%A Kjell Gronhaug
%T Computing in the home:
shifts in the time allocation patterns of households
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 512-522

%A Thomas J. Sager
%T A polynomial time generator for minimal perfect hash functions
%J Communications of the ACM
%K cacm
%V 28
%N 5
%D May 1985
%P 523-532

%A Jon Bentley
%T Programming pearls: associative arrays
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 570-576

%A Karen A. Frenkel
%T Toward automating the software-development cycle
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 578-589

%A P.-J. Courtois
%T On time and space decomposition of complex structures
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 590-604

%A John Beidler
%A Richard H. Austing
%A Lillian N. Cassel
%T Computing programs in small colleges
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 605-611

%A David R. McIntyre
%A Michael A. Pechura
%T Data compression using static Huffman code-decode tables
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 612-616

%A Leonard J. Bass
%T A generalized user interface for applications programs (II)
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 617-627

%A Alan W. Biermann
%A Robert D. Rodman
%A David C. Rubin
%A Francis Heidlage
%T Natural language with discrete speech
as a mode for human-to-machine communication
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 628-636

%A Shimon Even
%A Oded Goldreich
%A Abraham Lempel
%T A randomized protocol for signing contracts
%J Communications of the ACM
%K cacm
%V 28
%N 6
%D June 1985
%P 637-647

%A Jon Bentley
%T Programming pearls: confessions of a coder
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 671-679
%K awk functions

%A Sturr Roxanne Hiltz
%A Murray Turoff
%T Structuring computer mediated communication systems
to avoid information overload
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 680-689

%A Mark Stefik
%T Strategic computing at DARPA: overview and assessment
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 690-707

%A John A. Mills
%T A pragmatic view of the system architect
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 708-717

%A Vaclav Rajlich
%T Paradigms for design and implementation in Ada
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 718-727

%A Kenneth C. Laudon
%T Environmental models of system development:
a national criminal history system
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 728-740

%A W. David Kelton
%T Transient exponential-Erlang queues and steady state simulation
%J Communications of the ACM
%K cacm
%V 28
%N 7
%D July 1985
%P 741-749

%A David Gifford
%A Alfred Spector
%T The CIRRUS banking network
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 797-807

%A Karen A. Frenkel
%T Report on the
Microelectronics and Computer Technology Corporation conference
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 808-814

%A Elliot B. Koffman
%A David Stemple
%A Caroline E. Wardle
%T Recommended curriculum for CS2, 1984:
a report of the ACM Curriculum Task Force for CS2
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 815-819

%A J.M. Shearer
%A M.A. Wolfe
%T ALGLIB a simple symbol-manipulation package
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 820-825

%A Henry C. Smith
%T Database design:
composing fully normalized tables from a rigorous dependency diagram
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 826-839

%A Dianne P. O'Leary
%A G.W. Stewart
%T Data flow algorithms for parallel matrix computations
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 840-853

%A L.L. Larmore
%A D.S. Hirschberg
%T Efficient optimal pagination of scrolls
%J Communications of the ACM
%K cacm
%V 28
%N 8
%D August 1985
%P 854-856

%A Jon Bentley
%T Programming pearls: bumper-sticker computer science
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 896-901

%A Richard Fikes
%A Tom Kehler
%T The role of frame-based representation in reasoning
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 904-920

%A Frederick Hayes-Roth
%T Rule-based systems
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 921-932

%A Michael R. Genesereth
%A Matthew L. Ginsberg
%T Logic programming
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 933-941

%A J. Gutknecht
%T Concepts of the text editor Lara
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 942-960

%A Gerard D. Finn
%T Extended use of null productions in LR(1) parser applications
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 961-972

%A Hanan Samet
%T Data structures for quadtree approximation and compression
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 973-993

%A James R. Slagle
%A Henry Hamburger
%T An expert system for a resource allocation problem
%J Communications of the ACM
%K cacm
%V 28
%N 9
%D September 1985
%P 994-1004

%A David Chaum
%T Security without identification:
transaction systems to make big brother obsolete
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1030-1044

%A Gad Ariav
%A Michael J. Ginzberg
%T DSS design: a systemic view of decision support
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1045-1053

%A Robert Mandl
%T Orthogonal latin squares:
an application of experiment design to compiler testing
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1054-1058

%A Bo Sanden
%T Systems programming with JSP: example - a VDU controller
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1059-1067

%A R.M. Norton
%A D.P. Yeager
%T A probability model for overflow sufficiency in small hash tables
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1068-1075

%A Raj Jain
%A Imrich Chlamtac
%T The P2 algorithm for dynamic calculation
of quantiles and histograms without storing observations
%J Communications of the ACM
%K cacm
%V 28
%N 10
%D October 1985
%P 1076-1085

%A Jon Bentley
%T Programming pearls: selection
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1121-1127

%A Michael R. Raugh
%T Modeling California earthquakes and earth structures
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1130-1150

%A D.K. Cullers
%A Ivan R. Linscott
%A Bernard M. Oliver
%T Signal processing in SETI
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1151-1163

%A Peter Friedland
%A Laurence H. Kedes
%T Discovering the secrets of DNA
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1164-1186

%A Alan B. Charbers
%A David C. Nagel
%T Pilots of the future: human or computer ?
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1187-1199

%A Leonard Kleinrock
%T Distributed systems
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1200-1213

%A Edward Balkovich
%A Steven Lerman
%A Richard P. Parmelee
%T Computing in higher education: the Athena experience
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1214-1224

%A Joel S. Birnbaum
%T Toward the domestication of microelectronics
%J Communications of the ACM
%K cacm
%V 28
%N 11
%D November 1985
%P 1225-1235

%A Alain Colmerauer
%T Prolog in 10 figures
%J Communications of the ACM
%K cacm
%V 28
%N 12
%D December 1985
%P 1296-1310

%A Jacques Cohen
%T Describing Prolog by its interpretation and compilation
%J Communications of the ACM
%K cacm
%V 28
%N 12
%D December 1985
%P 1311-1325

%A David Lorge Parnas
%T Software aspects pf strategic defense systems
%J Communications of the ACM
%K cacm
%V 28
%N 12
%D December 1985
%P 1326-1335

%A Gordon V. Cormack
%T Data compression on a database system
%J Communications of the ACM
%K cacm
%V 28
%N 12
%D December 1985
%P 1336-1343

%A J.D. McKeen
%A Tor Guimaraes
%T Selecting MIS projects by steering committee
%J Communications of the ACM
%K cacm
%V 28
%N 12
%D December 1985
%P 1344-1352

%A Kenneth C. Laudon
%T Data quality and due process
in large interorganizational record systems
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 4-11

%A Jason L. Frand
%A Ephraim R. McLean
%T Summary of the second annual UCLA survey
of business school computer usage
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 12-18

%A Jean-Pierre Banatre
%A Michel Banatre
%A Guy Lapalme
%A Florimond Ployette
%T The design and building of Enchere,
a distributed electronic marketing system
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 19-29

%A Mike Heck
%A Martin Plaehn
%T A workstation model for an interactive graphics system
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 30-38

%A W. Dickson
%A Gerardine deSanctis
%A D.J. McBride
%T Understanding the effectiveness of computer graphics
for decision support: a cumulative experimental approach
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 40-47

%A Iris Vessey
%A Ron Weber
%T Structured tools and conditional logic: an empirical investigation
%J Communications of the ACM
%K cacm
%V 29
%N 1
%D January 1986
%P 48-57

%A Jon Bentley
%T Programming pearls: cutting the Gordian knot
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 92-96

%A Richard M. Karp
%T Combinatorics, complexity, and randomness
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 98-109

%A Karen A. Frenkel
%T Piecing together complexity
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 110-111

%A Richard M. Karp
%T Complexity and parallel processing (interview)
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 112-117

%A Simon L. Peyton Jones
%T Parsing distfix operators
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 118-122

%A Warren Harrison
%A Curtis R. Cook
%T A note on the Berry-Meekings style metric
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 123-125

%A K.A. Redish
%A W.F. Smith
%T Program style analysis: a natural by-product of program compilation
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 126-133

%A D. Yun Yeh
%A Toshinori Munakata
%T Dynamic allocation and local reallocation procedures
for multiple stacks
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 134-141

%A Carol S. Saunders
%A Richard E. Scamell
%T Organizational power and the information services department:
a reexamination
%J Communications of the ACM
%K cacm
%V 29
%N 2
%D February 1986
%P 142-147

%A Jon Bentley
%T Programming pearls: the envelope is back
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 176-182

%A James H. Morris
%A Mahadev Satyarayanan
%A Michael H. Conner
%A John H. Howard
%A David S.H. Rosenthal
%A E. Donelson Smith
%T Andrew: a distributed personal computing environment
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 184-201

%A Norman E. Gibbs
%A Allen B. Tucker
%T A model curriculum for a liberal arts degree in computer science
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 202-211

%A Sumit Sircar
%A Dinesh Dave
%T The relationship between benchmark tests and microcomputer price
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 212-217

%A Philip J. Fleming
%A John J. Wallace
%T How not to lie with statistics:
the correct way to summarize benchmark results
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 218-221

%A Donald Golden
%A Michael Pechura
%T The structure of microcomputer file systems
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 222-231

%A Jack J. Baroudi
%A Margrethe H. Olson
%A Blake Ives
%T An empirical study of the impact of user involvement
on system usage and information satisfaction
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 232-238

%A H.E. Lu
%A P.S.P. Wang
%T A comment on
"A fast parallel algorithm for thinning digital patterns"
%J Communications of the ACM
%K cacm
%V 29
%N 3
%D March 1986
%P 239-242

%A Alfred Spector
%A David Gifford
%T A computer science perspective of bridge design
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 267-283

%A Karen A. Frenkel
%T Computers, complexity, and the Statue of Liberty restoration
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 284-296

%A John A.N. Lee
%A Gerald Segal
%A Rosalie Steier
%T Positive alternatives: a report on an ACM Panel on Hacking
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 297-299
%K positively disgusting misuse of the term hacking

%A Douglas W. Jones
%T An empirical comparison
of priority-queue and event-set implementations
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 300-311

%A Larry Koved
%A Ben Schneiderman
%T Embedded menus: selecting items in context
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 312-318
%K holophrasting

%A Jon Louis Bentley
%A Daniel D. Sleator
%A Robert E. Tarjan
%A Victor K. Wei
%T A locally adaptive data compression scheme
%J Communications of the ACM
%K cacm
%V 29
%N 4
%D April 1986
%P 320-330

%A Jon Bentley
%T Programming pearls: literate programming
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 364-369

%A M.J. Sergot
%A F. Sadri
%A R.A. Kowalski
%A F. Kriwaczek
%A P. Hammond
%A H.T. Cory
%T The British Nationality Act as a logic program
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 370-386

%A John S. Gourlay
%T A language for music printing
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 388-401

%A Valdis Berzins
%A Michael Gray
%A David Naumann
%T Abstraction-based software development
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 402-415

%A Richard Botting
%T Novel security techniques for on-line systems
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 416-417

%A David S. Scott
%A S. Sitharama Iyengar
%T TID - a translation invariant data structure for storing images
%J Communications of the ACM
%K cacm
%V 29
%N 5
%D May 1986
%P 418-429

%A Jon Bentley
%T Programming pearls: a literate program
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 471-483

%A Herbert J. Bernstein
%T Special section on factory automation and robotics
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 484-485

%A John E. Hopcroft
%T The impact of robotics on computer science
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 486-498

%A Marc H. Raibert
%T Legged robots
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 499-514

%A David D. Grossman
%T Opportunities for research on numerical control machining
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 515-522

%A S. Ceri
%A G. Gottlob
%T Normalization of relations and Prolog
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 524-544

%A Jack J. Baroudi
%A Michael J. Ginzberg
%T Impact of the technological environment
on programmer/analyst job outcomes
%J Communications of the ACM
%K cacm
%V 29
%N 6
%D June 1986
%P 546-555

%A Avi Rushinek
%A Sara F. Rushinek
%T What makes users happy ?
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 594-598

%A Brian M. Slator
%A Matthew P. Anderson
%A Walt Conley
%T Pygmalion at the interface
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 599-604

%A Richard E. Mayer
%A Jennifer L. Dyck
%A William Vilberg
%T Learning to program and learning to think: what's the connection ?
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 605-610

%A Geoffry S. Howard
%A Robert D. Smith
%T Computer anxiety in management: myth or reality ?
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 611-615

%A J.D. Gannon
%A E.E. Katz
%A V.R. Basili
%T Metrics for Ada packages: an initial study
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 616-623

%A James C. Spohrer
%A Elliot Soloway
%T Novice mistakes: are the folk wisdoms correct ?
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 624-632

%A James L. Peterson
%T A note on undetected typing errors
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 633-637

%A Moira LeMay
%A Eric Hird
%T Operator work load: when is enough enough ?
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 638-642

%A Neal S. Coulter
%A Norman H. Kelly
%T Computer instruction set usage by programmers:
an empirical investigation
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 643-647

%A Gerard Salton
%T Another look at automatic text-retrieval systems
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 648-656

%A Hassan Gomaa
%T Software development of real-time systems
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 657-668

%A Neil Sarnak
%A Robert E. Tarjan
%T Planar point location using persistent search trees
%J Communications of the ACM
%K cacm
%V 29
%N 7
%D July 1986
%P 669-679

%A Jon Bentley
%T Programming pearls: little languages
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 711-721

%A Jean E. Sammet
%T Why Ada is not just another programming language
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 722-733

%A Edward Lieblein
%T The Department of Defense Software Initiative - a status report
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 734-744

%A Martin K. Solomon
%A Riva Wenig Bickel
%T Self-assessment procedure XV: file processing
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 745-751

%A Karen A. Frenkel
%T Evaluating two massively parallel architectures
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 752-759
%K FPS, connection machine

%A Russell M. Clapp
%A Louis Duchesneau
%A Richard A. Volz
%A Trevor N. Mudge
%A Timothy Schultze
%T Toward real-time performance benchmarks for Ada
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 760-778

%A Young Moo Kang
%A Robert B. Miller
%A Roger Alan Pick
%T Comments on "Grosch's law re-visited: CPU power and the cost of
computation"
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 779-781

%A Jon L. Bentley
%A Brian W. Kernighan
%T GRAP - a language for typesetting graphs
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 782-793

%A R.H. Irving
%A C.A. Higgins
%A F.R. Safayeni
%T Computerized performance monitoring systems: use and abuse
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 794-801

%A Raymond F. Koopman
%T The orders of equidistribution of subsequences
of some asymptotically random sequences
%J Communications of the ACM
%K cacm
%V 29
%N 8
%D August 1986
%P 802-806

%A Jon Bentley
%T Programming pearls: document design
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 832-839

%A Derek Sleeman
%T The challenges of teaching computer programming
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 840-841

%A John R. Anderson
%A Edward Skwarecki
%T The automated tutoring of introductory computer programming
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 842-849

%A Elliot Soloway
%T Learning to program = learning to construct mechanisms and explanations
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 850-858

%A Andrea A. diSessa
%A Harold Abelson
%T Boxer: a reconstructable computational medium
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 859-868

%A David Gries
%A Raymond Miller
%A Robert Ritchie
%A Paul Young
%T Imbalance between growth and funding in academic computing science:
two trends colliding
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 870-878

%A Daniel G. Bobrow
%A Sanjay Mittal
%A Mark J. Stefik
%T Expert systems: perils and promise
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 880-894

%A M.D. Janssens
%A J.K. Annot
%A A.J. van\ de\ Goor
%T Adapting Unix for a multiprocessor environment
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 895-901

%A Quentin F. Stout
%A Bette L. Warren
%T Tree rebalancing in optimal time and space
%J Communications of the ACM
%K cacm
%V 29
%N 9
%D September 1986
%P 902-908

%A John S. Quarterman
%A Josiah C. Hoskins
%T Notable computer networks
%J Communications of the ACM
%K cacm
%V 29
%N 10
%D October 1986
%P 932-971

%A David Gries
%T The 1984-1985 Taulbee survey
%J Communications of the ACM
%K cacm
%V 29
%N 10
%D October 1986
%P 972-977

%A Niklaus Wirth
%T Multiprogramming architectures:
a comparison based on code generation by compiler
%J Communications of the ACM
%K cacm
%V 29
%N 10
%D October 1986
%P 978-990

%A Manny Hayes
%T Accessing bit fields in Fortran-77
%J Communications of the ACM
%K cacm
%V 29
%N 10
%D October 1986
%P 991-995

%A M.D. Atkinson
%A J.-R. Sack
%A N. Santoro
%A T. Strothotte
%T Min-max heaps and generalized priority queues
%J Communications of the ACM
%K cacm
%V 29
%N 10
%D October 1986
%P 996-1000

%A William K. McHenry
%A Seymour E. Goodman
%T MIS in Soviet industrial enterprises: the limits of reform from above
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1034-1043

%A Joseph L. Kearner
%A Robert L. Sedlmeyer
%A William B. Thompson
%A Michael A. Gray
%A Michael A. Adler
%T Software complexity measurement
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1044-1050

%A Glen G. Langdon,\ Jr.
%T Self-assessment procedure XVI: computer organization and logic design
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1051-1059

%A Dorothy Deringer
%A David Brandin
%A Dexter Fletcher
%A Neil Jacobstein
%T The report of the Long-range Planning Committee: a summary
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1061-1071

%A Pierre N. Robillard
%T Schematic pseudocode for program constructs
and its computer automation be SCHEMACODE
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1072-1089

%A Frank G. Landram
%A James R. Cook
%A Marvin Johnston
%T Spreadsheet calculations of probabilities
from the F, t, chi square, and normal distribution
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1090-1093

%A Izak Benbasat
%A Albert S. Dexter
%A Peter Todd
%T An experimental program investigating color-enhanced and graphical
information presentation: an integration of the findings
%J Communications of the ACM
%K cacm
%V 29
%N 11
%D November 1986
%P 1094-1105

%A Jon Bentley
%T Programming pearls: birth of a cruncher
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1155-1161

%A Peter J. Denning
%T Parallel computing and its evolution
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1163-1167

%A Karen A. Frenkel
%T Introduction to the special issue on parallelism
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1168-1169

%A W. Daniel Hillis
%A Guy L. Steele,\ Jr.
%T Data parallel algorithms
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1170-1183

%A David A. Padua
%A Michael J. Wolfe
%T Advanced compiler optimizations for supercomputers
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1184-1201

%A Randall Rettberg
%A Robert Thomas
%T Contention is no obstacle to shared-memory multiprocessing
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1202-1212

%A Craig Stanfill
%A David Waltz
%T Toward memory-based reasoning
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1213-1228

%A Craig Stanfill
%A Brewster Kahle
%T Parallel free-text search on the Connection Machine system
%J Communications of the ACM
%K cacm
%V 29
%N 12
%D December 1986
%P 1229-1239

%A John M. Carroll
%A Jan McKendree
%T Interface design issues for advice-giving expert systems
%J Communications of the ACM
%K cacm
%V 30
%N 1
%D January 1987
%P 14-31

%A Mark Stefik
%A Gregg Foster
%A Daniel G. Bobrow
%A Kenneth Kahn
%A Stan Lanning
%A Lucy Suchman
%T Beyond the chalkboard: computer support
for collaboration and problem solving in meetings
%J Communications of the ACM
%K cacm
%V 30
%N 1
%D January 1987
%P 32-47

%A Daniel R. Dolk
%A Robert A. Kirsch,\ II
%T A relational information resource dictionary system
%J Communications of the ACM
%K cacm
%V 30
%N 1
%D January 1987
%P 48-61

%A James P. Held
%A John V. Carlis
%T MATCH - a new high-level representation operator for pattern matching
%J Communications of the ACM
%K cacm
%V 30
%N 1
%D January 1987
%P 62-75

%A Alan Borning
%T Computer system reliability and nuclear war
%J Communications of the ACM
%K cacm
%V 30
%N 2
%D February 1987
%P 112-131

%A David Notkin
%A Norman Hutchinson
%A Jan Sanislo
%A Michael Schwartz
%T Heterogeneous computing environments:
report on the ACM SIGOPS workshop on accommodating heterogeneity
%J Communications of the ACM
%K cacm
%V 30
%N 2
%D February 1987
%P 132-140

%A Paul J. Jalics
%T Cobol on a PC: a new perspective on a language and its performance
%J Communications of the ACM
%K cacm
%V 30
%N 2
%D February 1987
%P 142-154

%A Christopher M. Holt
%A Alan Stewart
%A Maurice Clint
%A Ronald H. Perrott
%T An improved parallel thinning algorithm
%J Communications of the ACM
%K cacm
%V 30
%N 2
%D February 1987
%P 156-160

%A Zen-Cheung Shih
%A Gen-Huey Chen
%A R.C.T. Lee
%T Systolic algorithms to examine all pairs of elements
%J Communications of the ACM
%K cacm
%V 30
%N 2
%D February 1987
%P 161-167

%A John E. Hopcroft
%T Computer science: the emergence of a discipline
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 198-203
%K Turing award lecture

%A Robert E. Tarjan
%T Algorithm design
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 205-212
%K Turing award lecture

%A Karen A. Frankel
%T An interview with the 1986 A.M. Turing Award recipients
- John E. Hopcroft and Robert E. Tarjan
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 214-222

%A Michael Allen Bickel
%T Automatic correction to misspelled names:
a fourth-generation language approach
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 224-228

%A Nancy C. Goodwin
%T Functionality and usability
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 229-233

%A John T. Stasko
%A Jeffrey Scott Vitter
%T Pairing heaps: experiments and analysis
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 234-249
%K priority queues

%A Farokh B. Bastani
%A S. Sitharama Iyengar
%T The effect of data structures on the logical complexity of programs
%J Communications of the ACM
%K cacm
%V 30
%N 3
%D March 1987
%P 250-259

%A Jon Bentley
%A David Gries
%T Programming pearls: abstract data types
%J Communications of the ACM
%K cacm
%V 30
%N 4
%D April 1987
%P 284-290

%A David Gifford
%A Alfred Spector
%A Richard Case
%A Andris Padegs
%T Case study: IBM's System/360-370 architecture
%J Communications of the ACM
%K cacm
%V 30
%N 4
%D April 1987
%P 291-307

%A Phillip Ein-Dor
%A Jacob Feldmesser
%T Attributes of the performance of central processing units:
a relative performance prediction model
%J Communications of the ACM
%K cacm
%V 30
%N 4
%D April 1987
%P 308-317

%A Jorge L.C. Sanz
%A Its'hak Dinstein
%A Dragutin Petkovic
%T Computing multi-colored polygonal masks in pipeline architectures
and its application to automated visual inspection
%J Communications of the ACM
%K cacm
%V 30
%N 4
%D April 1987
%P 318-329

%A Alfs Berztiss
%T A mathematically focused curriculum for computer science
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 356-365

%A Carolynn van\ Dyke
%T Taking "computer literacy" literally
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 366-374

%A Taylor Booth
%A Raymond E. Miller
%T Computer science program accreditation:
the first-year activities of the Computing Sciences Accreditation Board
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 376-388
%K CSAB CSAC

%A Thomas W. Malone
%A Kenneth R. Grant
%A Franklyn A. Turbak
%A Stephen A. Brobst
%A Michael D. Cohen
%T Intelligent information-sharing systems
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 390-402

%A Jack J. Dongarra
%A Eric Grosse
%T Distributed of mathematical software via electronic mail
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 403-407

%A S.A. Mamrak
%A M.J. Kaelbling
%A C.K. Nicholas
%A M. Share
%T A software architecture for supporting the exchange of electronic manuscripts
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 408-414

%A Chris F. Kemerer
%T An empirical validation of software cost estimation models
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 416-429

%A Richard E. Nance
%A Robert L. Moose,\ Jr.
%A Robert V. Foutz
%T A statistical technique for comparing heuristics:
an example from capacity assignment strategies in computer network design
%J Communications of the ACM
%K cacm
%V 30
%N 5
%D May 1987
%P 430-442

%A Jon Bentley
%T Programming pearls: self-describing data
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 479-483

%A Thomas W. Malone
%A Joanne Yates
%A Robert I. Benjamin
%T Electronic markets and electronic hierarchies
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 484-497

%A M. Lynne Markus
%A Niels Bjorn-Andersen
%T Power over users: its exercise by system professionals
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 498-504

%A Itzhak Shemer
%T Systems analysis: a systemic analysis of a conceptual model
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 506-512

%A Jurgen Ebert
%T A versatile data structure for edge-oriented graph algorithms
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 513-519

%A Ian H. Witten
%A Radford M. Neal
%A John G. Cleary
%T Arithmetic coding for data compression
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 520-540

%A Vasant Dhar
%A Harry E. Pople
%T Rule-base versus structure-based models
for explaining and generating expert behavior
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 542-555

%A Ananth Srinivasan
%A Kate M. Kaiser
%T Relationships between selected organizational factors and systems development
%J Communications of the ACM
%K cacm
%V 30
%N 6
%D June 1987
%P 556-562

%A Jon Bentley
%T Programming pearls: profilers
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 587-592

%A Christopher J. Van\ Wyk
%A David Hanson
%A John Gilbert
%T Literate programming: printing common words
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 594-599

%A Joseph D. Becker
%T Arabic word processing
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 600-610

%A Jose A. Manas
%T Word division in Spanish
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 612-616

%A Georgia Griffiths
%A G. Carlyle Stones
%T The tea-leaf reader algorithm:
an efficient implementation of CRC-16 and CRC-32
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 617-620

%A Shu-Xiang Li
%A Murray H. Loew
%T The quadcode and its arithmetic
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 621-626
%K quadtree

%A Shu-Xiang Li
%A Murray H. Loew
%T Adjacency detection using quadcodes
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 627-631
%K quadtree

%A Danny Kopec
%A Monty Newborn
%T Belle and Mephisto Dallas capture computer chess titles at the FJCC
%J Communications of the ACM
%K cacm
%V 30
%N 7
%D July 1987
%P 640-645

%A Russell J. Abbott
%T Knowledge abstraction
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 664-671

%A C.A.R. Hoare
%A I.J. Hayes
%A He Jifeng
%A C.C. Morgan
%A A.W. Roscoe
%A J.W. Sanders
%A I.H. Sorensen
%A J.M. Spivey
%A B.A. Sufrin
%T Laws of programming
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 672-686

%A David Gries
%T The 1985-1986 Taulbee survey
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 688-694

%A Kjell W. Nielsen
%A Ken Shumate
%T Designing large real-time systems with Ada
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 695-715

%A Lee W. Schruben
%A V. James Cogliano
%T An experimental procedure for simulation response
surface model identification
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 716-730

%A Shu Tezuka
%T Walsh-spectral test for GFSR pseudorandom numbers
%J Communications of the ACM
%K cacm
%V 30
%N 8
%D August 1987
%P 731-735

%A Paul Abrahams
%T A gown for the princess: a parable for software engineers
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 750-751

%A Jon Bentley
%A Bob Floyd
%T Programming pearls: a sample of brilliance
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 754-757

%A John D. Gould
%A Spethe J. Boies
%A Stephen Levy
%A John T. Richards
%A Jim Schoonard
%T The 1984 Olympic message system:
a test of behavioral principles of system design
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 758-769
%K voice mail, human factors, psychology

%A Jonathan P. Jacky
%A Ira J. Kalet
%T An object-oriented programming discipline for standard Pascal
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 772-776

%A Niv Ahituv
%A Yeheskel Lapid
%A Seev Neumann
%T Processing encrypted data
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 777-780

%A Niv Ahituv
%T A metamodel of information flow: a tool to support information systems theory
%J Communications of the ACM
%K cacm
%V 30
%N 9
%D September 1987
%P 781-791