%%% -*-BibTeX-*- %%% ==================================================================== %%% Bibtex-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.59", %%% date = "20 October 2023", %%% time = "09:31:28 MDT", %%% filename = "cacm1980.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% checksum = "11753 30904 122443 1317539", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography, CACM, Communications of the %%% ACM", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a preliminary bibliography of %%% Communications of the ACM (CODEN CACMA2, ISSN %%% 0001-0782 (print), 1557-7317 (electronic)), %%% covering (incompletely) 1980 -- 1984, and %%% completely 1985--1989 (see below). %%% %%% The ACM maintains Web pages with journal %%% tables of contents at: %%% %%% http://www.acm.org/pubs/contents/journals/cacm/ %%% http://portal.acm.org/browse_dl.cfm?idx=J79 %%% %%% At version 2.59, the year coverage looked %%% like this: %%% %%% 1960 ( 2) 1977 ( 3) 1994 ( 0) %%% 1961 ( 1) 1978 ( 4) 1995 ( 0) %%% 1962 ( 0) 1979 ( 2) 1996 ( 0) %%% 1963 ( 1) 1980 ( 71) 1997 ( 0) %%% 1964 ( 1) 1981 ( 86) 1998 ( 0) %%% 1965 ( 1) 1982 ( 89) 1999 ( 0) %%% 1966 ( 2) 1983 ( 125) 2000 ( 0) %%% 1967 ( 1) 1984 ( 140) 2001 ( 0) %%% 1968 ( 5) 1985 ( 100) 2002 ( 0) %%% 1969 ( 1) 1986 ( 138) 2003 ( 0) %%% 1970 ( 6) 1987 ( 90) 2004 ( 0) %%% 1971 ( 3) 1988 ( 113) 2005 ( 0) %%% 1972 ( 2) 1989 ( 121) 2006 ( 0) %%% 1973 ( 2) 1990 ( 3) 2007 ( 0) %%% 1974 ( 1) 1991 ( 0) 2008 ( 0) %%% 1975 ( 1) 1992 ( 3) 2009 ( 1) %%% 1976 ( 3) 1993 ( 0) %%% %%% Article: 1114 %%% Book: 4 %%% InProceedings: 2 %%% PhdThesis: 1 %%% TechReport: 1 %%% %%% Total entries: 1122 %%% %%% The size of the original cacm.bib file %%% covering 1958--1996 became too large (about %%% 4000 entries) for BibTeX and TeX to handle, %%% so at version 1.44, it was split into %%% cacm1950.bib, cacm1960.bib, cacm1970.bib, %%% cacm1980.bib, and cacm1990.bib, each covering %%% the decade starting with the year embedded in %%% the filename. Version numbers for these %%% files begin at 2.00. %%% %%% Volumes from the 1990s average more than 200 %%% articles yearly, so a complete bibliography %%% for this journal could contain more than 6000 %%% entries from 1958 to 2000. %%% %%% These bibliographies also include ACM %%% Algorithms 1--492. For Algorithms 493--686, %%% including Algorithm 568, published in ACM %%% Transactions on Programming Languages and %%% Systems (TOPLAS), see the companion %%% bibliographies, toms.bib and toplas.bib. %%% %%% All published Remarks and Corrigenda are %%% cross-referenced in both directions, so %%% that citing a paper will automatically %%% generate citations for those Remarks and %%% Corrigenda. Cross-referenced entries are %%% duplicated in cacm19*.bib and toms.bib, so %%% that each is completely self-contained. %%% %%% Source code for ACM Algorithms from 380 %%% onwards, with some omissions, is available %%% via the Netlib service at %%% http://netlib.ornl.gov/, and %%% ftp://netlib.bell-labs.com/netlib/toms. %%% %%% There is a World Wide Web search facility %%% for articles published in this journal from %%% 1959 to 1979 at %%% http://ciir.cs.umass.edu/cgi-bin/web_query_form/public/cacm2.1. %%% %%% The ACM maintains Web pages with journal %%% tables of contents for 1985--1995 at %%% http://www.acm.org/pubs/toc. That data has %%% been automatically converted to BibTeX %%% form, corrected for spelling and page %%% number errors, and merged into this file. %%% Thus, the journal coverage from 1985 on %%% should be complete. %%% %%% The initial draft of entries for 1981 -- 1990 %%% was extracted from the ACM Computing Archive %%% CD ROM for the 1980s, with manual corrections %%% and additions. Additions were then made from %%% all of the bibliographies in the TeX User %%% Group collection, from bibliographies in the %%% author's personal files, from tables of %%% contents information at %%% http://www.acm.org/pubs/cacm/, from %%% Zentralblatt fur Mathematik Mathematics %%% Abstracts at %%% http://www.emis.de/cgi-bin/MATH/, from %%% bibliographies at Internet host %%% netlib.bell-labs.com, and from the computer science %%% bibliography collection on ftp.ira.uka.de in %%% /pub/bibliography to which many people of %%% have contributed. The snapshot of this %%% collection was taken on 5-May-1994, and it %%% consists of 441 BibTeX files, 2,672,675 %%% lines, 205,289 entries, and 6,375 %%% String{} abbreviations, occupying 94.8MB %%% of disk space. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order within each journal, %%% using bibsort -byvolume. %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== @Preamble{ "\input bibnames.sty " # "\input path.sty " # "\def \TM {${}^{\sc TM}$} " # "\hyphenation{ al-pha-mer-ic Balz-er Blom-quist Bo-ta-fo-go Bran-din Brans-comb Bu-tera Chris-tina Christ-o-fi-des Col-lins Cor-dell data-base econ-omies Fletch-er flow-chart flow-charts Fry-styk ge-dank-en Gar-fink-el Ge-ha-ni Glush-ko Goud-reau Gua-dan-go Gui-ma-raes Har-i-di Haw-thorn Hem-men-ding-er Hor-o-witz Hour-vitz Hirsch-berg Ike-da Ka-chi-tvi-chyan-u-kul Kat-ze-nel-son Kitz-miller Ko-ba-yashi Le-Me-tay-er Ken-ne-dy Law-rence Mac-kay Mai-net-ti Mar-sa-glia Max-well Mer-ner Mo-ran-di Na-ray-an New-ell Nich-ols para-digm pat-ent-ed Phi-lo-kyp-rou Prep-a-ra-ta pseu-do-chain-ing QUIK-SCRIPT Rad-e-mach-er re-eval-u-a-tion re-wind Ros-witha Schwach-heim Schob-bens Schon-berg Sho-sha-ni Si-tha-ra-ma Skwa-rec-ki Ste-phens Streck-er Strin-gi-ni Tes-ler Te-zu-ka Teu-ho-la Till-quist Town-send Tsi-chri-tzis Tur-ski Vuille-min We-nig Za-bo-row-ski Za-mora }"} %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-CACM = "Communications of the ACM"} @String{j-MANAGEMENT-SCIENCE = "Management Science"} @String{j-SIAM-J-COMPUT = "SIAM Journal on Computing"} @String{j-SPE = "Software --- Practice and Experience"} @String{j-TOMS = "ACM Transactions on Mathematical Software"} %%% ==================================================================== %%% Publisher abbreviations: @String{pub-ACM = "ACM Press"} @String{pub-ACM:adr = "New York, NY 10036, USA"} @String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"} @String{pub-AW:adr = "Reading, MA, USA"} @String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"} @String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"} @String{pub-SUCSLI = "Stanford University Center for the Study of Language and Information"} @String{pub-SUCSLI:adr = "Stanford, CA, USA"} @String{pub-SV = "Spring{\-}er-Ver{\-}lag"} @String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/ etc."} @String{pub-WILEY = "Wiley"} @String{pub-WILEY:adr = "New York, NY, USA"} %%% ==================================================================== %%% Bibliography entries (cross-references in notes necessitate %%% inclusion of a few additional entries published elsewhere): @Article{Samelson:1960:SFT, author = "K. Samelson and Friedrich L. Bauer", title = "Sequential Formula Translation", journal = j-CACM, volume = "3", number = "2", pages = "76--83", month = feb, year = "1960", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68.00", MRnumber = "23\#B548", bibdate = "Mon Jan 22 07:18:14 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm3.html#SamelsonB60; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Addendum, 351.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SamelsonB60", reviewer = "B. A. Galler", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SamelsonB60", } @Article{Ellenberger:1960:NSP, author = "K. W. Ellenberger", title = "{ACM Algorithm 30}: Numerical Solution of the Polynomial Equation", journal = j-CACM, volume = "3", number = "12", pages = "643", month = dec, year = "1960", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 08 09:47:45 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Novotny:1985:RNS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Irons:1961:SDC, author = "Edgar T. Irons", title = "A Syntax Directed Compiler for {ALGOL 60}", journal = j-CACM, volume = "4", number = "1", pages = "51--55", month = jan, year = "1961", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:51:53 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Irons61; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "applic.MC", oldlabel = "Irons61", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Irons61", } @Article{Sussenguth:1963:UTS, author = "Edward H. {Sussenguth, Jr.}", title = "Use of Tree Structures for Processing Files", journal = j-CACM, volume = "6", number = "5", pages = "272--279", month = may, year = "1963", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:25:05 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm6.html#Sussenguth63; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Sussenguth63", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sussenguth63", } @Article{Boothroyd:1964:G, author = "J. Boothroyd", title = "{ACM Algorithm 246}: Graycode", journal = j-CACM, volume = "7", number = "12", pages = "701", month = dec, year = "1964", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 08 09:47:54 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Misra:1975:RG,Er:1985:RG}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Dijkstra:1965:SPC, author = "Edsger W. Dijkstra", title = "Solution of a Problem in Concurrent Programming Control", journal = j-CACM, volume = "8", number = "9", pages = "569--??", month = sep, year = "1965", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:36:04 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm8.html#Dijkstra65; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one if them is engaged in the ``critical section'' of its cycle.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Dijkstra65", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dijkstra65", xxtitle = "Solutions of a Problem in Concurrent Programming Control", } @Article{Weizenbaum:1966:ECP, author = "J. Weizenbaum", title = "{ELIZA} --- a Computer Program for the Study of Natural Language Communication between Man and Machine", journal = j-CACM, volume = "9", number = "1", pages = "36--44", month = jan, year = "1966", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Feb 01 07:09:04 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "ELIZA is a program operating within the MAC time-sharing system at MIT which makes certain kinds of natural language conversation between man and computer possible. Input sentences are analyzed on the basis of decomposition rules which are triggered by key words appearing in the input text. Responses are generated by reassembly rules associated with selected decomposition rules. the fundamental technical problems with which ELIZA is concerned are: (1)the identification of key words, (2) the discovery of minimal context, (3) the choice of appropriate transformations, (4) generation of responses in the absence of key words, and (5) the provision of an editing capability for ELIZA ``scripts''. A discussion of some psychological issues relevant to the ELIZA approach as well as of future developments concludes the paper.", acknowledgement = ack-nhfb, annote = "Early approach, using simple algorithms to mimic intelligence.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Dennis:1966:PSM, author = "J. B. Dennis and E. C. van Horn", title = "Programming Semantics for Multiprogrammed Computations", journal = j-CACM, volume = "9", number = "3", pages = "143--155", month = mar, year = "1966", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jul 26 18:50:48 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "The first introduction of protection and capabilities.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "parallel processing operating debugging sharing segments CACM", } @Article{Hill:1967:CSI, author = "I. D. Hill and M. C. Pike", title = "{ACM Algorithm 299}: Chi-Squared Integral", journal = j-CACM, volume = "10", number = "4", pages = "243--244", month = apr, year = "1967", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 08 09:47:54 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{elLozy:1976:RAC,Hill:1985:RCS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Maurer:1968:IHS, author = "Ward Douglas Maurer", title = "An Improved Hashcode for Scatter Storage", journal = j-CACM, volume = "11", number = "1", pages = "35--37", month = jan, year = "1968", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jul 19 23:00:01 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Morris:1968:SST, author = "Robert Morris", title = "Scatter Storage Techniques", journal = j-CACM, volume = "11", number = "1", pages = "38--44", month = jan, year = "1968", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:06:01 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Morris68; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Influential survey of the subject of hashing, and first introduction of random probing with secondary clustering. Appears to be the first publication where the word `hashing' appeared, although it was in common use at the time. Knuth \cite[p.~542]{Knuth:1973:ACP} found only one earlier printed use of the word, in a 1961 unpublished memorandum by W. W. Peterson.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Morris68", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morris68", } @Article{Denning:1968:WSM, author = "Peter J. Denning", title = "The Working Set Model for Program Behaviour", journal = j-CACM, volume = "11", number = "5", pages = "323--333", month = may, year = "1968", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:04 MST 2001", bibsource = "and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/Dist.Sys.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/distmem.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Denning68; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Probably the most basic reason behind the absence of resource allocation in modern computer systems is an adequate model of program behaviour. In this paper a new model, the ``working set model,'' is developed. The working set of pages associated with a process, defined to be the collection os its most recently used pages, provides knowledge vital to the dynamic management of paged memories. ``Process'' and ``working set'' are shown to be manifestations of the same ongoing computational activity; then ``processor demand'' and ``memory demand'' are defined; and resource allocation is formulated as the problem of balancing demands against the available equipment.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", memo = "``Advice'' on program resource requirements cannot be successfully taken from the user because the user may not know them (due to lack of understanding or the fact that the program makes use of external library procedures whose resource demands aren't known), the type of advice required is not well defined and the user is only concerned with efficient execution of his code, not the system as a whole. ``Advice'' on program resource requirements cannot be successfully taken from the compiler because modular programs will use modules which are not necessarily available at compile time and the extra instrumentation required in a compiler could possibly severely restrict its performance and thus the efficiency of the whole machine (as (at the time anyway) compilers were one of the most used programs on most systems).", oldlabel = "Denning68", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Denning68", xxtitle = "The Working Set Model for Program Behavior", } @Article{Dijkstra:1968:SMS, author = "Edsger W. Dijkstra", title = "The structure of the {``THE''}-multiprogramming system", journal = j-CACM, volume = "11", number = "5", pages = "341--346", month = may, year = "1968", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/363095.363143", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Nov 25 18:20:19 MST 2005", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Dijkstra68; http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "cooperating sequential processes; input-output buffering; multiprocessing; multiprogramming; multiprogramming system; operating system; processor sharing; program verification; real-time debugging; synchronizing primitives; system hierarchy; system levels; system structure", oldlabel = "Dijkstra68", summary = "The appendix deals with semaphores. The basic operation of `P-Operation' and `V-Operation' are specified, along with some comments on the effects of multiple P's and V's. The use of semaphores for mutual exclusion, and the use of private semaphores (which are associated with a sequential process, which alone is allowed to do a P-operation) is explained, along with an outline of the proof that a particular implementation using semaphores is valid.", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dijkstra68", } @Article{Bell:1968:NRD, author = "J. R. Bell", title = "{ACM Algorithm 334}: Normal Random Deviates [{G5}]", journal = j-CACM, volume = "11", number = "7", pages = "498", month = jul, year = "1968", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Sep 19 23:32:16 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Tracht:1982:RNR}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Hoare:1969:ABC, author = "C. A. R. Hoare", title = "An Axiomatic Basis for Computer Programming", journal = j-CACM, volume = "12", number = "10", pages = "576--580, 583", month = oct, year = "1969", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:50:21 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm12.html#Hoare69; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, checked = "24 August 1990", classcodes = "C4290 (Other computer theory)", corpsource = "The Queen's Univ., Belfast, UK", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "computer metatheory; programming", oldlabel = "Hoare69", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare69", } @Article{Earley:1970:ECF, author = "Jay Earley", title = "An Efficient Context-Free Parsing Algorithm", journal = j-CACM, volume = "13", number = "2", pages = "94--102", month = feb, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:37:10 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Earley70; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to $n^3$ (where $n$ is the length of the string being parsed) in general; it has a $n^2$ bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Univ. California, Berkeley, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "compilers; computational complexity; computational linguistics; context-free grammar; parsing; program compilers; syntax analysis", oldlabel = "Earley70", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Earley70", } @Article{Bell:1970:QQM, author = "James R. Bell", title = "The Quadratic Quotient Method: a Hash Code Eliminating Secondary Clustering", journal = j-CACM, volume = "13", number = "2", pages = "107--109", month = feb, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:24:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Bell70; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "Digital Equipment Corp., Maynard, MA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "table lookup", oldlabel = "Bell70", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bell70", } @Article{Codd:1970:RMD, author = "E. F. Codd", title = "A Relational Model of Data for Large Shared Data Banks", journal = j-CACM, volume = "13", number = "6", pages = "377--387", month = jun, year = "1970", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/362384.362685", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:31:56 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Codd70; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprinted in \cite[pp.~5--15]{Stonebraker:1988:RDS}.", URL = "http://dblp.uni-trier.de/db/journals/cacm/Codd70.html", abstract = "Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs would remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on $n$-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.", acknowledgement = ack-nhfb, annote = "Shows problems of hierarchical data organization, presents a non-hierarchical `normal' structure, and discusses languages for describing relations of such normal structures.", cdrom = "CACMs1/CACM13/P377.pdf", classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "IBM, San Jose, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "composition; computers, data storage; consistency; data bank; data banks; data base; data integrity; data organization; data structure; data structures; derivability; file organisation; hierarchies of data; information retrieval; information storage and retrie; join; networks of data; NOI; predicate calculus; redundancy; relations; retrieval language; security; systems", oldlabel = "Codd70", review = "ACM CR 8905-0329", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Codd70", } @Article{Hill:1970:SD, author = "G. W. Hill", title = "{ACM Algorithm 395}: {Student}'s $t$-Distribution", journal = j-CACM, volume = "13", number = "10", pages = "617--619", month = oct, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 08 09:47:54 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{elLozy:1979:RAS,Hill:1981:RSD}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Hill:1970:SQ, author = "G. W. Hill", title = "{ACM Algorithm 396}: {Student}'s $t$-Quantiles", journal = j-CACM, volume = "13", number = "10", pages = "619--620", month = oct, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Apr 29 17:35:09 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Hill:1981:RSD,Hill:1981:RSQ,elLozy:1979:RAS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Wirth:1971:PDS, author = "Niklaus Wirth", title = "Program Development by Stepwise Refinement", journal = j-CACM, volume = "14", number = "4", pages = "221--227", month = apr, year = "1971", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:30:25 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/conc.scientific.computing.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Wirth71; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, classcodes = "C6110 (Systems analysis and programming)", corpsource = "Eidgenossische Tech. Hochschule, Zurich, Switzerland", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "development; education; programming; programming techniques; refinement; stepwise", oldlabel = "Wirth71", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wirth71", } @Article{McNamee:1971:SMP, author = "J. M. McNamee", title = "{ACM Algorithm 408}: a Sparse Matrix Package (Part {I})", journal = j-CACM, volume = "14", number = "4", pages = "265--273", month = apr, year = "1971", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:33:53 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Sipala:1977:RSM,Gustavson:1978:RSM,Harms:1980:RSM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Harrison:1971:IST, author = "M. C. Harrison", title = "Implementation of the Substring Test by Hashing", journal = j-CACM, volume = "14", number = "12", pages = "777--779", month = dec, year = "1971", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Sep 20 19:47:21 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also \cite{Tharp:1982:PTS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Parnas:1972:TSM, author = "David Lorge Parnas", title = "A technique for software module specification with examples", journal = j-CACM, volume = "15", number = "5", pages = "330--336", month = may, year = "1972", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:20 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Parnas72; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, classcodes = "C6110 (Systems analysis and programming)", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "programming; software design; software module specification; technique", oldlabel = "Parnas72", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Parnas72", } @Article{Kuki:1973:SSA, author = "H. Kuki and W. J. Cody", title = "A Statistical Study of the Accuracy of Floating Point Number Systems", journal = j-CACM, volume = "16", number = "4", pages = "223--230", month = apr, year = "1973", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A20 (65G05)", MRnumber = "51 2344", MRreviewer = "I. Kaufmann", bibdate = "Mon Jan 22 06:56:31 MST 2001", bibsource = "Compendex database; ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#KukiC73; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "This paper presents the statistical results of tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations. The arithmetic systems studied are 6-digit hexadecimal and 22-digit binary floating point number representations combined with the usual chop and round modes of arithmetic with various numbers of guard digits, and with a modified round mode with guard digits. In a certain sense, arithmetic systems differing only in their use of binary or hexadecimal number representations are shown to be approximately statistically equivalent in accuracy. Further, the usual round mode with guard digits is shown to be statistically superior in accuracy to the usual chop mode in all cases save one. The modified round mode is found to be superior to the chop mode in all cases.", acknowledgement = ack-nhfb # " and " # ack-nj, classcodes = "C5230 (Digital arithmetic methods)", classification = "723", corpsource = "Univ. Chicago, IL, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "accuracy; arithmetic; computer programming; digital arithmetic; error analysis; floating point arithmetic; floating point number systems; guard digits; number representation; rounding; statistical study", oldlabel = "KukiC73", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KukiC73", } @Article{Ritchie:1974:UTS, author = "Dennis M. Ritchie and Ken Thompson", title = "The {UNIX} Time-Sharing System", journal = j-CACM, volume = "17", number = "7", pages = "365--375", month = jul, year = "1974", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:16:12 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#RitchieT74; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "This paper discusses the nature and implementation of the file system and of the user command interface. UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11\slash 40 and 11\slash 45 computers. It offers a number of features seldom found even in larger operating systems, including: (1) a hierarchical file system incorporating demountable volumes; (2) compatible file, device, and inter-process I/O; (3) the ability to initiate asynchronous processes; (4) system command language selectable on a per-user basis; and (5) over 100 subsystems including a dozen languages.", acknowledgement = ack-nhfb, annote = "Interactive operating system for PDP-11, VAX with a hierarchical file system incorporating demountable volumes.", classcodes = "C6120 (File organisation); C6150J (Operating systems)", classification = "723", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "asynchronous; command language; compatible file; computer systems programming; demountable volumes; file organisation; file system; hierarchical file system; operating; operating systems (computers); processes; sharing systems; system; system command language; time sharing; time-; UNIX interactive operating system", oldlabel = "RitchieT74", treatment = "A Application; P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RitchieT74", } @Article{Denning:1976:LMS, author = "Dorothy E. Denning", title = "A Lattice Model of Secure Information Flow", journal = j-CACM, volume = "19", number = "5", pages = "236--243", month = may, year = "1976", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:31:20 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "This paper investigates mechanisms that guarantee secure information flow in a computer system. These mechanisms are examined within a mathematical framework suitable for formulating the requirements of secure information flow among security classes. The central component of the model is a lattice structure derived from the security classes and justified by the semantics of information flow. The lattice properties permit concise formulations of the security requirements of different existing systems and facilitate the construction of mechanisms that enforce security. \par The model provides a unifying view of all systems that restrict information flow, enables a classification of them according to security objectives, and suggests some new approaches. It also leads to the construction of automatic program certification mechanisms for verifying the secure flow of information through a program.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "information flow; lattice; program certification; protection; security; security class", } @Article{Metcalfe:1976:EDP, author = "Robert M. Metcalfe and David R. Boggs", title = "{Ethernet}: Distributed Packet Switching for Local Computer Networks", journal = j-CACM, volume = "19", number = "7", pages = "395--404", month = jul, year = "1976", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:04:09 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#MetcalfeB76; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multiprocessors. \par An Ethernet's shared communication facility, its Ether, is a passive broadcast medium with no central control. Coordination of access to the Ether for packet broadcasts is distributed among the contending transmitting stations using controlled statistical arbitration. \par Switching of packets to their destinations on the Ether is distributed among the receiving stations using packet address recognition. Design principles and implementation are described, based on experience with an operating Ethernet of 100 nodes along a kilometer of coaxial cable. A model for estimating performance under heavy loads and a packet protocol for error controlled communication are included for completeness.", acknowledgement = ack-nhfb, classcodes = "B6210L (Computer communications); C5620 (Computer networks and techniques)", classification = "718; 722; 723", corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "broadcast; broadcast communication; communication; computer networks; computer systems, digital --- Real Time Operation; computers --- Data Communication Systems; data transmission; digital communication systems; distributed communication; distributed computing; distributed control; Ethernet; LANs; multiprocessing; multiprocessors; networks; operating; packet switching; statistical arbitration; switching systems", oldlabel = "MetcalfeB76", treatment = "A Application; P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MetcalfeB76", } @Article{Boyer:1977:FSS, author = "Robert S. Boyer and J. Strother Moore", title = "A Fast String Searching Algorithm", journal = j-CACM, volume = "20", number = "10", pages = "762--772", month = oct, year = "1977", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/359842.359859", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:27:49 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#BoyerM77; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also \cite{Knuth:1977:FPM,Sunday:1990:VFS,Baeza-Yates:1992:NAT}.", abstract = "An algorithm is presented that searches for the location, ``i,'' of the first occurrence of a character string, ``pat,'' in another string, ``string.'' During the search operation, the characters of pat are matched starting with the last character of pat. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first i characters of string are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of pat. For a random English pattern of length 5, the algorithm will typically inspect i/4 characters of string before finding a match at i. Furthermore, the algorithm has been implemented so that (on the average) fewer than i plus patlen machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in i plus patlen, assuming the availability of array space for tables linear in patlen plus the size of the alphabet.", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", classification = "723; 901", comment = "The Boyer--Moore string matching algorithm is, in the worst case, linear in the length of the text + length of the pattern. The average case behavior is sublinear. Practical efficient implementations of this algorithm exist. By starting the comparisons at the right of the pattern instead of the left of the pattern, large jumps can be made in the text.", corpsource = "Stanford Res. Inst., Stanford, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "algorithm; Boyer--Moore; character string; computer operating systems; computer programming; fast; information science --- Information Retrieval; list processing; pattern matching; string matching; string searching; text; text editing", oldlabel = "BoyerM77", received = "June 1975", revised = "April 1976", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BoyerM77", } @Article{Hoare:1978:CCS, author = "C. A. R. Hoare", title = "Corrigendum: {``Communicating Sequential Processes''}", journal = j-CACM, volume = "21", number = "11", pages = "958--958", month = nov, year = "1978", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 18 15:39:32 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See \cite{Hoare:1978:CSP}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Rivest:1978:MOD, author = "Ronald L. Rivest and Adi Shamir and Leonard M. Adleman", title = "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", journal = j-CACM, volume = "21", number = "2", pages = "120--126", month = feb, year = "1978", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "94A05", MRnumber = "83m:94003", MRreviewer = "J. L. Selfridge", bibdate = "Mon Jan 22 07:16:20 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#RivestSA78; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "The basics of trap-door functions and the famous RSA public key cryptosystem are presented in this paper.", abstract = "An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. (2) A message can be ``signed'' using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature.", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", classification = "723", corpsource = "Dept. of Math., MIT, Cambridge, MA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "computer programming; cryptography; cryptosystems; data handling; data processing --- Security of Data; decryption key; digital signatures; encryption key; number theory; operating protection; RSA; security; security of data", oldlabel = "RivestSA78", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RivestSA78", } @Article{Hoare:1978:CSP, author = "C. A. R. Hoare", title = "Communicating Sequential Processes", journal = j-CACM, volume = "21", number = "8", pages = "666--677", month = aug, year = "1978", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:50:24 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Hoare78; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See corrigendum \cite{Hoare:1978:CCS}.", abstract = "This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. \par Their use is illustrated by sample solutions of a variety of familiar programming exercises.", acknowledgement = ack-nhfb, annote = "This paper is now expanded into an excellent book detailed by Hoare and published by Prentice-Hall. This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey ``Tutorial on Parallel Processing.'' Reproduced in ``Distributed Computing: Concepts and Implementations'' edited by McEntire, O'Reilly and Larson, IEEE, 1984. Somewhat dated.", classcodes = "C6110 (Systems analysis and programming)", classification = "723", corpsource = "Queen's Univ., Belfast, UK", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "4.22; 4.32 maeder biblio: synchronisation and concurrency in processes; ak; bhibbard grecommended91; classes; computer programming; concurrency; conditional critical regions; coroutines; CR categories: 4.20; CSP; data representations; Dijkstra's guarded command; guarded commands; hcc; input; iterative arrays; k-concurrency; k-csp; k-guarded-commands; monitors; multiple entries; multiple exits; nondeterminacy; output; parallel composition; parallel programming; primitives; procedures; program; program structures; programming; Programming; programming languages; programming primitives; recursion; sequential processes; structured programming; structuring method", oldlabel = "Hoare78", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare78", } @Article{Brelaz:1979:NMC, author = "Daniel Br{\'e}laz", title = "New Methods to Color Vertices of a Graph", journal = j-CACM, volume = "22", number = "4", pages = "251--256", month = apr, year = "1979", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "90B35", MRnumber = "80c:90080", MRreviewer = "G. Berman", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/clique.color.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See \cite{Peemoller:1983:CBM,Kubale:1985:GIE}.", acknowledgement = ack-nhfb, annote = "Successive augmentation approach to graph coloring. DSATUR chooses the vertex adjacent to the largest number of distinctly colored vertices. Paper also discusses an implicit enumeration scheme for finding an optimal coloring using some of the principles of DSATUR to guide the search.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{ONeill:1980:PST, author = "P. O'Neill and A. O'Neill", title = "Performance Statistics of a Time Sharing Network at a Small University", journal = j-CACM, volume = "23", number = "1", pages = "10--13", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:32 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "(VBI-001200)", country = "USA", descriptors = "Computer network; traffic measurement", enum = "10738", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Mazlack:1980:IPA, author = "Lawrence J. Mazlack", title = "Identifying Potential to Acquire Programming Skill", journal = j-CACM, volume = "23", number = "1", pages = "14--17", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:02:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Mazlack80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Mazlack80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mazlack80", } @Article{Cichelli:1980:MPH, author = "R. J. Cichelli", key = "Cichelli", title = "Minimal Perfect Hash Functions Made Simple", journal = j-CACM, volume = "23", number = "1", pages = "17--19", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Apr 29 17:34:47 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib", note = "See remarks in \cite{Jaeschke:1980:TCC}, and the author's response in \cite{Cichelli:1980:TCC}, and also later extension \cite{Sager:1985:PTG}.", acknowledgement = ack-nhfb, annote = "A heuristic for computing a simple, fast, and machine-independent hash function is presented. Because of these properties, several attempts have been made to extend this paper since its publication.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Abelson:1980:ITA, author = "Harold Abelson and Peter Andreae", title = "Information Transfer and Area-Time Tradeoffs for {VLSI} Multiplication", journal = j-CACM, volume = "23", number = "1", pages = "20--23", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "94C30 (68C25)", MRnumber = "80m:94112", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Lane:1980:SLM, author = "Jeffrey M. Lane and Loren C. Carpenter and J. Turner Whitted and James F. Blinn", title = "Scan Line Methods for Displaying Parametrically Defined Surfaces", journal = j-CACM, volume = "23", number = "1", pages = "23--34", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 22:56:05 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Algorithmic Aspects scanning; CACM; Mathematical Aspects surface generation; Methodologies; Modeling geometric design/modeling; surface display; surface splines; Techniques; visible patch", } @Article{Kent:1980:TCS, author = "Stephen T. Kent", title = "Technical Correspondence: On Secure Personal Computing", journal = j-CACM, volume = "23", number = "1", pages = "35--36", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:49:39 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Denning:1980:TCS, author = "Dorothy E. Denning", title = "Technical Correspondence: On Secure Personal Computing", journal = j-CACM, volume = "23", number = "1", pages = "36--39", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:49:39 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Bates:1980:TCS, author = "Doug Bates and Ronald S. Lemos", title = "Technical Correspondence: On Statistical Analysis", journal = j-CACM, volume = "23", number = "1", pages = "39--40", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:49:39 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Anonymous:1980:CLC, author = "Anonymous", title = "Correction: List of Contributors to the {CS Report [Comm. ACM, March 1979]}", journal = j-CACM, volume = "23", number = "1", pages = "40--40", month = jan, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:49:39 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Ralston:1980:CCS, author = "Anthony Ralston and Mary Shaw", title = "{Curriculum '78} --- Is Computer Science Really that Unmathematical", journal = j-CACM, volume = "23", number = "2", pages = "67--70", month = feb, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:14:49 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#RalstonS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "This decade has seen major advances in the theory of computation and in the utility of theoretical results in practical settings. The rapid growth of the field of computational complexity has greatly increased our ability to analyze algorithms. And perhaps most significantly, we have finally started to make real progress in developing principles and theories for the design and verification of algorithms and programs. Are these changes evident in Curriculum '78? Sadly No. That curriculum only lends support to the equation Computer Science equals Programming that is mistakenly believed by so many outside the discipline.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "RalstonS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RalstonS80", } @Article{Canon:1980:VME, author = "M. D. Canon and D. H. Fritz and John H. Howard and T. D. Howell and Michael F. Mitoma and Juan Rodriguez-Rossel", title = "A Virtual Machine Emulator for Performance Evaluation", journal = j-CACM, volume = "23", number = "2", pages = "71--80", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:29:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#CanonFHHMR80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "CanonFHHMR80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CanonFHHMR80", } @Article{Redell:1980:POS, author = "David Redell and Yogen Dalal and Thomas Horsley and Hugh Lauer and William Lynch and Paul McJones and Hal Murray and Stephen Purcell", title = "{Pilot}: An Operating System for a Personal Computer", journal = j-CACM, volume = "23", number = "2", pages = "81--92", month = feb, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "The Pilot operating system provides a single-user, single-language environment for higher level software on a powerful personal computer. Its features include virtual memory, a large ``flat'' file system, streams, network communication facilities, and concurrent programming support. Pilot thus provides rather more powerful facilities than are normally associated with personal computers. The exact facilities provided display interesting similarities to and differences from corresponding facilities provided in large multi-user systems. Pilot is implemented entirely in Mesa, a high-level system programming language. The modularization of the implementation displays some interesting aspects in terms of both the static structure and dynamic interactions of the various components.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Mesa; Virtual Memory", } @Article{Ousterhout:1980:MED, author = "J. K. Ousterhout and D. A. Scelza and P. S. Sindhu", title = "{Medusa}: an experiment in distributed operating system structure", journal = j-CACM, volume = "23", number = "2", pages = "92--105", month = feb, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:36:07 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "The design of Medusa, a distributed operating system for the Cm* multimicroprocessor, is discussed. The Cm* architecture combines distribution and sharing in a way that strongly impacts the organization of operating systems. Medusa is an attempt to capitalize on the architectural features to produce a system that is modular, robust, and efficient. To provide modularity and to make effective use of the distributed hardware, the operating system is partitioned into several disjoint utilities that communicate with each other via messages. To take advantage of the parallelism present in Cm* and to provide robustness, all programs, including the utilities, are task forces containing many concurrent, cooperating activities.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Lampson:1980:EPM, author = "Butler W. Lampson and David D. Redell", title = "Experience with Processes and Monitors in {Mesa}", journal = j-CACM, volume = "23", number = "2", pages = "105--117", month = feb, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 22:55:32 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.synch.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "The use of monitors for describing concurrency has been much discussed in the literature. When monitors are used in real systems of any size, however, a number of problems arise which have not been adequately dealt with: the semantics of nested monitor calls; the various ways of defining the meaning of WAIT; priority scheduling; handling of timeouts; aborts and other exceptional conditions; interactions with process creation and destruction; monitoring large numbers of small objects. These problems are addressed by the facilities described here for concurrent programming in Mesa. Experience with several substantial applications gives us some confidence in the validity of our solutions.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "k-mesa; k-monitors; k-nested-monitor-calls; Mesa Monitors", } @Article{Walker:1980:SVU, author = "B. J. Walker and R. A. Kemmerer and G. J. Popek", title = "Specification and Verification of the {UCLA Unix} Security Kernel", journal = j-CACM, volume = "23", number = "2", pages = "118--131", month = feb, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Data Secure Unix, a kernel structured operating system, was constructed as part of an ongoing effort at UCLA to develop procedures by which operating systems can be produced and shown secure. Program verification methods were extensively applied as a constructive means of demonstrating security enforcement. Here we report the specification and verification experience in producing a secure operating system. The work represents a significant attempt to verify a large-scale, production level software system, including all aspects from initial specification to verification of implemented code.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{McCracken:1980:JWM, author = "Daniel D. McCracken", title = "{John W. Mauchly}: 1907--1980", journal = j-CACM, volume = "23", number = "3", pages = "143--143", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:02:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#McCracken80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "obituary", oldlabel = "McCracken80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McCracken80", } @Article{Auerbach:1980:TJW, author = "Isaac L. Auerbach", title = "A Tribute to {John William Mauchly}", journal = j-CACM, volume = "23", number = "3", pages = "144--??", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:22:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Auerbach80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Auerbach80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Auerbach80", } @Article{Eckert:1980:EDS, author = "J. Presper Eckert", title = "Eulogy: Delivered in {St. Anthony's Church, Ambler, Pennsylvania}, at funeral services on {January 11, 1980}", journal = j-CACM, volume = "23", number = "3", pages = "145--146", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:37:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Eckert80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "John William Mauchly", oldlabel = "Eckert80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Eckert80", } @Article{Ling:1980:GCD, author = "Robert F. Ling", title = "General Considerations on the Design of an Interactive System for Data Analysis", journal = j-CACM, volume = "23", number = "3", pages = "147--154", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:59:10 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Ling80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Ling80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ling80", } @Article{Fraser:1980:GTE, author = "C. W. Fraser", title = "A Generalized Text Editor", journal = j-CACM, volume = "23", number = "3", pages = "154--158", month = mar, year = "1980", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358826.358834", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "uilit text", } @Article{Lee:1980:LAC, author = "K. P. Lee", title = "A Linear Algorithm for Copying Binary Trees Using Bounded Workspace", journal = j-CACM, volume = "23", number = "3", pages = "159--162", month = mar, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 22:56:16 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Samet:1980:RRQ, author = "H. Samet", title = "Region representation: Quadtrees from boundary codes", journal = j-CACM, volume = "23", number = "3", pages = "163--170", month = mar, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:37 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Algorithmic Aspects region representation; graphical data/base/structures; surface representation", } @Article{Dyer:1980:RRB, author = "C. R. Dyer and A. Rosenfeld and H. Samet", title = "Region representation: Boundary codes from quadtrees", journal = j-CACM, volume = "23", number = "3", pages = "171--179", month = mar, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 22:52:38 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/raum.bib; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Algorithmic Aspects region representation; graphical data/base/structures; surface representation", topics = "K{\"u}nstliche Intelligenz / Raumbeschreibung / Wissensrepr{\"a}sentation / Spatial Reasoning", } @Article{Gold:1980:SRE, author = "Charles L. Gold and Seymour E. Goodman and Benjamin G. Walker", title = "Software: Recommendations for an Export Control Policy", journal = j-CACM, volume = "23", number = "4", pages = "199--207", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:45:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#GoldGW80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "GoldGW80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GoldGW80", } @Article{Brooks:1980:SPB, author = "R. E. Brooks", title = "{Studying programming behavior experimentally: The problems of proper methodology}", journal = j-CACM, volume = "23", number = "4", pages = "207--213", month = Apr, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/is.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Bentley:1980:MDC, author = "Jon Louis Bentley", title = "Multidimensional Divide-and-Conquer", journal = j-CACM, volume = "23", number = "4", pages = "214--229", month = apr, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68H05 (68C05)", MRnumber = "81b:68116", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "This paper contains an $n \log(n)$ deterministic algorithm for finding nearest neighbors in two-dimensional space.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Vuillemin:1980:ULD, author = "Jean Vuillemin", title = "A Unifying Look at Data Structures", journal = j-CACM, volume = "23", number = "4", pages = "229--239", month = apr, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B15", MRnumber = "81b:68024", bibdate = "Mon Jan 22 07:27:37 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/80.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Vuillemin80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Vuillemin80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Vuillemin80", } @Article{Glass:1980:RTL, author = "Robert L. Glass", title = "Real-Time: The ``Lost World'' of Software Debugging and Testing", journal = j-CACM, volume = "23", number = "5", pages = "264--271", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:44:38 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Glass80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Glass80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Glass80", } @Article{Turner:1980:SMP, author = "Joshua Turner", title = "The Structure of Modular Programs", journal = j-CACM, volume = "23", number = "5", pages = "272--277", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:26:50 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Turner80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Turner80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Turner80", } @Article{Sethi:1980:CDT, author = "Ishwar K. Sethi and B. Chatterjee", title = "Conversion of Decision Tables to Efficient Sequential Testing Procedures", journal = j-CACM, volume = "23", number = "5", pages = "279--285", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:20:36 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#SethiC80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SethiC80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SethiC80", } @Article{Maes:1980:AAC, author = "Rik Maes", title = "An Algorithmic Approach to the Conversion of Decision Grid Charts into Compressed Decision Tables", journal = j-CACM, volume = "23", number = "5", pages = "286--293", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:00:54 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Maes80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Maes80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Maes80", } @Article{Gill:1980:HBS, author = "Arthur Gill", title = "Hierarchical Binary Search", journal = j-CACM, volume = "23", number = "5", pages = "294--300", month = may, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:32:07 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Deimel:1980:MCP, author = "Lionel E. {Deimel, Jr.}", title = "On a matrix chain product algorithm. Correction to: {``An $O(n)$ algorithm for determining a near-optimal computation order of matrix chain products'' [Comm. ACM, 21, 1978, 544--549, MR 80a:68037] by F. Y. Chin}. With a reply by {Chin}", journal = j-CACM, volume = "23", number = "5", pages = "301", month = may, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C25", MRnumber = "81j:68049", MRreviewer = "Ondrej S{\'y}kora", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{House:1980:CPS, author = "Roger House", title = "Comments on Program Specification and Testing", journal = j-CACM, volume = "23", number = "6", pages = "324--331", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:51:01 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#House80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "House80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/House80", } @Article{Chambers:1980:CAI, author = "Jack A. Chambers and Jerry W. Sprecher", title = "Computer Assisted Instruction: Current Trends", journal = j-CACM, volume = "23", number = "6", pages = "332--342", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:30:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#ChambersS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "ChambersS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ChambersS80", } @Article{Whitted:1980:IIM, author = "Turner Whitted", title = "An Improved Illumination Model for Shaded Display", journal = j-CACM, volume = "23", number = "6", pages = "343--349", month = jun, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Aug 24 21:14:52 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "Also appears in {\bf Tutorial: Computer Graphics: Image Synthesis}, Kenneth I. Joy, Charles W. Grant, Nelson L. Max, and Lansing Hatfield (eds.), Computer Society Press, Washington, 1988, p. 132-138. \\ The classic paper on ray tracing. Describes a global shading model and extensions to the original ray tracing model. He notes that up to 95\% of the time is spent calculating ray-surface intersections and that there must be a way to speed things up. \\ To accurately render a two-dimensional image of a three-dimensional scene, global illumination information that affects the intensity of each pixel of the image must be known at the time the intensity is calculated. In a simplified form, this information is stored in a tree of ``rays'' extending from the viewer to the first surface encountered and from there to other surfaces and to the light sources. A visible surface algorithm creates this tree for each pixel of the display and passes it to determine the intensity of the light received by the shader to accurately simulate true reflection, shadows, and refraction, as well as the effects simulated by conventional shaders. Anti-aliasing is included as an integral part of the visibility calculations. Surfaces displayed include curved as well as polygonal surfaces.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Algorithmic Aspects shading; parallel processing; ray tracing; Three-Dimensional Graphics realism", } @Article{Fletcher:1980:MGA, author = "John G. Fletcher", title = "A More General Algorithm for Computing Closed Semiring Costs Between Vertices of a Directed Graph", journal = j-CACM, volume = "23", number = "6", pages = "350--351", month = jun, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:31:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Banno:1980:KOB, author = "Y. Banno and H. Hirose and Y. Karita and H. Mawatari and H. Murakami and H. Takahashi and S. Yashiro and H. Yoshiki and N. Hagiwara and Y. Sakurai", title = "{KEKOPEN}, An Open Batch Processing System at {KEK}", journal = j-CACM, volume = "23", number = "7", pages = "368--378", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:23:08 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#BannoHKMMTYYHS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "BannoHKMMTYYHS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BannoHKMMTYYHS80", } @Article{Harel:1980:FT, author = "David Harel", title = "On Folk Theorems", journal = j-CACM, volume = "23", number = "7", pages = "379--389", month = jul, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:32:09 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Cheng:1980:GVG, author = "R. C. H. Cheng and G. M. Feast", title = "Gamma variate generators with increased shape parameter range", journal = j-CACM, volume = "23", number = "7", pages = "389--394", month = jul, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:32:35 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "Gamma generators, easily programmed, and possess a uniform speed over the operating range, but are only valid for $\alpha>1$. Generating random variates using the ratio of uniform variates are combined to produce a family of generators valid for all $\alpha>1/n$ where $n$ is an arbitrary integer. thus if $n$ is greater than unity, variates with $\alpha$ less than unity can be sampled.", country = "USA", descriptors = "distribution; gamma distribution; rng", enum = "547", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "8", } @Article{Luccio:1980:CGA, author = "Fabrizio Luccio and Linda Pagli", title = "Comment on Generalized {AVL} Trees", journal = j-CACM, volume = "23", number = "7", pages = "394--395", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:00:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#LuccioP80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LuccioP80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LuccioP80", } @Article{Card:1980:KLM, author = "Stuart K. Card and Thomas P. Moran and Allen Newell", title = "The Keystroke-Level Model for User Performance Time with Interactive Systems", journal = j-CACM, volume = "23", number = "7", pages = "396--410", month = jul, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:36:31 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/da.3d-metaphors.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Keystroke-Modell in User Interface Design Environment (UIDE): T(Execute) = K(Keystroking) + P(Pointing at screen Object) + H(Homing on Device) + D(Drawing) + M(Mental Preparation) + R(System Response Time)", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Triance:1980:MPM, author = "J. M. Triance and J. F. S. Yow", title = "{MCOBOL} --- a Prototype Macro Facility for {Cobol}", journal = j-CACM, volume = "23", number = "8", pages = "432--439", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:26:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#TrianceY80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "TrianceY80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/TrianceY80", } @Article{Compton:1980:EFL, author = "Michael T. Compton", title = "Easing Fault Location in Large Systems", journal = j-CACM, volume = "23", number = "8", pages = "440--442", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:32:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Compton80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Compton80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Compton80", } @Article{Iverson:1980:NTT, author = "Kenneth E. Iverson", title = "Notation as a Tool of Thought", journal = j-CACM, volume = "23", number = "8", pages = "444--465", month = aug, year = "1980", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358896.358899", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "00A25 (68-02)", MRnumber = "82b:00007", MRreviewer = "B. Brainerd", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM apl programming languages", remark = "This is the 1979 ACM Turing Award Lecture.", } @Article{Peterson:1980:CLM, author = "G. Peterson and A. B. Budgor", title = "The Computer Language {Mathsy} and Applications to Solid State Physics", journal = j-CACM, volume = "23", number = "8", pages = "466--474", month = aug, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:33 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Applications of Computer Graphics physics", } @Article{Halstead:1980:SAP, author = "Maurice H. Halstead and Victor B. Schneider", title = "Self-Assessment Procedure {VII}: a Self-Assessment Procedure Dealing with Software Science", journal = j-CACM, volume = "23", number = "8", pages = "475--480", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:48:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#HalsteadS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "HalsteadS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HalsteadS80", } @Article{Hall:1980:VOS, author = "Dennis E. Hall and Deborah K. Scherrer and Joseph S. Sventek", title = "A Virtual Operating System", journal = j-CACM, volume = "23", number = "9", pages = "495--502", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:47:59 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#HallSS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "HallSS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HallSS80", } @Article{Asai:1980:ONI, author = "Hitohisa Asai", title = "An overrelaxation for a numerical inverse of a constant", journal = j-CACM, volume = "23", number = "9", pages = "503--510", month = sep, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "65B10", MRnumber = "81h:65002", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Kumar:1980:CSD, author = "B. Kumar and E. S. Davidson", title = "Computer System Design Using a Hierarchical Approach to Performance Evaluation", journal = j-CACM, volume = "23", number = "9", pages = "511--521", month = sep, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Pfaltz:1980:PMR, author = "John L. Pfaltz and William J. Berman and Edgar M. Cagley", title = "Partial-Match Retrieval Using Indexed Descriptor Files", journal = j-CACM, volume = "23", number = "9", pages = "522--528", month = sep, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68H05", MRnumber = "81g:68128", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Chand:1980:LCS, author = "Donald R. Chand and Surya B. Yadav", title = "Logical Construction of Software", journal = j-CACM, volume = "23", number = "10", pages = "546--555", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:30:14 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#ChandY80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "ChandY80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ChandY80", } @Article{Ledgard:1980:NLI, author = "Henry F. Ledgard and John A. Whiteside and Andrew Singer and William Seymour", title = "The Natural Language of Interactive Systems", journal = j-CACM, volume = "23", number = "10", pages = "556--563", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:58:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#LedgardWSS80; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LedgardWSS80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LedgardWSS80", } @Article{Bard:1980:MSD, author = "Y. Bard", title = "A Model of shared {DASD} and Multipathing", journal = j-CACM, volume = "23", number = "10", pages = "564--572", month = oct, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Chandy:1980:CAP, author = "K. Mani Chandy and Charles H. Sauer", title = "Computational algorithms for product form queueing networks", journal = j-CACM, volume = "23", number = "10", pages = "573--583", month = oct, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C15 (90B22)", MRnumber = "81i:68047", bibdate = "Tue Dec 26 16:39:26 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "\ldots{}in queueing networks with a product form solution two computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.", descriptors = "Queueing network; discrete convolution; product form; network; runtime/storage efficiency", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Potier:1980:ALP, author = "D. Potier and P. LeBlanc", title = "Analysis of Locking Policies in Database Management Systems", journal = j-CACM, volume = "23", number = "10", pages = "584--593", month = oct, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:01:30 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "Consistency control has to be enforced in database management systems (DBMS) where several transactions may concurrently access the database. \ldots{} However, a drawback of integrity enforcement through locking policies is the degradation of the global system performance. \ldots{} The results hereby obtained are aggregated in a second step to yield a global performance evaluation. \ldots{}", descriptors = "Queueing system; Queueing network; performance evaluation; model; DBMS = database management system; concurrency", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM", } @Article{Cook:1980:BSA, author = "Curtis R. Cook and Do Jin Kim", title = "Best Sorting Algorithms for Nearly Sorted Lists", journal = j-CACM, volume = "23", number = "11", pages = "620--624", month = nov, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:34:24 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM see also McGlinn; SP\&E Oct 1989", } @Article{Pitteway:1980:BAG, author = "M. L. V. Pitteway and D. J. Watkinson", title = "{Bresenham}'s algorithm with grey scale", journal = j-CACM, volume = "23", number = "11", pages = "625--626", month = nov, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 18:50:31 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See corrigendum \cite{Pitteway:1981:CBA}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithmic aspects; aliasing; antialiasing; line drawing; line generation", } @Article{Hirschberg:1980:DEF, author = "D. S. Hirschberg and J. B. Sinclair", title = "Decentralized Extrema-Finding in Circular Configurations of Processors", journal = j-CACM, volume = "23", number = "11", pages = "627--628", month = nov, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B20 (68C25)", MRnumber = "81j:68040", bibdate = "Tue Dec 03 18:09:39 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM", } @Article{Steele:1980:DLB, author = "Guy Lewis {Steele, Jr.} and Gerald Jay Sussman", title = "Design of a {Lisp}-based Processor", journal = j-CACM, volume = "23", number = "11", pages = "628--645", month = nov, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/scheme.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Hofri:1980:DSF, author = "M. Hofri", title = "Disk scheduling: {FCFS} vs. {SSTF} revisited", journal = j-CACM, volume = "23", number = "11", pages = "645--653", month = nov, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:34:57 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "We report on a rather extensive simulation effort directed at evaluating the merits of two scheduling strategies, fcfs and sstf, for moving-arm disks under stationary request arrival process. For first-come-first-served (fcfs) scheduling, analytic results for the mean waiting time are also given (in a closed form). If the objective of a schedule is to minimize the mean waiting time (or queue size) and its variance, the results seem to confirm \ldots{}.", country = "USA", descriptors = "Queueing discipline; simulation; process management; spt; fifo", enum = "1383", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "8", } @Article{Peterson:1980:CPD, author = "James Lyle Peterson", title = "Computer Programs for Detecting and Correcting Spelling Errors", journal = j-CACM, volume = "23", number = "12", pages = "676--687", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:47:16 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Winston:1980:LRA, author = "Patrick H. Winston", title = "Learning and Reasoning by Analogy", journal = j-CACM, volume = "23", number = "12", pages = "689--702", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:35:08 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Learning.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Samet:1980:DTD, author = "Hanan Samet", title = "Deletion in two-dimensional quad trees", journal = j-CACM, volume = "23", number = "12", pages = "703--710", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:35:25 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/80.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Shoch:1980:MPE, author = "John F. Shoch and Jon A. Hupp", title = "Measured performance of an {Ethernet} local network", journal = j-CACM, volume = "23", number = "12", pages = "711--721", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:35:44 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "The Ethernet communications network is a broadcast, multiaccess system for local computer networking, using the techniques of carrier sense and collision detection. Recently we have measured the actual performance and error characteristics of an existing Ethernet installation which provides communications services to over 120 directly connected hosts to network. This paper is a report on some of those measurements -- characterizing ``typical'' \ldots{}.", country = "USA", descriptors = "Performance evaluation; model; Queueing network; Packet switching; traffic intensity; traffic load", enum = "2894", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "21", } @Article{Anonymous:1980:ISA, author = "Anonymous", title = "1980 Index by Subject to Algorithms", journal = j-CACM, volume = "23", number = "12", pages = "722--722", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 07:00:33 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Anonymous:1980:ICA, author = "Anonymous", title = "Index to {Communications of the ACM}, Volume 23, 1980", journal = j-CACM, volume = "23", number = "12", pages = "723--727", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 07:00:33 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Jaeschke:1980:TCC, author = "G. Jaeschke and G. Osterburg", title = "Technical Correspondence: On {Cichelli}'s Minimal Perfect Hash Functions Method", journal = j-CACM, volume = "23", number = "12", pages = "728--729", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jul 19 22:51:08 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib", note = "This letter to the editor contains comments on \cite{Cichelli:1980:MPH}, together with a response from R. J. Cichelli \cite{Cichelli:1980:TCC}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Cichelli:1980:TCC, author = "R. J. Cichelli", title = "Technical Correspondence: On {Cichelli}'s Minimal Perfect Hash Functions Method", journal = j-CACM, volume = "23", number = "12", pages = "728--729", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Apr 29 18:36:31 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib", note = "This is the author's response to the comments in \cite{Jaeschke:1980:TCC} about \cite{Cichelli:1980:MPH}. See also \cite{Sager:1985:PTG}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", xxpages = "729--729", } @Article{McClintock:1980:TCA, author = "John McClintock and Paul Klint", title = "Technical Correspondence: {Algol-W} Approach to Line Number Maintenance", journal = j-CACM, volume = "23", number = "12", pages = "729--729", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:34:29 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Dwyer:1981:OMT, author = "Barry Dwyer", title = "One More Time --- How to Update a Master File", journal = j-CACM, volume = "24", number = "1", pages = "3--8", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:37:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Dwyer81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Dwyer81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dwyer81", } @Article{Ricart:1981:OAM, author = "Glenn Ricart and Ashok K. Agrawala", title = "An Optimal Algorithm for Mutual Exclusion in Computer Networks", journal = j-CACM, volume = "24", number = "1", pages = "9--17", month = jan, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B20", MRnumber = "84c:68014", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not share memory. The algorithm sends only 2*(N-1) messages, where N is the number of nodes in the network per critical section invocation. This number of messages is at a minimum if parallel, distributed, symmetric control is used; hence, the algorithm is optimal in this respect. The time needed to achieve mutual exclusion is also minimal under some general assumptions. As in Lamport's ``bakery algorithm'', unbounded sequence numbers are used to provide first-come first-served priority into the critical section. It is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus. The number of messages required to implement the exclusion can be reduced by using sequential node-by-node processing, by using broadcast message techniques, or by sending information through timing channels. The ``readers and writers'' problem is solved by a simple modification of the algorithm and the modifications necessary to make the algorithm robust are described.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Pritchard:1981:SAS, author = "Paul Pritchard", title = "A sublinear additive sieve for finding prime numbers", journal = j-CACM, volume = "24", number = "1", pages = "18--23", month = jan, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "10A25 (68C25)", MRnumber = "82c:10011", MRreviewer = "Samuel S. {Wagstaff, Jr.}", bibdate = "Mon Jan 27 12:44:40 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See corrigendum \cite{Pritchard:1981:CSA}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Keen:1981:ISO, author = "Peter G. W. Keen", title = "Information Systems and Organizational Change", journal = j-CACM, volume = "24", number = "1", pages = "24--33", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:54:13 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Keen81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Keen81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Keen81", } @Article{Krull:1981:EIH, author = "Fred N. Krull", title = "Experience With {ILIAD}: a High-Level Process Control Language", journal = j-CACM, volume = "24", number = "2", pages = "66--72", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:56:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Krull81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Krull81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Krull81", } @Article{Gauss:1981:PBC, author = "E. J. Gauss", title = "Pracniques: Built-In Checklist Reduces File Destruction", journal = j-CACM, volume = "24", number = "2", pages = "73--??", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:43:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Gauss81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Gauss81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gauss81", } @Article{Hoare:1981:EOC, author = "Charles Anthony Richard Hoare", title = "The {Emperor}'s Old Clothes", journal = j-CACM, volume = "24", number = "2", pages = "75--83", year = "1981", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358549.358561", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:50:25 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Hoare81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "This is the 1980 ACM Turing Award Lecture, delivered at ACM'80, Nashville, Tennessee, October 27, 1980.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Hoare81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare81", } @Article{Chaum:1981:UEM, author = "David Chaum", title = "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms", journal = j-CACM, volume = "24", number = "2", pages = "84--88", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:30:41 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Chaum81; https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Chaum81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chaum81", } @Article{Pitteway:1981:CBA, author = "M. L. V. Pitteway and D. J. Watkinson", title = "Corrigendum: {``Bresenham's algorithm with grey scale''}", journal = j-CACM, volume = "24", number = "2", pages = "88--88", month = feb, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 06:37:45 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/81.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See \cite{Pitteway:1980:BAG}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "antialiasing; line drawing", } @Article{Rosenberg:1981:UIO, author = "Arnold L. Rosenberg", title = "On Uniformly Inserting One Data Structure into Another", journal = j-CACM, volume = "24", number = "2", pages = "88--90", month = feb, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B15", MRnumber = "82i:68016", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Mantai:1981:EPT, author = "Marilyn M. Mantai", title = "The Effect of Programming Team Structures on Programming Tasks", journal = j-CACM, volume = "24", number = "3", pages = "106--113", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:01:34 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Mantai81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Mantai81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mantai81", } @Article{Magel:1981:RML, author = "Kenneth I. Magel and Richard H. Austing and Alfs Berztiss and Gerald L. Engel and John W. Hamblen and A. A. J. Hoffmann and Robert Mathis", title = "Recommendations for Master's Level Programs in Computer Science --- a Report of the {ACM} Curriculum Committee on Computer Science", journal = j-CACM, volume = "24", number = "3", pages = "115--123", month = mar, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:40:15 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Nunamaker:1981:EPI, author = "Jay F. Nunamaker", title = "Educational Programs in Information Systems", journal = j-CACM, volume = "24", number = "3", pages = "124--133", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:10:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nunamaker81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Nunamaker81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nunamaker81", } @Article{Minker:1981:CSW, author = "Jack Minker", title = "Computer Scientists Whose Scientific Freedom and Human Rights Have Been Violated: a Report of the {ACM Committee on Scientific Freedom and Human Rights}", journal = j-CACM, volume = "24", number = "3", pages = "134--139", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:04:34 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Minker81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Minker81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Minker81", } @Article{Andrews:1981:PPP, author = "G. R. Andrews", title = "Parallel Programs: Proofs, Principles, and Practice", journal = j-CACM, volume = "24", number = "3", pages = "140--146", month = mar, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:40 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Mowshowitz:1981:ASS, author = "Abbe Mowshowitz", title = "On Approaches to the Study of Social Issues in Computing", journal = j-CACM, volume = "24", number = "3", pages = "146--155", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:06:24 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Mowshowitz81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Mowshowitz81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mowshowitz81", } @Article{Nance:1981:TSR, author = "Richard E. Nance", title = "The time and state relationships in simulation modeling", journal = j-CACM, volume = "24", number = "4", pages = "173--179", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J10 (00A69)", MRnumber = "82d:68062", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Discrete event simulation", enum = "2239", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Oren:1981:CCA, author = "Tuncer I. {\"O}ren", title = "Concepts and Criteria to Access Acceptability of Simulation Studies: a Frame of References", journal = j-CACM, volume = "24", number = "4", pages = "180--189", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:10:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Oren81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Oren81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Oren81", } @Article{Balci:1981:MCR, author = "Osman Balci and Robert G. Sargent", title = "A methodology for cost-risk analysis in the statistical validation of simulation models", journal = j-CACM, volume = "24", number = "4", pages = "190--197", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J10", MRnumber = "82d:68061", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Chandy:1981:ADS, author = "K. M. Chandy and I. Misra", title = "Asynchronous Distributed Simulation via a Sequence of Parallel Computations", journal = j-CACM, volume = "24", number = "4", pages = "198--206", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J05 (68B20)", MRnumber = "82d:68058", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/concordia.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Clark:1981:UPD, author = "Gordon M. Clark", title = "Use of {P\'olya} distributions in approximate solutions to nonstationary ${M}/{M}/s$ queues", journal = j-CACM, volume = "24", number = "4", pages = "206--217", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J05 (60K25 90B22)", MRnumber = "82e:68103", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Continuous simulation; waiting time; M/M/N; queueing approximation; traffic theory", enum = "592", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "14", } @Article{Schriber:1981:CFR, author = "T. J. Schriber and R. W. Andrews", title = "A conceptual framework for research in the analysis of simulation output", journal = j-CACM, volume = "24", number = "4", pages = "218--232", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7859", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Heidelberger:1981:SMC, author = "Philip Heidelberger and Peter D. Welch", title = "A spectral method for confidence interval generation and run length control in simulations", journal = j-CACM, volume = "24", number = "4", pages = "233--245", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J05", MRnumber = "82d:68059", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Schruben:1981:CIB, author = "Lee W. Schruben", title = "Control of initialization bias in multivariate simulation response", journal = j-CACM, volume = "24", number = "4", pages = "246--252", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J05", MRnumber = "82d:68060", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7862", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Donnelly:1981:MMS, author = "J. H. Donnelly and R. E. Shannon", title = "Minimum mean-squared-error estimators for simulation experiments", journal = j-CACM, volume = "24", number = "4", pages = "253--259", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:46 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7228", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Heidelberger:1981:RAE, author = "P. Heidelberger and P. A. W. Lewis", title = "Regression-adjusted estimates for regenerative simulations, with graphics", journal = j-CACM, volume = "24", number = "4", pages = "260--273", month = apr, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:15:15 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "This paper discusses a method for placing confidence limits on the steady state mean of an output sequence generated by a discrete event simulation. An estimate of the variance is obtained by estimating the spectral density at zero frequency. This estimation is accomplished through a regression analysis of the logarithm of the averaged periodogram. By batching the output sequence the storage and computational requirements of the method remain \ldots{}.", descriptors = "Simulation; confidence interval; spectral analysis; application; method; runtime/storage efficiency; variance; variance estimation", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Litecky:1981:EAR, author = "Charles R. Litecky and Larry E. Rittenberg", title = "The External Auditor's Review of Computer Controls", journal = j-CACM, volume = "24", number = "5", pages = "288--295", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:59:26 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#LiteckyR81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LiteckyR81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LiteckyR81", } @Article{Robinson:1981:ASC, author = "P. J. Robinson and Dave Singer", title = "Another Spelling Correction Program", journal = j-CACM, volume = "24", number = "5", pages = "296--297", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:16:39 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "RobinsonS81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobinsonS81", } @Article{Nix:1981:ESE, author = "Robert P. Nix", title = "Experience With a Space Efficient Way to Store a Dictionary", journal = j-CACM, volume = "24", number = "5", pages = "297--298", year = "1981", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358645.358654", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib", acknowledgement = ack-ds # " and " # ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", mynote = "Computing Practices, Note", oldlabel = "Nix81", rawdata = "Nix, R. (1981) ``Experience With a Space Efficient Way to Store a Dictionary,'' {\it Communications of the ACM}, {\bf24}(5):297--298.", remark = "Comment on \cite{Peterson:1981:LES}", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nix81", } @Article{Inglis:1981:PUM, author = "J. Inglis", title = "Pracniques: Updating a Master File --- Yet One More Time", journal = j-CACM, volume = "24", number = "5", pages = "299--??", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:51:50 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Inglis81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Inglis81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Inglis81", } @Article{Preparata:1981:CCC, author = "Franco P. Preparata and Jean Vuillemin", title = "The Cube-Connected Cycles: a Versatile Network for Parallel Computation", journal = j-CACM, volume = "24", number = "5", pages = "300--309", month = may, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B20", MRnumber = "82d:68018", bibdate = "Mon Feb 12 14:34:32 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/conc.scientific.computing.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Ballard:1981:STH, author = "Dana H. Ballard", title = "Strip Trees, a Hierarchical Representation for Curves", journal = j-CACM, volume = "24", number = "5", pages = "310--321", month = may, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:40 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/graphics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; ftp://ftp.ira.uka.de/pub/siggraph/81.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "The use of curves to represent two-dimensional structures is an important part of many scientific investigations. \ldots{} Because of the very large amount of data involved and the need to perform operations on this data efficiently, the representation of such curves is a crucial issue. A hierarchical representation consisting of binary trees with a special datum at each node is described. This datum is called a strip and the tree that contains such \ldots{}.", comment = "Ballard uses two dimensional extents in a hierarchy to define a two dimensional curve at varying resolution. Algorithms are presented to determine intersection of two strip trees, inside-outside tests etc\ldots{}", descriptors = "method; graphics; two-dimensional plot; information system; data structure", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "curves; intersection; strip trees", } @Article{Crockett:1981:TP, author = "Dan W. Crockett", title = "Triform Programs", journal = j-CACM, volume = "24", number = "6", pages = "344--350", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:34:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Crockett81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Crockett81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Crockett81", } @Article{Traub:1981:QVC, author = "Joseph Traub", title = "Quo Vadimus: Computer Science in a Decade", journal = j-CACM, volume = "24", number = "6", pages = "351--369", month = jun, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:42:19 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Denning:1981:SRD, author = "Peter J. Denning and Edward A. Feigenbaum and Paul Gilmore and Anthony C. Hearn and Robert W. Ritchie and Joseph F. Traub", title = "The {Snowbird} Report: a Discipline in Crisis", journal = j-CACM, volume = "24", number = "6", pages = "370--374", month = jun, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:29 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#DenningFGHRT81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "DenningFGHRT81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DenningFGHRT81", } @Article{Lee:1981:RFT, author = "John A. N. Lee", title = "Response to the {Federal Trade Commission}'s Proposed Ruling on Standards and Certification", journal = j-CACM, volume = "24", number = "6", pages = "375--380", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:58:15 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Lee81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Lee81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lee81", } @Article{Fischler:1981:RSC, author = "Martin A. Fischler and Robert C. Bolles", title = "Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography", journal = j-CACM, volume = "24", number = "6", pages = "381--395", month = jun, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68G10 (51-04 86A30)", MRnumber = "82f:68091", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Stonebraker:1981:OSS, author = "M. Stonebraker", title = "Operating System Support for Database Management", journal = j-CACM, volume = "24", number = "7", pages = "412--418", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:21:48 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprinted in M. Stonebraker, Readings in Database Sys., Morgan Kaufmann, San Mateo, CA, 1988", abstract = "Several operating system services are examined with a view toward their applicability to support of database management functions. These services include buffer pool management; the file system; scheduling, process management, and interprocess communication; and consistency control.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "process control storage structures buffer Halloween problem CACM", } @Article{Ralston:1981:PNC, author = "Anthony Ralston", title = "The Proposed New {Computing Reviews} Classification Scheme, a Report of the {Computing Reviews Category Revision Committee}", journal = j-CACM, volume = "24", number = "7", pages = "419--433", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:14:46 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Ralston81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Ralston81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ralston81", } @Article{Denning:1981:SRR, author = "Peter J. Denning and David H. Brandin", title = "Special Report: Report of the {Public Cryptography Study Group}", journal = j-CACM, volume = "24", number = "7", pages = "434--434", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:07 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Denning81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Denning81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Denning81", } @Article{Baum:1981:RPC, author = "Werner A. Baum and David H. Brandin and R. Creighton Buck and George I. Davida and George Handelman and Martin E. Hellman and Ira Michael Heyman and Wilfred Kaplan and Daniel C. Schwartz", title = "Report of the {Public Cryptography Study Group}, prepared for {American Council on Education, One Dupont Circle, Washington, DC 20036, February 7, 1981}", journal = j-CACM, volume = "24", number = "7", pages = "435--445", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jan 28 14:37:22 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See the opposing view in \cite{Davida:1981:CAR}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Davida:1981:CAR, author = "George I. Davida", title = "The Case Against Restraints on Non-Governmental Research in Cryptography", journal = j-CACM, volume = "24", number = "7", pages = "445--450", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jan 28 14:39:33 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "This is an opposing view published with \cite{Baum:1981:RPC}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Greenberg:1981:RSS, author = "Harvey J. Greenberg and Richard P. O'Neill", title = "Representing super-sparse matrices with perturbed values", journal = j-CACM, volume = "24", number = "7", pages = "451--456", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C05 (90C05)", MRnumber = "82f:68033", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Billard:1981:PMA, author = "Brian Billard", title = "Polynomial manipulation with {APL}", journal = j-CACM, volume = "24", number = "7", pages = "457--465", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C20 (03B35)", MRnumber = "82f:68042", bibdate = "Tue Dec 26 18:50:57 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See corrigendum \cite{Billard:1982:CPM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Merkle:1981:SME, author = "Ralph C. Merkle and Martin E. Hellman", title = "On the security of multiple encryption", journal = j-CACM, volume = "24", number = "7", pages = "465--467", month = jul, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68K05 (94A24 94B99)", MRnumber = "82f:68103", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/crypto.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Demers:1981:SDU, author = "Richard A. Demers", title = "System Design for Usability", journal = j-CACM, volume = "24", number = "8", pages = "494--501", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Demers81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Demers81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Demers81", } @Article{Ash:1981:MPP, author = "William L. Ash", title = "{Mxec}: Parallel Processing with an Advanced Macro Facility", journal = j-CACM, volume = "24", number = "8", pages = "502--509", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:22:07 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Ash81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Ash81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ash81", } @Article{Mayer:1981:PCL, author = "Richard E. Mayer and Piraye Bayman", title = "Psychology of Calculator Languages: a Framework for Describing Differences in Users' Knowledge", journal = j-CACM, volume = "24", number = "8", pages = "511--520", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:02:20 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#MayerB81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "MayerB81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MayerB81", } @Article{Smith:1981:LTF, author = "Alan Jay Smith", title = "Long-Term File Migration: Development and Evaluation of Algorithms", journal = j-CACM, volume = "24", number = "8", pages = "521--532", month = aug, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:48:33 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Denning:1981:TKD, author = "D. E. Denning and M. S. Sacco", title = "Timestamps in Key Distribution Protocols", journal = j-CACM, volume = "24", number = "8", pages = "533--536", month = aug, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Denning:1981:CAS, author = "P. J. Denning", title = "Computer Architecture: Some Old Ideas that Haven'{T} Quite Made It Yet", journal = j-CACM, volume = "24", number = "9", pages = "553--554", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:44 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/risc.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "RISC", } @Article{Dwyer:1981:UFA, author = "Barry Dwyer", title = "A User-Friendly Algorithm", journal = j-CACM, volume = "24", number = "9", pages = "556--561", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:37:05 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Dwyer81a; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Dwyer81a", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dwyer81a", } @Article{Teitelbaum:1981:CPS, author = "Tim Teitelbaum and Thomas Reps", title = "The {Cornell Program Synthesizer}: a Syntax-directed Programming Environment", journal = j-CACM, volume = "24", number = "9", pages = "563--573", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:33 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See also: Report TR 80-421, Department of Computer Science, Cornell University, Ithaca, NY (May 1980).", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CPS", } @Article{ORourke:1981:LAF, author = "J. O'Rourke", title = "An on-line algorithm for fitting straight lines between data ranges", journal = j-CACM, volume = "24", number = "9", pages = "574--578", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:44:24 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/81.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "stabbing", } @Article{Quittner:1981:CSH, author = "P. Quittner and S. Csoka and S. Halasz and D. Kotsis and K. Varnai", title = "Comparison of Synonym Handling and Bucket Organization Methods", journal = j-CACM, volume = "24", number = "9", pages = "579--582", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 22 11:37:23 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A theoretical description of the access times required in open addressing and external chaining is given. Values are calculated for different record and bucket sizes and load factors, and the corresponding values for the two methods are compared. Practical guidelines for determining bucket sizes and load factors are presented. It is proved that open addressing is almost always superior to external chaining and the optimal bucket size is between 1 and 4.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{McEliece:1981:SSR, author = "R. J. McEliece and D. V. Sarwate", title = "On sharing secrets and {Reed--Solomon} codes", journal = j-CACM, volume = "24", number = "9", pages = "583--584", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "94B35", MRnumber = "82h:94024", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Fedorowicz:1981:CPP, author = "Jane Fedorowicz", title = "Comments on Price\slash Performance Patterns of {U.S.} Computer Systems", journal = j-CACM, volume = "24", number = "9", pages = "585--586", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:39:00 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Fedorowicz81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Fedorowicz81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fedorowicz81", } @Article{Kaiser:1981:AEA, author = "Gail E. Kaiser", title = "Automatic Extension of an {ATN} Knowledge Base", journal = j-CACM, volume = "24", number = "9", pages = "587--593", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:53:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Kaiser81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Kaiser81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kaiser81", } @Article{Rothe:1981:APM, author = "Christopher E. Rothe", title = "An Abstract Programming Model", journal = j-CACM, volume = "24", number = "9", pages = "594--596", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:17:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Rothe81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Rothe81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rothe81", } @Article{Gischer:1981:SLP, author = "Jay Gischer", title = "Shuffle Languages, {Petri} Nets, and Context-Sensitive Grammars", journal = j-CACM, volume = "24", number = "9", pages = "597--605", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68F05 (68D90 68F10)", MRnumber = "82h:68102", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Dunlavey:1981:LES, author = "Michael R. Dunlavey", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = j-CACM, volume = "24", number = "9", pages = "608--608", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:48:13 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Miller:1981:LES, author = "Lance A. Miller", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = j-CACM, volume = "24", number = "9", pages = "608--609", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:49:22 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Peterson:1981:LES, author = "James L. Peterson", title = "Letter to the {Editor}: On Spelling Correction and Beyond", journal = j-CACM, volume = "24", number = "9", pages = "609--609", month = sep, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Feb 04 16:49:21 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib", note = "See \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Chamberlin:1981:HES, author = "Donald D. Chamberlin and Morton M. Astrahan and Michael W. Blasgen and James N. Gray and W. Frank King and Bruce G. Lindsay and Raymod Lorie and James W. Mehl and Thomas G. Price and Franco Putzolo and Patricia Griffiths Selinger and Mario Schkolnick and Donald R. Slutz and Irving L. Traiger and Bradford W. Wade and Robert A. Yost", title = "A History and Evaluation of {System R}", journal = j-CACM, volume = "24", number = "10", pages = "632--646", month = oct, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jan 9 16:15:02 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprinted in M. Stonebraker, Readings in Database Sys., Morgan Kaufmann, San Mateo, CA, 1988", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "relation database IBM San Jose CACM", } @Article{Wegner:1981:SAP, author = "Peter Wegner", title = "Self-Assessment Procedure {VIII}: a Self-Assessment Procedure Dealing with the Programming Language {Ada}", journal = j-CACM, volume = "24", number = "10", pages = "647--678", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:28:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Wegner81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Wegner81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wegner81", } @Article{Robey:1981:CIS, author = "Daniel Robey", title = "Computer Information Systems and Organization Structure", journal = j-CACM, volume = "24", number = "10", pages = "679--687", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:16:32 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Robey81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Robey81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Robey81", } @Article{Denning:1981:LCS, author = "Peter J. Denning and T. Don Dennis and Jeffrey A. Brumfield", title = "Low Contention Semaphores and Ready Lists", journal = j-CACM, volume = "24", number = "10", pages = "687--699", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:27 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#DenningDb81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "DenningDb81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DenningDb81", } @Article{Patterson:1981:EHL, author = "David A. Patterson", title = "An Experiment in High Level Language Microprogramming and Verification", journal = j-CACM, volume = "24", number = "10", pages = "699--709", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:39 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Patterson81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Patterson81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Patterson81", } @Article{Denning:1981:PAE, author = "P. Denning", title = "Performance Analysis: Experimental computer science at its best", journal = j-CACM, volume = "24", number = "11", pages = "725--727", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Gass:1981:DMH, author = "Saul I. Gass and Karla L. Hoffman and Richard H. F. Jackson and Lambert S. Joel and Patsy B. Saunders", title = "Documentation for a Model: a Hierarchical Approach", journal = j-CACM, volume = "24", number = "11", pages = "728--733", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:43:19 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#GassHJJS81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "GassHJJS81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GassHJJS81", } @Article{Pechura:1981:MRN, author = "M. A. Pechura", title = "Microcomputers as remote nodes of a distributed system", journal = j-CACM, volume = "24", number = "11", pages = "734--738", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design", subject = "H.4 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications \\ H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Microprocessor/Microcomputer applications \\ C.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems", } @Article{Hiltz:1981:EUB, author = "Starr Roxanne Hiltz and Murray Turoff", title = "The Evolution of User Behavior in a Computerized Conference System", journal = j-CACM, volume = "24", number = "11", pages = "739--751", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "human factors", subject = "H.1.2 Information Systems, MODELS AND PRINCIPLES, User/Machine Systems, Human factors \\ H.4.3 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications, Electronic mail \\ C.2.0 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications", } @Article{Benbasat:1981:ESH, author = "Izak Benbasat and Albert S. Dexter and Paul S. Masulis", title = "An Experimental Study of the Human\slash Computer Interface", journal = j-CACM, volume = "24", number = "11", pages = "752--762", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:24:45 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#BenbasatDM81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "BenbasatDM81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BenbasatDM81", } @Article{Lientz:1981:PAS, author = "Bennet P. Lientz and E. Burton Swanson", title = "Problems in Application Software Maintenance", journal = j-CACM, volume = "24", number = "11", pages = "763--769", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:59:03 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#LientzS81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LientzS81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LientzS81", } @Article{Lamport:1981:TNP, author = "Leslie Lamport", title = "Technical Note: Password Authentication with Insecure Communication", journal = j-CACM, volume = "24", number = "11", pages = "770--772", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:57:19 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Lamport81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Lamport81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lamport81", } @Article{Pritchard:1981:CSA, author = "Paul Pritchard", title = "Corrigendum: {``A sublinear additive sieve for finding prime numbers''}", journal = j-CACM, volume = "24", number = "11", pages = "772--772", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "10A25 (68C25)", MRnumber = "82c:10011", MRreviewer = "Samuel S. {Wagstaff, Jr.}", bibdate = "Mon Jan 27 12:44:36 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See \cite{Pritchard:1981:SAS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Booth:1981:ASU, author = "K. S. Booth", title = "Authentication of Signatures Using Public Key Encryption", journal = j-CACM, volume = "24", number = "11", pages = "772--774", month = nov, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 22 11:36:41 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "One of Needham and Schroeder's proposed signature authentication protocols is shown to fail when there is a possibility of compromised keys: this invalidates one of the applications of their technique. A more elaborate mechanism is proposed which does not require a network clock, but does require a third party to the transaction. The latter approach is shown to be reliable in a fairly strong sence.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Bass:1981:GUI, author = "Leonard J. Bass and Ralph E. Bunker", title = "A Generalized User Interface for Applications Programs", journal = j-CACM, volume = "24", number = "12", pages = "796--800", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:23:48 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#BassB81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "BassB81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BassB81", } @Article{McCormack:1981:AFE, author = "William M. McCormack and Robert G. Sargent", title = "Analysis of future event set algorithms for discrete event simulation", journal = j-CACM, volume = "24", number = "12", pages = "801--812", month = dec, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68J05", MRnumber = "83f:68114", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; future event set", enum = "2100", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Galle:1981:AEG, author = "Per Galle", title = "An Algorithm for Exhaustive Generation of Building Floor Plans", journal = j-CACM, volume = "24", number = "12", pages = "813--825", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:43:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Galle81; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Galle81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Galle81", } @Article{Blackstone:1981:TLS, author = "John H. {Blackstone, Jr.} and Gary L. Hogg and Don T. Phillips", title = "A two-list synchronisation procedure for discrete event simulation", journal = j-CACM, volume = "24", number = "12", pages = "825--829", month = dec, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:45:15 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; time control; synchronization", enum = "306", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Jaeschke:1981:RHM, author = "G. Jaeschke", title = "Reciprocal Hashing: a Method for Generating Minimal Perfect Hashing Functions", journal = j-CACM, volume = "24", number = "12", pages = "829--833", month = dec, year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B15", MRnumber = "83f:68013", bibdate = "Mon Feb 12 14:34:32 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Hash functions, for a key $x$ in a set $S$ of positive integers, of the form $h(x) = (C/(Dx + E)) \bmod N$ are considered. Though the existence of $h$ is guaranteed, the scheme suffers from many practical problems because of exhaustive nature of the search for $h$.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Briggs:1981:PCB, author = "F. A. Briggs and M. Dubois", title = "Performance of cache-based multiprocessors", journal = j-CACM, volume = "24", number = "??", pages = "181--190", month = "????", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:44:26 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Multiprocessor system; cache memory; performance evaluation", enum = "401", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", xxnote = "Not in 1979--1982 volumes, or in ACM Computing Archive CD ROM.", } @Article{Gustafson:1982:SPE, author = "G. G. Gustafson and Roberta J. Kerr", title = "Some Practical Experience with a Software Quality Assurance Program", journal = j-CACM, volume = "25", number = "1", pages = "4--12", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:47:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#GustafsonK82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "GustafsonK82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GustafsonK82", } @Article{Sammet:1982:NCR, author = "Jean E. Sammet and Anthony Ralston", title = "The New (1982) {Computing Reviews} Classification System --- Final Version", journal = j-CACM, volume = "25", number = "1", pages = "13--25", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:18:25 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#SammetR82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SammetR82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SammetR82", } @Article{Robinson:1982:DGD, author = "Jane J. Robinson", title = "{DIAGRAM}: a Grammar for Dialogues", journal = j-CACM, volume = "25", number = "1", pages = "27--47", month = jan, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:33 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nlg.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Ahrens:1982:GGV, author = "J. H. Ahrens and U. Dieter", title = "Generating {Gamma} variates by a modified rejection technique", journal = j-CACM, volume = "25", number = "1", pages = "47--54", month = jan, year = "1982", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/360000/358390", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "65U05 (65C10)", MRnumber = "83f:65223", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "A suitable square root transformation of a gamma random variable with mean $a \ge 1$ yields a probability density close to the standard normal density. A modification of the rejection technique then begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time (95 percent if $a \ge 4$). When used with efficient subroutines for sampling from the normal and exponential distributions, the resulting accurate method is significantly faster than competing algorithms.", country = "USA", descriptors = "RNG; probability; statistics; distribution; gamma distribution; Poisson distribution; variance; normal distribution", enum = "49", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "24", } @Article{Shneiderman:1982:CFD, author = "Ben Shneiderman", title = "Control Flow and Data Structure Documentation: Two Experiments", journal = j-CACM, volume = "25", number = "1", pages = "55--63", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:21:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Shneiderman82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Shneiderman82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shneiderman82", } @Article{Bentley:1982:AAC, author = "Jon Louis Bentley and Mark G. Faust and Franco P. Preparata", title = "Approximation algorithms for convex hulls", journal = j-CACM, volume = "25", number = "1", pages = "64--68", month = jan, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "52-0468G99", MRnumber = "83m:52001", MRreviewer = "V. Medek", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "$O(n)$ time", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "approximation; convex hull; designing algorithms; two-dimensional; worst-case analysis", } @Article{Mozeico:1982:HCI, author = "Howard Mozeico", title = "A Human\slash Computer Interface to Accommodate User Learning Stages", journal = j-CACM, volume = "25", number = "2", pages = "100--104", month = feb, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:06:28 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Mozeico82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I36 human/computer interface", oldlabel = "Mozeico82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mozeico82", } @Article{Welsch:1982:UEM, author = "L. A. Welsch", title = "Using electronic mail as a teaching tool", journal = j-CACM, volume = "25", number = "2", pages = "105--108", month = feb, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "documentation; human factors", subject = "H.4.3 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications, Electronic mail \\ I.7 Computing Methodologies, TEXT PROCESSING, Text Editing \\ K.3 Computing Milieux, COMPUTERS AND EDUCATION, Computer Uses in Education", } @Article{Codd:1982:RDP, author = "E. F. Codd", title = "Relational Database: a Practical Foundation for Productivity", journal = j-CACM, volume = "25", number = "2", pages = "109--117", month = feb, year = "1982", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/358396.358400", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:33 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "This is the 1981 ACM Turing Award Lecture, delivered at ACM, Los Angeles, CA, Nov. 9, 1981.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Skelly:1982:APS, author = "Patrick G. Skelly", title = "The {ACM} Position on Standardization of the {Ada} Language", journal = j-CACM, volume = "25", number = "2", pages = "118--120", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:22:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Skelly82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Skelly82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Skelly82", } @Article{Ledgard:1982:SAT, author = "Henry F. Ledgard and Andrew Singer", title = "Scaling Down {Ada} (Or Towards a {Standard Ada Subset})", journal = j-CACM, volume = "25", number = "2", pages = "121--125", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:58:10 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#LedgardS82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LedgardS82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LedgardS82", } @Article{Chandy:1982:LHA, author = "K. M. Chandy and D. Neuse", title = "Linearizer: a heuristic algorithm for queueing network models of computing systems", journal = j-CACM, volume = "25", number = "2", pages = "126--134", month = feb, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:28:05 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, descriptors = "Queueing network; product form; analysis", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Zahorjan:1982:BJB, author = "John Zahorjan and Kenneth C. Sevcik and Derek L. Eager and Bruce Galler", title = "Balanced job bound analysis of queueing networks", journal = j-CACM, volume = "25", number = "2", pages = "134--141", month = feb, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C15 (90B22)", MRnumber = "83a:68042", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Queueing network; product form; analysis", enum = "8057", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Jacobson:1982:AQN, author = "P. A. Jacobson and E. D. Lazowska", title = "Analyzing queueing networks with simultaneous resource possession", journal = j-CACM, volume = "25", number = "2", pages = "142--151", month = feb, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:57 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Queueing network; analysis", enum = "7434", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Denning:1982:EJ, author = "Peter J. Denning", title = "Electronic Junk", journal = j-CACM, volume = "25", number = "3", pages = "163--165", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:08 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Denning82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Denning82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Denning82", } @Article{Shoch:1982:CPW, author = "John F. Shoch and Jon A. Hupp", title = "Computing Practices: The `Worm' Programs --- Early Experience with a Distributed Computation", journal = j-CACM, volume = "25", number = "3", pages = "172--180", month = mar, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:21:22 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/alife.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.1.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.object.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#ShochH82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "The ``worm'' programs were an experiment in the development of distributed computations: programs that span machine boundaries and also replicate themselves in idle machines. A ``worm'' is composed of multiple ``segments'', each running on a different machine. The underlying worm maintenance mechanisms are responsible for maintaining the worm -- finding free machines when needed and replicating the program for each additional segment. These techniques were successfully used to support several real applications, ranging from a simple multimachine test program to a more sophisticated real-time animation system harnessing multiple machines.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "obc olit distribution worms", oldlabel = "ShochH82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ShochH82", } @Article{Weiss:1982:SAP, author = "Eric A. Weiss", title = "Self-Assessment Procedure {IX}: a self-assessment procedure dealing with ethics in computing", journal = j-CACM, volume = "25", number = "3", pages = "181--195", month = mar, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:52:43 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "ACM code of ethics, scenarios, references.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Wasserman:1982:FP, author = "Anthony I. Wasserman and Steven Gutz", title = "The Future of Programming", journal = j-CACM, volume = "25", number = "3", pages = "196--206", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:28:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#WassermanG82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "WassermanG82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/WassermanG82", } @Article{McCall:1982:PRS, author = "Edward H. McCall", title = "Performance Results of the Simplex Algorithm for a Set of Real-World Linear Programming Models", journal = j-CACM, volume = "25", number = "3", pages = "207--212", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:02:24 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#McCall82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "McCall82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McCall82", } @Article{Billard:1982:CPM, author = "Brian Billard", title = "Corrigendum: {``Polynomial manipulation with {APL}''}", journal = j-CACM, volume = "25", number = "3", pages = "213--213", month = mar, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C20 03B35", MRnumber = "83g:68054", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "See \cite{Billard:1981:PMA}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Watkins:1982:TTC, author = "Marvin L. Watkins", title = "A Technique for Testing Command and Control Software", journal = j-CACM, volume = "25", number = "4", pages = "228--232", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:28:28 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Watkins82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Watkins82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Watkins82", } @Article{Mitchell:1982:CTN, author = "James G. Mitchell and Jeremy Dion", title = "A Comparison of Two Network-Based File Servers", journal = j-CACM, volume = "25", number = "4", pages = "233--245", month = apr, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:36:34 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "This paper compares two working network-based file servers, Xerox Distributed File System (XDFS) implemented at the Xerox Palo Alto Research Center, and the Cambridge File Server (CFS) implemented at the Cambridge University Computer Laboratory. Both servers support concurrent random access to files using atomic transactions, both are connected to local area networks, and both have been in service long enough to enable us to draw lessons from them for future file servers. We compare the servers in terms of design goals, implementation issues, performance, and their relative successes and failures, and discuss what we would do differently next time.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM operating XDFS CFS Cambridge lans", } @Article{Spector:1982:PRO, author = "Alfred Z. Spector", title = "Performing remote operations efficiently on a local computer network", journal = j-CACM, volume = "25", number = "4", pages = "246--260", month = apr, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:52:38 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A communication model is described that can service as a basis for a highly efficient communication subsystem for local networks. The model contains a taxonomy of communication instructions that can be implemented efficiently and can be a good basis for interprocessor communication. These communication instructions, called remote references, cause an operation to be performed by a remote process and, optionally, cause a value to be returned. This paper also presents implementation considerations for a communication system based upon the model and describes an experimental communication subsystem that provides one class of remote references. These remote references take about 150 microseconds or 50 average instruction times to perform on Xerox Alto computers connected by a 2.94 megabit Ethernet.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "performance; reliability", review = "ACM CR 39236", subject = "C.2.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol architecture \\ C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems \\ C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Access schemes \\ D.4.4 Software, OPERATING SYSTEMS, Communications Management, Message sending \\ D.4.4 Software, OPERATING SYSTEMS, Communications Management, Network communication \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", } @Article{Birrell:1982:GED, author = "Andrew D. Birrell and Roy Levin and Roger M. Needham and Michael D. Schroeder", title = "{Grapevine}: an exercise in distributed computing", journal = j-CACM, volume = "25", number = "4", pages = "260--274", month = apr, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Grapevine is a multicomputer system on the Xerox Research Internet. It provides facilities for the delivery of digital messages such as computer mail; for naming people, machines, and services; for authenticating people and machines; and for locating services on the internet. This paper has two goals: to describe the system itself and to serve as a case study of a real application of distributed computing. Part I describes the set of services provided by Grapevine and how its data and function are divided among computers on the internet. Part II presents in more detail selected aspects of Grapevine that illustrate novel facilities or implementation techniques, or that provide insight into the structure of a distributed system. Part III summarizes the current state of the system and the lessons learned from it so far.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design; distributed naming and binding; experimentation; reliability; replicated databases", review = "ACM CR 39273", subject = "C.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems C Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ D.4 Software, OPERATING SYSTEMS, Organization and Design \\ H.2 Information Systems, DATABASE MANAGEMENT, Systems \\ H.2 Information Systems, DATABASE MANAGEMENT, Database Administration \\ H.4 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications", } @Article{Gifford:1982:CSI, author = "D. K. Gifford and A. K. Jones", title = "Cryptographic Sealing for Information Security and Authentication", journal = j-CACM, volume = "25", number = "4", pages = "274--286", month = apr, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "A new protection mechanism is described that provides general primitives for protection and authentication. The mechanism is based on the idea of sealing an object with a key. Sealed objects are self-authenticating, and in the absence of an appropriate set of keys, only provide information about the size of their contents. New keys can be freely created at any time, and keys can also be derived from existing keys with operators that include Key-And and Key-Or. This flexibility allows the protection mechanism to implement common protection mechanisms such as capabilities, access control lists, and information flow control. The mechanism is enforced with a synthesis of conventional cryptography, public-key cryptography, and a threshold scheme.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM protection operating cryptography", } @Article{Howden:1982:CSD, author = "William E. Howden", title = "Contemporary Software Development Environments", journal = j-CACM, volume = "25", number = "5", pages = "318--329", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:51:07 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Howden82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Howden82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Howden82", } @Article{Suzuki:1982:APR, author = "Norihisa Suzuki", title = "Analysis of Pointer ``Rotation''", journal = j-CACM, volume = "25", number = "5", pages = "330--335", month = may, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:25:10 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Suzuki82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "functional", oldlabel = "Suzuki82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Suzuki82", } @Article{Franklin:1982:IAD, author = "Wm. Randolph Franklin", title = "On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors", journal = j-CACM, volume = "25", number = "5", pages = "336--337", month = may, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms", subject = "C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings \\ D.4.4 Software, OPERATING SYSTEMS, Communications Management, Message sending", } @Article{Morey:1982:EIQ, author = "Richard C. Morey", title = "Estimating and Improving the Quality of Information in a {MIS}", journal = j-CACM, volume = "25", number = "5", pages = "337--342", month = may, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:51:35 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "MIS's gets errors occurring because of input delays and overly or insufficiently stringent data edits. In the meantime, the record is out of date and in error. Shows how to forecast the level of improvement in the accuracy of the MIS record if these options are implemented. Considers type 1 and type 2 errors, does not deal well with inadequate input screening.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Levy:1982:MSF, author = "Michael R. Levy", title = "Modularity and the Sequential File Update Problem", journal = j-CACM, volume = "25", number = "6", pages = "362--367", month = jun, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:04:42 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Dodds:1982:PRD, author = "D. J. Dodds", title = "Pracniques: Reducing Dictionary Size by Using a Hashing Technique", journal = j-CACM, volume = "25", number = "6", pages = "368--370", month = jun, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:36:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Dodds82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Dodds82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dodds82", } @Article{Fournier:1982:CRS, author = "A. Fournier and D. Fussell and L. Carpenter", title = "Computer Rendering of Stochastic Models", journal = j-CACM, volume = "25", number = "6", pages = "371--384", month = jun, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 21 23:29:46 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM; I35 stochastic processes; model natural terrain stochastic", } @Article{Brown:1982:CCM, author = "James W. Brown", title = "Controlling the Complexity of Menu Networks", journal = j-CACM, volume = "25", number = "7", pages = "412--418", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:28:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Brown82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Brown82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brown82", } @Article{Meyer:1982:PPD, author = "Bertrand Meyer", title = "Principles of Package Design", journal = j-CACM, volume = "25", number = "7", pages = "419--428", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:04:11 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Meyer82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Meyer82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Meyer82", } @Article{Kearsley:1982:ASC, author = "Greg Kearsley", title = "Authoring Systems in Computer Based Education", journal = j-CACM, volume = "25", number = "7", pages = "429--437", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:54:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Kearsley82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Kearsley82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kearsley82", } @Article{Swartout:1982:IIS, author = "William Swartout and Robert Balzer", title = "On the Inevitable Intertwining of Specification and Implementation", journal = j-CACM, volume = "25", number = "7", pages = "438--440", month = jul, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 12:51:58 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "misc", } @Article{Gilchrist:1982:ISE, author = "Bruce Gilchrist and Arlaana Shenkin", title = "The Impact of Scanners on Employment in Supermarkets", journal = j-CACM, volume = "25", number = "7", pages = "441--445", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:44:17 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#GilchristS82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "GilchristS82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GilchristS82", } @Article{Weiser:1982:PUS, author = "Mark Weiser", title = "Programmers Use Slices When Debugging", journal = j-CACM, volume = "25", number = "7", pages = "446--452", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:29:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Weiser82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Weiser82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Weiser82", } @Article{Tsichritzis:1982:FM, author = "Dennis Tsichritzis", title = "Form management", journal = j-CACM, volume = "25", number = "7", pages = "453--478", month = jul, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design; languages; management", review = "ACM CR 39542", subject = "H.4 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Office Automation \\ H.4.3 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications, Electronic mail", } @Article{Vikas:1982:SDM, author = "Om Vikas and V. Rajaraman", title = "Searching in a Dynamic Memory with Fast Sequential Access", journal = j-CACM, volume = "25", number = "7", pages = "479--484", month = jul, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68E05 (68B15)", MRnumber = "83h:68098", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "1.5 log memory size search in a shuffle-cyclic memory with sorted entries.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Cheung:1982:EBA, author = "T-Y. Cheung", title = "Estimating Block Accesses and Number of Records in File Management", journal = j-CACM, volume = "25", number = "7", pages = "484--487", month = jul, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "selectivity CACM", } @Article{Elshoff:1982:ICP, author = "James L. Elshoff and Michael Marcotty", title = "Improving Computer Program Readability to Aid Modification", journal = j-CACM, volume = "25", number = "8", pages = "512--521", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 07:10:19 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#ElshoffM82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "ElshoffM82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ElshoffM82", } @Article{Turba:1982:LSL, author = "T. N. Turba", title = "Length-segmented lists", journal = j-CACM, volume = "25", number = "8", pages = "522--526", month = aug, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Jul 24 09:09:04 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; design; languages", subject = "D.4.3 Software, OPERATING SYSTEMS, File Systems Management, Access methods \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management, Directory structures \\ H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods \\ H.3.1 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Dictionaries \\ E.1 Data, DATA STRUCTURES, Lists \\ E.1 Data, DATA STRUCTURES, Tables \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Contiguous representations \\ H.3.1 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Indexing methods \\ H.4.1 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Office Automation, Word processing \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, Spelling", } @Article{Simmons:1982:RSS, author = "Robert F. Simmons and Daniel L. Chester", title = "Relating Sentences and Semantic Networks with Procedural Logic", journal = j-CACM, volume = "25", number = "8", pages = "527--547", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:21:46 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#SimmonsC82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SimmonsC82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SimmonsC82", } @Article{Berk:1982:HFS, author = "T. Berk and L. Brownston and A. Kaufman", title = "A Human Factors Study of Color Notation Systems for Computer Graphics", journal = j-CACM, volume = "25", number = "8", pages = "547--550", month = aug, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/siggraph/82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I36 color specification", } @Article{Doyle:1982:SSS, author = "M. S. Doyle and J. W. Graham", title = "A Study of Superfluity in Storage Hierarchies", journal = j-CACM, volume = "25", number = "8", pages = "550--555", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:36:44 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#DoyleG82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "DoyleG82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DoyleG82", } @Article{Lam:1982:TNC, author = "Clement W. H. Lam and Leonard H. Soicher", title = "Three New Combination Algorithms with the Minimal Change Property", journal = j-CACM, volume = "25", number = "8", pages = "555--559", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:57:11 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#LamS82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "LamS82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LamS82", } @Article{Pearl:1982:SBF, author = "Judea Pearl", title = "The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality", journal = j-CACM, volume = "25", number = "8", pages = "559--564", month = aug, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68G20 (68C25 68E10)", MRnumber = "83k:68096", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/tree-search.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Samet:1982:HLD, author = "Hanan Samet", title = "Heuristics for the Line Division Problem in Computer Justified Text", journal = j-CACM, volume = "25", number = "8", pages = "564--571", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:18:18 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Samet82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "typography", oldlabel = "Samet82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Samet82", } @Article{Martin:1982:EGC, author = "Johannes J. Martin", title = "An Efficient Garbage Compaction Algorithm", journal = j-CACM, volume = "25", number = "8", pages = "571--581", month = aug, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68B15", MRnumber = "83k:68013", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Mandelbrot:1982:CCR, author = "B. B. Mandelbrot", title = "Comment on Computer Rendering of Fractal Stochastic Models", journal = j-CACM, volume = "25", number = "8", pages = "581--584", month = aug, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:40:01 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I34 fractal stochastic models", } @Article{Gremillion:1982:DBF, author = "L. L. Gremillion", title = "Designing a {Bloom} Filter for Differential File Access", journal = j-CACM, volume = "25", number = "9", pages = "600--604", month = sep, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:33 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "files CACM", } @Article{Pechura:1982:FAT, author = "Michael A. Pechura", title = "File Archival Techniques Using Data Compression", journal = j-CACM, volume = "25", number = "9", pages = "605--609", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:57 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Pechura82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Pechura82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pechura82", } @Article{Shneiderman:1982:PDC, author = "Ben Shneiderman", title = "Pracniques: Designing Computer System Messages", journal = j-CACM, volume = "25", number = "9", pages = "610--611", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:21:13 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Shneiderman82a; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Shneiderman82a", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shneiderman82a", } @Article{Goodman:1982:UCE, author = "Seymour E. Goodman", title = "{U.S.} Computer Export Control Policies: Value Conflicts and Policy Choices", journal = j-CACM, volume = "25", number = "9", pages = "613--623", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:45:26 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Goodman82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Goodman82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Goodman82", } @Article{Chapman:1982:PTA, author = "David Chapman", title = "A Program Testing Assistant", journal = j-CACM, volume = "25", number = "9", pages = "625--634", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:30:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Chapman82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Chapman82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chapman82", } @Article{Lee:1982:ACVa, author = "Yong Tsui Lee and Aristides A. G. Requicha", title = "Algorithms for Computing the Volume and Other Integral Properties of Solids. {I}. Known Methods and Open Issues", journal = j-CACM, volume = "25", number = "9", pages = "635--641", month = sep, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "52-04 (51-04 65C05 65D30 68K05)", MRnumber = "84a:52003b", bibdate = "Tue Dec 26 16:40:00 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I35 volume computation of solids", } @Article{Lee:1982:ACVb, author = "Y. T. Lee and A. A. G. Requicha", title = "Algorithms for Computing the Volume and Other Integral Properties of Solids. {II}. {A} Family of Algorithms Based on Representation Conversion and Cellular Approximation", journal = j-CACM, volume = "25", number = "9", pages = "642--650", month = sep, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "52-04 (51-04 65C05 65D30 68K05)", MRnumber = "84a:52003a", bibdate = "Tue Dec 26 16:40:00 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I35 volume computation of solids", } @Article{Bic:1982:PMI, author = "Lubomir Bic", title = "A Protection Model and Its Implementation in a Dataflow System", journal = j-CACM, volume = "25", number = "9", pages = "650--658", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:26:18 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Bic82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Bic82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bic82", } @Article{Chin:1982:EPA, author = "Francis Y. Chin and John Lam and I Ngo Chen", title = "Efficient parallel algorithms for some graph problems", journal = j-CACM, volume = "25", number = "9", pages = "659--665", month = sep, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C25 (05C70 68E10)", MRnumber = "84a:68038", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Isner:1982:FPM, author = "J. F. Isner", title = "A {Fortran} Programming Methodology based on Data Abstraction", journal = j-CACM, volume = "25", number = "10", pages = "686--698", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:33 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Gillenson:1982:SPD, author = "Mark L. Gillenson", title = "The State of Practice of Data Administration--1981", journal = j-CACM, volume = "25", number = "10", pages = "699--706", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:06:21 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "Reports on a survey of IBM, IMS, and DOS DL/I account systems engineers in the US, and of personnel in internal IBM IMS user organizations in the US and Canada.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Lipsky:1982:ABT, author = "Lester Lipsky and Chee-Min Henry Lieu and Abolfazl Tehranipour and Appie van de Liefvoort", title = "On the Asymptotic Behavior of Time-Sharing Systems", journal = j-CACM, volume = "25", number = "10", pages = "707--714", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 29 07:19:49 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Beck:1982:DSA, author = "Leland L. Beck", title = "A Dynamic Storage Allocation Technique Based on Memory Residence Time", journal = j-CACM, volume = "25", number = "10", pages = "714--724", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:24:09 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Beck82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Beck82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Beck82", } @Article{Cohen:1982:CAM, author = "Jacques Cohen", title = "Computer-assisted microanalysis of programs", journal = j-CACM, volume = "25", number = "10", pages = "724--733", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Kornfeld:1982:CIA, author = "William A. Kornfeld", title = "Combinatorially Implosive Algorithms", journal = j-CACM, volume = "25", number = "10", pages = "734--738", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Nievergelt:1982:PSA, author = "J. Nievergelt and F. P. Preparata", title = "Plane-Sweep Algorithms for Intersecting Geometric Figures", journal = j-CACM, volume = "25", number = "10", pages = "739--747", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:40:04 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I35 intersecting geometric figures", } @Article{Houle:1982:CGD, author = "P. A. Houle", title = "Comment on gamma deviate generation", journal = j-CACM, volume = "25", number = "10", pages = "747--748", month = oct, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:57 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "RVG", enum = "7409", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Wicklund:1982:MEP, author = "Thomas L. Wicklund", title = "{MINI-EXEC}: a Portable Executive for $8$-Bit Microcomputers", journal = j-CACM, volume = "25", number = "11", pages = "772--780", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:29:33 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Wicklund82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Wicklund82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wicklund82", } @Article{Gauss:1982:PWF, author = "E. J. Gauss", title = "Pracniques: The ``Wolf Fence'' Algorithm for Debugging", journal = j-CACM, volume = "25", number = "11", pages = "780--??", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:43:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Gauss82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Gauss82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gauss82", } @Article{Nunamaker:1982:ISC, author = "Jay F. {Nunamaker, Jr.} and J. Daniel Couger and Gordon B. Davis", title = "Information Systems Curriculum Recommendations for the 80s: Undergraduate and Graduate Programs", journal = j-CACM, volume = "25", number = "11", pages = "781--805", month = nov, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Sep 30 15:08:25 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "A report of the ACM Curriculum Committee on Information Systems --- H4 is databases.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Sterling:1982:UPD, author = "Theodor D. Sterling", title = "Unionization of Professionals in Data Processing: An Assessment of Recent Trends", journal = j-CACM, volume = "25", number = "11", pages = "807--816", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:24:14 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Sterling82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Sterling82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sterling82", } @Article{Lageweg:1982:CAC, author = "B. J. Lageweg and J. K. Lenstra and A. H. G. Rinnooy Kan", title = "Computer-Aided Complexity Classification of Combinatorial Problems", journal = j-CACM, volume = "25", number = "11", pages = "817--822", month = nov, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68C25 (90B35)", MRnumber = "84d:68040a", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Lim:1982:HSD, author = "W. Y.-P. Lim", title = "{HISDL}: a structure description language", journal = j-CACM, volume = "25", number = "11", pages = "823--830", month = nov, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Sep 07 13:23:08 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design; languages", subject = "B.5.2 Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design Aids, Hardware description languages \\ B.6.3 Hardware, LOGIC DESIGN, Design Aids, Hardware description languages \\ B.4.3 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems), Topology \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Design languages", } @Article{Langer:1982:DGA, author = "A. M. Langer and A. W. Shum", title = "The Distribution of Granule Accesses Made by Database Transactions", journal = j-CACM, volume = "25", number = "11", pages = "831--832", month = nov, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:06:31 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Chandy:1982:DCG, author = "K. M. Chandy and J. Misra", title = "Distributed Computation on Graphs: Shortest Path Algorithms", journal = j-CACM, volume = "25", number = "11", pages = "833--837", month = nov, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68E10 (05C35 90B10)", MRnumber = "84e:68067", bibdate = "Mon Jan 29 07:21:39 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM", } @Article{Olson:1982:IOA, author = "Margrethe H. Olson and Henry C. {Lucas, Jr.}", title = "The Impact of Office Automation on the Organization: Some Implications for Research and Practice", journal = j-CACM, volume = "25", number = "11", pages = "838--847", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:10:36 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#OlsonL82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "OlsonL82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/OlsonL82", } @Article{Evans:1982:SEC, author = "Michael Evans", title = "Software Engineering for the {Cobol} Environment", journal = j-CACM, volume = "25", number = "12", pages = "874--882", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:38:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Evans82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Evans82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Evans82", } @Article{Gourd:1982:SAP, author = "Roger S. Gourd", title = "Self-Assessment Procedure {X}: a Self-Assessment Procedure Dealing with Software Project Management", journal = j-CACM, volume = "25", number = "12", pages = "883--887", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:45:53 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Gourd82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Gourd82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gourd82", } @Article{Minker:1982:CPW, author = "Jack Minker", title = "Computer Professionals Whose Scientific Freedom and Human Rights Have Been Violated --- 1982", journal = j-CACM, volume = "25", number = "12", pages = "888--894", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:04:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Minker82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Minker82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Minker82", } @Article{Lew:1982:EFD, author = "Art Lew", title = "On the Emulation of Flowcharts by Decision Tables", journal = j-CACM, volume = "25", number = "12", pages = "895--905", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:58:43 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Lew82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Lew82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lew82", } @Article{Gargantini:1982:EWR, author = "I. Gargantini", title = "An Effective Way to Represent Quadtrees", journal = j-CACM, volume = "25", number = "12", pages = "905--910", month = dec, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:39:55 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.82.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "I35 quadtree representation", } @Article{Vitter:1982:ICH, author = "J. S. Vitter", title = "Implementations for Coalesced Hashing", journal = j-CACM, volume = "25", number = "12", pages = "911--926", month = dec, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jul 18 19:48:12 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{ODonnell:1982:CFH, author = "M. J. O'Donnell", title = "A Critique of the Foundations of {Hoare} Style Programming Logics", journal = j-CACM, volume = "25", number = "12", pages = "927--934", month = dec, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", abstract = "Much recent discussion in computing journals has been devoted to arguments about the feasibility and usefulness of formal verification methods. Too little attention has been given to precise criticism of specific proposed systems for reasoning about programs. Wether such systems are to be used for formal verification, by hand or automatically, or as a rigorous foundation for informal reasoning, it is essential that they be logically sound. Several popular rules in the Hoare language are, in fact, not sound. These rules have been accepted because they have not been subjected to sufficiently strong standards of correctness. This paper attempts to clarify the different technical definitions of correctness of a logic, to show that only the strongest of these definitions is acceptable for Hoare logic, and to correct some of the unsound rules that have appeared in the literature. The corrected rules are given merely to show that it is possible to do so. Convenient and elegant rules for reasoning about certain programming constructs will probably require a more flexible notation than Hoare's.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Mor:1982:HCM, author = "M. Mor and A. S. Fraenkel", title = "A Hash Code Method for Detecting and Correcting Spelling Errors", journal = j-CACM, volume = "25", number = "12", pages = "935--938", month = dec, year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Jul 24 09:03:39 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; performance", review = "ACM CR 40850", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ H.3.1 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Dictionaries \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, Spelling", } @Article{Eastman:1982:CEN, author = "C. M. Eastman", title = "A Comment on {English} Neologisms and Programming Language Keywords", journal = j-CACM, volume = "25", number = "12", pages = "938--940", year = "1982", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:37:17 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Eastman82; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Eastman82", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Eastman82", } @Article{Samelson:1983:SFT, author = "K. Samelson and Friedrich L. Bauer", title = "Sequential Formula Translation (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "9--13", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:18:15 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#SamelsonB83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Samelson:1960:SFT}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SamelsonB83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SamelsonB83", } @Article{Irons:1983:SDC, author = "Edgar T. Irons", title = "A Syntax Directed Compiler for {ALGOL 60} (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "14--16", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:51:54 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Irons83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Irons:1961:SDC}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Irons83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Irons83", } @Article{Sussenguth:1983:UTS, author = "Edward H. {Sussenguth, Jr.}", title = "Use of Tree Structures for Processing Files (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "17--20", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:25:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Sussenguth83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Sussenguth:1963:UTS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Sussenguth83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sussenguth83", } @Article{Dijkstra:1983:SPC, author = "Edsger W. Dijkstra", title = "Solution of a Problem in Concurrent Programming Control (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "21--22", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:07:58 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Dijkstra:1965:SPC}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Weizenbaum:1983:ECP, author = "Joseph Weizenbaum", title = "{ELIZA} --- a Computer Program For the Study of Natural Language Communication Between Man And Machine (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "23--28", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:29:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Weizenbaum83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Weizenbaum:1966:ECP}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Weizenbaum83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Weizenbaum83", } @Article{Dennis:1983:PSM, author = "Jack B. Dennis and Earl C. {Van Horn}", title = "Programming Semantics for Multiprogrammed Computations (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "29--35", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:39 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#DennisH83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Dennis:1966:PSM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "DennisH83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DennisH83", } @Article{Maurer:1983:IHC, author = "W. D. Maurer", title = "An Improved Hash Code for Scatter Storage (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "36--38", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jul 19 01:13:05 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Maurer:1968:IHS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Morris:1983:SST, author = "Robert Morris", title = "Scatter Storage Techniques (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "39--42", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:10:10 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Morris:1968:SST}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Denning:1983:WSM, author = "Peter J. Denning", title = "The Working Set Model for Program Behaviour (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "43--48", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:35:09 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Denning83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Denning:1968:WSM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Denning83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Denning83", } @Article{Dijkstra:1983:SMS, author = "Edsger W. Dijkstra", title = "The Structure of the {``THE''}-Multiprogramming System (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "49--52", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:36:11 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Dijkstra83a; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Dijkstra:1968:SMS}.", acknowledgement = ack-nhfb, annote = "Design principles for correct programming systems", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Dijkstra83a", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dijkstra83a", } @Article{Hoare:1983:ABC, author = "C. A. R. Hoare", title = "An Axiomatic Basis for Computer Programming (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "53--56", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:09:18 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Hoare:1969:ABC}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Earley:1983:ECF, author = "Jay Earley", title = "An Efficient Context-Free Parsing Algorithm (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "57--61", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:08:28 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Earley:1970:ECF}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Bell:1983:QQM, author = "James R. Bell", title = "The Quadratic Quotient Method: a Hash Code Eliminating Secondary Clustering (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "62--63", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Feb 12 14:34:34 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Bell:1970:QQM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Codd:1983:RMD, author = "E. F. Codd", title = "A Relational Model of Data for Large Shared Data Banks (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "64--69", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:07:22 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Codd:1970:RMD}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Wirth:1983:PDS, author = "Niklaus Wirth", title = "Program Development by Stepwise Refinement (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "70--74", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:11:24 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Wirth:1971:PDS}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Parnas:1983:TSM, author = "David Lorge Parnas", title = "A Technique for Software Module Specification with Examples (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "75--78", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Parnas83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Parnas:1972:TSM}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Parnas83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Parnas83", } @Article{Kuki:1983:SSA, author = "H. Kuki and W. J. Cody", title = "A statistical study of the accuracy of floating point number systems (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "79--83", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Sep 6 22:00:00 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Kuki:1973:SSA}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations G Mathematics of Computing, PROBABILITY AND STATISTICS \\ B.2 Hardware, ARITHMETIC AND LOGIC STRUCTURES, Miscellaneous \\ B.5 Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design \\ D.2 Software, SOFTWARE ENGINEERING, General", } @Article{Ritchie:1983:UTS, author = "Dennis M. Ritchie and Ken Thompson", title = "The {UNIX} Time-Sharing System (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "84--89", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:13:58 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Ritchie:1974:UTS}.", abstract = "UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11/40 and 11/45 computers. It offers a number of features seldom found even in larger operating systems, including: (1) a hierarchical file system incorporating demountable volumes; (2) compatible file, device, and inter-process I/O; (3) the ability to initiate asynchronous processes; (4) system command languages selectable on a per-user basis; and (5) over 100 subsystems including a dozen languages. This paper discusses the nature and implementation of the file system and of the user command interface.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Metcalfe:1983:EDP, author = "Robert M. Metcalfe and David R. Boggs", title = "{Ethernet}: Distributed Packet Switching for Local Computer Networks", journal = j-CACM, volume = "26", number = "1", pages = "90--95", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Metcalfe:1976:EDP}.", abstract = "Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanisms provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multiprocessors. An Ethernet's shared communication facility, its Ether, is a passive broadcast medium with no central control. Coordination of access to the Ether for packet broadcasts is distributed among the contending transmitting stations using controlled statistical arbitration. Switching of packets to their destinations on the Ether is distributed among the receiving stations using packet address recognition. Design principles and implementation are described, based on experience with an operating Ethernet of 100 nodes along a kilometer of coaxial cable. A model for estimating performance under heavy loads and a packet protocol for error controlled communication are included for completeness.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", subject = "C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming \\ B.4 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices \\ B.4 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, General", } @Article{Rivest:1983:MOD, author = "R. L. Rivest and A. Shamir and L. Adleman", title = "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "96--99", month = jan, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Sep 22 11:37:34 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Rivest:1978:MOD}.", abstract = "An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be ``signed'' using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in ``electronic mail'' and ``electronic funds transfer'' systems. A message is encrypted by representing it as a number $M$, raising $M$ to a publicly specified power $e$, and then taking the remainder when the result is divided by the publicly specified product, $n$, of two large secret prime numbers $p$ and $q$. Decryption is similar; only a different, secret, power $d$ is used, where $e * d == 1(\mbox{mod}(p-1)*(q-1))$. The security of the system rests in part on the difficulty of factoring the published divisor, n.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Hoare:1983:CSP, author = "C. A. R. Hoare", title = "{Communicating Sequential Processes} (Reprint)", journal = j-CACM, volume = "26", number = "1", pages = "100--106", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:50:27 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Hoare83a; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprint of \cite{Hoare:1978:CSP}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Communicating Sequential Processes (CSP)", oldlabel = "Hoare83a", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare83a", } @Article{Zaki:1983:REF, author = "Ahmed S. Zaki", title = "Regulation of Electronic Funds Transfer: Impact and Legal Issues", journal = j-CACM, volume = "26", number = "2", pages = "112--118", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:31:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Zaki83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Zaki83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Zaki83", } @Article{Bell:1983:CMM, author = "Gordon Bell", title = "The {Computer Museum} Member's First Field Trip: The {Northbay AN\slash FSQ7 Sage} Site", journal = j-CACM, volume = "26", number = "2", pages = "118--119", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:24:24 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Bell83a; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Bell83a", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bell83a", } @Article{Kent:1983:SGF, author = "W. Kent", title = "A Simple Guide to Five Normal Forms in Relational Database Theory", journal = j-CACM, volume = "26", number = "2", pages = "120--125", month = feb, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", note = "Reprinted in A. R. Hurson, L. L. Miller, and S. H. Pakzad, Parallel Architectures for Database Systems, IEEE Computer Society Press, Washington, DC, 1989", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "CACM", } @Article{Bell:1983:MCD, author = "R. Charles Bell", title = "{Monte Carlo} Debugging: a Brief Tutorial", journal = j-CACM, volume = "26", number = "2", pages = "126--127", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:24:25 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Bell83b; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Bell83b", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bell83b", } @Article{Vessey:1983:SFA, author = "Iris Vessey and Ron Weber", title = "Some Factors Affecting Program Repair Maintenance: An Empirical Study", journal = j-CACM, volume = "26", number = "2", pages = "128--134", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:27:20 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#VesseyW83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "VesseyW83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/VesseyW83", } @Article{Srinivasan:1983:SDT, author = "B. Srinivasan", title = "On the Synthesis of Decision Tables", journal = j-CACM, volume = "26", number = "2", pages = "135--136", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:23:47 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Srinivasan83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Srinivasan83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Srinivasan83", } @Article{Mathey:1983:CMQ, author = "Michael J. Mathey and Bernard M. E. Moret", title = "The Computational Metaphor and Quantum Physics", journal = j-CACM, volume = "26", number = "2", pages = "137--145", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:02:10 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#MatheyM83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "MatheyM83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MatheyM83", } @Article{Schwarz:1983:FCT, author = "Arthur I. Schwarz", title = "On File Compression Techniques", journal = j-CACM, volume = "26", number = "2", pages = "148--148", month = feb, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 6 07:22:30 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Pechura:1983:FCT, author = "Michael Pechura", title = "On File Compression Techniques: Author's Response", journal = j-CACM, volume = "26", number = "2", pages = "148--149", month = feb, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 6 07:22:31 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Olson:1983:ROW, author = "M. H. Olson", title = "Remote office work: changing work patterns in space and time", journal = j-CACM, volume = "26", number = "3", pages = "182--187", month = mar, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "human factors; management", review = "ACM CR 40615", subject = "C.2.0 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications \\ H.4 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Office Automation \\ K.4 Computing Milieux, COMPUTERS AND SOCIETY, Organizational Impacts", } @Article{Pechura:1983:CTM, author = "Michael A. Pechura", title = "Comparing Two Microcomputer Operating Systems: {CP/M} and {HDOS}", journal = j-CACM, volume = "26", number = "3", pages = "188--195", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:11:58 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Pechura83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Pechura83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pechura83", } @Article{Chesnais:1983:MPA, author = "A. Chesnais and Erol Gelenbe and Isi Mitrani", title = "On the Modeling of Parallel Access to Shared Data", journal = j-CACM, volume = "26", number = "3", pages = "196--202", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:30:55 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#ChesnaisGM83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "ChesnaisGM83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ChesnaisGM83", } @Article{Lam:1983:TCA, author = "Simon S. Lam and Y. Luke Lien", title = "A tree convolution algorithm for the solution of queueing networks", journal = j-CACM, volume = "26", number = "3", pages = "203--215", month = mar, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:11:52 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Queueing network; bibliography; tree convolution algorithm; normalization constant", enum = "1866", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", references = "0", } @Article{Asai:1983:SOM, author = "Hitohisa Asai and C. K. Cheng", title = "Speeding Up an Overrelaxation Method of Division in Radix-$2^n$ Machine", journal = j-CACM, volume = "26", number = "3", pages = "216--220", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:22:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#AsaiC83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "arithmetic", oldlabel = "AsaiC83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AsaiC83", } @Article{Abrams:1984:EI, author = "P. Abrams", title = "Electronic islands", journal = j-CACM, volume = "26", number = "4", pages = "241--242", month = apr, year = "1984", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sun Aug 14 18:32:13 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "human factors", subject = "C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications \\ H.4.3 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Communications Applications, Electronic mail", } @Article{Brown:1983:EMN, author = "P. J. Brown", title = "Error Messages: The Neglected Area of the Man\slash Machine Interface?", journal = j-CACM, volume = "26", number = "4", pages = "246--249", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:28:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Brown83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Brown83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brown83", } @Article{Motzkin:1983:PM, author = "Dalia Motzkin", title = "Pracnique: {MEANSORT}", journal = j-CACM, volume = "26", number = "4", pages = "250--251", month = apr, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:06:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Motzkin83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "sorting", oldlabel = "Motzkin83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Motzkin83", } @Article{Schneider:1983:IHC, author = "Michael L. Schneider and John C. Thomas", title = "Introduction: The Humanization of Computer Interfaces", journal = j-CACM, volume = "26", number = "4", pages = "252--253", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:19:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#SchneiderT83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SchneiderT83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SchneiderT83", } @Article{Norman:1983:DRB, author = "Donald A. Norman", title = "Design Rules Based on Analyses of Human Error", journal = j-CACM, volume = "26", number = "4", pages = "254--258", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:09:51 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Norman83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Norman83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Norman83", } @Article{Jacob:1983:UFS, author = "Robert J. K. Jacob", title = "Using Formal Specifications in the Design of a Human-Computer Interface", journal = j-CACM, volume = "26", number = "4", pages = "259--264", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:52:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Jacob83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Jacob83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Jacob83", } @Article{Roberts:1983:ETE, author = "T. L. Roberts and T. P. Moran", title = "The Evaluation of Text Editors, Methodology and Empirical Results", journal = j-CACM, volume = "26", number = "4", pages = "265--283", month = apr, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:14:23 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "based on PhDthesis. Part is a keystroke model.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Sauter:1983:JHI, author = "Steven L. Sauter and Mark S. Gottlieb and Karen C. Jones and Vernon N. Dodson and Kathryn M. Rohrer", title = "Job and Health Implications of {VDT} Use: Initial results of the {Wisconsin--NIOSH} Study", journal = j-CACM, volume = "26", number = "4", pages = "284--294", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:19:08 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#SauterGJDR83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "SauterGJDR83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SauterGJDR83", } @Article{Gould:1983:CLS, author = "J. D. Gould and J. Conti and T. Hovanyecz", title = "Composing Letters with a Simulated Listening Typewriter", journal = j-CACM, volume = "26", number = "4", pages = "295--308", month = apr, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Dec 26 16:40:12 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/ai-articles.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "AI05", } @Article{Girill:1983:DIO, author = "T. R. Girill and Clement H. Luk", title = "{Document}: An Interactive, Online Solution to Four Documentation Problems", journal = j-CACM, volume = "26", number = "5", pages = "328--337", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:44:32 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#GirillL83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "GirillL83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GirillL83", } @Article{Ginzberg:1983:ITP, author = "Michael J. Ginzberg", title = "Introduction: Three Papers from the {Third International Conference on Information Systems}", journal = j-CACM, volume = "26", number = "5", pages = "339--??", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:44:29 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Ginzberg83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Ginzberg83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ginzberg83", } @Article{Abdel-Hamid:1983:DSP, author = "Tarek K. Abdel-Hamid and Stuart E. Madnick", title = "The Dynamics of Software Project Scheduling", journal = j-CACM, volume = "26", number = "5", pages = "340--346", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:20:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Abdel-HamidM83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Abdel-HamidM83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Abdel-HamidM83", } @Article{Mason:1983:PII, author = "R. E. A. Mason and T. T. Carey", title = "Prototyping Interactive Information Systems", journal = j-CACM, volume = "26", number = "5", pages = "347--354", month = may, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "misc information", } @Article{Will:1983:ALS, author = "H. J. Will", title = "{ACL}: a Language Specific for Auditors", journal = j-CACM, volume = "26", number = "5", pages = "356--361", year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:30:03 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Will83; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "Will83", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Will83", } @Article{Taylor:1983:GPA, author = "Richard N. Taylor", title = "A General-Purpose Algorithm for Analyzing Concurrent Programs", journal = j-CACM, volume = "26", number = "5", pages = "362--376", month = may, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Konvalina:1983:MPK, author = "John Konvalina and Stanley A. Wileman and Larry J. Stephens", title = "Math Proficiency: a Key to Success for Computer Science Students", journal = j-CACM, volume = "26", number = "5", pages = "377--381", month = may, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:09:47 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Hora:1983:EIF, author = "Stephen C. Hora", title = "Estimation of the inverse function for random variate generation", journal = j-CACM, volume = "26", number = "5", pages = "590--594", month = may, year = "1983", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 27 13:13:06 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib", acknowledgement = ack-nhfb, annote = "A regression method for estimating the inverse of a continuous cumulative probability function F(X) is presented. It is assumed that an ordered sample, $x_1,\ldots,x_n$, of identically and independently distributed random variables is available. A reference distribution $f_0(x)$ with known inverse $f_0^{-1}(p)$ is used to calculate the quantities $w_i=i(f_0(x_i)/f_0(x_{i+1}))$. These quantities are used to estimate the function $\gamma(p)=pd\ln=>f_0(f^{-1}(p))