%%% -*-BibTeX-*- %%% ==================================================================== %%% Bibtex-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.28", %%% date = "25 November 2005", %%% time = "07:31:23 MST", %%% 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 = "42500 25385 100207 1024811", %%% 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", %%% supported = "yes", %%% docstring = "This is a preliminary bibliography of %%% Communications of the ACM (CODEN CACMA2, ISSN %%% 0001-0782), covering (incompletely) 1980 -- %%% 1984, and completely 1985--1989 (see below). %%% %%% At version 2.28, the year coverage looked %%% like this: %%% %%% 1960 ( 2) 1971 ( 3) 1982 ( 89) %%% 1961 ( 1) 1972 ( 2) 1983 ( 125) %%% 1962 ( 0) 1973 ( 1) 1984 ( 141) %%% 1963 ( 1) 1974 ( 1) 1985 ( 100) %%% 1964 ( 1) 1975 ( 1) 1986 ( 99) %%% 1965 ( 1) 1976 ( 3) 1987 ( 90) %%% 1966 ( 2) 1977 ( 1) 1988 ( 112) %%% 1967 ( 1) 1978 ( 3) 1989 ( 118) %%% 1968 ( 5) 1979 ( 2) 1990 ( 2) %%% 1969 ( 1) 1980 ( 71) 1991 ( 0) %%% 1970 ( 6) 1981 ( 86) 1992 ( 1) %%% %%% Article: 1067 %%% Book: 2 %%% InProceedings: 2 %%% TechReport: 1 %%% %%% Total entries: 1072 %%% %%% 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|http://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-CACM = "Communications of the ACM"} @String{j-MANAGEMENT-SCIENCE = "Management Science"} @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-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", 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", note = "Addendum, 351.", acknowledgement = ack-nhfb, 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", bibdate = "Thu Sep 08 09:47:45 1994", note = "See also \cite{Novotny:1985:RNS}.", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, 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", 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", acknowledgement = ack-nhfb, 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", bibdate = "Thu Sep 08 09:47:54 1994", note = "See also \cite{Misra:1975:RG,Er:1985:RG}.", acknowledgement = ack-nhfb, } @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", 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", 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, 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", bibdate = "Sat Feb 01 07:09:04 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.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.", } @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", bibdate = "Mon Jul 26 18:50:48 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib", acknowledgement = ack-nhfb, annote = "The first introduction of protection and capabilities.", 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", bibdate = "Thu Sep 08 09:47:54 1994", note = "See also \cite{Lozy:1976:RCS,Hill:1985:RCS}.", acknowledgement = ack-nhfb, } @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", bibdate = "Tue Jul 19 23:00:01 1994", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 07:06:01 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Morris68", 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, 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", 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", 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, 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''}-Multiprogramming System", journal = j-CACM, volume = "11", number = "5", pages = "341--346", year = "1968", CODEN = "CACMA2", ISSN = "0001-0782", bibdate = "Mon Jan 22 06:36:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Dijkstra68", acknowledgement = ack-nhfb, oldlabel = "Dijkstra68", 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", bibdate = "Mon Sep 19 23:32:16 1994", note = "See also \cite{Tracht:1982:RNR}.", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, checked = "24 August 1990", classcodes = "C4290 (Other computer theory)", corpsource = "The Queen's Univ., Belfast, UK", 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", 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", 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", 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", bibdate = "Mon Jan 22 06:24:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Bell70", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "Digital Equipment Corp., Maynard, MA, USA", 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", ISSN = "0001-0782", bibdate = "Mon Jan 22 06:31:56 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Codd70", note = "Also published in/as: `Readings in Database Systems', M. Stonebraker, Morgan-Kaufmann, 1988, pp. 5--15", 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", 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", bibdate = "Thu Sep 08 09:47:54 1994", note = "See also \cite{Lozy:1979:RSD,Hill:1981:RSD}.", acknowledgement = ack-nhfb, } @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", bibdate = "Thu Apr 29 17:35:09 1999", note = "See also \cite{Hill:1981:RSD,Hill:1981:RSQ,Lozy:1979:RSD}.", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, classcodes = "C6110 (Systems analysis and programming)", corpsource = "Eidgenossische Tech. Hochschule, Zurich, Switzerland", 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", bibdate = "Mon Feb 12 14:33:53 1996", note = "See also \cite{Sipala:1977:RSM,Gustavson:1978:RSM,Harms:1980:RSM}.", acknowledgement = ack-nhfb, } @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", bibdate = "Tue Sep 20 19:47:21 1994", note = "See also \cite{Tharp:1982:PTS}.", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, classcodes = "C6110 (Systems analysis and programming)", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", 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", 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", 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", 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", bibdate = "Mon Jan 22 07:16:12 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib and ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#RitchieT74", 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", 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", bibdate = "Mon Jan 27 12:31:20 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.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, 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", bibdate = "Mon Jan 22 07:04:09 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#MetcalfeB76", 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", 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{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", 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 and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib and ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#RivestSA78", 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", 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", 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", 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", 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", 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", 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.", } @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", bibdate = "Tue Dec 26 16:39:32 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib", acknowledgement = ack-nhfb, annote = "(VBI-001200)", country = "USA", descriptors = "Computer network; traffic measurement", enum = "10738", language = "English", 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", bibdate = "Mon Jan 22 07:02:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Mazlack80", acknowledgement = ack-nhfb, 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", 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", bibdate = "Thu Apr 29 17:34:47 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib", note = "See remarks in \cite{Jaeschke:1980:CMP}, and the author's response in \cite{Cichelli:1980:CMP}, 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.", } @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", MRclass = "94C30 (68C25)", MRnumber = "80m:94112", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", bibdate = "Wed Sep 21 22:56:05 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 29 06:49:39 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 29 06:49:39 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 29 06:49:39 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 29 06:49:39 2001", acknowledgement = ack-nhfb, } @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", 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", 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.", 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", bibdate = "Mon Jan 22 06:29:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#CanonFHHMR80", acknowledgement = ack-nhfb, 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.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, 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", bibdate = "Mon Jan 27 12:36:07 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib and ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.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, } @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", bibdate = "Wed Sep 21 22:55:32 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib and ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.synch.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, 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.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, } @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", bibdate = "Mon Jan 22 07:02:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#McCracken80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:22:16 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Auerbach80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:37:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Eckert80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:59:10 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Ling80", acknowledgement = ack-nhfb, 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", ISSN = "0001-0782", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib", acknowledgement = ack-nhfb, 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", bibdate = "Wed Sep 21 22:56:16 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib", acknowledgement = ack-nhfb, } @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", bibdate = "Tue Dec 26 16:39:37 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib", acknowledgement = ack-nhfb, 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", bibdate = "Wed Sep 21 22:52:38 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/raum.bib and ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:45:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#GoldGW80", acknowledgement = ack-nhfb, 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/is.bib", acknowledgement = ack-nhfb, } @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", 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", note = "This paper contains an $n \log(n)$ deterministic algorithm for finding nearest neighbors in two-dimensional space.", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:44:38 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Glass80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 07:26:50 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Turner80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 07:20:36 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#SethiC80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 07:00:54 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Maes80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 27 12:32:07 1997", acknowledgement = ack-nhfb, } @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", MRclass = "68C25", MRnumber = "81j:68049", MRreviewer = "Ondrej S{\'y}kora", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 06:51:01 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#House80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:30:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#ChambersS80", acknowledgement = ack-nhfb, 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", bibdate = "Wed Aug 24 21:14:52 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.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.", 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", bibdate = "Mon Jan 27 12:31:45 1997", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 06:23:08 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#BannoHKMMTYYHS80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 27 12:32:09 1997", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 27 12:32:35 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.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", language = "English", 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", bibdate = "Mon Jan 22 07:00:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#LuccioP80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 27 12:36:31 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/da.3d-metaphors.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, } @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", bibdate = "Mon Jan 22 07:26:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#TrianceY80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:32:22 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#Compton80", acknowledgement = ack-nhfb, 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 = "http://doi.acm.org/10.1145/358896.358899", ISSN = "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", acknowledgement = ack-nhfb, 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", bibdate = "Tue Dec 26 16:39:33 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:48:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#HalsteadS80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:47:59 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#HallSS80", acknowledgement = ack-nhfb, 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", MRclass = "65B10", MRnumber = "81h:65002", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 06:30:14 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#ChandY80", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:58:12 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#LedgardWSS80", acknowledgement = ack-nhfb, 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib", acknowledgement = ack-nhfb, } @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", 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 and ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.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", } @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", bibdate = "Wed Sep 21 23:01:30 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib and ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.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", 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", bibdate = "Mon Jan 27 12:34:24 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib", acknowledgement = ack-nhfb, 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", bibdate = "Tue Dec 26 18:50:31 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.80.bib", note = "See corrigendum \cite{Pitteway:1981:CAG}.", acknowledgement = ack-nhfb, 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", 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", acknowledgement = ack-nhfb, 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/scheme.bib", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 27 12:34:57 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.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", language = "English", 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", bibdate = "Sun Feb 04 16:47:16 1996", note = "See remarks \cite{Dunlavey:1981:LES,Miller:1981:LES,Peterson:1981:LES}.", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 27 12:35:08 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Learning.bib", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 27 12:35:25 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/80.bib", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 27 12:35:44 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.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", language = "English", 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", bibdate = "Mon Jan 29 07:00:33 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 29 07:00:33 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Tue Jul 19 22:51:08 1994", note = "This letter to the editor contains comments on \cite{Cichelli:1980:MPH}, together with a response from R. J. Cichelli \cite{Cichelli:1980:CMP}.", acknowledgement = ack-nhfb, } @Article{Cichelli:1980:CMP, author = "R. J. Cichelli", title = "Technical Correspondence: On {Cichelli}'s Minimal Perfect Hash Functions Method", journal = j-CACM, volume = "23", number = "12", pages = "729--729", month = dec, year = "1980", CODEN = "CACMA2", ISSN = "0001-0782", bibdate = "Thu Apr 29 18:36:31 1999", note = "This is the author's response to the comments in \cite{Jaeschke:1980:CMP} about \cite{Cichelli:1980:MPH}. See also \cite{Sager:1985:PTG}.", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 29 06:34:29 2001", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 06:37:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Dwyer81", acknowledgement = ack-nhfb, 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", 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 and ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.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, } @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", MRclass = "10A25 (68C25)", MRnumber = "82c:10011", MRreviewer = "Samuel S. {Wagstaff, Jr.}", bibdate = "Mon Jan 27 12:44:40 1997", note = "See corrigendum \cite{Pritchard:1981:CSA}.", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 06:54:13 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Keen81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:56:23 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Krull81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:43:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Gauss81", acknowledgement = ack-nhfb, 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 = "http://doi.acm.org/10.1145/358549.358561", ISSN = "0001-0782", bibdate = "Mon Jan 22 06:50:25 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Hoare81", note = "This is the 1980 ACM Turing Award Lecture, delivered at ACM'80, Nashville, Tennessee, October 27, 1980.", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 06:30:41 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Chaum81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 29 06:37:45 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/81.bib", note = "See \cite{Pitteway:1980:BAG}.", acknowledgement = ack-nhfb, 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", MRclass = "68B15", MRnumber = "82i:68016", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 07:01:34 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Mantai81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 27 12:40:15 1997", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 07:10:06 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nunamaker81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 07:04:34 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Minker81", acknowledgement = ack-nhfb, 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", bibdate = "Tue Dec 26 16:39:40 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", acknowledgement = ack-nhfb, } @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", bibdate = "Mon Jan 22 07:06:24 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Mowshowitz81", acknowledgement = ack-nhfb, 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", 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", acknowledgement = ack-nhfb, country = "USA", descriptors = "Discrete event simulation", enum = "2239", language = "English", 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", bibdate = "Mon Jan 22 07:10:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Oren81", acknowledgement = ack-nhfb, 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", MRclass = "68J10", MRnumber = "82d:68061", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, } @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", 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", acknowledgement = ack-nhfb, country = "USA", descriptors = "Continuous simulation; waiting time; M/M/N; queueing approximation; traffic theory", enum = "592", language = "English", 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", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7859", language = "English", 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", MRclass = "68J05", MRnumber = "82d:68059", bibdate = "Tue Dec 26 13:35:07 1995", acknowledgement = ack-nhfb, } @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", MRclass = "68J05", MRnumber = "82d:68060", bibdate = "Tue Dec 26 13:35:07 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7862", language = "English", 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", bibdate = "Tue Dec 26 16:39:46 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib", acknowledgement = ack-nhfb, country = "USA", descriptors = "Simulation; statistical technique", enum = "7228", language = "English", 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", bibdate = "Wed Sep 21 23:15:15 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.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", } @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", bibdate = "Mon Jan 22 06:59:26 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#LiteckyR81", acknowledgement = ack-nhfb, 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", bibdate = "Mon Jan 22 07:16:39 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81", acknowledgement = ack-nhfb, 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 = "Experiments With a Space Efficient Way to Store a Dictionary", journal = j-CACM, volume = "24", number = "5", pages = "297--298", year = "1981", CODEN = "CACMA2", ISSN = "0001-0782", bibdate = "Mon Jan 22 07:09:42 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81", acknowledgement = ack-nhfb, oldlabel = "Nix81", 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", bibdate = "Mon Jan 22 06:51:50 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Inglis81", acknowledgement = ack-nhfb, 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", 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", acknowledgement = ack-nhfb, } @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", bibdate = "Tue Dec 26 16:39:40 1995", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/graphics.bib and ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib and ftp://ftp.ira.uka.de/pub/siggraph/81.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", 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", bibdate = "Mon Jan 22 06:34:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Crockett81", acknowledgement = ack-nhfb, oldlabel = "Crockett81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Crocke