%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.34",
%%%     date            = "13 January 2011",
%%%     time            = "17:33:39 MDT",
%%%     filename        = "cacm1970.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        = "48281 45368 209760 2079426",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, CACM, Communications of the
%%%                        ACM",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of the journal
%%%                        Communications of the ACM (CODEN CACMA2, ISSN
%%%                        0001-0782), covering (incompletely) 1970 --
%%%                        1979.
%%%
%%%                        At version 2.34, the year coverage looked
%%%                        like this:
%%%
%%%                             1961 (   1)    1972 ( 179)    1983 (   1)
%%%                             1962 (   1)    1973 ( 162)    1984 (   0)
%%%                             1963 (   5)    1974 ( 138)    1985 (   3)
%%%                             1964 (   4)    1975 ( 121)    1986 (   1)
%%%                             1965 (   2)    1976 (  96)    1987 (   0)
%%%                             1966 (   3)    1977 ( 121)    1988 (   1)
%%%                             1967 (   3)    1978 ( 120)    1989 (   0)
%%%                             1968 (   6)    1979 (  81)    1990 (   2)
%%%                             1969 (   8)    1980 (   1)    1991 (   4)
%%%                             1970 ( 157)    1981 (   2)    1992 (   1)
%%%                             1971 ( 106)    1982 (   1)
%%%
%%%                             Article:       1324
%%%                             Book:             3
%%%                             InProceedings:    1
%%%                             Manual:           1
%%%                             MastersThesis:    1
%%%                             PhdThesis:        1
%%%
%%%                             Total entries: 1331
%%%
%%%                        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 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 the Compendex database
%%%                        (1970--1979), from the IEEE INSPEC database
%%%                        (1970--1979), 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 <at>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
                Hari-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
                Scheu-er-mann
                Schwach-heim
                Schob-bens
                Schon-berg
                Sho-sha-ni
                Si-tha-ra-ma
                Skwa-rec-ki
                Streck-er
                Strin-gi-ni
                Tes-ler
                Te-zu-ka
                Teu-ho-la
                Till-quist
                Town-send
                Tsi-chri-tzis
                Tur-ski
                Vuille-min
                Wald-ing-er
                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/|"}

@String{ack-nj =   "Norbert Juffa,
                  2445 Mission College Blvd.
                  Santa Clara, CA 95054
                  USA
                  email: \path=norbert@iit.com="}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-CACM                  = "Communications of the ACM"}

@String{j-COMP-SURV             = "Computing Surveys"}

@String{j-J-ACM                 = "Journal of the ACM"}

@String{j-MANAGEMENT-SCIENCE    = "Management Science"}

@String{j-SIAM-J-COMPUT         = "SIAM Journal of Computing"}

@String{j-SPE                   = "Software --- Practice and Experience"}

@String{j-TOMS                  = "ACM Transactions on Mathematical Software"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-ANSI                = "American National Standards Institute"}

@String{pub-ANSI:adr            = "1430 Broadway, New York, NY 10018, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}

@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-MORGAN-KAUFMANN     = "Morgan Kaufmann Publishers"}

@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}

@String{pub-SUCSLI              = "Stanford University Center for the Study of
                                  Language and Information"}

@String{pub-SUCSLI:adr          = "Stanford, CA, USA"}

%%% ====================================================================
%%% Bibliography entries (cross-references in notes necessitate
%%% inclusion of a few additional entries published elsewhere):

@Article{Herndon:1961:AASa,
  author =       "J. R. Herndon",
  title =        "{ACM Algorithm 49}: Spherical {Neumann} Function",
  journal =      j-CACM,
  volume =       "4",
  number =       "4",
  pages =        "179",
  month =        apr,
  year =         "1961",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Coleman:1978:RAS}.",
  acknowledgement = ack-nhfb,
}

@Article{Merner:1962:AAC,
  author =       "J. N. Merner",
  title =        "{ACM Algorithm 149}: Complete Elliptic Integral",
  journal =      j-CACM,
  volume =       "5",
  number =       "12",
  pages =        "605",
  month =        dec,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Skovgaard:1978:RCE}.",
  acknowledgement = ack-nhfb,
}

@Article{Arthurs:1963:AAL,
  author =       "T. D. Arthurs",
  title =        "{ACM Algorithm 176}: Least Squares Surface Fit",
  journal =      j-CACM,
  volume =       "6",
  number =       "6",
  pages =        "313",
  month =        jun,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:31:33 1994",
  note =         "See remark \cite{Schuegraf:1972:RAL}.",
  acknowledgement = ack-nhfb,
}

@Article{Ludwig:1963:AAI,
  author =       "O. G. Ludwig",
  title =        "{ACM Algorithm 179}: Incomplete Beta Ratio",
  journal =      j-CACM,
  volume =       "6",
  number =       "6",
  pages =        "314",
  month =        jun,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Pike:1976:RIB,Bosten:1974:RAI}.",
  acknowledgement = ack-nhfb,
}

@Article{Relph:1963:AAH,
  author =       "A. P. Relph",
  title =        "{ACM Algorithm 191}: Hypergeometric",
  journal =      j-CACM,
  volume =       "6",
  number =       "7",
  pages =        "388--389",
  month =        jul,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:02 1994",
  note =         "See certification \cite{Koppelaar:1974:CRA}.",
  acknowledgement = ack-nhfb,
}

@Article{Thurnau:1963:AAB,
  author =       "D. H. Thurnau",
  title =        "{ACM Algorithm 195}: {BANDSOLVE}",
  journal =      j-CACM,
  volume =       "6",
  number =       "8",
  pages =        "441",
  month =        aug,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:11 1994",
  note =         "See remark \cite{Schuegraf:1972:RAB}.",
  acknowledgement = ack-nhfb,
}

@Article{Kase:1963:AAT,
  author =       "R. H. Kase",
  title =        "{ACM Algorithm 219}: Topological Ordering for {Pert}
                 Networks",
  journal =      j-CACM,
  volume =       "6",
  number =       "12",
  pages =        "738--739",
  month =        dec,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:51 1994",
  note =         "See also \cite{Tenney:1977:RAT}.",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1964:AAI,
  author =       "W. Gautschi",
  title =        "{ACM Algorithm 222}: Incomplete Beta Function Ratios",
  journal =      j-CACM,
  volume =       "7",
  number =       "3",
  pages =        "143--144",
  month =        mar,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:19 1994",
  note =         "See remark \cite{Kolm:1971:MAL,Ellis:1974:RAHb}.",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1964:AAB,
  author =       "W. Gautschi",
  title =        "{ACM Algorithm 236}: {Bessel} Functions of the First
                 Kind",
  journal =      j-CACM,
  volume =       "7",
  number =       "8",
  pages =        "479--480",
  month =        aug,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Skovgaard:1975:RBF}.",
  acknowledgement = ack-nhfb,
}

@Article{Boothroyd:1964:AAG,
  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{Floyd:1964:AAT,
  author =       "R. W. Floyd",
  title =        "{ACM Algorithm 245}: Treesort 3",
  journal =      j-CACM,
  volume =       "7",
  number =       "12",
  pages =        "701",
  month =        dec,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:18 1994",
  note =         "See certification \cite{London:1970:CAM}.",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1965:AAL,
  author =       "W. Gautschi",
  title =        "{ACM Algorithm 259}: {Legendre} Functions for
                 Arguments Larger than One",
  journal =      j-CACM,
  volume =       "8",
  number =       "8",
  pages =        "488--492",
  month =        aug,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Jansen:1977:RLF}.",
  acknowledgement = ack-nhfb,
}

@Article{Pike:1965:AAP,
  author =       "M. C. Pike and I. D. Hill",
  title =        "{ACM Algorithm 266}: Pseudo-Random Numbers",
  journal =      j-CACM,
  volume =       "8",
  number =       "10",
  pages =        "605--606",
  month =        oct,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:34 1994",
  note =         "See certification \cite{Sullins:1972:CAP}.",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1966:AD,
  author =       "Walter Gautschi",
  title =        "{Algorithm 282}: {Derivatives} of $e^x/x$,
                 $\cos(x)/x$, and $\sin(x)/x$",
  journal =      j-CACM,
  volume =       "9",
  number =       "4",
  pages =        "272--272",
  month =        apr,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Nov 25 18:20:05 MST 2005",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/",
  note =         "See remark \cite{Gautschi:1970:RAD}.",
  acknowledgement = ack-nhfb,
  keywords =     "$\cos(x)/x$; $\sin(x)/x$; $e^x/x$; elementary
                 functions",
}

@Article{Fletcher:1966:AAI,
  author =       "W. Fletcher",
  title =        "{ACM Algorithm 284}: Interchange of Two Blocks of
                 Data",
  journal =      j-CACM,
  volume =       "9",
  number =       "5",
  pages =        "326",
  month =        may,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Ito:1976:RIT}.",
  acknowledgement = ack-nhfb,
}

@Article{Hill:1967:AAC,
  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{Gunn:1967:AAC,
  author =       "J. H. Gunn",
  title =        "{ACM Algorithm 300}: {Coulomb} Wave Functions",
  journal =      j-CACM,
  volume =       "10",
  number =       "4",
  pages =        "244--245",
  month =        apr,
  year =         "1967",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:53 1994",
  note =         "See remark \cite{Vos:1973:RAC}.",
  acknowledgement = ack-nhfb,
}

@Article{Brown:1967:AAS,
  author =       "K. M. Brown",
  title =        "{ACM Algorithm 316}: Solution of Simultaneous
                 Nonlinear Equations",
  journal =      j-CACM,
  volume =       "10",
  number =       "11",
  pages =        "728--729",
  month =        nov,
  year =         "1967",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:50 1994",
  note =         "See remark \cite{Raduchel:1971:RAS}.",
  acknowledgement = ack-nhfb,
}

@Article{Ord-Smith:1968:AAG,
  author =       "R. J. Ord-Smith",
  title =        "{ACM Algorithm 323}: Generation of Permutations in
                 Lexicographic Order",
  journal =      j-CACM,
  volume =       "11",
  number =       "2",
  pages =        "117",
  month =        feb,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:33:05 1994",
  note =         "See certification \cite{Leitch:1969:CGP} and remark
                 \cite{Roy:1973:RAG}.",
  acknowledgement = ack-nhfb,
}

@Article{Bayer:1968:AAM,
  author =       "G. Bayer",
  title =        "{ACM Algorithm 324}: Maxflow",
  journal =      j-CACM,
  volume =       "11",
  number =       "2",
  pages =        "117--118",
  month =        feb,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:32:59 1994",
  note =         "See remark \cite{Bayer:1973:RAM}.",
  acknowledgement = ack-nhfb,
}

@Article{Dijkstra:1968:GSC,
  author =       "Edsger Wybe Dijkstra",
  title =        "Go to statement considered harmful",
  journal =      j-CACM,
  volume =       "11",
  number =       "3",
  pages =        "147--148",
  month =        mar,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  note =         "This paper inspired scores of others, published mainly
                 in SIGPLAN Notices up to the mid-1980s. The best-known
                 is \cite{Knuth:1974:SPG}.",
  acknowledgement = ack-nhfb,
}

@Article{Witte:1968:AAJ,
  author =       "B. F. W. Witte",
  title =        "{ACM Algorithm 332}: {Jacobi} Polynomials",
  journal =      j-CACM,
  volume =       "11",
  number =       "6",
  pages =        "436--437",
  month =        jun,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:33:08 1994",
  note =         "See remark \cite{Skovgaard:1975:RAJ}.",
  acknowledgement = ack-nhfb,
}

@Article{Salazar:1968:AAM,
  author =       "R. C. Salazar and S. K. Sen",
  title =        "{ACM Algorithm 333}: Minit Algorithm For Linear
                 Programming",
  journal =      j-CACM,
  volume =       "11",
  number =       "6",
  pages =        "437--440",
  month =        jun,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:33:06 1994",
  note =         "See remark
                 \cite{Holmgren:1973:RAM,Obradovic:1973:RAM}.",
  acknowledgement = ack-nhfb,
}

@Article{Grad:1968:AAE,
  author =       "J. Grad and M. A. Brebner",
  title =        "{ACM Algorithm 343}: Eigenvalues and Eigenvectors of a
                 Real Generator Matrix",
  journal =      j-CACM,
  volume =       "11",
  number =       "12",
  pages =        "820--826",
  month =        dec,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Mar 24 21:38:51 MST 1997",
  note =         "See remark \cite{Niessner:1972:RAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Computer Services, Univ. Birmingham, UK",
  keywords =     "eigenvalues and eigenfunctions; matrix algebra",
}

@Article{Singleton:1969:AAEa,
  author =       "R. C. Singleton",
  title =        "{ACM Algorithm 347}: An Efficient Algorithm for
                 Sorting with Minimal Storage",
  journal =      j-CACM,
  volume =       "12",
  number =       "3",
  pages =        "185--187",
  month =        mar,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Mar 24 21:38:51 MST 1997",
  note =         "See remarks \cite{Griffin:1970:RME,Peto:1970:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150E (General utility programs)",
  corpsource =   "Stanford Research Inst., Menlo Park, CA, USA",
  keywords =     "digital computer sorting; minimal storage sorting;
                 sorting; subroutines",
}

@Article{ANSI:1969:CFS,
  author =       "{ANSI Subcommittee X3J3}",
  title =        "Clarification of {Fortran} Standards --- Initial
                 Progress",
  journal =      j-CACM,
  volume =       "12",
  number =       "5",
  pages =        "289--294",
  month =        may,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Aug 29 18:26:25 1994",
  note =         "See also \cite{ANSI:1966:AF}.",
  acknowledgement = ack-nhfb,
}

@Article{Clemm:1969:AAC,
  author =       "D. S. Clemm",
  title =        "{ACM Algorithm 352}: Characteristic Values and
                 Associated Solutions of {Mathieu}'s Differential
                 Equation",
  journal =      j-CACM,
  volume =       "12",
  number =       "7",
  pages =        "399--407 (or 399--406??)",
  month =        jul,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Mar 24 21:38:51 MST 1997",
  note =         "See remark \cite{Frisch:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations); C7300 (Natural
                 sciences computing)",
  corpsource =   "Wright-Patterson Air Force Base, USA",
  keywords =     "differential equations; function evaluation;
                 subroutines",
}

@Article{Wirth:1969:MMC,
  author =       "N. Wirth",
  title =        "On Multiprogramming, Machine Coding, and Computer
                 Organization",
  journal =      j-CACM,
  volume =       "12",
  number =       "9",
  pages =        "489--498",
  month =        sep,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:23:22 1997",
  note =         "See corrigendum \cite{Wirth:1970:CMM}.",
  acknowledgement = ack-nhfb,
}

@Article{Leitch:1969:CGP,
  author =       "I. M. Leitch",
  title =        "Certification of {ACM Algorithm 323 [G6]}: Generation
                 of Permutations in Lexicographic Order",
  journal =      j-CACM,
  volume =       "12",
  number =       "9",
  pages =        "512--512",
  month =        sep,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Feb 01 07:26:28 1997",
  note =         "See \cite{Ord-Smith:1968:AAG,Roy:1973:RAG}.",
  acknowledgement = ack-nhfb,
  keywords =     "direct lexicographic order; lexicographic generation;
                 permutations; reverse lexicographic order",
}

@Article{Singleton:1969:AAEb,
  author =       "R. C. Singleton",
  title =        "{ACM Algorithm 357}: An Efficient Prime Number
                 Generator",
  journal =      j-CACM,
  volume =       "12",
  number =       "10",
  pages =        "563--564",
  month =        oct,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Mar 24 21:38:51 MST 1997",
  note =         "See remark \cite{DeMorgan:1973:RAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Stanford Research Inst., Menlo Park, CA, USA",
  keywords =     "algebra; number theory; subroutines",
}

@Article{Gautschi:1969:AAC,
  author =       "W. Gautschi",
  title =        "{ACM Algorithm 363}: Complex Error Function",
  journal =      j-CACM,
  volume =       "12",
  number =       "11",
  pages =        "635",
  month =        nov,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:33:14 1994",
  note =         "See certification \cite{Kolbig:1972:CAC}.",
  acknowledgement = ack-nhfb,
}

@Article{Lowe:1970:ASC,
  author =       "T. C. Lowe",
  title =        "Automatic segmentation of cyclic program structures
                 based on connectivity and processor timing",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "3--6",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Informatics Inc., Bethesda, MD, USA",
  keywords =     "input-output programs; multiprogramming; program
                 processors; time-sharing programs",
}

@Article{Gautschi:1970:RCC,
  author =       "Walter Gautschi and Bruce J. Klein",
  title =        "Recursive computation of certain derivatives --- {A}
                 study of error propagation",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "7--9",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65Q05",
  MRnumber =     "46 1115",
  MRreviewer =   "D. F. Mayers",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  abstract =     "A brief study is made of the propagation of errors in
                 linear first-order difference equations. The recursive
                 computation of successive derivatives of $(e^x)/x$ and
                 $(\cos x)/x$ is considered as an illustration.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4110 (Error analysis in numerical methods)",
  corpsource =   "Purdue Univ., Lafayette, IN, USA",
  keywords =     "difference equations; error analysis; error
                 propagation; recursive computation; successive
                 derivatives",
}

@Article{Mullery:1970:PAM,
  author =       "A. P. Mullery and G. C. Driscoll",
  title =        "A processor allocation method for time-sharing",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "10--14",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "IBM, Thomas J. Watson Res. Center Yorktown Heights,
                 NY, USA",
  keywords =     "storage allocation; time-sharing programs",
}

@Article{Simmons:1970:NLQ,
  author =       "R. F. Simmons",
  title =        "Natural Language Question-Answering Systems: 1969",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "15--30",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "artificial intelligence; computational linguistics;
                 language; translation and linguistics",
}

@Article{Irons:1970:EEL,
  author =       "E. T. Irons",
  title =        "Experience with an extensible language",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "31--40",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Inst. Defense Analyses Princeton, NJ, USA",
  keywords =     "procedure oriented languages",
}

@Article{Montanari:1970:NML,
  author =       "Ugo Montanari",
  title =        "A note on minimal length polygonal approximation to a
                 digitized contour",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "41--47",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.20",
  MRnumber =     "44\#2311",
  bibdate =      "Mon Jan 22 07:05:22 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Montanari70",
  abstract =     "A method for extracting a smooth polygonal contour
                 from a digitized image is illustrated. The ordered
                 sequence of contour points and the connection graph of
                 the image are first obtained by a modified Ledley
                 algorithm in one image scan. A minimal perimeter
                 polygon subjected to specified constraints is then
                 chosen as the approximating contour. The determination
                 of the minimal polygon can be reduced to a nonlinear
                 programming problem, solved by an algorithm which takes
                 into account the weak bonds between variables. Some
                 examples are presented, and the corresponding computing
                 times are listed.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Consiglio Nazionale delle Richerche, Pisa, Italy",
  keywords =     "connection tree; digitized image; minimal polygon;
                 nonlinear programming; optimal approximation; pattern
                 recognition",
  oldlabel =     "Montanari70",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Montanari70",
}

@Article{Stehfest:1970:AAN,
  author =       "Harald Stehfest",
  title =        "{ACM Algorithm 368}: Numerical Inversion of {Laplace}
                 Transforms",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "47--49",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "J. W. Goethe Univ. Frankfurt am Main, West Germany",
  keywords =     "Laplace transforms; subroutines",
}

@Article{Schaffer:1970:AAG,
  author =       "H. E. Schaffer",
  title =        "{ACM Algorithm 369}: Generator of Random Numbers
                 Satisfying the {Poisson} Distribution",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "49--49",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "North Carolina State Univ., Raleigh, NC, USA",
  keywords =     "random number generation; subroutines",
}

@Article{Butler:1970:AAG,
  author =       "E. L. Butler",
  title =        "{ACM Algorithm 370}: General Random Number Generator",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "49--52",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Proll:1972:RAA}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Texas A and M Univ., College Station, TX, USA",
  keywords =     "random number generation; subroutines",
}

@Article{McKay:1970:AAP,
  author =       "J. K. S. McKay",
  title =        "{ACM Algorithm 371}: Partitions in Natural Order",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "52--52",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "California Inst. Technol. Pasadena, CA, USA",
  keywords =     "number theory; subroutines",
}

@Article{Dunham:1970:AAA,
  author =       "K. B. Dunham",
  title =        "{ACM Algorithm 372}: An Algorithm to Produce Complex
                 Primes {CSIEVE}",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "52--54",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Georgia Inst. Technol., Atlanta, GA, USA",
  keywords =     "number theory; subroutines",
  xxnote =       "Check pages??",
}

@Article{Gautschi:1970:RAD,
  author =       "Walter Gautschi and Bruce J. Klein",
  title =        "Remark on {Algorithm 282, Derivatives of $e^x / x$,
                 $\cos(x) / x$, and $\sin(x) / x$}",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "53--54",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Oct 30 07:27:17 2010",
  note =         "See \cite{Gautschi:1966:AD}.",
  acknowledgement = ack-nhfb,
  citedby =      "Fullerton:1980:BEM",
  remark =       "Fullerton: Corrections are given for several Algol
                 procedures.",
}

@Article{Griffin:1970:RME,
  author =       "R. Griffin and K. A. Redich",
  title =        "Remark on ``{Algorithm 347}: {An Efficient Algorithm
                 for Sorting with Minimal Storage [{M1}]}, by {R. C.
                 Singleton}''",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "54--54",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:26:41 1997",
  note =         "See \cite{Singleton:1969:AAEa,Peto:1970:RAM}.",
  acknowledgement = ack-nhfb,
  keywords =     "digital computer sorting; minimal storage sorting;
                 sorting",
}

@Article{Anonymous:1970:RCD,
  author =       "Anonymous",
  title =        "Representation for calendar date for
                 machine-to-machine data interchange",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "55--55",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  keywords =     "codes; standards",
}

@Article{Anonymous:1970:IRP,
  author =       "Anonymous",
  title =        "Interchange rolls of perforated tape for information
                 interchange",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "56--56",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5320Z (Other digital storage); C5560 (Data
                 preparation equipment); C7250 (Information storage and
                 retrieval)",
  keywords =     "digital storage; equipment; information retrieval;
                 punched tape; standards",
}

@Article{Payne:1970:FTP,
  author =       "W. H. Payne",
  title =        "{Fortran Tausworthe} pseudorandom number generator",
  journal =      j-CACM,
  volume =       "13",
  number =       "1",
  pages =        "57--57",
  month =        jan,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Washington State Univ. Pullman, WA, USA",
  keywords =     "random number generation",
}

@Article{Hsiao:1970:FSI,
  author =       "David K. Hsiao and Frank D. Harary",
  title =        "A Formal System for Information Retrieval from Files",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "67--73",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib",
  note =         "See corrigenda \cite{Hsiao:1970:CFS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  corpsource =   "Univ. Pennsylvania, Philadelphia, PA, USA",
  keywords =     "file organisation; information retrieval",
}

@Article{vonGlaserfeld:1970:MPH,
  author =       "E. {von Glaserfeld} and P. P. Pisani",
  title =        "The multistore parser for hierarchical syntactic
                 structures",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "74--82",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. Georgia, Athens, GA, USA",
  keywords =     "computational linguistics",
}

@Article{Vere:1970:TE,
  author =       "Steven Vere",
  title =        "Translation equations",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "83--89",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "45 4925",
  MRreviewer =   "H. Maurer",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See errata \cite{Vere:1970:TEE},",
  abstract =     "Input limited transduction expressions, or translation
                 equations, are used to describe the syntax and
                 left-context sensitive semantics for context-free
                 languages. A formal procedure is given for deriving
                 from a set of translation equations the specifications
                 for a pushdown translator. The translator consists of
                 Mealy form finite-state automata interacting by means
                 of a pushdown stack. Within the framework described
                 string recognition and parsing may be treated as
                 special cases of the translation problem.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  keywords =     "automata; computational linguistics; context-free
                 languages; finite state automata; formal languages;
                 meta-compilers; parsing; pushdown transducer;
                 recognizers; regular expression; syntax directed
                 compilers; transduction expression; translation; Turing
                 machines",
}

@Article{Morgan:1970:SCS,
  author =       "H. L. Morgan",
  title =        "Spelling correction in systems programs",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "90--94",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:33:52 1997",
  abstract =     "Several specialized techniques are shown for
                 efficiently incorporating spelling correction
                 algorithms in to compilers and operating systems. These
                 include the use of syntax and semantics information,
                 the organization of restricted keyword and symbol
                 tables, and the consideration of a limited class of
                 spelling errors. Sample 360 coding for performing
                 spelling correction is presented. By using systems
                 which perform spelling correction, the number of
                 debugging runs per program has been decreased, saving
                 both programmer and machine time.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "compilers; computer science and automata; debugging;
                 diagnostics; error correction; error detection; lexical
                 analysis systems programming; misspelling; operating
                 systems; program debugging; spelling correction;
                 subroutines",
}

@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{Radke:1970:UQR,
  author =       "C. E. Radke",
  title =        "The Use of Quadratic Residue Research",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "103--105",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "IBM, Endicott, NY, USA",
  keywords =     "data handling; programming",
}

@Article{Jones:1970:VSA,
  author =       "B. Jones",
  title =        "A Variation on Sorting by Address Calculation",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "105--107",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Martin Marietta Corp., Orlando, FL, USA",
  keywords =     "sorting",
}

@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{Ness:1970:CEG,
  author =       "D. N. Ness and R. S. Green and W. A. Martin and G. A.
                 Moulton",
  title =        "Computer education in a graduate school of
                 management",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "110--114, 19",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "M.I.T., Cambridge, MA, USA",
  keywords =     "education; management; simulation",
}

@Article{Robbins:1970:ICS,
  author =       "M. F. Robbins and J. D. Beyer",
  title =        "An interactive computer system using graphical
                 flowchart input",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "115--119",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7400 (Engineering computing); C5540 (Terminals and
                 graphic displays)",
  corpsource =   "Bell Telephone Labs. Inc., Holmdel, NJ, USA",
  keywords =     "applications of computers; computers; control system
                 synthesis; electrical engineering; engineering
                 applications of; online operation; sampled data
                 systems; simulation",
}

@Article{White:1970:AAN,
  author =       "J. S. White",
  title =        "{ACM Algorithm 373}: Number of Doubly Restricted
                 Partitions",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "120--120",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Univ. Minnesota, Minneapolis, MN, USA",
  keywords =     "combinatorial mathematics; subroutines",
}

@Article{White:1970:AAR,
  author =       "J. S. White",
  title =        "{ACM Algorithm 374}: Restricted Partition Generator",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "120--120",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Univ. Minnesota, Minneapolis, MN, USA",
  keywords =     "combinatorial mathematics; subroutines",
}

@Article{Spath:1970:AAF,
  author =       "H. Sp{\"{a}}th",
  title =        "{ACM Algorithm 375}: Fitting Data to One Exponential",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "120--121",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4150 (Nonlinear and functional equations); C7300
                 (Natural sciences computing)",
  corpsource =   "Inst. Neutronenphysik Reaktortechnik, Karlsruhe, West
                 Germany",
  keywords =     "least squares approximations; nonlinear equations;
                 subroutines",
}

@Article{Spath:1970:AAL,
  author =       "H. Sp{\"{a}}th",
  title =        "{ACM Algorithm 376}: Least Squares Fit by
                 {$f(x)=A\cos(Bx+C)$}",
  journal =      j-CACM,
  volume =       "13",
  number =       "2",
  pages =        "121--122",
  month =        feb,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4150 (Nonlinear and functional equations); C7300
                 (Natural sciences computing)",
  corpsource =   "Inst. Neutronenphysik, Reaktortechnik, Karlsruhe, West
                 Germany",
  keywords =     "least squares approximations; nonlinear equations;
                 subroutines",
}

@Article{Fenichel:1970:PTP,
  author =       "R. R. Fenichel and J. Weizenbaum and J. C. Yochelson",
  title =        "A Program to Teach Programming",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "141--146",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The TEACH system was developed at MIT to ease the cost
                 and improve the results of elementary instruction in
                 programming. To the student, TEACH offers loosely
                 guided experience with a conversational language which
                 was designed with teaching in mind. Faculty involvement
                 is limited. At the heart of the TEACH system is an
                 interactive language which somewhat resembles Joss, but
                 is somewhat more amenable to rational explanation.
                 Surrounding the language processor is a teaching system
                 which presents lessons to the student, supervises his
                 progress, and permits him to exercise his skills. A
                 term of experience with TEACH is discussed.
                 Pedagogically, the system appears to be successful;
                 straightforward reimplementation will make it
                 economically successful as well.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0310 (EDP management); C6150Z (Other systems
                 operation programs)",
  corpsource =   "Massachusetts Inst. Technol., Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer applications; computer-assisted learning;
                 computers, programming; education; elementary
                 programming; engineering education; programming; TEACH;
                 UNCL; utility programs",
}

@Article{Slagle:1970:EMT,
  author =       "J. R. Slagle and J. K. Dixon",
  title =        "Experiments with the {M \& N} Tree-Searching Program",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "147--154, 159",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The M \& N procedure is an improvement to the mini-max
                 backing-up procedure widely used in computer programs
                 for game-playing and other purposes. It is based on the
                 principle that it is desirable to have many options
                 when making decisions in the face of uncertainty. The
                 mini-max procedure assigns to a MAX (MIN) node the
                 value of the highest (lowest) valued successor to that
                 node. The M \& N procedure assigns to a MAX (MIN) node
                 some function of the M (N) highest (lowest) valued
                 successors. An M \& N procedure was written in LISP to
                 play the game of kalah, and it was demonstrated that
                 the M \& Nprocedure is significantly superior to the
                 mini-max procedure. The statistical significance of
                 important conclusions is given. Since information on
                 statistical significance has often been lacking in
                 papers on computer experiments in the artificial
                 intelligence field, these experiments can perhaps serve
                 as a model for future work.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence)",
  corpsource =   "Education Welfare, Bethesda, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "arg; artificial intelligence; automata theory;
                 computers; game theory; heuristic programming;
                 optimisation; programming; trees (mathematics)",
}

@Article{Batson:1970:MSS,
  author =       "A. Batson and Shy-Ming M. Ju and D. C. Wood",
  title =        "Measurements of Segment Size",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "155--159",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Distributions of segment sizes measured under routine
                 operating conditions on a computer system which
                 utilizes variable sized segments (the Burroughs B5500)
                 are discussed. The most striking feature of the
                 measurements is the large number of small
                 segments-about 60\% of the segments in use contain less
                 than 40 words. Although the results are certainly not
                 installation independent, and although they are
                 particularly influenced by features of the B5500 ALGOL
                 system, they should be relevant to the design of new
                 computer systems, especially with respect to the
                 organization of paging schemes.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Univ. Virginia, Charlottesville, VA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; dynamic memory management; operating
                 systems; storage allocation",
}

@Article{Watson:1970:ANM,
  author =       "G. A. Watson",
  title =        "On an Algorithm for Nonlinear Minimax Approximation",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "160--162",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "90.50 (65.00)",
  MRnumber =     "44\#3694",
  MRreviewer =   "R. W. Cottle",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Certain nonlinear minimax approximation problems are
                 characterized by properties which permit the
                 application of special algorithms, mainly, based on the
                 exchange algorithms of E. Y. Remes (1934, 1935), for
                 their solution. The application to problems of this
                 type of a general nonlinear algorithm due to M. R.
                 Osborne and G. A. Watson (1969) is considered. Examples
                 are given to illustrate that this algorithm can give
                 satisfactory results and, in particular, can
                 successfully solve problems which lead to difficulties
                 with the more conventional specialist methods.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "Australian Nat. Univ., Canberra, Australia",
  journalabr =   "Commun ACM",
  keywords =     "linear programming; mathematics; minimax
                 approximation; nonlinear approximation; numerical
                 methods; optimisation; THO",
}

@Article{Schweikert:1970:CEI,
  author =       "D. G. Schweikert",
  title =        "A Comparison of Error Improvement Estimates for
                 Adaptive Trapezoid Integration",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "163--166",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.55",
  MRnumber =     "44\#7751",
  MRreviewer =   "R. E. Barnhill",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Various simple choices of error improvement estimates
                 for the trapezoid rule are studied to demonstrate a
                 comparison procedure which is relatively independent of
                 the profusion of adaptive search and stopping
                 strategies. Comparisons are based on $x^r1$; the
                 inclusion of the noninteger powers makes this more
                 realistic than the usual polynomial based comparison.
                 Behavior near the singularity was found to be the
                 dominant factor, and a new estimate, based on a
                 constant curvature assumption and parametric
                 differences, was considered slightly better than the
                 other choices considered.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4110 (Error analysis in numerical methods); C4160
                 (Numerical integration and differentiation)",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "adaptive integration; error analysis; error
                 improvement estimate; integration; mathematics;
                 nonpolynomial error criteria; numerical methods; re;
                 trapezoid rule",
}

@Article{Schwarcz:1970:DQA,
  author =       "Robert M. Schwarcz and John F. Burger and Robert F.
                 Simmons",
  title =        "A Deductive Question Answerer for Natural Language
                 Inference",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "167--183",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib",
  abstract =     "The question-answering aspects of the Protosynthex III
                 prototype language processing system are described and
                 exemplified in detail. The system is written in LISP 1.
                 5 and operates on the Q-32 time-sharing system. The
                 system's data structures and their semantic
                 organization, the deductive question-answering
                 formalism of relational properties and
                 complex-relation-forming operators, and the
                 question-answering procedures which employ these
                 features in their operation are all described and
                 illustrated. Examples of the system's performance and
                 of the limitations of its question-answering capability
                 are presented and discussed. It is shown that the use
                 of semantic information in deductive question answering
                 greatly facilitates the process, and that a top-down
                 procedure which works from question to answer enables
                 effective use to be made of this information.",
  acknowledgement = ack-nhfb,
  annote =       "Deductive inference driven by English: PROTOSYNTHEX
                 III",
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "System Dev. Corp., Santa Monica, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "artificial intelligence; automata theory;
                 computational linguistics; information retrieval;
                 language translation and linguistics",
}

@Article{Cardenas:1970:PLP,
  author =       "A. F. Cardenas and W. J. Karplus",
  title =        "{PDEL} --- a Language for Partial Differential
                 Equations",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "184--191",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:33:36 1997",
  bibsource =    "Compendex database",
  abstract =     "Conventional computer methods available to solve
                 continuous system problems characterized by partial
                 differential equations are very time-consuming and
                 cumbersome. A convenient, easy to learn and to use,
                 high level problem oriented language to solve and study
                 partial differential equation problems has been
                 designed; a practical translator for the language has
                 also been designed, and a working version of it has
                 been constructed for a significant portion of the
                 language. This Partial Differential Equation Language,
                 PDEL, is outlined, and the highlights of the translator
                 are briefly summarized. PDEL can handle a large variety
                 of fields. Time-dependent and time-independent fields
                 can be defined. Any size of grid can be used to
                 approximate regular and irregular geometries. Linear,
                 nonlinear, uniform and nonuniform fields can be
                 treated.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; differential equations; mathematics;
                 problem oriented languages",
}

@Article{Levine:1970:AAS,
  author =       "Michael J. Levine and Stanley M. Swanson",
  title =        "{ACM Algorithm 377}: Symbolic Expansion of Algebraic
                 Expressions",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "191--192",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:35:50 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "algebra; subroutines",
}

@Article{Kailas:1970:AMC,
  author =       "M. V. Kailas",
  title =        "Another method of converting from hexadecimal to
                 decimal",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "193--193",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  keywords =     "digital arithmetic",
}

@Article{Pager:1970:NSP,
  author =       "D. Pager",
  title =        "A number system for the permutations",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "193--193",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Univ. Hawaii, Honolulu, HI, USA",
  keywords =     "number theory",
}

@Article{Dempster:1970:CPA,
  author =       "J. R. H. Dempster",
  title =        "Comment on a Paging Anomaly",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "193--194",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Univ. British Columbia, Vancouver, BC, Canada",
  keywords =     "computation theory; demand paging; paging machines;
                 replacement algorithm; storage allocation",
}

@Article{Maurer:1970:NCI,
  author =       "H. A. Maurer",
  title =        "A Note on the Complement of Inherently Ambiguous
                 Context-Free Languages",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "194--194",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. Calgary, Alta., Canada",
  keywords =     "ambiguity; bounded language; Chomsky-language;
                 complement; context-free language; formal languages;
                 inherent ambiguity; phrase structure language;
                 production system; type 2 language",
}

@Article{Hsiao:1970:CFS,
  author =       "D. K. Hsiao and F. D. Harary",
  title =        "Corrigenda: {``A Formal System for Information
                 Retrieval from Files''}",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "266--266",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Dec 26 18:33:42 1995",
  note =         "See \cite{Hsiao:1970:FSI}.",
  acknowledgement = ack-nhfb,
}

@Article{DeSalvio:1970:CCI,
  author =       "A. J. DeSalvio and J. G. Purdy and J. Rau",
  title =        "Creation and Control of Internal Data Bases Under a
                 {Fortran} Programming Environment",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "211--215",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A method is described for the definition of a user's
                 COMMON structure and the automatic generation of the
                 necessary COMMON, DIMENSION, EQUIVALENCE, and type
                 declarations for each of the user's routines. The
                 definition for the COMMON is contained in an easy to
                 modify form, thus allowing the control of general
                 communications of data between routines. The described
                 system has been implemented on the IBM 7094, CDC 6000
                 series, and the IBM 360. The method has proved to be
                 invaluable for the definition and control of COMMON in
                 many large-scale programs.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "TRW Systems, Redondo Beach and Sunnyvale, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; data handling; data structures; FORTRAN",
}

@Article{Mills:1970:SDP,
  author =       "H. D. Mills",
  title =        "Syntax-Directed Documentation for {PL360}",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "216--222",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The language PL360, together with its phrase structure
                 grammar, is used as a concrete basis for illustrating
                 an idea called syntax-directed documentation. This idea
                 is-to use the phrase structure of a program to define
                 the structure of a formal documentation for that
                 program; to use the syntactic types and identifiers in
                 the resulting structure to trigger the automatic
                 formation of questions to the programmer, whose answers
                 will become part of that documentation; and to provide
                 automatic storage and retrieval facilities so that
                 other programmers who want to understand or modify the
                 index in various ways by syntactic types and objects. A
                 small PL360 program, already found in the literature,
                 is worked out as an example.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "IBM, Gaithersburg, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; computers, programming; documentation;
                 procedure oriented languages; Program and system",
}

@Article{Bayer:1970:SCC,
  author =       "Rudolf Bayer and Christoph Witzgall",
  title =        "Some Complete Calculi for Matrices",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "223--237",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib",
  abstract =     "A matrix calculus is introduced with the intention of
                 developing data structures suitable for a high level
                 algorithmic language for mathematical programming. It
                 is shown how the special structure of matrices can be
                 described and utilized for efficient computing by
                 saving memory space and superfluous operations.
                 Sequences of matrices (and sequences of sequences of
                 matrices) are considered, and matrix operators are
                 extended to sequence operators and cumulative
                 operators. Algorithms are given which use symbol
                 manipulation of matrix expressions so as to find the
                 forms best suited for computation. These forms are
                 called normalforms. Several completeness results are
                 obtained in the sense that for each expression an
                 equivalent expression in normal form can be found
                 within a specified calculus.",
  acknowledgement = ack-nhfb,
  checked =      "29 June 1993",
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "Boeing Sci. Res. Labs., Seattle, WA, USA",
  journalabr =   "Commun ACM",
  keywords =     "algorithmic languages; computers; computers,
                 programming; data structures; mathematical;
                 mathematics; matrix algebra; programming",
}

@Article{BrinchHansen:1970:NMS,
  author =       "P. {Brinch Hansen}",
  title =        "The Nucleus of a Multiprogramming System",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "238--241, 250",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib",
  abstract =     "The philosophy and structure is described of a
                 multiprogramming system that can be extended with a
                 hierarchy of operating systems to suit diverse
                 requirements of program scheduling and resource
                 allocation. The system nucleus simulates an environment
                 in which program execution and input\slash output are
                 handled uniformly as parallel, cooperating processes. A
                 fundamental set of primitives allows the dynamic
                 creation and control of a hierarchy of processes as
                 well as the communication among them.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "A/S Regnecentralen, Copenhagen, Denmark",
  journalabr =   "Commun ACM",
  keywords =     "computers; computers, time sharing; multiprogramming;
                 operating systems",
}

@Article{Eastman:1970:RSP,
  author =       "C. M. Eastman",
  title =        "Representations for Space Planning",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "242--250",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Problems involving the arrangement of objects in
                 two-or three-space where the objective function
                 primarily consists of derivatives of the distance
                 between objects or their arrangement are called space
                 planning problems. The representational requirements
                 for this problem area are defined and compared with
                 current computer graphic languages. Four alternative
                 data structures that allow automated space planning are
                 described and compared.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer-aided design; computers; computers, language;
                 data structures; design automation; graphic methods;
                 graphics",
}

@Article{Pomeranz:1970:CMP,
  author =       "J. E. Pomeranz and R. L. {Weil, Jr.}",
  title =        "The cyclical majority problem",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "251--254",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The unsolved combinational problem of the cyclical
                 majority is presented and some mew, simulated results
                 for 3, 4, 5,\ldots{}, 40 issues and 3, 5, 7,\ldots{},
                 37 judges are reported. The method devised for
                 simulating the voting process to estimate the
                 probabilities does not solve the problem, but appears
                 much more efficient than one previous simulation and
                 more accurate than another.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Univ. Chicago, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "combinatorial mathematics; computers, simulation;
                 simulation; statistical methods",
}

@Article{Nilson:1970:CSU,
  author =       "E. N. Nilson",
  title =        "Cubic Splines on Uniform Meshes",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "255--258",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.20",
  MRnumber =     "44\#1189",
  MRreviewer =   "C. A. Hall",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A very simple procedure is presented for constructing
                 cubic splines, periodic or nonperiodic, on uniform
                 meshes. Arcs of two cubics suffice to construct a basis
                 of cardinal splines. An algorithm is given which
                 requires only minimal storage and computation and
                 permits easy trade-off of one against the other. The
                 application of these devices is of fundamental
                 importance in the area of computer graphics where
                 substantial savings in computing time and storage
                 requirements have special significance.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Pratt and Whitney Aircraft, East Hartford, CT, USA",
  journalabr =   "Commun ACM",
  keywords =     "cardinal splines; computers; mathematics; numerical
                 methods; polynomials; simple spline representation;
                 uniform mesh splines",
}

@Article{Pankiewicz:1970:AAD,
  author =       "W. Pankiewicz",
  title =        "{ACM Algorithm 378}: Discretized {Newton}-like Method
                 for Solving a System of Simultaneous Nonlinear
                 Equations",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "259--260",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4150 (Nonlinear and functional equations); C7300
                 (Natural sciences computing)",
  keywords =     "nonlinear equations; numerical methods; subroutines",
}

@Article{Lyness:1970:AAS,
  author =       "J. N. Lyness",
  title =        "{ACM Algorithm 379}: {SQUANK (Simpson Quadrature Used
                 Adaptively-Noise Killed)}",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "260--263",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:37:51 1997",
  note =         "See certification \cite{Hallet:1972:CAS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7300 (Natural sciences computing)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  keywords =     "integration; subroutines",
}

@Article{Heess:1970:CPW,
  author =       "W. F. {Heess, Jr.}",
  title =        "Comments on a paper by {Wallace} and {Mason}",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "264--265",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  keywords =     "multiprogramming; storage allocation",
}

@Article{Smith:1970:CMU,
  author =       "J. L. Smith",
  title =        "Comment on multiprogramming under a page on demand
                 strategy",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "265--265",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "CSIRO, Canberra City, ACT, Australia",
  keywords =     "multiprogramming",
}

@Article{deVries:1970:CLM,
  author =       "Ronald C. {de Vries}",
  title =        "Comment on {Lawler}'s Multilevel {Boolean}
                 minimization",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "265--266",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68.00 (94.00)",
  MRnumber =     "44\#7801",
  MRreviewer =   "E. Maliszewski",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4230 (Switching theory)",
  corpsource =   "Univ. New Mexico, Albuquerque, NM, USA",
  keywords =     "generalized prime implicants; incompletely specified
                 functions; minimal forms; minimisation of switching
                 nets; minimization; multilevel logic design",
}

@Article{Knight:1970:ACP,
  author =       "K. R. Knight",
  title =        "An {Algol} construction for procedures as parameters
                 of procedures",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "266--266",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. Surrey, Guildford, UK",
  keywords =     "ALGOL; programming",
}

@Article{Wirth:1970:CMM,
  author =       "N. Wirth",
  title =        "Corrigenda: {``On Multiprogramming, Machine Coding,
                 and Computer Organization''}",
  journal =      j-CACM,
  volume =       "13",
  number =       "4",
  pages =        "266--266",
  month =        apr,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Jan 06 09:47:03 1998",
  note =         "See \cite{Wirth:1969:MMC}.",
  acknowledgement = ack-nhfb,
}

@Article{Hodes:1970:PSO,
  author =       "L. Hodes",
  title =        "Programming System for the On-Line Analysis of
                 Biomedical Images",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "279--283, 286",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A preliminary description of the software for a
                 computer-display system is given with special emphasis
                 on the man-machine interaction. This system is intended
                 for a wide variety of biomedical applications. As an
                 example, the methods are applied to the karyotyping of
                 chromosomes. The system is separated into four
                 programming tasks-picture transformations, file
                 maintenance, picture structuring, and display
                 management. Picture structuring is considered as the
                 vehicle for man-machine communication. A prototype data
                 format for pictures, called a picture-form, is
                 developed. Structure operators are defined which
                 manipulate picture-forms to produce new picture-forms.
                 Many of the ideas are taken from the symbolic
                 mathematical laboratory at MIT conceived by M.
                 Minsky.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Dept. Health, Education Welfare, Bethasda, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "bioengineering, computer applications; biology;
                 computers; computers, programming; data handling; data
                 reduction and analysis; graphics; image processing;
                 machine systems; man-; medicine; pattern recognition",
}

@Article{Sitton:1970:OGA,
  author =       "G. A. Sitton",
  title =        "Operations on Generalized Arrays with the {Genie}
                 Compiler",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "284--286",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Operations on vectors, matrices, and higher
                 dimensional storage arrays are standard features of
                 most compilers today. The elements of such structures
                 are usually restricted to be scalars For many
                 sophisticated applications this restriction can impose
                 cumbersome data representations. An efficient system
                 has been devised and implemented which allows the
                 elements of multidimensional arrays to themselves be
                 multidimensional arrays. This system was developed from
                 a storage structure in which the location, length, and
                 content of each array is described by a codeword which
                 can be interpreted by the system. Codewords may
                 describe arrays containing more codewords, thus
                 providing all needed descriptive information for
                 hyperstructures of any form.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Rice Univ., Houston, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; computers, operating systems; data
                 handling; data structures; E P; matrix operations;
                 multidimensional arrays; program compilers;
                 programming",
}

@Article{Vere:1970:TEE,
  author =       "S. Vere",
  title =        "Translation Equations (Errata)",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "286--286",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:28:27 1997",
  note =         "See \cite{Vere:1970:TE}.",
  acknowledgement = ack-nhfb,
}

@Article{Sasser:1970:ASS,
  author =       "W. E. Sasser and D. S. Burdick and D. A. Graham and T.
                 H. Naylor",
  title =        "Application of Sequential Sampling to Simulation. an
                 Example Inventory Model",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "287--296",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Four different sequential sampling procedures are
                 applied to the analysis of data generated by a computer
                 simulation experiment with a multi-item inventory
                 model. For each procedure the cost of computer time
                 required to achieve given levels of statistical
                 precision is calculated. Also the cost of computer time
                 using comparable fixed sample size methods is
                 calculated. The computer costs of fixed sample size
                 procedures vs sequential sampling procedures are
                 compared. Details are given for the inventory model and
                 sampling procedures.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1220 (Simulation, modelling and identification)",
  corpsource =   "Duke Univ., Durham, NC, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; control; data reduction and analysis;
                 industrial management, data processing; inventory
                 control; modelling; sequential sampling; simulation;
                 statistical methods; stock",
}

@Article{Loeckx:1970:ACB,
  author =       "J. Loeckx",
  title =        "Algorithm for the Construction of Bounded-Context
                 Parsers",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "297--307",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "An algorithm is described which accepts an arbitrary
                 context-free grammar and constructs a bounded-context
                 parser for it whenever such a parser exists. The
                 definition of a context-free grammar and the working of
                 a bounded-context parser are recalled. The notion of
                 reduction class for a context-free grammar is then
                 introduced and its connection with the structure of a
                 bounded-context parser is indicated. Next, pushdown
                 automata which generate the different reduction classes
                 of a context-free grammar are defined. Finally, the
                 algorithm is described; it essentially carries out an
                 exhaustive study of all possible runs of the pushdown
                 automata generating the reduction classes. The utility
                 of the algorithm is discussed in the light of the
                 experience gained from its use in compiler design.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "MBLE Res. Lab., Brussels, Belgium",
  journalabr =   "Commun ACM",
  keywords =     "automata theory; compilers; computational linguistics;
                 computers, language; context-free grammars; formal
                 languages; grammars; low",
}

@Article{Reynolds:1970:GST,
  author =       "John C. Reynolds",
  title =        "{GEDANKEN} --- {A} Simple Typeless Language Based on
                 the Principle of Completeness and the Reference
                 Concept",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "308--319",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib",
  abstract =     "In this experimental programming language, any value
                 which is permitted in some context of the language is
                 permissible in any other meaningful context. In
                 particular, functions and labels are permissible
                 results of functions and values of variables.
                 Assignment and indirect addressing are formalized by
                 introducing values, called references, which in turn
                 possess other values. The assignment operation always
                 affects the relation between some reference and its
                 values. All composed data structures are treated as
                 functions. Type declarations are not permitted. Any
                 data structure may be implicit; i.e., it may be
                 specified by giving an arbitrary algorithm for
                 computing or accessing its components. The existence of
                 label variables permits the construction of coroutines,
                 quasi-parallel processes, and other unorthodox control
                 mechanisms. A variety of programming examples
                 illustrates the generality of the language. Limitations
                 and possible extensions are discussed briefly.",
  acknowledgement = ack-nhfb,
  checked =      "4 September 1990",
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; data structures; gedanken; procedure
                 oriented languages; programming languages",
}

@Article{Crespi-Reghizzi:1970:LTG,
  author =       "S. Crespi-Reghizzi and R. Morpurgo",
  title =        "A language for treating graphs",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "319--323",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A language for the representation of graphs is
                 described, and the formulation of graph operations such
                 as node and\slash or link deletion or insertion, union,
                 intersection, comparison, and traversal of graphs is
                 given. Graphs are represented by linked lists. The
                 language is syntactically defined as an extension to
                 ALGOL 60, and it is translated into ALGOL by means of a
                 syntax-driven compiler. Application areas for this
                 language are operation research, network problems,
                 control theory, traffic problems, etc.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Politecnico di Milano, Italy",
  journalabr =   "Commun ACM",
  keywords =     "automatic control, analysis; computers; data handling;
                 data structures; electric circuits, analysis; graph
                 theory; operations research; procedure oriented
                 languages",
}

@Article{Laflin:1970:AAS,
  author =       "S. Laflin and M. A. Brebner",
  title =        "{ACM Algorithm 380}: In-situ Transposition of a
                 Rectangular Matrix",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "324--326",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:38:00 1997",
  note =         "See certification \cite{Macleod:1972:STR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Univ. Birmingham, UK",
  keywords =     "matrix algebra; subroutines",
}

@Article{Knop:1970:AAR,
  author =       "R. E. Knop",
  title =        "{ACM Algorithm 381}: Random Vectors Uniform In Solid
                 Angle",
  journal =      j-CACM,
  volume =       "13",
  number =       "5",
  pages =        "326--326",
  month =        may,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Schrack:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Rutgers Univ., New Brunswick, NJ, USA",
  keywords =     "random number generation; subroutines",
}

@Article{Elder:1970:FVI,
  author =       "H. A. Elder",
  title =        "On the Feasibility of Voice Input to an On-Line
                 Computer Processing System",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "339--346",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "An on-line digital computer processing system is
                 considered in which an ordinary telephone is the
                 complete terminal device, input to the computer being
                 provided as a sequence of spoken words, and output to
                 the user being audio responses from the machine. The
                 feasibility of implementing such a system with a
                 FORTRAN-like algebraic compiler as the object processor
                 is considered. Details of a specific word recognition
                 program are given. This technique \ldots{} between each
                 input word. Experimental results are presented giving
                 error rates for different experimental conditions as
                 well as the machine resources required to accommodate
                 several users at a time. The results show that at this
                 time it is both economically and logically feasible to
                 handle at least 40 users at a time with an IBM
                 360\slash 65 computer.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5590 (Other computer peripheral equipment)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer peripheral equipment; computers; computers,
                 input-output device; computers, pattern recognition;
                 data processing; man-machine interfaces; online
                 operation; recognition; speech; speech, recognition;
                 telephony; voice input",
}

@Article{Muthukrishnan:1970:CDT,
  author =       "C. R. Muthukrishnan and V. Rajaraman",
  title =        "On the Conversion of Decision Tables to Computer
                 Programs",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "347--351",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The use of execution time diagnostics in pinpointing
                 ambiguities in decision tables is discussed. It is
                 pointed out that any attempt at resolving ambiguities
                 at compile time will, in general, be impossible. It is
                 shown that, as a consequence, three methods of
                 converting decision tables to programs are inadequate
                 in regard to ambiguity detection. Two algorithms for
                 programming decision tables whose merits are simplicity
                 of implementation and detection of ambiguities at
                 execution time are presented. The first algorithm is
                 for limited entry decision tables and clarifies the
                 importance of proper coding of the information in the
                 decision table. The second algorithm programs a mixed
                 entry decision table directly without going through the
                 intermediate step of conversion to a limited entry
                 form, thereby resulting in storage economy. A
                 comparison of the algorithms and others proposed in the
                 literature is made. Some features of a decision table
                 to FORTRAN IV translator developed for the IBM 7044 are
                 given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6100 (Software techniques and systems)",
  corpsource =   "Indian Inst. Technol., Kanpur, India",
  journalabr =   "Commun ACM",
  keywords =     "computers; decision tables; operations research;
                 programming",
}

@Article{Grimes:1970:SRC,
  author =       "J. E. Grimes",
  title =        "Scheduling to Reduce Conflict in Meetings",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "351--352",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Conflicts in scheduling can be treated as defining an
                 undirected linear graph independently of the relation
                 of the activities in conflict to additional constraints
                 of time and space. Each connected component of such a
                 graph, which can be found by an algorithm described by
                 S. C. Gotlieb and D. C. Corneil, corresponds to a set
                 of events that must be scheduled at different times.
                 Applications are discussed in scheduling the
                 presentation of papers at meetings and scheduling
                 examinations.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "co; computers; graph theory; programming; undirected
                 linear graphs",
}

@Article{Frantz:1970:PPA,
  author =       "D. G. Frantz",
  title =        "A {PL\slash} 1 program to assist the comparative
                 linguist",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "353--356",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Univ. Alberta, Arrowwood, Alta., Canada",
  keywords =     "language translation and linguistics",
}

@Article{Damerau:1970:APC,
  author =       "F. J. Damerau",
  title =        "Automatic Parsing for Content Analysis",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "356--360",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Although automatic syntactic and semantic analysis is
                 not yet possible for all of an unrestricted natural
                 language text, some applications, of which content
                 analysis is one, do not have such a stringent coverage
                 requirement. Preliminary studies show that the Harvard
                 Syntactic Analyzer can produce correct and unambiguous
                 identification of the subject and object of certain
                 verbs for approximately half of the relevant
                 occurrences. This provides a degree of coverage for
                 content analysis variables which compares favorably to
                 manual methods, in which only a sample of the total
                 available text is normally processed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "IBM, Yorktown Heights, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers, data processing; content analysis; E L;
                 information storage and retrie; language translation
                 and linguistics; linguistics; natural language
                 processing; syntactic analysis",
}

@Article{Linz:1970:AFP,
  author =       "Peter Linz",
  title =        "Accurate Floating-Point Summation",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "361--362",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.25",
  MRnumber =     "44\#3468",
  MRreviewer =   "R. P. Brent",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip and
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib",
  abstract =     "This paper describes an alternate method for summing a
                 set of floating-point numbers. Comparison of the error
                 bound for this method with that of the standard
                 summation method shows that it is considerably less
                 sensitive to propagation of round-off error.",
  acknowledgement = ack-nhfb # "\slash " # ack-nj,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "New York Univ., NY, USA",
  descriptors =  "Simulation; statistics; numeric calculation;",
  journalabr =   "Commun ACM",
  keywords =     "accurate floating-point summation; computers, data
                 processing; digital arithmetic; floating point
                 arithmetic; floating-point addition; mathematics;
                 numerical methods; round-off error; round-off errors;
                 round-off propagation; summation",
}

@Article{Hillstrom:1970:CSA,
  author =       "K. E. Hillstrom",
  title =        "Comparison of Several Adaptive {Newton--Cotes}
                 Quadrature Routines in Evaluating Definite Integrals
                 with Peaked Integrands",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "362--365",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "It is shown, by numerical experiment only, that there
                 are certain quadratures for which the rate of
                 convergences increases with the use of higher degree
                 Newton--Cotes rules, used adaptively. The advantage of
                 adaptive methods over a nonadaptive rule in
                 approximating integrals having peaked integrands is
                 demonstrated. The performance of five different
                 adaptive quadrature schemes, based on Newton--Cotes (2N
                 plus 1) point rules (N equals 1, 2, 3, 4, 5), in
                 approximating a set of definite integrals is
                 compared.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers, data processing; convergence of numerical
                 methods; integral evaluation; integration; mathematics;
                 methods; numerical; numerical integration; numerical
                 methods; quadrature schemes",
}

@Article{Stewart:1970:IOS,
  author =       "G. W. Stewart",
  title =        "Incorporating Origin Shifts into the {QR} Algorithm
                 for Symmetric Tridiagonal Matrices",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "365--367",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib",
  abstract =     "The QR iteration for the eigenvalues of a symmetric
                 tridiagonal matrix can be accelerated by incorporating
                 a sequence of origin shifts. The origin shift may be
                 either subtracted directly from the diagonal elements
                 of the matrix or incorporated by means of an implicit
                 algorithm. Both methods have drawbacks-the direct
                 method can unnecessarily degrade small eigenvalues,
                 while the implicit method can effectively loose the
                 shift and thereby retard the convergence. A new method
                 which has neither drawback is presented. Both the
                 algorithm proposed here and the implicit algorithm are
                 safer than the explicit algorithm. The implicit
                 algorithm requires somewhat less computation, but the
                 new algorithm will give faster convergence in some
                 cases, an important consideration when eigenvectors are
                 being calculated.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Univ. Tex., Austin, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers, data processing; convergence of numerical
                 methods; eigenfunctions; eigenvalues; eigenvalues and;
                 eigenvectors; iterative methods; mathematics; matrix
                 algebra; origin shifts; QR method; symmetric
                 tridiagonal matrix; tridiagonal matrices",
  kwds =         "nla, eig, QR algorithm, symmetric matrix, tridiagonal
                 matrix",
}

@Article{Chase:1970:AAC,
  author =       "P. J. Chase",
  title =        "{ACM Algorithm 382}: Combinations of ${M}$ Out of
                 ${N}$ Objects",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "368--368",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Dept. Defense, Fort Meade, MD, USA",
  keywords =     "algebra; subroutines",
}

@Article{Chase:1970:AAP,
  author =       "P. J. Chase",
  title =        "{ACM Algorithm 383}: Permutations of a Set with
                 Repetitions",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "368--369",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Dept. Defense, Fort Meade, MD, USA",
  keywords =     "algebra; subroutines",
}

@Article{Stewart:1970:AAE,
  author =       "G. W. Stewart",
  title =        "{ACM Algorithm 384}: Eigenvalues and Eigenvectors of a
                 Real Symmetric Matrix [{F2}]",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "369--371",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See errata \cite{Stewart:1970:RAF}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C7300 (Natural sciences
                 computing)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "eigenvalues; eigenvalues and eigenfunctions;
                 eigenvectors; matrix algebra; QR algorithm; real
                 symmetric matrix; subroutines",
  kwds =         "nla, eig, QR algorithm, symmetric matrix",
}

@Article{London:1970:CAM,
  author =       "R. L. London",
  title =        "Certification of ``{Algorithm 245: Treesort 3
                 [{M1}]}'': Proof of Algorithms --- {A} New Kind of
                 Certification",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "371--374",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:26:39 1997",
  note =         "See \cite{Floyd:1964:AAT}.",
  acknowledgement = ack-nhfb,
}

@Article{Chandler:1970:RS,
  author =       "J. P. Chandler and W. C. Harrison",
  title =        "{R201}--{SHELLSORT}",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "373--374",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:28:53 1997",
  acknowledgement = ack-nhfb,
  keywords =     "digital computer sorting; minimal storage sorting;
                 sorting",
}

@Article{Codd:1970:RMD,
  author =       "E. F. Codd",
  title =        "A Relational Model of Data for Large Shared Data
                 Banks",
  journal =      j-CACM,
  volume =       "13",
  number =       "6",
  pages =        "377--387",
  month =        jun,
  year =         "1970",
  CODEN =        "CACMA2",
  DOI =          "http://doi.acm.org/10.1145/362384.362685",
  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 =         "Reprinted in \cite[pp.~5--15]{Stonebraker:1988:RDS}.",
  URL =          "http://dblp.uni-trier.de/db/journals/cacm/Codd70.html",
  abstract =     "Future users of large data banks must be protected
                 from having to know how the data is organized in the
                 machine (the internal representation). A prompting
                 service which supplies such information is not a
                 satisfactory solution. Activities of users at terminals
                 and most application programs would remain unaffected
                 when the internal representation of data is changed and
                 even when some aspects of the external representation
                 are changed. Changes in data representation will often
                 be needed as a result of changes in query, update, and
                 report traffic and natural growth in the types of
                 stored information. Existing noninferential, formatted
                 data systems provide users with tree-structured files
                 or slightly more general network models of the data. In
                 Section 1, inadequacies of these models are discussed.
                 A model based on $n$-ary relations, a normal form for
                 data base relations, and the concept of a universal
                 data sublanguage are introduced. In Section 2, certain
                 operations on relations (other than logical inference)
                 are discussed and applied to the problems of redundancy
                 and consistency in the user's model.",
  acknowledgement = ack-nhfb,
  annote =       "Shows problems of hierarchical data organization,
                 presents a non-hierarchical `normal' structure, and
                 discusses languages for describing relations of such
                 normal structures.",
  cdrom =        "CACMs1/CACM13/P377.pdf",
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  corpsource =   "IBM, San Jose, CA, USA",
  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{Grant:1970:ICG,
  author =       "C. A. Grant",
  title =        "An interactive command generating facility",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "403--406",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A facility to permit conversationally controlled tasks
                 to be executed in a noninteractive environment is
                 proposed. A means by which programs can generate
                 interactive time-sharing commands and receive the
                 corresponding output response is presented. The
                 commands will be invoked as if they had been typed at a
                 console keyboard. It is argued that this facility will
                 help overcome some of the current limitations in
                 man-computer communication. A set of functions to
                 accomplish the above which could be embedded into any
                 string processing language is suggested, and necessary
                 information pertinent to implementation of the facility
                 on existing time-sharing systems is given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140B (Machine-oriented languages); C6150J (Operating
                 systems)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; computers, time sharing; interactive
                 computing; machine oriented languages; operating
                 systems; time-sharing systems",
}

@Article{Wilkes:1970:CAM,
  author =       "M. A. Wilkes",
  title =        "Conversational Access to a 2048-Word Machine",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "407--414",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "LAP6 is an on-line system running on 2048- word LINC
                 which provides full facilities for text editing,
                 automatic filing and file maintenance, and program
                 preparation and assembly. It focuses on the preparation
                 and editing of continuously displayed 23,040- character
                 text strings (manuscripts) which can be positioned
                 anywhere by the user and edited by simply adding and
                 deleting lines as though working directly on an elastic
                 scroll. Other features are available through a uniform
                 command set which itself can be augmented by the user.
                 The machine, although small, aids program design by
                 providing display scope and premarked randomly
                 addressable LINC tapes as standard items, in an
                 environment similar to that of a sophisticated
                 terminal. The tapes are logically similar to a disk.
                 Priority was given to the design of efficient tape
                 algorithms to minimize the limitations of the small
                 memory. Techniques developed for handling scroll
                 editing, filing, and the layered system structure are
                 outlined.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Washington Univ., St. Louis, MS, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; interactive computing; OD; online
                 operation; operating systems; operating systems
                 (computers); text editing",
}

@Article{Waite:1970:MPS,
  author =       "W. M. Waite",
  title =        "The mobile programming system: {STAGE} 2",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "415--421",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "STAGE 2 is the second level of a bootstrap sequence
                 which is easily implemented on any computer. It is a
                 flexible, powerful macro processor designed
                 specifically as a tool for constructing
                 machine-independent software. The features provided by
                 STAGE 2 are summarized, and the implementation
                 techniques which have made it possible to have STAGE 2
                 running on a new machine with less than one man-week of
                 effort are discussed. The approach has been successful
                 on over 15 machines of widely varying
                 characteristics.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140E (Other programming languages)",
  corpsource =   "Univ. Colorado, Boulder, CO, USA",
  journalabr =   "Commun ACM",
  keywords =     "bootstrapping; computers; macro processors;
                 programming languages; system",
}

@Article{Bloom:1970:STT,
  author =       "Burton H. Bloom",
  title =        "Space\slash Time Trade-offs in Hash Coding with
                 Allowable Errors",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "422--426",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:55 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Bloom70",
  URL =          "http://dblp.uni-trier.de/db/journals/cacm/Bloom70.html",
  abstract =     "Trade-offs among certain computational factors in hash
                 coding are analyzed. The paradigm problem considered is
                 that of testing a series of messages one-by-one for
                 membership in a given set of messages. Two new
                 hash-coding methods are examined and compared with a
                 particular conventional hash-coding method. The
                 computational factors considered are the size of the
                 hash area (space), the time required to identify a
                 message as a nonmember of the given set (reject time),
                 and an allowable error frequency. The new methods are
                 intended to reduce the amount of space required to
                 contain the hash-coded information from that associated
                 with conventional methods. The reduction in space is
                 accomplished by exploiting the possibility that a small
                 fraction of errors of commission may be tolerable in
                 some applications, in particular, applications in which
                 a large amount of data is involved and a core resident
                 hash area is consequently not feasible using
                 conventional methods. An example is discussed which
                 illustrates possible areas of application for the new
                 method.",
  acknowledgement = ack-nhfb,
  annote =       "Phantom use of a direct access list.",
  cdrom =        "CACMs1/CACM13/P422.pdf",
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Computer Usage Co. Newton Upper Falls, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "bit vector filter CACM; codes; computers; computers,
                 errors; hash coding; inf",
  oldlabel =     "Bloom70",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bloom70",
}

@Article{Coffman:1970:FSU,
  author =       "E. G. {Coffman, Jr.} and J. Eve",
  title =        "File Structures Using Hashing Functions",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "427--432, 436",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib",
  abstract =     "A general method of file structuring is proposed which
                 uses a hashing function to define tree structure. Two
                 types of such trees are examined, and their relation to
                 trees studied in the past is explained. Results for the
                 probability distributions of path lengths are derived
                 and illustrated.",
  acknowledgement = ack-nhfb,
  annote =       "Tree structure with branching based on bit values of
                 key code.",
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. Newcastle upon Tyne, UK",
  journalabr =   "Commun ACM",
  keywords =     "computers; data processing; data structures; file
                 organization; hash coding; information storage and
                 retrie; tree structures; trees (mathematics)",
}

@Article{Bradley:1970:ABG,
  author =       "Gordon H. Bradley",
  title =        "Algorithm and Bound for the Greatest Common Divisor of
                 $n$ Integers",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "433--436",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "10A30",
  MRnumber =     "45 3313",
  MRreviewer =   "A. M. Cohen",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A new version of the Euclidean algorithm for finding
                 the greatest common divisor of $n$ integers $a(i)$ and
                 multipliers $x(i)$ such that $\mbox{gcd} = x(1)a(1) +
                 \ldots + x(n)a(n)$ is presented. The number of
                 arithmetic operations and the number of storage
                 locations are linear in $n$. A theorem of Lame that
                 gives a bound for the number of iterations of the
                 Euclidean algorithm for two integers is extended to the
                 case of $n$ integers. An algorithm to construct a
                 minimal set of multipliers is presented. A Fortran
                 program for the algorithm appears as Comm. ACM
                 Algorithm 386.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Yale Univ., New Haven, CT, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers, data processing; diophantine equations;
                 Euclidean algorithm; greatest common divisor; iterative
                 methods; mathematics; number theory; numerical
                 methods",
}

@Article{Woods:1970:CSP,
  author =       "W. A. Woods",
  title =        "Context-Sensitive Parsing",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "437--445",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "This paper presents a canonical form for
                 context-sensitive derivations and a parsing algorithm
                 which finds each context-sensitive analysis once and
                 only once. The amount of memory required by the
                 algorithm is essentially no more than the required to
                 store a single complete derivation. In addition, a
                 modified version of the basic algorithm is presented
                 which blocks infinite analyses for grammars which
                 contain loops. The algorithm is also compared with
                 several previous parsers for context-sensitive grammars
                 and general rewriting systems, and the difference
                 between the two types of analyses is discussed. The
                 algorithm appears to be complementary to an algorithm
                 by S. Kuno in several respects, including the
                 space-time trade-off and the degree of context
                 dependence involved.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "automata theory; computational linguistics;
                 context-sensitive grammars; context-sensitive parsing;
                 formal grammars; formal language theory; parsing;
                 parsing algorithms; recognition algorithms",
}

@Article{Paciorek:1970:AAE,
  author =       "K. A. Paciorek",
  title =        "{ACM Algorithm 385}: Exponential Integral ${E}_i(x)$",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "446--447",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Frisch:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7300 (Natural sciences computing)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  keywords =     "integration; subroutines",
}

@Article{Bradley:1970:AAG,
  author =       "G. H. Bradley",
  title =        "{ACM Algorithm 386}: Greatest Common Divisor of $n$
                 Integers and Multipliers",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "447--448",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See certification \cite{Ragland:1973:CAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods); C7300 (Natural
                 sciences computing)",
  corpsource =   "Yale Univ. New Haven, CT, USA",
  keywords =     "number theory; subroutines",
}

@Article{Bray:1970:CAR,
  author =       "T. Bray",
  title =        "Certification of {Algorithm 22, Ricatti--Bessel
                 Functions of First and Second Kind}",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "448--448",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Oct 29 21:49:15 2010",
  acknowledgement = ack-nhfb,
  citedby =      "Fullerton:1980:BEM",
  remark =       "Fullerton: An error in an Algol procedure is
                 reported.",
}

@Article{Ng:1970:CAE,
  author =       "E. N. Ng",
  title =        "Certification of {Algorithm 385, Exponential Integral
                 {${\rm Ei}(x)$}}",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "448--449",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Oct 30 09:18:14 2010",
  acknowledgement = ack-nhfb,
  citedby =      "Fullerton:1980:BEM",
  remark =       "Fullerton: Comments on a FORTRAN routine.",
}

@Article{Sattley:1970:CPL,
  author =       "K. Sattley and R. Millstein",
  title =        "Comments on a paper by {Lowe}",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "450--451",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Applied Data Res. Inc., NY, USA",
  keywords =     "computation theory; graph theory",
}

@Article{Baecker:1970:NDB,
  author =       "H. D. Baecker",
  title =        "A note on data base deadlocks",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "451--451",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7250 (Information storage and retrieval)",
  corpsource =   "Univ. Calgary, Alta., Canada",
  keywords =     "information retrieval",
}

@Article{Pomeranz:1970:NAP,
  author =       "J. E. Pomeranz",
  title =        "Note on an Anomaly in Paging",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "451--451",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "demand paging; paging machines; replacement algorithm;
                 storage allocation",
}

@Article{Hunt:1970:CAA,
  author =       "B. R. Hunt",
  title =        "A Comment on Axiomatic Approaches to Programming",
  journal =      j-CACM,
  volume =       "13",
  number =       "7",
  pages =        "452--452",
  month =        jul,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Univ. California, Los Alamos, NM, USA",
  keywords =     "axiomatic method; computability and decidability;
                 homomorphic structure in programming; programming;
                 proofs of programs",
}

@Article{Nielsen:1970:ACR,
  author =       "N. R. Nielsen",
  title =        "Allocation of Computer Resources. is Pricing the
                 Answer",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "467--474",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The extent to which a pricing mechanism fits the mold
                 is discussed. Inasmuch as pricing must serve as a
                 rationing mechanism at times, consideration is given to
                 the means by which prices can be adjusted flexibly in
                 order to make a dynamic allocation of resources.
                 Consideration is given to the means by which users can
                 be insulated from the harmful effects of frequent price
                 fluctuations. Two illustrative pricing systems are
                 discussed in order to demonstrate the applicability of
                 pricing in quite different environments.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers; cost accounting; digital computers;
                 economics; industrial management; installation
                 management; resource allocation; resources",
}

@Article{Nagy:1970:NTH,
  author =       "G. Nagy and N. Tuong",
  title =        "Normalization Techniques for Handprinted Numerals",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "475--481",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A family of pattern standardization techniques based
                 on geometrical projection is applied to a file of
                 digitized handprinted numerals obtained from sales
                 clerks. The principle involves transforming a
                 quadrilateral specified in terms of the convex hull of
                 each pattern into a square. The amount of overlap
                 within each class of characters vs the amount between
                 classes is used to evaluate the degree of normalization
                 achieved with respect to other published methods
                 including size and shear normalization through
                 moments.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers digital, character R; computers,
                 digital; pattern recognition; pattern recognition
                 systems",
}

@Article{Day:1970:FTQ,
  author =       "A. C. Day",
  title =        "Full Table Quadratic Searching for Scatter Storage",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "481--482",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The quadratic residue search method for hash tables
                 avoids much of the clustering experienced with a linear
                 search method. The simple quadratic search only
                 accesses half the table. It has been shown that when
                 the length of the table is a prime of the form 4n plus
                 3, where n is an integer, the whole table may be
                 accessed by two quadratic searches plus a separate
                 access for the original entry point. A search method is
                 presented which is computationally simple, has all the
                 advantages of the quadratic search, and yet accesses
                 all the table in one sweep.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. Coll. London, UK",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers; computers, data storage; hash
                 coding; programming; table look-up; table lookup",
}

@Article{Brawn:1970:SPE,
  author =       "B. S. Brawn and F. G. Gustavson and E. S. Mankin",
  title =        "Sorting in a Paging Environment",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "483--494",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib",
  abstract =     "This sorting study was part of an extensive
                 measurement project undertaken on the M44\slash 44X, an
                 experimental paging system which was conceived and
                 implemented at IBM Research in order to explore the
                 virtual machine concept. The study was concerned with
                 the implementation of sorting procedures in the context
                 of the dynamic paging environment characteristic of
                 virtual memory machines. Descriptions of the
                 experimental sort programs and analysis of the
                 performance measurement results obtained for them are
                 presented. The insight gained from the experimental
                 effort is used to arrive at a set of broad guidelines
                 for writing sort programs for a paging environment.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer, memories; computers; computers,
                 programming; dynamic memory management; External sort
                 virtual memory CACM; operating systems; sorting;
                 virtual machines",
}

@Article{Saltzer:1970:IM,
  author =       "J. H. Saltzer and J. W. Gintell",
  title =        "The instrumentation of {Multics}",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "495--500",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib",
  abstract =     "An array of measuring tools devised to aid in the
                 implementation of a prototype computer utility is
                 discussed. These tools include special hardware clocks
                 and data channels, general purpose programmed probing
                 and recording tools, and specialized measurement
                 facilities. Some particular measurements of interest in
                 a system which combines demand paging with
                 multiprogramming are described in detail. Measuring
                 techniques described here have been directed primarily
                 toward understanding what goes on inside the operating
                 system, rather than on measuring `throughput' system
                 capacity, or the characteristics of system load.",
  acknowledgement = ack-nhfb,
  annote =       "An array of measuring tools devised to aid in the
                 implementation of a prototype computer utility is
                 discussed. These tools include (1) a hardware calendar
                 clock (52 bit, 1 microsecond resolution) and an
                 associated match register; (2) a memory reference
                 counter; (3) an input/output channel which can be used
                 by an attached processor to read memory; (4) a general
                 metering package which records time spent executing
                 selectable supervisor modules while the system is
                 running; (5) a segment utilization metering facility
                 which periodically probes for the current segment
                 number; (6) a facility which records on a per-segment
                 basis the number of missing pages and segments
                 encountered during execution in that segment; (7) a
                 tool which counts the number of times procedures are
                 called; (8) a software package implemented on a PDP-8
                 which utilizes the special I/O channel (3); (9) the
                 CLI, which prints out the time of day, the CPU time,
                 and the number of times the process had to wait for a
                 page to be brought in after every `ready message'; (10)
                 a ring buffer containing the segment, page number, and
                 time of day of the last 256 missing pages of the
                 process under measurement; (11) a package to monitor
                 the effect of the system's multiprogramming effort of
                 an individual program; (12) a script driver implemented
                 on a PDP-8; and (13) an internal script driver.",
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "MIT, Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers; multiprogramming systems; operating
                 distributed performance paging CACM; operating systems;
                 operating systems (computers); performance measurement;
                 system analysis",
}

@Article{Ichbiah:1970:TGA,
  author =       "J. D. Ichbiah and S. P. Morse",
  title =        "A technique for generating almost optimal
                 {Floyd-Evans} productions for precedence grammars",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "501--508",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Co. Internat. l'Informatique, Les Clayes-sous-Bois,
                 France",
  keywords =     "computational linguistics; grammars; optimisation",
}

@Article{Fielding:1970:AAF,
  author =       "K. Fielding",
  title =        "{ACM Algorithm 387}: Function Minimization and Linear
                 Search",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "509--510",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Univ. Essex, Wivenhoe Park, Colchester, UK",
  keywords =     "optimisation; subroutines",
}

@Article{Hubner:1970:AAR,
  author =       "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W.
                 Schwering",
  title =        "{ACM Algorithm 388}: {Rademacher} Function",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "510--511",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  keywords =     "mathematics; subroutines",
}

@Article{Hubner:1970:AAB,
  author =       "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W.
                 Schwering",
  title =        "{ACM Algorithm 389}: Binary Ordered {Walsh}
                 Functions",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "511--511",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  keywords =     "mathematics; subroutines",
}

@Article{Hubner:1970:AAS,
  author =       "H. H{\"{u}}bner and H. Kremer and K. O. Linn and W.
                 Schwering",
  title =        "{ACM Algorithm 390}: Sequency Ordered {Walsh}
                 Functions",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "511--511",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:38:16 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  keywords =     "mathematics; subroutines",
}

@Article{McKay:1970:AAU,
  author =       "J. McKay",
  title =        "{ACM Algorithm 391}: Unitary Symmetric Polynomials",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "512--512",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Schrack:1972:RAU}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "California Inst. Technol., Pasadena, CA, USA",
  keywords =     "polynomials; subroutines",
}

@Article{Anonymous:1970:ISU,
  author =       "Anonymous",
  title =        "Identification of {States of the United States}
                 (including the {District of Columbia}) for information
                 interchange",
  journal =      j-CACM,
  volume =       "13",
  number =       "8",
  pages =        "514--515",
  month =        aug,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  keywords =     "code standards",
}

@Article{Bouknight:1970:PGT,
  author =       "W. Jack Bouknight",
  title =        "A Procedure for Generation of Three-Dimensional
                 Half-Toned Computer Graphics Presentations",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "527--536",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib",
  abstract =     "A description is given of an algorithm for producing
                 computer generated halftone presentations of
                 three-dimensional polygonal surface structures. The
                 history leading to the algorithm development and then
                 the algorithm itself are described. Results are
                 presented and are compared with computer runs achieved
                 by the Warnock approach. An extension of the procedure
                 to variable position illumination sources is also
                 given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Univ. Illinois, Urbana, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer graphics; computers; half-tone images;
                 hidden surface; image processing",
}

@Article{Bracchi:1970:ISS,
  author =       "G. Bracchi and M. Somalvico",
  title =        "Interactive Software System for Computer-Aided Design.
                 an Application to Circuit Project",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "537--545",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Characteristics of an interactive software system,
                 intended to constitute an interface between designer
                 and computer during various steps of the design
                 process, are presented. Main emphasis is given to the
                 description of the features of the two high level user
                 oriented languages, operating at different levels, on
                 which the interaction is based. The first one is IMOL,
                 an interactive monitor language, which is designed to
                 perform the overall and control functions of the
                 software system. The second one is COIF, a circuit
                 oriented graphic language, which is designed to
                 describe, generate, and manipulate graphic problem
                 specifications. The application to computer-aided
                 circuit design is in particular examined.",
  acknowledgement = ack-nhfb,
  classcodes =   "B1130B (Computer-aided circuit analysis and design);
                 C7410D (Electronic engineering computing)",
  corpsource =   "Politecnico, Milano, Italy",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer aided circuit design; computer-aided
                 circuit design; computers; computers, graphics;
                 computers, programming; electric circuits, analysis;
                 language; online operation",
}

@Article{Hirschsohn:1970:AHL,
  author =       "I. Hirschsohn",
  title =        "{AMESPLOT}, a Higher Level Data Plotting Software
                 System",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "546--555",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "System described is hardware independent. Elements
                 common to all types of data plots are outlined and the
                 way in which these elements may be combined into a
                 system based on simple modules is demonstrated. Basic
                 syntax of AMESPLOT is outlined, and a brief description
                 is given of its current utility software, consisting of
                 `macros' to produce self-scaled plots, formal tablets
                 of text, interspersed with subplots, map coastlines and
                 3-D plots. Structuring of plots from multiple,
                 independent, self-contained subplots is described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. California, San Diego, La Jolla, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer graphics; computers; computers,
                 language; data plotting; graphics; interactive
                 computing; problem oriented languages",
}

@Article{Moler:1970:ISR,
  author =       "Cleve B. Moler and Louis P. Solomon",
  title =        "Integrating Square Roots",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "556--557",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.60",
  MRnumber =     "44\#1223",
  MRreviewer =   "J. C. Butcher",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Differential equation of the $(y')^2 = f(y)$ are
                 difficult to integrate numerically because of the
                 singularity at points where $f(y)$ vanishes. A
                 technique is described for removing the singularity and
                 evaluating the expressions through the use of standard
                 numerical methods for second order ordinary
                 differential equations.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; differential equations; mathematics; numerical
                 methods; quadrature; Y F",
}

@Article{Kimble:1970:VGL,
  author =       "G. W. Kimble",
  title =        "A Variation of the {Goodman-Lance} Method for the
                 Solution of Two-Point Boundary Value Problems",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "557--558",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.62",
  MRnumber =     "44\#3500",
  MRreviewer =   "F. Odeh",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A recently published method for the interpolative
                 solution of nonlinear equations is improved, and
                 applied to give a significant variation of the
                 Goodman-Lance method for the solution of two-point
                 boundary value problems. The resulting method applies
                 in particular to the numerical solution of optimal
                 control problems in the Euler--Lagrange formulation.
                 Quantitative estimates are presented which indicate
                 that the variation is nearly twice as fast on some
                 problems in the latter context.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Univ. Nevada, Reno, NV, USA",
  journalabr =   "Commun ACM",
  keywords =     "automatic control; boundary value problems;
                 boundary-value problems; CACMA; differential equations;
                 Goodman-Lance; interpolative solution; Newton's method;
                 nonlinear equations; numerical methods; optimal
                 control; optimization; ordinary differential equations;
                 orthogonal matrices; secant method",
}

@Article{Wilson:1970:OSA,
  author =       "M. Wayne Wilson",
  title =        "Optimal Starting Approximations for Generating Square
                 Root for Slow or No Divide",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "559--560",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.50",
  MRnumber =     "44\#2338",
  MRreviewer =   "J. E. {Dennis, Jr.}",
  bibdate =      "Tue Apr 08 20:38:30 1997",
  bibsource =    "Compendex database;
                 ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip",
  abstract =     "On computing machines with slow or no division, it is
                 preferable to use an iterative scheme for the square
                 root different from the classical Heron scheme. The
                 problem of optimal initial approximants is considered,
                 and some optimal polynomial initial approximations are
                 tabulated.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "IBM, Houston, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; digital arithmetic; ele; iterative methods;
                 mathematics; numerical methods; optimisation",
}

@Article{Ehrlich:1970:CMI,
  author =       "L. W. Ehrlich",
  title =        "Complex Matrix Inversion Versus Real",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "561--562",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.35",
  MRnumber =     "44\#1196",
  MRreviewer =   "C. G. Cullen",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A comparison of complex matrix with real matrix
                 inversion is made. It is shown that the complex
                 inversion can be up to twice as fast as the real
                 inversion. Further, the rounding error bound for
                 complex inversion is about one-eighth that of real, for
                 Gaussian elimination. Using extended inner product
                 accumulation the bound is half of the real system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Johns Hopkins Univ., Silver Spring, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; complex matrix inversion; complex rounding
                 error bounds; error bounds; GUL; inversion;
                 mathematics; matrix algebra; matrix inversion;
                 numerical methods; rounding error bound; rounding
                 errors",
}

@Article{vanEmden:1970:IEQ,
  author =       "M. H. {van Emden}",
  title =        "Increasing the Efficiency of Quicksort",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "563--567",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:38:44 1997",
  bibsource =    "Compendex database",
  abstract =     "The average asymptotic number of comparisons needed is
                 shown to be $! n log_2 (n)$. A formula is derived
                 expressing $!$ in terms of the probability distribution
                 of the `bound' of a partition. Another generalization
                 of quicksort is presented which uses a bounding
                 interval instead of a single element as bound. This
                 generalization turns out to be easy to implement in a
                 computer program. A numerical approximation shows that
                 $!$ equals 1.140 for this version of quicksort compared
                 with 1.386 for the original. This implies a decrease in
                 number of comparisons of 18\%; actual tests showed
                 about 15\% saving in computing time.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Math. Centre, Amsterdam, Netherlands",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers; programming; SAL; sorting",
}

@Article{Smith:1970:AAS,
  author =       "Robert R. Smith and Dennis McCall",
  title =        "{ACM Algorithm 392}: Systems of Hyperbolic {P.D.E.}",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "567--570",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Frisch:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations); C7310 (Mathematics
                 computing)",
  corpsource =   "US Naval Electronics Lab. Center, San Diego, CA, USA",
  keywords =     "boundary-value problems; partial differential
                 equations",
}

@Article{Abdali:1970:AAS,
  author =       "S. K. Abdali",
  title =        "{ACM Algorithm 393}: Special Series Summation with
                 Arbitrary Precision",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "570--570",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Sale:1972:RAS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4120 (Functional analysis); C7310 (Mathematics
                 computing)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "function approximation; function evaluation;
                 subroutines",
}

@Article{Dial:1970:AAD,
  author =       "R. B. Dial",
  title =        "{ACM Algorithm 394}: Decision Table Translation",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "571--572",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Marshall:1972:RAD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Univ. Washington, Seattle, WA, USA",
  keywords =     "decision tables; program interpreters; subroutines",
}

@Article{Lamport:1970:CBQ,
  author =       "Leslie Lamport and J. R. Bell",
  title =        "Comment on {Bell}'s Quadratic Quotient Method for Hash
                 Code Searching",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "573--574",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  keywords =     "codes; data handling",
}

@Article{Bavel:1970:NAS,
  author =       "Z. Bavel",
  title =        "On the Number of Automorphisms of a Singly Generated
                 Automaton",
  journal =      j-CACM,
  volume =       "13",
  number =       "9",
  pages =        "574--575",
  month =        sep,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4220 (Automata theory)",
  corpsource =   "Univ. Kansas, Lawrence, KS, USA",
  keywords =     "automata; automorphisms; finite automata; generators;
                 length of state; minimal-length generators; orbit;
                 singly generated automata",
}

@Article{Woods:1970:TNG,
  author =       "W. A. Woods",
  title =        "Transition Network Grammars for Natural Language
                 Analysis",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "591--606",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C7820 (Humanities computing)",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  keywords =     "grammars; language translation and linguistics",
}

@Article{Earley:1970:FTI,
  author =       "J. Earley and H. Sturgis",
  title =        "A formalism for translator interactions",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "607--617",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A formalism is presented for describing the actions of
                 processors for programming languages-compilers,
                 interpreters, assemblers-and their interactions in
                 complex systems such as compiler-compilers or
                 extendible languages. An algorithm is presented for
                 deciding whether or not a given system can be produced
                 from a given set of component processors.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; compilers; computational linguistics; computer,
                 digital; computers, digital, languages; computers,
                 digital, operating; pre; program; program assemblers;
                 program interpreters; program processors; programming
                 languages",
}

@Article{Hill:1970:AASa,
  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 =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See also \cite{Lozy:1979:RSD,Hill:1981:RSD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "CSIRO, Glen Osmond, Australia",
  keywords =     "statistics; subroutines",
}

@Article{Hill:1970:AASb,
  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 =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See also
                 \cite{Hill:1981:RSD,Hill:1981:RSQ,Lozy:1979:RSD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4120 (Functional analysis); C7310 (Mathematics
                 computing)",
  corpsource =   "CSIRO, Glen Osmond, Australia",
  keywords =     "function evaluation; statistics; subroutines",
}

@Article{Chang:1970:AAI,
  author =       "S. K. Chang and A. Gill",
  title =        "{ACM Algorithm 397}: An Integer Programming Problem",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "620--621",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Johnson:1972:RAI}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  keywords =     "integer programming; subroutines",
}

@Article{Stone:1970:AAT,
  author =       "R. A. Stone",
  title =        "{ACM Algorithm 398}: Tableless Date Conversion",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "621--621",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Robertson:1972:RAT}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Western Electric Co., Princeton, NJ, USA",
  keywords =     "code convertors; subroutines",
}

@Article{Seppanen:1970:AAS,
  author =       "J. J. Sepp{\"{a}}nen",
  title =        "{ACM Algorithm 399}: Spanning Tree",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "621--622",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Helsinki Univ. Technol., Otaniemi, Finland",
  keywords =     "graph theory; subroutines; trees (mathematics)",
}

@Article{Wallick:1970:AAM,
  author =       "G. C. Wallick",
  title =        "{ACM Algorithm 400}: Modified {H{\aa}vie}
                 Integration",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "622--624",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Piessens:1974:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Mobil Res. Dev. Corp., Dallas, TX, USA",
  keywords =     "integration; subroutines",
}

@Article{Peto:1970:RAM,
  author =       "R. Peto",
  title =        "Remark on ``{Algorithm 347}: {An} Efficient Algorithm
                 for Sorting with Minimal Storage [{M1}]''",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "624",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue May 28 09:23:57 1996",
  note =         "See \cite{Griffin:1970:RME,Singleton:1969:AAEa}.",
  acknowledgement = ack-nhfb,
  keywords =     "digital computer sorting; minimal storage sorting;
                 ranking; sorting",
}

@Article{Smith:1970:UIG,
  author =       "L. B. Smith",
  title =        "The use of interactive graphics to solve numerical
                 problems",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "625--634",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "CERN, Geneva, Switzerland",
  keywords =     "analysis; computer graphics; least squares
                 approximations; numerical; online operation",
}

@Article{LaFata:1970:IDA,
  author =       "P. LaFata and J. B. Rosen",
  title =        "An interactive display for approximation by linear
                 programming",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "651--659",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68.00 (90.00)",
  MRnumber =     "42\#2712",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  abstract =     "An interactive program with a graphical display has
                 been developed for the approximation of data by means
                 of a linear combination of functions (including
                 splines) selected by the user. The coefficients of the
                 approximation are determined by linear programming so
                 as to minimize the error in either the $L_1$ or
                 $L-\infty$ norm. Auxiliary conditions such as
                 monotonicity or convexity of the approximation can also
                 be imposed. This interactive system is described and
                 several examples of its use are given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "approximation; data fitting; function approximation;
                 functional approximation; interactive graphical
                 display; linear programming; online operation; spline
                 functions",
}

@Article{Lum:1970:MAR,
  author =       "Vincent Y. Lum",
  title =        "Multi-Attribute Retrieval with Combined Indexes",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "660--665",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:13 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Lum70",
  URL =          "http://dblp.uni-trier.de/db/journals/cacm/Lum70.html",
  acknowledgement = ack-nhfb,
  annote =       "Construction of combined indexes with formulas for
                 number needed.",
  cdrom =        "CACMs1/CACM13/P660.pdf",
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  corpsource =   "IBM, San Jose, CA, USA",
  keywords =     "file organisation; information retrieval",
  oldlabel =     "Lum70",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lum70",
}

@Article{Mifsud:1970:MDA,
  author =       "C. J. Mifsud",
  title =        "A multiple-precision division algorithm",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "666--668",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Mitre Corp., McLean, VA, USA",
  keywords =     "digital arithmetic",
}

@Article{Conrow:1970:NPS,
  author =       "K. Conrow and R. G. Smith",
  title =        "{NEATER2}: {A PL/I} Source Statement Reformatter",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "669--675",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  abstract =     "NEATER2 accepts a PL/I source program and operates on
                 it to produce a reformatted version. When in the
                 LOGICAL mode, NEATER2 indicates the logical structure
                 of the source program in the indentation pattern of its
                 output. Logic errors discovered through NEATER2 logical
                 analysis are discovered much more economically than is
                 possible through compilation and trial runs. A number
                 of options are available to give the user full control
                 over the output format and to maximize the utility of
                 NEATER2 as an aid during the early stages of
                 development of a PL/I source deck. One option, USAGE,
                 causes NEATER2 to insert into each logical unit of
                 coding a statement which will case the number of times
                 each one is executed to be recorded during execution.
                 This feature is expected to provide a major aid in
                 optimization of PL/I programs.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Kansas State Univ., Manhattan, KS, USA",
  keywords =     "documentation aid; execution time usage data; logical
                 analysis of PL/I source; optimisation; PL/1;
                 prettyprinter; program processors; reformatting of PL/I
                 source",
}

@Article{Bell:1970:LQH,
  author =       "James R. Bell and Charles H. Kaman",
  title =        "The Linear Quotient Hash Code",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "675--677",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "Independent discovery of technique of secondary hash
                 functions first proposed by
                 \cite{deBalbine:1969:CAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Digital Equipment Corp., Maynard, MA, USA",
  keywords =     "codes",
}

@Article{Cheney:1970:NLC,
  author =       "C. J. Cheney",
  title =        "A Nonrecursive List Compacting Algorithm",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "677--678",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:30:46 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm13.html#Cheney70",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. Cambridge, UK",
  keywords =     "data structures; list processing; storage management",
  oldlabel =     "Cheney70",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Cheney70",
}

@Article{Anonymous:1970:PANa,
  author =       "Anonymous",
  title =        "Proposed {American National Standard}. Recorded
                 magnetic tape for information interchange (1600 {CPI},
                 phase encoded)",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "679--685",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5320C (Storage on moving magnetic media)",
  keywords =     "magnetic recording; standards",
}

@Article{Anonymous:1970:PANb,
  author =       "Anonymous",
  title =        "Proposed {American National Standard}. Unrecorded
                 magnetic tape for information interchange (9 track-200
                 and 800 {CPI}, {NRZI} and 1600 {CPI}, {P.E.})",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "686--692",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5320C (Storage on moving magnetic media)",
  keywords =     "magnetic recording; standards",
}

@Article{Bratley:1970:AAI,
  author =       "P. Bratley",
  title =        "{ACM Algorithm 401}: An Improved Algorithm to Produce
                 Complex Primes",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "693--693",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Montreal, Que., Canada",
  keywords =     "number theory; subroutines",
}

@Article{vanEmden:1970:AAI,
  author =       "M. H. {van Emden}",
  title =        "{ACM Algorithm 402}: Increasing the Efficiency of
                 {Quicksort}",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "693--694",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remark \cite{Wheeler:1973:IEQ}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Math. Centre, Amsterdam, Netherlands",
  keywords =     "sorting; subroutines",
}

@Article{Wilson:1970:GMG,
  author =       "W. J. Wilson",
  title =        "A generalized method for generating argument\slash
                 function values",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "696--697",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Univac Div. Sperry Rand, Huntsville, AL, USA",
  keywords =     "decision tables; table lookup",
}

@Article{Ehrman:1970:CAC,
  author =       "J. R. Ehrman",
  title =        "Correction to 'logical' arithmetic on computers with
                 two's complement binary arithmetic",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "697--698",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Stanford Linear Accelerator Center, CA, USA",
  keywords =     "digital arithmetic",
}

@Article{Bernstein:1970:CWS,
  author =       "A. Bernstein",
  title =        "Comment on the working set model for program
                 behavior",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "698--699",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "State Univ. New York, Stony Brook, NY, USA",
  keywords =     "storage management",
}

@Article{Rokne:1970:CNP,
  author =       "J. Rokne",
  title =        "Condition numbers of {Pei} matrices",
  journal =      j-CACM,
  volume =       "13",
  number =       "11",
  pages =        "699--699",
  month =        nov,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Univ. Calgary, Alta., Canada",
  keywords =     "matrix algebra",
}

@Article{Mathews:1970:GPC,
  author =       "M. V. Mathews and F. R. Moore",
  title =        "{GROOVE-A} program to compose, store, and edit
                 functions of time",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "715--721",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7420 (Control engineering computing); C7820
                 (Humanities computing)",
  corpsource =   "Bell Telephone Labs., Murray Hill, NJ, USA",
  keywords =     "compose store, edit, time functions; computer music;
                 computers; conductor program; control engineering
                 applications of computers; digital control; GROOVE;
                 hybrid; hybrid systems; interactive software;
                 luminescence; man computer system; man-machine systems;
                 periodic functions; real-time; real-time control;
                 sampled data systems; systems",
  treatment =    "P Practical",
}

@Article{Tiernan:1970:ESA,
  author =       "James C. Tiernan",
  title =        "An Efficient Search Algorithm to Find the Elementary
                 Circuits of a Graph",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "722--726",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "94.30 (05.00)",
  MRnumber =     "42\#7427",
  MRreviewer =   "J. Mor{\'a}vek",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  abstract =     "A theoretically most efficient search algorithm is
                 presented which uses an exhaustive search to find all
                 of the elementary circuits of a graph. The algorithm
                 can be easily modified to find all of the elementary
                 circuits with a particular attribute such as length. A
                 rigorous proof of the algorithm is given as well as an
                 example of its application. Empirical bounds are
                 presented relating the speed of the algorithm to the
                 number of vertices and the number of arcs. The speed is
                 also related to the number of circuits in the graph to
                 give a relation between speed and complexity.
                 Extensions to undirected and s-graphs are discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Univ. California, San Diego, La Jolla, CA, USA",
  keywords =     "algorithm; circuit search algorithm; elementary
                 circuits; graph theory; path search; path search
                 algorithm; searching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Betourne:1970:PMR,
  author =       "C. Betourne and J. Boulenger and J. Ferrie and C.
                 Kaiser and S. Krakowiak and J. Mossiere",
  title =        "Process management and resource sharing in the
                 multiaccess system {ESOPE}",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "727--733",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  keywords =     "ESOPE; multi-access systems; multiprogramming;
                 parallel processes; parallel processing; primitive
                 operations; process scheduling; programs; resource
                 allocation; system; time sharing system; time-sharing",
  treatment =    "P Practical",
}

@Article{Morgan:1970:IBO,
  author =       "H. L. Morgan",
  title =        "An interrupt based organization for management
                 information systems",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "734--739",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6150J (Operating
                 systems)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "data handling; integrated data processing; interrupt
                 scheduling; management information systems; monitoring;
                 parallel; parallel processing; processing; supervisory
                 programs; supervisory systems; systems",
}

@Article{Thompson:1970:IRR,
  author =       "R. J. Thompson",
  title =        "Improving round-off in {Runge--Kutta} computations
                 with {Gill}'s method",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "739--740",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Sandia Labs., Albuquerque, NM, USA",
  keywords =     "differential equations; error analysis; methods;
                 numerical mathematics; ordinary differential equations;
                 predictor-corrector; round-off error;
                 Runge--Kutta--Gill methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shapiro:1970:LSG,
  author =       "S. C. Shapiro",
  title =        "The list set generator: a construct for evaluating set
                 expressions",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "741--744",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "construct; file; list processing; processing;
                 programming; programming techniques; set generation;
                 set manipulating",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Black:1970:OMM,
  author =       "N. A. Black",
  title =        "Optimum Merging from Mass Storage",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "745--749",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Computer Sci. Corp., Huntsville, AL, USA",
  keywords =     "access time; drum merging; magnetic storage systems;
                 mass storage; merging; optimisation; optimum merging;
                 sort timing; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Redish:1970:RAE,
  author =       "K. A. Redish",
  title =        "Remark on {Algorithm 385, Exponential Integral ${\rm
                 Ei}(x)$}",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "750--750",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Oct 30 09:56:59 2010",
  acknowledgement = ack-nhfb,
  note =         "See \cite{Paciorek:1970:AEI,Frisch:1972:RAR}",
  citedby =      "Fullerton:1980:BEM",
  remark =       "Fullerton: Minor corrections to a FORTRAN routine.",
}

@Article{Stewart:1970:RAF,
  author =       "G. W. Stewart",
  title =        "Remark on ``{Algorithm 384}: Eigenvalues and
                 Eigenvectors of a Real Symmetric Matrix [{F2}]''",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "750--750",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:40:01 1997",
  note =         "See \cite{Stewart:1970:AAE}.",
  acknowledgement = ack-nhfb,
  keywords =     "eigenvalues; eigenvectors; QR algorithm; real
                 symmetric matrix",
  kwds =         "nla, eig, QR algorithm, symmetric matrix",
}

@Article{Fuchs:1970:EDR,
  author =       "E. A. Fuchs and P. E. Jackson",
  title =        "Estimates of Distributions of Random Variables for
                 Certain Computer Communications Traffic Models",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "752--757",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib",
  note =         "Reproduced in Advances in Computer Commun., Chu, W.
                 W., (Ed (1974), 2-7; in Computer Commun., Green, P. E.,
                 and Lucky, R. W. (Eds.), (1975), 577-582).",
  abstract =     "A study of multiaccess computer communications has
                 characterized the distributions underlying an
                 elementary model of the user-computer interactive
                 process. The model used is elementary in the sense that
                 many of the random variables that generally are of
                 interest in computer communications studies can be
                 decomposed into the elements of this model. Data were
                 examined from four operational multiaccess systems, and
                 the model is shown to be robust; that is each of the
                 variables of the model has the same distribution
                 independent of which of the four systems is being
                 examined. It is shown that the gamma distribution can
                 be used to describe the discrete variables.
                 Approximations to the gamma distribution by the
                 exponential distribution are discussed for the systems
                 studied.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Bell Telephone Labs. Inc., Holmdel, NJ, USA",
  descriptors =  "Random Process; Computer Communication; Traffic Model;
                 Distribution; Estimation;",
  keywords =     "computation theory; computer communications;
                 distribution of random variables; modelling;
                 multi-access systems; multiaccess systems; operating
                 systems; operating systems (computers); optimisation
                 models; optimization models; time-sharing; time-sharing
                 systems; user computer interactive processes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pinter:1970:DBF,
  author =       "C. C. Pinter",
  title =        "On decomposing a {Boolean} function and simplifying
                 the components separately",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "758--758",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4230 (Switching theory)",
  corpsource =   "Bucknell Univ., Lewisburg, PA, USA",
  keywords =     "basic cells; Boolean functions; minimisation;
                 minimisation of switching nets; of Boolean functions;
                 prime implicants; simplification; vertices",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Raduchel:1970:EHB,
  author =       "W. J. Raduchel",
  title =        "Efficient handling of binary data",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "758--759",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  keywords =     "binary variables; bit strings; cross-; data handling;
                 dummy variables; efficiency; programming; programming
                 techniques; tabulations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wagner:1970:FAI,
  author =       "Robert A. Wagner",
  title =        "Finiteness Assumptions and Intellectual Isolation of
                 Computer Scientists",
  journal =      j-CACM,
  volume =       "13",
  number =       "12",
  pages =        "759--760",
  month =        dec,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "ALGOL versus FORTRAN; Algol vs. Fortran; finite;
                 finite word size; finiteness assumptions; integer
                 variable range; intellectual; intellectual isolation;
                 isolation; memory finiteness; personnel; philosophical
                 aspects; word size",
}

@Article{Lowry:1971:OCO,
  author =       "E. Lowry and C. W. Medlock",
  title =        "Object Code Optimization",
  journal =      j-CACM,
  volume =       "12",
  number =       "1",
  pages =        "13--22",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Dec 26 16:35:14 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib",
  acknowledgement = ack-nhfb,
}

@Article{Galbi:1971:SPS,
  author =       "Elmer W. Galbi",
  title =        "Software and patents: a status report",
  journal =      j-CACM,
  volume =       "14",
  number =       "??",
  pages =        "274--278",
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Oct 22 14:07:06 MDT 1999",
  acknowledgement = ack-nhfb,
}

@Article{Hammer:1971:SSC,
  author =       "Carl Hammer",
  title =        "Signature Simulation and Certain Cryptographic Codes",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "3--14",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:10 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hammer71",
  abstract =     "Three cyphers allegedly authored by Thomas Jefferson
                 Beale in 1822 have been the subject of intensive study
                 for over 100 years. Generations of cryptanalysts have
                 expended untold man-years, thus far without success,
                 attempting tode code them; vast armies of fortune
                 hunters and treasure seekers have devoted Herculean
                 labors to digging up the rolling hills of Virginia
                 trying to locate the promised bonanza. \par

                 The history of pertinent activities would fill volumes,
                 yet serious students of cryptography have always had
                 nagging doubts about the cyphers' authenticity. It has
                 been alleged that the ``known solution'' to Cypher
                 Number Two: 115, 73, 24, 818, 37, 52, 49, \ldots{} (``I
                 have deposited in the County of Bedford about four
                 miles from Buford's in an excavation or vault
                 \ldots{}'') with the aid of an unsanitized version of
                 the Declaration of Independence was merely a superb,
                 imaginative, and grandiose hoax perpetrated ages ago
                 for whatever reasons. Modern computer technology could
                 obviously perform signature analyses the process of
                 encoding itself so as to yield new clues and deeper
                 insights into their construction. For the benefit of
                 the uninitiated, the encoding method used in the second
                 cypher employs a specified document whose words are
                 simply numbered consecutively, and first letters of
                 these words are sought out at random to match the
                 letters of these words are sought out at random to
                 match the letters of the clear text or message.
                 \par

                 The sequence of numbers corresponding to these matches
                 is then written down as the final code. While
                 primitive, the process has the advantage of relative
                 security until the source document becomes known; at
                 that moment the cypher can be decoded even by second
                 graders. The work now completed with the help of our
                 UNIVAC 1108 includes numerous analytical studies of the
                 Beale cyphers and various types of simulations.
                 \par

                 For example, we have turned the entire process of
                 simulated encoding by various schemes over to the
                 machine and analyzed the signatures of these synthetic
                 codes; we have also encoded various messages by hand,
                 using different texts and a variety of methods to
                 obtain their signatures. These simulations provide
                 convincing evidence that the signatures are both
                 process and data dependent; they indicate also very
                 strongly that Mr. Beale's cyphers are for real and that
                 it is merely a matter of time before someone finds the
                 correct source document and locates the right vault in
                 the common-wealth of Virginia.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6120B (Codes); C6130 (Data handling techniques)",
  keywords =     "Beale Cyphers codes; codes; computer applications;
                 computer signature simulation; cryptanalysis; cyphers;
                 Declaration of Independence; decoding; encoding; Magna
                 Carta; numerical cryptographic codes; pseudotext;
                 results analysis; signature; simulation; Thomas
                 Jefferson Beale; treasure site identification",
  oldlabel =     "Hammer71",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hammer71",
}

@Article{Klinger:1971:PWG,
  author =       "Allen Klinger",
  title =        "Pattern Width at a Given Angle",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "15--20",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:55:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Klinger71",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  keywords =     "extent integral projections; feature extraction;
                 figure properties; functions; geometrical concept;
                 integral geometry; linear pattern measures; pattern
                 recognition; picture processing; width; width at angle;
                 word description",
  oldlabel =     "Klinger71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Klinger71",
}

@Article{Chang:1971:RBP,
  author =       "Shi-Kuo Chang",
  title =        "The Reconstruction of Binary Patterns from Their
                 Projections",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "21--25",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68.00",
  MRnumber =     "44\#2379",
  MRreviewer =   "G. D. Chakerian",
  bibdate =      "Mon Jan 22 06:30:23 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Chang71",
  abstract =     "Given the horizontal and vertical projections of a
                 finite binary pattern $f$, can we construct the
                 original pattern $f$? In this paper we give a
                 characterization of patterns that are reconstructible
                 from their projection. Three algorithms are developed
                 to reconstruct both unambiguous and ambiguous patterns.
                 It is shown that an unambiguous pattern can be
                 perfectly reconstructed in time $m \times n$ and that a
                 pattern similar to an ambiguous pattern can also be
                 constructed in time $m \times n$, where $m$, $n$ are
                 the dimensions of the pattern frame.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "IBM, Yorktown Heights, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "ATI; CACMA; computers, digital; data compression;
                 finite binary pattern; image reconstruction; integral
                 geometry; original pattern reconstruction; pattern
                 frame dimensions; pattern recognition; pattern
                 recognition systems; pattern reconstruction",
  oldlabel =     "Chang71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chang71",
}

@Article{Bracchi:1971:LTG,
  author =       "Giampio Bracchi and Domenico Ferrari",
  title =        "Language for Treating Geometric Patterns in a
                 Two-Dimensional Space",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "26--32",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:54 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BracchiF71",
  abstract =     "In this paper CADEP, a problem-oriented language for
                 positioning geometric patterns in a two-dimensional
                 space, is presented. Although the language has been
                 specifically designed for the automatic generation of
                 integrated circuit masks, it turns out to be well
                 suited also for such other placement problems as
                 architecture design, urban planning, logical and block
                 diagram representation.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Politecnico Milano, Italy",
  journalabr =   "Commun ACM",
  keywords =     "2-dimensional space; architecture design; automation;
                 block diagrams; CACMA; CADEP; computers, digital;
                 computers, digital, pattern re; Fortran; Fortran
                 extension; generation; geometric patterns; graphic;
                 graphic displays; integrated circuit masks; integrated
                 circuits; language; languages; layout problems; logic
                 diagrams representation; pattern recognition; pattern
                 recognition systems; planning; positioning; problem
                 oriented language; problem oriented languages; urban;
                 urban planning",
  oldlabel =     "BracchiF71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BracchiF71",
}

@Article{Broucke:1971:CRN,
  author =       "R. A. Broucke",
  title =        "Construction of Rational and Negative Powers of a
                 Formal Series",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "32--35",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Brucke71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  keywords =     "binomial; Chebyshev approximation; Chebyshev series;
                 construction; convergence; convergence of numerical
                 methods; Fourier series; inversion; iterative methods;
                 Newton iterations; Poisson's; rational negative power;
                 root extraction; series; series expansion; theorem",
  oldlabel =     "Brucke71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brucke71",
  xxauthor =     "R. A. Brucke",
}

@Article{Holt:1971:CPS,
  author =       "Richard C. Holt",
  title =        "Comments on Prevention of System Deadlocks",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "36--38",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:41 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Holt71",
  abstract =     "A. N. Habermann's method of deadlock prevention is
                 discussed, where deadlock is defined as a system state
                 from which resource allocations to certain processes
                 are not possible. It is shown that the scheduler may
                 introduce `artificial' deadlocks which Habermann's
                 method does not prevent. Permanent blocking is the
                 situation where certain processes never receive their
                 resource requests. It is shown that deadlock prevention
                 does not necessarily eliminate permanent blocking. A
                 method of preventing permanent blocking is given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Cornell Univ. Ithaca, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers, digital; computers, digital,
                 operation; deadly embrace; Habermann's method;
                 interlock; knotting; layout; multiprogramming;
                 operating systems (computers); permanent blocking
                 preventions; resource allocation; scheduling; storage
                 allocation; system deadlock prevention; system
                 recovery; time sharing",
  oldlabel =     "Holt71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Holt71",
}

@Article{Hoare:1971:PPF,
  author =       "C. A. R. Hoare",
  title =        "Proof of a Program: {FIND}",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "39--45",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:22 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hoare71",
  abstract =     "An informal description is given of the purpose of the
                 program and the method used. A systematic technique is
                 described for constructing and the program proof during
                 the process of coding it, in such a way as to prevent
                 the intrusion of logical errors. The proof of
                 termination is treated as a separate exercise. Some,
                 conclusions relating to general programming methodology
                 are drawn.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Queen's Univ. Belfast, UK",
  journalabr =   "Commun ACM",
  keywords =     "algorithm correctness; algorithm theory; CACMA;
                 coding; computers, digital; computers, digital,
                 programming; documentation; FIND; ITI; languages;
                 logical errors intrusion; programming methodology;
                 programming theory; programs proofs",
  oldlabel =     "Hoare71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare71",
}

@Article{Proll:1971:FEA,
  author =       "L. G. Proll",
  title =        "Further evidence for the analysis of algorithms for
                 the zero-one programming problem",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "46--47",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:03 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Proll71",
  abstract =     "The purpose of this note is to report computational
                 experience additional to that recently summarized R. L.
                 Gue et al, with two algorithms for the zero-one linear
                 programming problem. An error in Gue's paper is
                 corrected. The utility of one of the algorithms as a
                 suboptimizer is indicated.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "Univ. Southampton, UK",
  journalabr =   "Commun ACM",
  keywords =     "algorithm analysis; algorithm theory; CACMA;
                 computational; ES,; experience; integer programming;
                 linear programming; mathematics; operations research;
                 suboptimisation; zero one variables",
  oldlabel =     "Proll71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Proll71",
}

@Article{Coleman:1971:AAC,
  author =       "M. W. Coleman and M. S. Taylor",
  title =        "{ACM Algorithm 403}: Circular Integer Partitioning
                 [{A1}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "48--48",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:14 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#ColemanT71",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Aberdeen Proving Ground, MD, USA",
  keywords =     "circular integer partitioning; combinations; design;
                 experiments design; number theory; statistical;
                 subroutines",
  oldlabel =     "ColemanT71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ColemanT71",
}

@Article{Lucas:1971:AAC,
  author =       "C. W. {Lucas, Jr.} and C. W. Terrill",
  title =        "{ACM Algorithm 404}: Complex Gamma Function [{S14}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "48--49",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:03 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#LucasT71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4120 (Functional analysis); C7310 (Mathematics
                 computing)",
  corpsource =   "Coll. William and Mary, Williamsburg, VA, USA",
  keywords =     "algorithm; CGAMMA; complex gamma function evaluation;
                 formula; function evaluation; poles of gamma function;
                 recursion formula; reflection; Stirling's asymptotic
                 series; subroutine in ALGOL; subroutines",
  oldlabel =     "LucasT71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LucasT71",
}

@Article{Kolm:1971:MAL,
  author =       "{\AA}. Kolm and T. Dahlstrand",
  title =        "Remark on ``{Algorithm 333: Minit Algorithm For Linear
                 Programming ([H])}''",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "50--50",
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:55:39 MST 2001",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 ftp://ftp.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#KolmD71",
  note =         "See \cite{Gautschi:1964:AAI}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "KolmD71",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KolmD71",
}

@Article{Redish:1971:ACL,
  author =       "K. A. Redish",
  title =        "Algorithms: Comment on {London}'s Certification of
                 {Algorithm 245}",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "50--51",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Redish71",
  acknowledgement = ack-nhfb,
  keywords =     "certification; debugging; in-place sorting;
                 metatheory; proof of algorithms; sorting",
  oldlabel =     "Redish71",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Redish71",
}

@Article{Pollack:1971:CCD,
  author =       "S. L. Pollack",
  title =        "Comment on the conversion of decision tables to
                 computer programs",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "52--52",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:12:54 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Pollack71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "S. D. Leidesdorf and Co., NY, USA",
  keywords =     "aids; application; business; comments; communication;
                 computer program; conversion; decision tables;
                 diagnostic; systems analysis",
  oldlabel =     "Pollack71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pollack71",
}

@Article{Aho:1971:POP,
  author =       "A. V. Aho and P. J. Denning and J. D. Ullman",
  title =        "Principles of optimal page replacement",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "80--93",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib",
  acknowledgement = ack-nhfb,
}

@Article{Shwayder:1971:CLE,
  author =       "Keith Shwayder",
  title =        "Conversion of Limited-Entry Decision Tables to
                 Computer Programs. a Proposed Modification to
                 {Pollack}'s Algorithm",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "69--73",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:21:30 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Shwayder71",
  abstract =     "S. Pollack has proposed an algorithm for converting
                 decision tables into flowcharts which minimize
                 subsequent execution time when compiled into a computer
                 program. Two modifications to this algorithm are
                 proposed. The first relies on Shannon's noiseless
                 coding theorem and the communications concept of
                 entropy but does not completely test the ELSE Rule. The
                 second modification completely tests the ELSE Rule but
                 results in more executions than the first modification.
                 Both modifications result in lower execution time than
                 Pollack's algorithm. However, neither modification
                 guarantees a globally optimal solution.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Univ. Chicago, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; communication channels; computer; computers,
                 digital; conversion; decision tables; flow charting;
                 flowcharting; information theory; modifications;
                 Pollack's algorithm; programming; programs",
  oldlabel =     "Shwayder71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shwayder71",
}

@Article{Bernstein:1971:PDS,
  author =       "Arthur J. Bernstein and J. C. Sharp",
  title =        "A Policy-Driven Scheduler for a Time-Sharing System",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "74--78",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:02 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BernsteinS71",
  abstract =     "A scheduling and swapping algorithm which keeps the
                 resource count of each process above its policy
                 function will provide the specified level of service.
                 Overhead can be reduced by avoiding swaps of processes
                 which have received at least this level of service. The
                 algorithm has been implemented in a general purpose
                 operating system, and it has provided significantly
                 better service to interactive and to batch jobs than
                 the previous scheduler.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "General Electric, Schenectady, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computation theory; computers, digital;
                 computers, digital, operating; operating; operating
                 systems (computers); policy driven; scheduler;
                 scheduling algorithm; supervisory and executive
                 programs; supervisory programs; systems; time sharing;
                 time sharing systems; time-sharing systems",
  oldlabel =     "BernsteinS71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BernsteinS71",
}

@Article{Nielsen:1971:AST,
  author =       "Norman R. Nielsen",
  title =        "An Analysis of Some Time-Sharing Techniques",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "79--90",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:23 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Nielsen71",
  abstract =     "The effectiveness of certain time-sharing techniques
                 such as program relocation, disk rotational delay
                 minimization, and swap volume minimization is
                 investigated. Summary data is presented, and the
                 findings are discussed. The vehicle for this
                 investigation was a SI-MULA based simulation model
                 reflecting an early framework for a planned Burroughs
                 B6500 time-sharing system. Inasmuch as the B6500 system
                 is based upon the use of variable sized segments and a
                 dynamic overlay procedure, data is also presented which
                 provides some indication of the effectiveness of this
                 type of organization in a time-sharing environment. The
                 design characteristics and operational capabilities of
                 the simulation model are also described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; capabilities; computers, digital; computers,
                 digital, operating; design characteristics; disk
                 rotational delay; minimization; operating systems;
                 operating systems (computers); operational; program
                 relocation; simulation; simulation model; swap volume
                 minimization; systems analysis; techniques; time
                 sharing; time sharing systems; time-sharing systems",
  oldlabel =     "Nielsen71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nielsen71",
}

@Article{Slagle:1971:EAL,
  author =       "James R. Slagle and Carl D. Farrell",
  title =        "Experiments in Automatic Learning for a Multipurpose
                 Heuristic Program",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "91--99",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:22:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#SlagleF71",
  abstract =     "An automatic learning capability has been developed
                 and implemented for use with the MULTIPLE (MULTIpurpose
                 Program that LEarns) heuristic tree-searching program,
                 which is presently being applied to resolution
                 theorem-proving in predicate calculus. MULTIPLE's
                 proving program (PP) uses two evaluation functions to
                 guide its search for a proof of whether or not a
                 particular goal is achievable. Thirteen general
                 features of predicate calculus clauses were created for
                 use in the automatic learning of better evaluation
                 functions for PP. A multiple regression program was
                 used to produce optimal coefficients for linear
                 polynomial functions in terms of the
                 features.\par

                 Also, automatic data-handling routines were written for
                 passing data between the learning program and the
                 proving program, and for analyzing and summarizing
                 results. Data was generally collected for learning
                 (regression analysis) from the experience of PP. A
                 number of experiments were performed to test the
                 effectiveness and generality of the learning program.
                 Results showed that the learning produced dramatic
                 improvements in the solutions to problems which were in
                 the same domain as those used for collection learning
                 data. Learning was also shown to generalize
                 successfully to domains other than those used for data
                 collection. Another experiment demonstrated that the
                 learning program could simultaneously improve
                 performance on problems in a specific domain and on
                 problems in a variety of domains. Some variations of
                 the learning program were also tested.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence)",
  corpsource =   "Nat. Inst. Health, Bethesda, MD, USA",
  keywords =     "adaptive; artificial intelligence; automatic learning;
                 computer aided instruction; computer aided learning;
                 education; experimental development; heuristic;
                 heuristic programming; heuristic tree searching
                 program; learning; learning systems; LISP; multiple
                 regression; multipurpose heuristic program;
                 problem-solving; resolution; self-modifying; system;
                 theorem-providing; tree-searching; trees; trees
                 (mathematics)",
  oldlabel =     "SlagleF71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SlagleF71",
}

@Article{Hurwitz:1971:PDV,
  author =       "H. {Hurwitz, Jr.}",
  title =        "On the Probability Distribution of the Values of
                 Binary Trees",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "99--102",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:30 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hurwitz71",
  abstract =     "\ldots{}unction for binary tree values, the values
                 reflecting sorting effort. The analysis does not assume
                 uniformly distributed branching ratios, and therefore
                 is applicable to a family of sorting algorithms
                 discussed by Hoare, Singleton, and van Emden. \par

                 The solution to the integral equation indicates that
                 using more advanced algorithms in the family makes only
                 minor reductions in the expected sorting effort, but
                 substantially reduces the variance in sorting effort.
                 Statistical tests of the values of several thousand
                 trees containing up to 10,000 points have given first,
                 second, and third moments of the value distribution
                 function in satisfactory agreement with the moments
                 computed from the generating function. The empirical
                 tests, as well as the analytical results, are in
                 agreement with previously published results for the
                 first moment in the cases of uniform and nonuniform
                 distribution of branching ratio, and for the second
                 moment in the case of uniform distribution of branching
                 ratio.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "General Electric, Schenectady, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "binary tree; binary trees; CACMA; generation; integral
                 equation: function; integral equations; N T;
                 probability distribution; sorting; statistical
                 analysis; statistical tests; statistics; trees; trees
                 (mathematics); values",
  oldlabel =     "Hurwitz71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hurwitz71",
}

@Article{Slagle:1971:AGT,
  author =       "James R. Slagle and Richard C. T. Lee",
  title =        "Application of Game Tree Searching Techniques to
                 Sequential Pattern Recognition",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "103--110",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:22:23 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#SlagleL71",
  abstract =     "A sequential pattern recognition (SPR) procedure does
                 not test all the features of a pattern at once.
                 Instead, it selects a feature to be tested. After
                 receiving the result of that test, the procedure either
                 classifies the unknown pattern or selects another
                 feature to be tested, etc. Medical diagnosis is an
                 example of SPR. In this paper the authors suggest that
                 SPR be viewed as a one-person game played against
                 nature (chance). Virtually all the powerful techniques
                 developed for searching two-person, strictly
                 competitive game trees can easily be incorporated
                 either directly or by analogy into SPR procedures.
                 \par

                 In particular, one can incorporate the ``mini average
                 backing-up procedure'' and the ``gamma procedure,''
                 which are the analogues of the ``minimax backing-up
                 procedure'' and the ``alpha-beta procedure,''
                 respectively. \par

                 Some computer simulated experiments in character
                 recognition are presented. The results indicate that
                 the approach is promising.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Nat. Inst. Health, Bethesda, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "bioengineering, computer applications;
                 branch-and-bound approach; CACMA; CAL; computers,
                 digital, character; dynamic programming; game against
                 nature; game theory; game theory application; game tree
                 searching; gamma procedure; mini average backing-up
                 procedure; optimal solution; pattern; pattern
                 recognition; pattern recognition systems; recognition;
                 sequential pattern recognition; techniques; trees;
                 trees (mathematics)",
  oldlabel =     "SlagleL71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SlagleL71",
}

@Article{Rokne:1971:CIA,
  author =       "J. Rokne and P. Lancaster",
  title =        "Complex Interval Arithmetic",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "111--112",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:53 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#RokneL71",
  abstract =     "Complex interval arithmetic is defined using real
                 interval arithmetic. Complex interval division is
                 defined so as to assure smallest possible resulting
                 intervals.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Univ. Calgary, Alta., Canada",
  journalabr =   "Commun ACM",
  keywords =     "complex interval arithmetic; complex intervals;
                 digital arithmetic; mathematics; numerical mathematics;
                 numerical methods; on; real interval arithmetic; real
                 intervals",
  oldlabel =     "RokneL71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RokneL71",
}

@Article{Dell:1971:AAR,
  author =       "Alice M. Dell and Roman L. Weil and Gerald L.
                 Thompson",
  title =        "{ACM Algorithm 405}: Roots of Matrix Pencils: The
                 Generalized Eigenvalue Problem [{F2}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "2",
  pages =        "113--117",
  month =        feb,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:34:59 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#DellWT71",
  note =         "See remark \cite{Heiberger:1972:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C7310 (Mathematics
                 computing)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "algebra; eigenvalues and eigenfunctions; generalised
                 eigenvalue; linear; matrix algebra; problem; roots of
                 matrix pencils; subroutines",
  oldlabel =     "DellWT71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DellWT71",
}

@Article{Noll:1971:SDC,
  author =       "A. Michael Noll",
  title =        "Scanned-Display Computer Graphics",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "143--150",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:46 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Noll71",
  abstract =     "A television-like scanned-display system has been
                 successfully implemented on a Honeywell DDP-224
                 computer installation. The scanned image is stored in
                 the core memory of the computer, and software scan
                 conversion is used to convert the rectangular
                 coordinates of a point to the appropriate work and bit
                 in an output display array in core storage. Results
                 thus far indicate that flicker-free displays of large
                 amounts of data are possible with reasonably fast
                 graphical interaction. A scanned image of size 240x254
                 points is displayed at a 30 frame-per-second rate.",
  acknowledgement = ack-nhfb,
  classcodes =   "B7260 (Display technology and systems); C5540
                 (Terminals and graphic displays)",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer; computer graphics; computers,
                 digital; core memory; display systems; ed.; graphical
                 interaction; installation; raster displays; scan
                 conversion; scanned image; software; stored; television
                 like scanned display",
  oldlabel =     "Noll71",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Noll71",
}

@Article{Manna:1971:TAP,
  author =       "Zohar Manna and Richard J. Waldinger",
  title =        "Toward Automatic Program Synthesis",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "151--165",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:01:30 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#MannaW71",
  abstract =     "An elementary outline of the theorem-proving approach
                 to automatic program synthesis is given, without
                 dwelling on technical details. The method is
                 illustrated by the automatic construction of both
                 recursive and iterative programs operating on natural
                 numbers,lists, and trees, In order to construct a
                 program satisfying certain specifications a theorem
                 induced by those specifications is proved, and the
                 desired program is extracted from the proof. The same
                 technique is applied to transform recursively defined
                 functions into iterative programs, frequently with a
                 major gain inefficiency. It is emphasized that in order
                 to construct a program with loops or with recursion,
                 the principle of mathematical induction must be
                 applied. The relation between the version of the
                 induction rule used and the form of the program
                 constructed is explored in some detail.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence)",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "answer extraction; artificial; artificial
                 intelligence; automata theory; automatic program
                 synthesis; CACMA; computer metatheory; computers,
                 languages; computers, programming; intelligence; lists;
                 mathematical induction; mathematical induction
                 principle; natural numbers; principle; problem solving;
                 programs; recursive and iterative; theorem proving;
                 trees",
  oldlabel =     "MannaW71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MannaW71",
}

@Article{Winters:1971:SAC,
  author =       "William K. Winters",
  title =        "Scheduling Algorithm for a Computer Assisted
                 Registration System",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "166--171",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:23 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Winters71",
  abstract =     "This paper presents the scheduling algorithm used in
                 the Computer Assisted Registration System at the
                 University of Tennessee. Notation is defined and the
                 logic of the algorithm necessary to implement
                 educational policy is described. Results from the first
                 term's implementation are presented.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7110 (Educational administration)",
  corpsource =   "Univ. Tennessee, Knoxville, TN, USA",
  journalabr =   "Commun ACM",
  keywords =     "administrative data processing; CACMA; computer
                 assisted registration system; data processing;
                 educational administrative data processing; educational
                 policy; implementation; logic; scheduling algorithm;
                 timetable",
  oldlabel =     "Winters71",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Winters71",
}

@Article{Williams:1971:SUM,
  author =       "John G. Williams",
  title =        "Storage Utilization in a Memory Hierarchy When Storage
                 Assignment is Performed by a Hashing Algorithm",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "172--175",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:07 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Williams71",
  abstract =     "The utilization of storage is studied in a two-level
                 memory hierarchy. The first storage level, which is the
                 fast store, is divided into a number of storage areas.
                 When an entry is to be filed in the hierarchy, a
                 hashing algorithm will attempt to place the entry into
                 one of these areas. If this particular area is full,
                 then the entry will be placed into the slower
                 second-level store, even though other areas in the
                 first-level store may have space available. Given that
                 N entries have been filed in the entire hierarchy, an
                 expression is derived for the expected number of
                 entries filed in the first-level store. This expression
                 gives a measure of how effectively the first-level
                 store is being used. By means of examples, storage
                 utilization is then studied as a function of the
                 hashing algorithm, the number of storage areas into
                 which the first-level store is divided and the total
                 size of the first-level store.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "RCA Labs., Princeton, NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers, digital; hashing algorithm;
                 hierarchical systems; memory allocation; memory
                 hierarchy; storage allocation; storage assignment;
                 storage units; storage utilization",
  oldlabel =     "Williams71",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Williams71",
}

@Article{Gear:1971:AIO,
  author =       "C. William Gear",
  title =        "The Automatic Integration of Ordinary Differential
                 Equations",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "176--179",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65L05",
  MRnumber =     "52 9612",
  bibdate =      "Mon Jan 22 06:43:27 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gear71",
  abstract =     "A criterion for the selection of the order of
                 approximation is proposed. The objective of the
                 criterion is to increase the step size so as to reduce
                 solution time. An option permits the solution of
                 `stiff' differential equations. A program embodying the
                 techniques discussed appears as an algorithm which is
                 specified.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "automatic; boundary value problems; boundary-value
                 problems; CACMA; differential equations; initial value;
                 integration; mathematics; numerical methods; order
                 control; order of approximation; ordinary differential
                 equations; problem; selection; step control; stiff
                 equations",
  oldlabel =     "Gear71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gear71",
}

@Article{Howell:1971:AAE,
  author =       "Jo Ann Howell",
  title =        "{ACM Algorithm 406}: Exact Solution of Linear
                 Equations Using Residue Arithmetic [{F4}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "180--184",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Howell71",
  note =         "See remark \cite{Howell:1973:RAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "adjoint matrix; determinant; Gaussian elimination; ill
                 condition; inversion; linear equations; matrix; matrix
                 algebra; modulus; prime number; residue arithmetic;
                 subroutine; subroutines; symmetric mixed radix
                 representation; symmetric residue",
  oldlabel =     "Howell71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Howell71",
}

@Article{Gear:1971:AAD,
  author =       "C. William Gear",
  title =        "{ACM Algorithm 407}: {DIFSUB} for Solution of Ordinary
                 Differential Equations [{D2}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "3",
  pages =        "185--190",
  month =        mar,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gear71a",
  note =         "See certification \cite{Nikolai:1973:CAD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Illinois, Urbana, IL, USA",
  keywords =     "control; differential equations; DIFSUB; estimated
                 error; method; multistep predictor corrector; ordinary
                 differential equations; stiff differential equations;
                 subroutine; subroutines",
  oldlabel =     "Gear71a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gear71a",
}

@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{Lum:1971:KAT,
  author =       "Vincent Y. Lum and P. S. T. Yuen and M. Dodd",
  title =        "Key-to-Address Transform Techniques: {A} Fundamental
                 Performance Study on Large Existing Formatted Files",
  journal =      j-CACM,
  volume =       "14",
  number =       "4",
  pages =        "228--239",
  month =        apr,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:18 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#LumYD71",
  note =         "Survey of several hash functions, with performance
                 results.",
  abstract =     "The results of a study of eight different
                 keyto-address transformation methods applied to a set
                 of existing files are presented. As each method is
                 applied to a particular file, load factor and bucket
                 size are varied over a wide range. Appropriate
                 variables pertinent only to a specific method take on
                 different values. The performance of each method is
                 summarized in terms of the number of accesses required
                 to get to a record and the number of overflow records
                 created by a transformation. Peculiarities of each
                 method are discussed. Practical guidelines obtained
                 from the results are stated. A proposal for further
                 quantitative fundamental study is outlined.",
  acknowledgement = ack-nhfb,
  annote =       "Measurement of direct access methods",
  classcodes =   "C6120 (File organisation)",
  corpsource =   "IBM, San Jose, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers, digital; computers, digital codes;
                 file management; file organisation; file organization;
                 formatted files; has codes; information retrieval;
                 information storage and retrie; key to address
                 transform; random access storage; techniques",
  oldlabel =     "LumYD71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LumYD71",
}

@Article{Tucker:1971:DMP,
  author =       "Allen B. Tucker and Michael J. Flynn",
  title =        "Dynamic Microprogramming. Processor Organization and
                 Programming",
  journal =      j-CACM,
  volume =       "14",
  number =       "4",
  pages =        "240--250",
  month =        apr,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:26:46 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#TuckerF71",
  abstract =     "A microassembly language is developed and the overhead
                 involved in subroutine linkages is analyzed. The
                 efficiency of a flexible software linkage scheme is
                 examined as to its overhead for various subroutine
                 characteristics. Three examples of problem-oriented
                 programming are considered and the resulting coding is
                 compared against a System/360 assembly language
                 version, with the technology normalized.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Northwestern Univ., Evanston, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computers, digital; dynamically microprogrammed
                 processor; microassembly language; microprogramming;
                 microstorage; problem oriented programming;
                 problem-oriented languages; program processors; read
                 write; subroutine linkage",
  oldlabel =     "TuckerF71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/TuckerF71",
}

@Article{Talbot:1971:ALT,
  author =       "Peggy Anne Talbot and John W. {Carr III} and Richard
                 R. {Coulter, Jr.} and Rosa C. Hwang",
  title =        "Animator: An On-Line Two-dimensional Film Animation
                 System",
  journal =      j-CACM,
  volume =       "14",
  number =       "4",
  pages =        "251--259",
  month =        apr,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:25:23 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#TalbotCCH71",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays)",
  corpsource =   "Univ. Pennsylvania, Philadelphia, PA, USA",
  keywords =     "computer animation; computer graphics; dimensional
                 languages; microfilm recorder; on line system; online
                 operation; programming languages; two",
  oldlabel =     "TalbotCCH71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/TalbotCCH71",
}

@Article{Stein:1971:CD,
  author =       "Marvin L. Stein and William D. Munro",
  title =        "On Complement Division",
  journal =      j-CACM,
  volume =       "14",
  number =       "4",
  pages =        "260--264",
  month =        apr,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:09 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#SteinM71",
  abstract =     "The division algorithm theorem is expressed in a form
                 that permits it to serve as the basis for devising
                 division operations that produce both quotient and
                 remainder in complement form. Algorithms for division
                 yielding complement results are derived for numbers
                 represented in any base greater than one. Both radix
                 and radix-less-one complementation schemes are
                 considered. The binary form of the algorithms thus
                 includes both two's and one's complement
                 implementation. The problem of quotient overflow for
                 complement results is dealt with as is that of
                 selecting an appropriate form of the remainder
                 condition for complement division.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. Minnesota, Minneapolis, MN, USA",
  journalabr =   "Commun ACM",
  keywords =     "algorithmic languages; CACMA; complement; digital
                 arithmetic; division; division algorithm; mathematics;
                 radix complementation schemes",
  oldlabel =     "SteinM71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SteinM71",
}

@Article{McNamee:1971:AAS,
  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 =      "Tue Mar 25 13:26:09 MST 1997",
  note =         "See remarks
                 \cite{Sale:1973:SMP,Lawrence:1973:RAS,Sipala:1977:RAS,Gustavson:1978:RAS,Harms:1980:RSM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7410B (Power engineering computing)",
  corpsource =   "York Univ., Downsview, Ont., Canada",
  keywords =     "algebra; electrical engineering applications of
                 computers; electrical network problems; Fortran
                 subroutines; matrix; sparse matrix manipulation;
                 subroutines; tests",
  treatment =    "P Practical",
}

@Article{Olle:1971:IFA,
  author =       "T. William {Olle (Chairman)} and {Codasyl Systems
                 Committee}",
  title =        "Introduction to ``Feature Analysis of Generalized Data
                 Base Management Systems''",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "308--318",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:29:12 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#CODASYL71",
  abstract =     "This introduction gives a review of the current state
                 of the art in the systems and discusses the differences
                 and similarities between capabilities found in host
                 language systems and those found in self-contained
                 systems. Technical problems facing future designers are
                 described. The use of Cobol as a basis for further
                 development work is considered at some length with
                 respect to data structures, host language capabilities,
                 and self-contained capabilities.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  keywords =     "data structures; feature analysis; generalised data
                 base management systems; information; programming
                 languages; retrieval; standards; storage management;
                 transaction processing",
  oldlabel =     "CODASYL71",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CODASYL71",
}

@Article{Nielsen:1971:MRC,
  author =       "Norman R. Nielsen",
  title =        "The Merit of Regional Computing Networks",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "319--326",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:24 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Nielsen71a",
  abstract =     "One of the suggested means for stimulating the spread
                 of computing capabilities in institutions of higher
                 learning is through the construction of regional
                 computing networks. One such network has been
                 constructed in the San Francisco Bay Area of Stanford
                 University. This paper reports upon the lessons learned
                 from the operation of that network over the past 2
                 yr.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training); C5600 (Data
                 communication equipment and techniques); C7810C
                 (Computer-aided instruction)",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; computer aided instruction; computer
                 applications; computer sharing; computer utility;
                 computers, digital, data proce; computing; cooperative
                 networks; curriculum development; digital communication
                 systems; education; educational computing; engineering
                 education; R C; remote",
  oldlabel =     "Nielsen71a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nielsen71a",
}

@Article{Krolak:1971:MMA,
  author =       "Patrick Krolak and Wayne Felts and George Marble",
  title =        "A Man-Machine Approach Toward Solving the Traveling
                 Salesman Problem",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "327--334",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:56:20 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#KrolakFM71",
  abstract =     "This paper describes a computer aided heuristic
                 technique which uses only a modest amount of computer
                 time in real-time to solve large (100 to 200) point
                 problems. This technique takes advantage of both the
                 computer's and the human's problem-solving abilities.
                 The computer is not asked to solve the problem in a
                 brute force way as in many of today's heuristics, but
                 it is asked to organize the data for the human so that
                 the human can solve the problem easily. The technique
                 used in this paper seems to point to new directions in
                 the field of man-machine interaction and in the field
                 of artificial intelligence.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C1270 (Man-machine
                 systems)",
  corpsource =   "Vanderbilt Univ., Nashville, TN, USA",
  journalabr =   "Commun ACM",
  keywords =     "artificial intelligence; assignment; CACMA; computer
                 aided heuristic techniques; computer applications;
                 cybernetics; heuristic procedure; heuristic
                 programming; interaction process; man machine
                 interaction; man-machine systems; operations research;
                 optimisation; problem; production planning and control;
                 rubber band tour generator; travelling salesman
                 problem",
  oldlabel =     "KrolakFM71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KrolakFM71",
}

@Article{Montanari:1971:ODC,
  author =       "Ugo Montanari",
  title =        "On the Optimal Detection of Curves in Noisy Pictures",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "335--345",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:28 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Montanari71",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Istituto Elaborazione Informazione, Pisa, Italy",
  keywords =     "curve; description; dynamic programming; edge; global
                 recognition; heuristic; heuristic programming;
                 interaction graph; line; methods; noise; optimal
                 detection; optimisation; optimisation problem; parallel
                 processing; pattern recognition; picture; picture
                 processing; picture recognition; secondary",
  oldlabel =     "Montanari71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Montanari71",
}

@Article{Richards:1971:HKA,
  author =       "Donald L. Richards",
  title =        "How To Keep the Addresses Short",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "346--349",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:54 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Richards71",
  abstract =     "This paper demonstrates that a wide class of problems
                 can be formulated as covering problems solvable by
                 means of elementary arithmetic operations on the column
                 vectors of a ternary matrix.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Leasco Systems Corp., Tustin, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "addressing; assembler; CACMA; compilers; computers,
                 digital; covering problem; data handling; integer;
                 integer programming; minimisation; program; program
                 assemblers; programming; variable length addressing",
  oldlabel =     "Richards71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Richards71",
}

@Article{Fenichel:1971:ILV,
  author =       "Robert R. Fenichel",
  title =        "On Implementation of Label Variables",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "349--350",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:18 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Fenichel71",
  abstract =     "Variables of label mode are conventionally implemented
                 with a technique which fails to trap certain
                 programming errors. Fine-grained calender clocks have
                 recently become available; these allow implementation
                 of label variables via a new technique which traps all
                 programming errors of this variety.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "MIT, Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "CACMA; compiler; computers, digital; DS; fine grained
                 calendar clocks; go; interpreter; label variables
                 implementation; program compilers; program debugging;
                 to; transfer",
  oldlabel =     "Fenichel71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fenichel71",
}

@Article{Morris:1971:ARI,
  author =       "James H. {Morris, Jr.}",
  title =        "Another Recursion Induction Principle",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "351--354",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "02F25 (94A25)",
  MRnumber =     "45 57",
  MRreviewer =   "H. R. Strong",
  bibdate =      "Mon Jan 22 07:06:02 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Morris71",
  abstract =     "An inductive method for proving things about
                 recursively defined functions is described. It is shown
                 to be useful for proving partial functions equivalent
                 and thus applicable in proofs about interpreters for
                 programming languages.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "automata theory; CACMA; compiler correctness; compiler
                 correctness proofs; computational linguistics;
                 computers, digital, languages; computers, digital,
                 programming; correctness; induction; interpreters;
                 proofs; proving; recursion; recursion induction
                 principle; recursive functions; theorem",
  oldlabel =     "Morris71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morris71",
}

@Article{Schmitt:1971:AAD,
  author =       "H. Schmitt",
  title =        "{ACM Algorithm 409}: Discrete {Chebychev} Curve Fit
                 [{E2}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "355--356",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Schmitt71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "Tech. Hochschule, Darmstadt, West Germany",
  keywords =     "ALGOL procedure; algorithm; Chebyshev approximation;
                 discrete Chebychev curve fit; exchange; Remez
                 algorithm; subroutines",
  oldlabel =     "Schmitt71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schmitt71",
}

@Article{Chambers:1971:AAP,
  author =       "J. M. Chambers",
  title =        "{ACM Algorithm 410}: Partial Sorting [{M1}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "5",
  pages =        "357--358",
  month =        may,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:30:09 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Chambers71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Bell Telephone Labs., Murray Hill, NJ, USA",
  keywords =     "FORTRAN routine; order statistics; partial sorting;
                 partial sorting order statistics; sorting;
                 subroutines",
  oldlabel =     "Chambers71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chambers71",
}

@Article{Harada:1971:GRP,
  author =       "Kazuaki Harada",
  title =        "Generation of rosary permutations expressed in
                 {Hamiltonian} circuits",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "373--379",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "90.30 (05.00)",
  MRnumber =     "44\#3675",
  bibdate =      "Mon Jan 22 06:48:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Harada71",
  abstract =     "Systematic generation of a specific class of
                 permutations fundamental to scheduling problems is
                 described. In a nonoriented complete graph with n
                 vertices, Hamiltonian circuits equivalent to $.5(n -
                 1)!$ specific permutations of $n$ elements, termed
                 rosary permutations, can be defined. Each of them
                 corresponds to two circular permutations which
                 mirror-image each other, and is generated successively
                 by a number system covering $3*4*\ldots*(n-1)$ sets of
                 edges. Every set of edges $\{E[k]\}, 1 <= E[k] <= k, 3
                 <= k <= (n-1)$ is determined recursively by
                 constructing a Hamiltonian circuit with $k$ vertices
                 from a Hamiltonian circuit with $k-1$ vertices,
                 starting with the Hamiltonian circuit of 3 vertices.
                 The basic operation consists of transposition of a pair
                 of adjacent vertices where the position of the pair in
                 the permutation is determined by $\{E[k]\}$. Two
                 algorithms treating the same example for five vertices
                 are presented. It is very easy to derive all possible
                 n! permutations from the $.5(n - 1 )!$ rosary
                 permutations be cycling the permutations and by taking
                 them in the reverse order-procedures which can be
                 performed fairly efficiently by computer.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics)",
  corpsource =   "Washington Univ., St. Louis, MO, USA",
  keywords =     "circuits; combinatorial algebra; graph theory;
                 Hamiltonian; nonoriented complete graph; permutation;
                 rosary permutations generation; scheduling",
  oldlabel =     "Harada71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Harada71",
}

@Article{Foley:1971:AOD,
  author =       "James D. Foley",
  title =        "An approach to the optimum design of computer graphics
                 systems",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "380--390",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:40:07 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Foley71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Univ. North Carolina, Chapel Hill, NC, USA",
  keywords =     "average response time prediction; computer graphics;
                 computer graphics systems; computer metatheory;
                 mathematical; model; optimisation; optimum design",
  oldlabel =     "Foley71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Foley71",
}

@Article{Amarel:1971:CSC,
  author =       "Saul Amarel",
  title =        "Computer Science: {A} Conceptual Framework for
                 Curriculum Planning",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "391--401",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:21:15 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Amarel71",
  abstract =     "Two views of computer science are considered: a global
                 view which attempts to capture broad characteristics of
                 the field and its relationships to other fields, and a
                 local view which focuses on the inner structure of the
                 field. This structure is presented in terms of the
                 kinds of knowledge, problems, and activities that exist
                 within the discipline, as well as the relations between
                 them. An approach to curriculum planning in computer
                 science is presented which is guided by the structure
                 of the field, by the fact that change is an important
                 feature of the situation, and by the expectation that
                 computer science will continue to increase its working
                 contacts with other disciplines.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Rutgers Univ., New Brunswick, NJ, USA",
  keywords =     "computer science; curriculum planning; education",
  oldlabel =     "Amarel71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Amarel71",
}

@Article{Bosarge:1971:NPR,
  author =       "W. E. {Bosarge, Jr.} and O. G. Johnson",
  title =        "Numerical properties of the {Ritz--Trefftz} algorithm
                 for optimal control",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "402--406",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.30",
  MRnumber =     "44\#7714",
  MRreviewer =   "A. Pasquali",
  bibdate =      "Mon Jan 22 06:27:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BosargeJ71",
  abstract =     "In this paper the Ritz--Trefftz algorithm is applied
                 to the computer solution of the state regulator
                 problem. The algorithm represents a modification of the
                 Ritz direct method and is designed to improve the speed
                 of solution and the storage requirements to the point
                 where real-time implementation becomes feasible. The
                 modification is shown to be more stable computationally
                 than the traditional Ritz approach. \par

                 The first concern of the paper is to describe the
                 algorithm and establish its properties as a valid and
                 useful numerical technique. In particular such useful
                 properties as definiteness and reasonableness of
                 condition are established for the method. The second
                 part of the paper is devoted to a comparison of the new
                 techniques with the standard procedure of numerically
                 integrating a matrix Riccati equation to determine a
                 feedback matrix. The new technique is shown to be
                 significantly faster for comparable accuracy.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1330 (Optimal control); C4190 (Other numerical
                 methods)",
  corpsource =   "IBM Sci. Center, Houston, TX, USA",
  keywords =     "control theory; equation; feedback matrix; matrix
                 Riccati; numerical; numerical analysis; numerical
                 integration; numerical methods; optimal control;
                 properties; regulator problem; Ritz Trefftz algorithm;
                 splines; state regulator problem",
  oldlabel =     "BosargeJ71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BosargeJ71",
}

@Article{Gladwin:1971:NCF,
  author =       "H. Tim Gladwin",
  title =        "A Note on Compiling Fixed Point Binary
                 Multiplications",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "407--408",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:44:55 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Glaswin71",
  abstract =     "An algorithm is developed for compiling, as a sequence
                 of shifts, additions,and subtractions, many fixed point
                 binary multiplications involving a constant. The most
                 significant characteristics of the algorithm are the
                 simplicity of the test which determines if the
                 algorithm should be applied and the degree to which it
                 ``suggests'' efficient object code.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Univ. Washington, Seattle, WA, USA",
  keywords =     "additions; compiling fixed point binary
                 multiplications; compiling multiplications; digital
                 arithmetic; fixed point arithmetic; program compilers;
                 shifts; subtractions",
  oldlabel =     "Glaswin71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Glaswin71",
  xxauthor =     "H. Tim Glaswin",
}

@Article{Fraser:1971:MNP,
  author =       "A. G. Fraser",
  title =        "On the Meaning of Names in Programming Systems",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "409--416",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:41:34 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Fraser71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  keywords =     "computational linguistics; context manipulation; data
                 names; file; functional; lambda calculus; names;
                 operating system; operating systems (computers);
                 programming; programming systems; programming theory;
                 theory",
  oldlabel =     "Fraser71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fraser71",
}

@Article{Walker:1971:BS,
  author =       "R. J. Walker",
  title =        "Binary Summation",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "417--417",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Walker71",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "binary summation; digital arithmetic; floating point;
                 roundoff errors; space; storage",
  oldlabel =     "Walker71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Walker71",
}

@Article{Zelkowitz:1971:IDP,
  author =       "Marvin V. Zelkowitz",
  title =        "Interrupt Driven Programming",
  journal =      j-CACM,
  volume =       "14",
  number =       "6",
  pages =        "417--418",
  month =        jun,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:31:37 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Zelkowitz71",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "associative; control; debugging; interrupt drive
                 programming; memories; microprogramming; parallel
                 processing; program execution",
  oldlabel =     "Zelkowitz71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Zelkowitz71",
}

@Article{McKenney:1971:SCO,
  author =       "J. L. McKenney and Fred M. Tonge",
  title =        "The State of Computer-Oriented Curricula in Business
                 Schools 1970",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "443--448",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:03:10 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#McKenneyT71",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  keywords =     "business schools; computer curricula; education;
                 reviews",
  oldlabel =     "McKenneyT71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McKenneyT71",
}

@Article{Bernstein:1971:PTP,
  author =       "Arthur J. Bernstein",
  title =        "A Programmer Training Project",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "449--452",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:25:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Bernstein71",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "General Electric Res. and Dev. Center, Schenectady,
                 NY, USA",
  keywords =     "black; course organisation; curriculum; jobs;
                 programmer training project; programming; residents;
                 training",
  oldlabel =     "Bernstein71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bernstein71",
}

@Article{DeRemer:1971:SLK,
  author =       "Franklin L. DeRemer",
  title =        "Simple {LR(k)} Grammars",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "453--460",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "47 9893",
  MRreviewer =   "J. E. L. Peck",
  bibdate =      "Mon Jan 22 06:34:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#DeRemer71",
  abstract =     "A class of context-free grammars, called the ``Simple
                 LR(k)'' or SLR(k) grammars is defined.\par

                 This class has been shown to include weak precedence
                 and simple precedence grammars as proper subsets.
                 \par

                 How to construct parsers for the SLR(k) grammars is
                 also shown. These parser-construction techniques are
                 extendible to cover all of the LR(k) grammars of Knuth;
                 they have been implemented and by direct comparison
                 proved to be superior to precedence techniques, not
                 only in the range of grammars covered, but also in the
                 speed of parser construction and in the size and speed
                 of the resulting parsers.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. of California, Santa Cruz, CA, USA",
  keywords =     "context free grammars; context-free grammar;
                 context-free grammars; deterministic pushdown
                 automaton; finite-state machine; grammars; LR(k)
                 grammar; parser; parser construction; parsing
                 algorithm; precedence; precedence grammar; simple LR(K)
                 grammars; syntactic analysis",
  oldlabel =     "DeRemer71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DeRemer71",
}

@Article{Pratt:1971:LEG,
  author =       "Terrence W. Pratt and Daniel P. Friedman",
  title =        "A Language Extension for Graph Processing, and Its
                 Formal Semantics",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "460--467",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "46 6657",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Mon Jan 22 07:13:15 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#PrattF71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "data structure; directed graph; flowchart; formal
                 semantics; graph processing; Graspe; language
                 extension; Lisp; problem oriented languages; syntax",
  oldlabel =     "PrattF71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/PrattF71",
}

@Article{Paton:1971:ABC,
  author =       "Keith Paton",
  title =        "An algorithm for the blocks and cut nodes of a graph",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "468--475",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "05-04",
  MRnumber =     "46 5135",
  MRreviewer =   "E. M. Reingold",
  bibdate =      "Mon Jan 22 07:11:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Paton71",
  note =         "See corrigendum \cite{Paton:1971:CAB}.",
  abstract =     "An efficient method is presented for finding blocks
                 and cutnodes of an arbitrary undirected graph. The
                 graph may be represented either (i) as an ordered list
                 of edges or (ii) as a packed adjacency matrix. If $w$
                 denotes the word length of the machine employed, the
                 storage (in machine words) required for a graph with
                 $n$ nodes and $m$ edges increases essentially as
                 $2(m+n)$ in case (i), or $(n^2)/w$ in case (ii). A
                 spanning tree with labeled edges is grown, two edges
                 finally bearing different labels if and only if they
                 belong to different blocks. For both representations
                 the time required to analyze a graph on $n$ nodes
                 increases as $n^G$ where $G$ depends on the type of
                 graph, $1 <= G <= 2$, and both bounds are attained.
                 \par

                 Values of G are derived for each of several suitable
                 families of test graphs, generated by an extension of
                 the web grammar approach. The algorithm is compared in
                 detail with that proposed by Read for which 1 <= G <=
                 3.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Medical Res. Council, London, UK",
  keywords =     "algorithm; block; block-cutpoint-tree; blocks; cut
                 nodes; cutnode; fundamental cycle set; graph; graph
                 theory; labelled edges; lobe; lobe decomposition; lobe
                 decomposition graph; ordered list of edges; packed
                 adjacency matrix; separable; spanning tree; undirected;
                 web grammar",
  oldlabel =     "Paton71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Paton71",
}

@Article{Ferguson:1971:BAM,
  author =       "David E. Ferguson",
  title =        "Buffer Allocation in Merge-Sorting",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "476--478",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Ferguson71",
  abstract =     "A fixed buffer allocation for merge-sorting is
                 presented here which minimizes the number of
                 input-output operations for a given order of merge.
                 \par

                 When sorting on movable arm disks, the number of seeks
                 is equal to the number of input-output operations, and
                 the seek time usually controls the sort time. First
                 some standard terminology is introduced. Then the input
                 buffer allocation method is described, followed by an
                 analysis of the improvement to be expected over more
                 conventional allocation. This analysis makes use of a
                 particular distribution function. An analysis of a
                 completely different distribution is given which yields
                 similar results. This suggests that the results do not
                 depend on a particular distribution function. An
                 optimum output buffer size is also determined. It is
                 concluded that this buffering allocation can
                 significantly reduce the time of merge sorting on
                 movable arm disks when the input data are not random,
                 and that this output buffer allocation should be used
                 whether the data is random or not.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Programmatics Inc., Los Angeles, CA, USA",
  keywords =     "file; fixed buffer allocation; gamma distribution
                 function; input output operations; item; merge sort;
                 movable arm disks; optimum; output buffer size; seek
                 time; sorting; storage allocation; string",
  oldlabel =     "Ferguson71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ferguson71",
}

@Article{Ramamoorthy:1971:SOE,
  author =       "C. V. Ramamoorthy and M. J. Gonzalez",
  title =        "Subexpression ordering in the execution of arithmetic
                 expressions",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "479--485",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A20",
  MRnumber =     "46 6650",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Mon Jan 22 07:14:53 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#RamamoorthyG71",
  abstract =     "An arithmetic expression can often be broken down into
                 its component subexpressions. Depending on the hardware
                 environment in which the expression is to be executed,
                 these subexpressions can be evaluated in serials, in
                 parallel, or in a combination of these modes. This
                 paper shows that expression execution time can be
                 minimized only if consideration is given to the
                 ordering of the subexpressions. In particular,
                 subexpressions should be executed in order of
                 decreasing memory and processor time requirements. This
                 observation is valid for configurations ranging from a
                 uniprocessor with an unbuffered main memory to
                 multiprocessor with a ``cache'' buffer memory. If the
                 number of subexpressions which can be executed in
                 parallel exceeds the number of available processors,
                 then execution of some of these subexpressions must be
                 postponed. A procedure is given which combines this
                 requirement with the earlier ordering considerations to
                 provide an optimal execution sequence.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C6130 (Data
                 handling techniques)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "arithmetic expression; arithmetic expressions; cache;
                 compilers; computational trees; data handling; digital
                 arithmetic; execution time; parallel processing;
                 subexpression ordering",
  oldlabel =     "RamamoorthyG71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RamamoorthyG71",
}

@Article{McVitie:1971:SMP,
  author =       "D. G. McVitie and L. B. Wilson",
  title =        "The Stable Marriage Problem",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "486--490",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "90B99 (68A10)",
  MRnumber =     "46 6808",
  MRreviewer =   "R. B. Potts",
  bibdate =      "Mon Jan 22 07:03:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#McVitieW71",
  abstract =     "The original work of Gale and Shapley on an assignment
                 method using the stable marriage criterion has been
                 extended to find all the stable marriage
                 assignments.\par

                 The algorithm derived for finding all the stable
                 marriage assignments is proved to satisfy all the
                 conditions of the problem. Algorithm 411 applies to
                 this paper.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C7310 (Mathematics
                 computing)",
  corpsource =   "Univ. Newcastle upon Tyne, UK",
  keywords =     "assignment; assignment problems; assignment
                 procedures; combinatorial mathematics; combinatorics;
                 discrete mathematics; operational research; operations
                 research; stable marriage problem; university
                 entrance",
  oldlabel =     "McVitieW71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McVitieW71",
}

@Article{McVitie:1971:AAT,
  author =       "D. G. McVitie and L. B. Wilson",
  title =        "{ACM Algorithm 411}: Three Procedures for the Stable
                 Marriage Problem [{H}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "491--492",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:03:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#McVitieW71a",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Newcastle upon Tyne, UK",
  keywords =     "ALGOL procedures; assignment; combinatorial
                 mathematics; operations research; stable marriage
                 problem; subroutines",
  oldlabel =     "McVitieW71a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McVitieW71a",
}

@Article{Cermak:1971:AAG,
  author =       "J. {\v{C}}erm{\'{a}}k",
  title =        "{ACM Algorithm 412}: Graph Plotter [{J6}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "492--493",
  month =        jul,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:30:05 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Cermak71",
  note =         "See remark \cite{Watkins:1973:RAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150E (General utility programs)",
  corpsource =   "Univ. Chem. Technol., Pardubice, Czechoslovakia",
  keywords =     "ALGOL procedure; computer graphics; graph; line;
                 multivalued function; plot; printer; subroutines;
                 utility programs",
  oldlabel =     "Cermak71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Cermak71",
}

@Article{Raduchel:1971:RAS,
  author =       "William J. Raduchel",
  title =        "Remark on ``{Algorithm 316}: Solution of Simultaneous
                 Nonlinear Equations [{C5}]''",
  journal =      j-CACM,
  volume =       "14",
  number =       "7",
  pages =        "493--??",
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Raduchel71",
  note =         "See \cite{Brown:1967:AAS}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Raduchel71",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Raduchel71",
}

@Article{Morris:1971:PSS,
  author =       "Robert Morris",
  title =        "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "509--510",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:42:05 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  keywords =     "algebra; algebraic expressions; equivalence; greatest
                 common divisors; polynomial; polynomials; resultants;
                 roots; subresultants; symbolic and algebraic
                 manipulation; zero",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hearn:1971:ASM,
  author =       "Anthony C. Hearn",
  title =        "Applications of symbol manipulation in theoretical
                 physics",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "511--516",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:06 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/reduce.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hearn71",
  abstract =     "This paper surveys the applications of symbolic
                 computation techniques to problems in theoretical
                 physics. Particular emphasis is placed on applications
                 in quantum electrodynamics where the most activity has
                 occurred.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "Univ. Utah, Salt Lake City, UT, USA",
  keywords =     "algebraic; algebraic simplification; computational
                 physics; data handling; physics; quantum
                 electrodynamics; simplification; symbol manipulation;
                 symbolic computation; symbolic manipulation;
                 theoretical physics",
  oldlabel =     "Hearn71",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hearn71",
}

@Article{Hall:1971:ASR,
  author =       "Andrew D. {Hall, Jr.}",
  title =        "The {Altran} system for rational function manipulation
                 --- a survey",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "517--521",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:47:54 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hall71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6140D (High level
                 languages); C7310 (Mathematics computing)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  keywords =     "algebra; Altran; coefficients; computation; data
                 structures; integer; language; languages; polynomial
                 manipulation; polynomials; problem oriented; rational
                 function manipulation; run time data structures;
                 symbolic",
  oldlabel =     "Hall71",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hall71",
}

@Article{Fenichel:1971:LTS,
  author =       "Robert R. Fenichel",
  title =        "List Tracing in Systems Allowing Multiple Cell Types",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "522--526",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:19 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Fenichel71a",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "MIT, Cambridge, MA, USA",
  keywords =     "configuration; list processing; list tracing; multiple
                 cell types; size; storage allocation",
  oldlabel =     "Fenichel71a",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fenichel71a",
}

@Article{Moses:1971:ASG,
  author =       "Joel Moses",
  title =        "Algebraic Simplification: {A} Guide for the
                 Perplexed",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "527--537",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A15",
  MRnumber =     "46 8465",
  bibdate =      "Mon Jan 22 07:06:18 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Moses71",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "MIT, Cambridge, MA, USA",
  keywords =     "algebra; algebraic simplification; automatic;
                 simplification capabilities; substitution",
  oldlabel =     "Moses71",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moses71",
}

@Article{Jefferys:1971:AAM,
  author =       "William H. Jefferys",
  title =        "Automatic algebraic manipulation in celestial
                 mechanics",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "538--541",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:52:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Jefferys71",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and chemistry computing)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "algebra; automated algebraic manipulation; celestial
                 mechanics; integration; perturbation theory; physics;
                 Poisson series; processors",
  oldlabel =     "Jefferys71",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Jefferys71",
  xxtitle =      "Automated Algebraic Manipulation in Celestial
                 Mechanics",
}

@Article{Barton:1971:GRA,
  author =       "David Barton and John P. Fitch",
  title =        "General relativity and the application of algebraic
                 manipulative systems",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "542--547",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "83.53",
  MRnumber =     "48 1640",
  MRreviewer =   "I. K. Marek",
  bibdate =      "Mon Jan 22 06:23:42 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BartonF71",
  abstract =     "The paper describes some applications of symbolic
                 algebra systems to problems of general relativity
                 including the derivation of the field equations, the
                 Petrov classification of a metric, and the solution of
                 the field equations in the presence of matter in a
                 simple case. Attention is drawn to the strictly
                 algebraic difficulties encountered in this work.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "Computer Lab., Cambridge, UK",
  keywords =     "algebra; algebraic manipulation; algebraic
                 manipulative systems; equation manipulation; field
                 equations; general relativity; nonnumerical
                 mathematics; Petrov classification; symbolic; symbolic
                 mathematics",
  oldlabel =     "BartonF71",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BartonF71",
}

@Article{Moses:1971:SIS,
  author =       "Joel Moses",
  title =        "Symbolic Integration: The Stormy Decade",
  journal =      j-CACM,
  volume =       "14",
  number =       "8",
  pages =        "548--560",
  month =        aug,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A15",
  MRnumber =     "46 8466",
  MRreviewer =   "D. B. Hunter",
  bibdate =      "Mon Jan 22 07:06:20 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Moses71a",
  abstract =     "Three approaches to symbolic integration in the 1960's
                 are described. The first, from artificial intelligence,
                 led to Slagle's SAINT and to a large degree to Moses'
                 SIN. The second, from algebraic manipulation, led to
                 Manove's implementation and to Horowitz' and Tobey's
                 reexamination of the Hermite algorithm for integrating
                 rational functions. The third, from mathematics, led to
                 Richardson's proof of the unsolvability of the problem
                 for a class of functions and for Risch's decision
                 procedure for the elementary functions.Generalizations
                 of Risch's algorithm to a class of special functions
                 and programs for solving differential equations and for
                 finding the definite integral are also described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4160 (Numerical
                 integration and differentiation)",
  conflocation = "Los Angeles, CA, USA; 23-25 March 1971",
  conftitle =    "Papers from the 2nd symposium on symbolic and
                 algebraic manipulation",
  corpsource =   "MIT, Cambridge, MA, USA",
  keywords =     "algorithm; artificial intelligence; definite; definite
                 integrals; differential equations; Hermite; integral;
                 integrating rational functions; integration; Manove's
                 implementation; Moses' SIN; proof; rational functions;
                 Richardson's; Risch's decision procedure; SAINT;
                 Slagle's; symbolic integration; unsolvability",
  oldlabel =     "Moses71a",
  sponsororg =   "Assoc. Computing Machinery",
  treatment =    "G General Review; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moses71a",
}

@Article{Teichroew:1971:ERU,
  author =       "Daniel Teichroew",
  title =        "Education Related to the Use of Computers in
                 Organizations",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "573--588",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:25:51 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Teichroew71",
  acknowledgement = ack-nhfb,
  annote =       "Learn about data bases and management. Extensive
                 bibliography.",
  classcodes =   "C0220 (Computing education and training)",
  keywords =     "colleges; computer education; curriculum development;
                 education; information systems; management; management
                 information systems; professional; societies;
                 universities",
  oldlabel =     "Teichroew71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Teichroew71",
}

@Article{Isoda:1971:EBT,
  author =       "Sadahiro Isoda and Eiichi Goto and Izumi Kimura",
  title =        "An Efficient Bit Table Technique for Dynamic Storage
                 Allocation of $2^n$-word Blocks",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "589--592",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:52:08 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#IsodaG71",
  abstract =     "An efficient bit table technique for dynamic storage
                 allocation of $2^n$-word blocks, which requires a
                 minimized amount of memory for bookkeeping purposes, is
                 described. The technique has been tested in an
                 implementation of the list processing language $L^6$. A
                 number of ideas incorporated in the processor are also
                 described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Tokyo Univ., Japan",
  keywords =     "$L^6$; 2/sup n/ word blocks; bit table; bit table
                 technique; bookkeeping; buddy system; dynamic storage
                 allocation; free storage; L/sup 6/; list processing;
                 list processing language; minimum memory; storage
                 allocation",
  oldlabel =     "IsodaG71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/IsodaG71",
}

@Article{Paton:1971:CAB,
  author =       "Keith Paton",
  title =        "Corrigendum: ``{An algorithm for the blocks and
                 cutnodes of a graph}''",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "592--592",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:33:19 1997",
  note =         "See \cite{Paton:1971:ABC}.",
  acknowledgement = ack-nhfb,
}

@Article{Wong:1971:CSA,
  author =       "Eugene Wong and T. C. Chiang",
  title =        "Canonical Structure in Attribute Based File
                 Organization",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "593--597",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:44 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#WongC71",
  note =         "Also published in/as: PhD Th., UCB, EECS, 1973.",
  acknowledgement = ack-nhfb,
  annote =       "Combinatorial retrieval of multi-attribute subsets,
                 applicable when there are few keyword choices. Thisis
                 of T. C. Chiang.",
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  keywords =     "arbitrary Boolean functions; atoms; attribute based;
                 boolean algebra; canonical structure; file
                 organisation; file organization; intersections; lists;
                 queries",
  oldlabel =     "WongC71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/WongC71",
}

@Article{Phillips:1971:NBO,
  author =       "David L. Phillips",
  title =        "A Note on Best One-Sided Approximations",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "598--600",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D15",
  MRnumber =     "45 6158",
  MRreviewer =   "H. L. Loeb",
  bibdate =      "Mon Jan 22 07:12:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Phillips71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  keywords =     "best; best approximation; best approximations; error;
                 function approximation; goodness of fit; logarithmic;
                 multiplicative constant; one sided approximations;
                 one-sided approximation; relationship; relative error;
                 uniform norm",
  oldlabel =     "Phillips71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Phillips71",
}

@Article{Liniger:1971:SCN,
  author =       "Werner Liniger",
  title =        "A stopping criterion for the {Newton--Raphson} method
                 in implicit multistep integration algorithms for
                 nonlinear systems of ordinary differential equations",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "600--601",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65.60",
  MRnumber =     "44\#7754",
  bibdate =      "Mon Jan 22 06:59:11 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Liniger71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "IBM, Yorktown Heights, NY, USA",
  keywords =     "implicit multistep integration; integration; linear
                 multistep formulas; Newton--Raphson method; nonlinear
                 differential equations; nonlinear systems; ordinary
                 differential equations; stopping criterion",
  oldlabel =     "Liniger71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Liniger71",
}

@Article{Flores:1971:ABS,
  author =       "Ivan Flores and George Madpis",
  title =        "Average Binary Search Length for Dense Ordered Lists",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "602--603",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:59 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#FloresM71",
  note =         "See corrigendum \cite{Flores:1972:CAB}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "City Univ. New York, NY, USA",
  keywords =     "average length; binary search; dense ordered lists;
                 information retrieval; list processing",
  oldlabel =     "FloresM71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FloresM71",
}

@Article{Fenichel:1971:CCL,
  author =       "Robert R. Fenichel",
  title =        "Comment on {Cheney}'s List-Compaction Algorithm",
  journal =      j-CACM,
  volume =       "14",
  number =       "9",
  pages =        "603--604",
  month =        sep,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:20 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Fenichel71b",
  acknowledgement = ack-nhfb,
  keywords =     "garbage collector; LISP; list processing; storage
                 allocation; virtual memory",
  oldlabel =     "Fenichel71b",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fenichel71b",
}

@Article{Earley:1971:TUD,
  author =       "Jay Earley",
  title =        "Toward an Understanding of Data Structures",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "617--627",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:11 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Earley71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  keywords =     "data structures; formalism; graph; implementation;
                 programming language; semantic",
  oldlabel =     "Earley71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Earley71",
}

@Article{ANSI:1971:CFS,
  author =       "{ANSI Subcommittee X3J3}",
  title =        "Clarification of {Fortran} Standards --- Second
                 Report",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "628--642",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:31:07 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#X3J371",
  note =         "See also \cite{ANSI:1966:AF}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics); C6140D (High level
                 languages)",
  keywords =     "American National Standard; Basic Fortran; Fortran;
                 FORTRAN; language; language standard; language standard
                 interpretation; language standard maintenance;
                 programming language; specification; standard
                 clarification; standardization; standardization
                 committee; standards",
  oldlabel =     "X3J371",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/X3J371",
}

@Article{Oldehoeft:1971:EAI,
  author =       "Arthur E. Oldehoeft and Samuel D. Conte",
  title =        "Experiments with an automated instructional system for
                 numerical methods",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "643--650",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:10:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#OldehoeftC71",
  acknowledgement = ack-nhfb,
  classcodes =   "C7810C (Computer-aided instruction)",
  corpsource =   "Iowa State Univ., Ames, IA, USA",
  keywords =     "computer aided; computer aided instruction;
                 instruction; instructional systems; numerical methods",
  oldlabel =     "OldehoeftC71",
  treatment =    "X Experimental",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/OldehoeftC71",
}

@Article{Newman:1971:DP,
  author =       "William M. Newman",
  title =        "Display Procedures",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "651--660",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Newman71",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays)",
  corpsource =   "Univ. Utah, Salt Lake City, UT, USA",
  keywords =     "computer graphics; display files; display systems;
                 programming languages",
  oldlabel =     "Newman71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Newman71",
}

@Article{Nemeth:1971:UPM,
  author =       "Alan G. Nemeth and Paul D. Rovner",
  title =        "User program measurement in a time-shared
                 environment",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "661--666",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:07:46 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/monitor.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#NemethR71",
  abstract =     "A general discussion of the measurement of software
                 systems is followed by a description of a hardware and
                 software scheme for measuring user programs in a
                 time-shared environment. The TX-2 computer at MIT
                 Lincoln Laboratory was used for the implementation of
                 such a system and the characteristics of this
                 implementation are reported. Finally, it is shown how
                 other time-sharing systems may provide similar
                 measuring facilities.",
  acknowledgement = ack-nhfb,
  annote =       "A general discussion of the measurement of software
                 systems is followed by a description of a hardware and
                 software scheme for measuring user programs in a
                 time-shared environment.",
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "MIT, Lexington, MA, USA",
  country =      "USA",
  descriptors =  "Performance evaluation; software monitor; time
                 sharing; operating system; multiprogramming;
                 measurement; technology; virtual computer; performance
                 improvement;",
  enum =         "2252",
  keywords =     "computer software; measurement; multiprogramming
                 systems; operating systems; performance improvement;
                 sharing systems; software; technology; time;
                 time-sharing systems; TX2 computer; user program
                 measurement; virtual computers",
  language =     "English",
  oldlabel =     "NemethR71",
  references =   "11",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/NemethR71",
}

@Article{Courtois:1971:CCR,
  author =       "P. J. Courtois and F. Heymans and David Lorge Parnas",
  title =        "Concurrent Control with ``Readers'' and ``Writers''",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "667--668",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:52 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#CouroisHP71",
  acknowledgement = ack-nhfb,
  annote =       "Algorithms for scheduler design for multi accessed
                 database",
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "MBLE Res. Lab., Brussels, Belgium",
  keywords =     "critical section; mutual exclusion; operating systems
                 (computers); programs; resources; shared access to;
                 supervisory and executive",
  oldlabel =     "CouroisHP71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CouroisHP71",
}

@Article{Lyness:1971:AAE,
  author =       "J. N. Lyness and G. Sande",
  title =        "{ACM Algorithm 413}: {ENTCAF} and {ENTCRE}: Evaluation
                 of Normalized {Taylor} Coefficients of an Analytic
                 Function ({C5})",
  journal =      j-CACM,
  volume =       "14",
  number =       "10",
  pages =        "669--675",
  month =        oct,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Lyness71",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  keywords =     "Cauchy integral; complex arithmetic; complex
                 variables; fast; Fourier transform; interpolation;
                 mathematics; numerical differentiation; numerical
                 integration; subroutines; Taylor coefficients; Taylor
                 series",
  oldlabel =     "Lyness71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lyness71",
}

@Article{Branquart:1971:CSA,
  author =       "P. Branquart and J. Lewi and Michel Sintzoff and P. L.
                 Wodon",
  title =        "The composition of semantics in {Algol 68}",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "697--708",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:59 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BranquartLSW71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "MBLE, Brussels, Belgium",
  keywords =     "ALGOL; Algol 68; data; design of programming
                 languages; programming languages; programming
                 primitives; recursive composition; semantics;
                 structures",
  oldlabel =     "BranquartLSW71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BranquartLSW71",
}

@Article{Hamblen:1971:UCH,
  author =       "John W. Hamblen",
  title =        "Using computers in higher education: past
                 recommendations, status, and needs",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "709--712",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:06 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hamblen71",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Southern Regional Education Board, Atlanta, GA, USA",
  keywords =     "computer science; computers; data processing; degree
                 programs; education; educational technology; higher
                 education; laboratory; national goals; testing",
  oldlabel =     "Hamblen71",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hamblen71",
}

@Article{Shell:1971:OPS,
  author =       "Donald L. Shell",
  title =        "Optimizing the Polyphase Sort",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "713--719",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:20:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Shell71",
  note =         "See corrigendum \cite{Shell:1972:COP}.",
  abstract =     "Various dispersion algorithms for the polyphase
                 sorting procedure are examined.The optimum algorithm
                 based on minimizing the total number of unit strings
                 read is displayed. The logic of this algorithm is
                 rather complicated; hence, several other new dispersion
                 algorithms with more straightforward logic are
                 presented. Of the simple dispersion algorithms
                 discussed, the Horizontal is best. It does
                 approximately one-fourth to one and one-half percent
                 less reading and writing than most algorithms in use
                 today. An additional two and one-fourth to three
                 percent improvement can be achieved by utilizing the
                 Modified Optimum Algorithm. This algorithm is
                 relatively straightforward, but it requires a fairly
                 close estimate of the total number of unit strings
                 before the dispersion begins.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "General Electric Co., Schenectady, NY, USA",
  keywords =     "dispersion algorithm; dispersion algorithms;
                 minimizing; optimisation; optimum; optimum dispersion
                 algorithm; polyphase sorting; repetition operator;
                 sorting; unit strings",
  oldlabel =     "Shell71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shell71",
}

@Article{Aramaki:1971:AEP,
  author =       "Itaru Aramaki and Tomokazu Kawabata and Kazuhiko
                 Arimoto",
  title =        "Automation of Etching-Pattern Layout",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "720--730",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:21:46 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AramakiKA71",
  acknowledgement = ack-nhfb,
  classcodes =   "B1130B (Computer-aided circuit analysis and design);
                 B2210 (Printed circuits); C7410D (Electronic
                 engineering computing)",
  corpsource =   "Sumitomo Electric Industries Ltd., Osaka, Japan",
  keywords =     "computer-aided circuit design; etching; heuristic
                 etching pattern layout; ICs; Lee's algorithm; maze
                 running; printed circuit board; printed circuits;
                 wiring design",
  oldlabel =     "AramakiKA71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AramakiKA71",
}

@Article{Malcolm:1971:AFP,
  author =       "Michael A. Malcolm",
  title =        "On Accurate Floating-Point Summation",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "731--736",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65G05 (68-XX)",
  MRnumber =     "47 4434",
  MRreviewer =   "P. Brock",
  bibdate =      "Mon Jan 22 07:01:06 MST 2001",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Malcolm71",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "accurate floating-point summation; digital arithmetic;
                 error analysis",
  oldlabel =     "Malcolm71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Malcolm71",
}

@Article{Golub:1971:AAC,
  author =       "G. H. Golub and L. B. Smith",
  title =        "{ACM Algorithm 414}: {Chebyshev} Approximation of
                 Continuous Functions by a {Chebyshev} System of
                 Functions [{E2}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "11",
  pages =        "737--746",
  month =        nov,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:17 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/acm.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BolubS71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "ALGOL 60; approximation; Chebyshev approximation;
                 critical points; minimax; numerical properties;
                 orthogonal polynomials; Remez algorithm; subroutines",
  oldlabel =     "BolubS71",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BolubS71",
}

@Article{Gordon:1971:RPT,
  author =       "Richard Gordon and Gabor T. Herman",
  title =        "Reconstruction of Pictures from Their Projections",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "759--768",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:45:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#GordonH71",
  note =         "See corrigendum \cite{Gordon:1972:CRP}.",
  abstract =     "There are situations in the natural sciences and
                 medicine (e.g. in electron microscopy and X-ray
                 photography) in which it is desirable to estimate the
                 gray levels of a digital picture at the individual
                 points from the sums of the gray levels along straight
                 lines (projections) at a few angles. Usually, in such
                 situations, the picture is far from determined and the
                 problem is to find the ``most representative'' picture.
                 Three algorithms are described (all using Monte Carlo
                 methods) which were designed to solve this problem. The
                 algorithms are applicable in a large and varied number
                 of fields. The most important uses may be the
                 reconstruction of possibly asymmetric particles from
                 electron micrographs and three-dimensional X-ray
                 analysis.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "State Univ., New York, Buffalo, NY, USA",
  keywords =     "approximation; biomedical image processing; efficient
                 encoding; electron microscopy; image; image processing;
                 linear programming; mathematical programming; medicine;
                 Monte Carlo; Monte Carlo methods; Monte Carlo
                 techniques; natural sciences; optical information;
                 optimization; physics; picture compression; picture
                 description; picture processing; processing;
                 projections; reconstruction of pictures; stereology;
                 techniques; X-ray analysis; X-ray photography",
  oldlabel =     "GordonH71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GordonH71",
}

@Article{Amidon:1971:ASB,
  author =       "E. L. Amidon and G. S. Akin",
  title =        "Algorithmic Selection of the Best Method for
                 Compressing Map Data Strings",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "769--774",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:21:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71",
  abstract =     "The best of a dozen different methods for compressing
                 map data is illustrated. The choices are generated by
                 encoding data strings-sequence of like codes-by three
                 methods and in four directions. Relationships are
                 developed between compression alternatives to avoid
                 comparing all of them. The technique has been used to
                 compress data from forest resource maps, but is widely
                 applicable to map and photographic data reduction.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7890 (Other special
                 applications of computing)",
  corpsource =   "Pacific Southwest Forest and Range Experiment Station,
                 Berkeley, CA, USA",
  keywords =     "data compression; data reduction; data reduction and
                 analysis; data strings; forest resource maps;
                 information retrieval; input/output; map; map storage;
                 run coding; storage",
  oldlabel =     "AmidonA71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AmidonA71",
}

@Article{Mullin:1971:RUS,
  author =       "James K. Mullin",
  title =        "Retrieval-Update Speed Tradeoffs Using Combined
                 Indices",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "775--776",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:06:43 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Mullin71",
  acknowledgement = ack-nhfb,
  classcodes =   "C7250 (Information storage and retrieval)",
  corpsource =   "Univ. Western Ontario, London, Ont., Canada",
  keywords =     "combined index files; file; file organisation; file
                 update; indexing; information retrieval; information
                 retrieval systems; inverted files; minimal cost;
                 organisation; query; retrieval time; speed tradeoffs",
  oldlabel =     "Mullin71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mullin71",
  xxtitle =      "Retrieval-Update Speed Tradeoffs Using Combined
                 Indexes",
}

@Article{Harrison:1971:IST,
  author =       "Malcolm 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 =      "Mon Jan 22 06:48:43 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Harrison71",
  note =         "See also \cite{Tharp:1982:PTS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "New York Univ., NY, USA",
  keywords =     "compression; data handling; hashing; information;
                 information retrieval; programming; searching;
                 signature; subset; substring test",
  oldlabel =     "Harrison71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Harrison71",
}

@Article{Wulf:1971:BLS,
  author =       "W. A. (William A.) Wulf and D. B. Russell and A. N.
                 Habermann",
  title =        "{BLISS}: {A} Language for Systems Programming",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "780--790",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05",
  MRnumber =     "46 8463",
  MRreviewer =   "P. Deussen",
  bibdate =      "Mon Jan 22 07:30:58 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Ai.misc.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#WulfR71",
  URL =          "http://doi.acm.org/10.1145/362919.362936",
  abstract =     "A language, BLISS, is described. This language is
                 designed so as to be especially suitable for use in
                 writing production software systems for a specific
                 machine (the PDP-10): compilers, operating systems,
                 etc. Prime design goals of the design are the ability
                 to produce highly efficient object code, to allow
                 access to all relevant hardware features of the host
                 machine, and to provide a rational means by which to
                 cope with the evolutionary nature of systems programs.
                 A major feature which contributes to the realization of
                 these goals is a mechanism permitting the definition of
                 the representation of all data structures in terms of
                 the access algorithm for elements of the structure.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5420 (Mainframes and minicomputers); C6120 (File
                 organisation); C6150C (Compilers, interpreters and
                 other processors); C6150J (Operating systems)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "BLISS; compilers; data structures; implementation
                 language; language; minicomputers; operating systems;
                 program processors; programming languages; software
                 systems; supervisory and executive programs; systems
                 programming",
  oldlabel =     "WulfR71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/WulfR71",
}

@Article{Rochfeld:1971:NLT,
  author =       "Arnold Rochfeld",
  title =        "New {LISP} Techniques for a Paging Environment",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "791--795",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:42 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Rochfeld71",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Univ. Edinburgh, UK",
  keywords =     "block segment; collection; compact; core
                 fragmentation; garbage; LISP; list processing; list
                 structures; management; paging environment; procedure
                 oriented languages; storage; virtual memory",
  oldlabel =     "Rochfeld71",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rochfeld71",
}

@Article{Blumberg:1971:NMN,
  author =       "John W. Blumberg and Clinton R. Foulk",
  title =        "A note on `a modification of {Nordsieck}'s method
                 using an ``off-step'' point'",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "796--796",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:58 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BlumbergF71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Ohio State Univ., Columbus, OH, USA",
  keywords =     "corrector; corrector methods; differential equations;
                 modification; multistep methods; Nordsieck's method;
                 numerical methods; off error; ordinary differential
                 equations; predictor; predictor-; round",
  oldlabel =     "BlumbergF71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BlumbergF71",
}

@Article{Gustafson:1971:RCG,
  author =       "Sven-{\AA}ke A. Gustafson",
  title =        "Rapid Computation of General Interpolation Formulas
                 and Mechanical Quadrature Rules",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "797--801",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D05",
  MRnumber =     "46 10167a",
  MRreviewer =   "V. Pereyra",
  bibdate =      "Mon Jan 22 06:47:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gustafson71",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Royal Inst. Technol., Stockholm, Sweden",
  keywords =     "divided differences; formula; functionals; general
                 interpolation formulas; Hermitian; interpolation;
                 Lagrangian; linear; mechanical quadrature rules;
                 Newton's interpolation; rapid computation",
  oldlabel =     "Gustafson71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gustafson71",
}

@Article{Bourgeois:1971:EMA,
  author =       "Fran{\c{c}}ois Bourgeois and Jean-Claude Lassalle",
  title =        "An extension of the {Munkres} algorithm for the
                 assignment problem to rectangular matrices",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "802--804",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "90C05",
  MRnumber =     "47 4628",
  bibdate =      "Mon Jan 22 06:27:39 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BourgeoisL71",
  abstract =     "The assignment problem, together with Munkres proposed
                 algorithm for its solution in square matrices, is
                 presented first. Then the authors develop an extension
                 of this algorithm which permits a solution for
                 rectangular matrices. Timing results obtained by using
                 an adapted version of Silver's Algol procedure are
                 discussed, and a relation between solution time and
                 problem size is given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "CERN, Geneva, Switzerland",
  keywords =     "algorithm; assignment problem; matrix algebra; Munkres
                 algorithm; operations research; optimisation;
                 optimization theory; rectangular matrices",
  oldlabel =     "BourgeoisL71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BourgeoisL71",
}

@Article{Bourgeois:1971:AAA,
  author =       "Fran{\c{c}}ois Bourgeois and John-Claude C. Lassalle",
  title =        "{ACM Algorithm 415}: Algorithm for the Assignment
                 Problem (Rectangular Matrices) [{H}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "805--806",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BourgeoisL71a;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#BourgeoisL71b",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "CERN, Geneva, Switzerland",
  keywords =     "algorithm; assignment problem; matrix algebra;
                 operations research; optimization; rectangular
                 matrices; subroutines",
  oldlabel =     "BourgeoisL71a; BourgeoisL71b",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BourgeoisL71a;
                 ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BourgeoisL71b",
}

@Article{Gustafson:1971:AARa,
  author =       "Sven-{\AA}ke Gustafson",
  title =        "{ACM Algorithm 416}: Rapid Computation of Coefficients
                 of Interpolation Formulas [{E1}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "806--807",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D05",
  MRnumber =     "46 10167b",
  MRreviewer =   "V. Pereyra",
  bibdate =      "Mon Jan 22 06:47:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gustafson71a;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gustafson71c",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "algorithm; coefficients; divided differences;
                 interpolation; interpolation formula; rapid
                 computation; subroutines",
  oldlabel =     "Gustafson71a; Gustafson71c",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gustafson71a;
                 ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gustafson71c",
}

@Article{Gustafson:1971:AARb,
  author =       "Sven-{\AA}ke Gustafson",
  title =        "{ACM Algorithm 417}: Rapid Computation of Weights of
                 Interpolatory Quadrature Rules [{D1}]",
  journal =      j-CACM,
  volume =       "14",
  number =       "12",
  pages =        "807--807",
  month =        dec,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D05",
  MRnumber =     "46 10167c",
  MRreviewer =   "V. Pereyra",
  bibdate =      "Mon Jan 22 06:47:33 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gustafson71b;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Gustafson71d",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "algorithm; divided differences; interpolation;
                 interpolation formulae; mechanical quadrature rules;
                 rapid computation; subroutines; weights",
  oldlabel =     "Gustafson71b; Gustafson71d",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gustafson71b;
                 ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gustafson71d",
}

@Article{Lesk:1972:PPR,
  author =       "Arthur M. Lesk",
  title =        "Pictorial pattern recognition and the phase problem of
                 {X}-ray crystallography",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "3--6",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:58:31 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Lesk72",
  acknowledgement = ack-nhfb,
  classcodes =   "A6100 (Structure of liquids and solids;
                 crystallography); A6150 (Crystalline state); B6140C
                 (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Princeton Univ., NJ, USA",
  keywords =     "calculation methods; cross correlation;
                 crystallography; hypotheses; molecular model building;
                 pattern recognition; phase problem; physics; pictorial
                 pattern recognition; structural; X-ray; X-ray
                 crystallography",
  oldlabel =     "Lesk72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lesk72",
}

@Article{Levialdi:1972:SBP,
  author =       "Stefano Levialdi",
  title =        "On Shrinking Binary Picture Patterns",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "7--10",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:58:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Levialdi72",
  abstract =     "A parallel processing algorithm for shrinking binary
                 patterns to obtain single isolated elements, one for
                 each pattern, is presented. This procedure may be used
                 for counting patterns on a matrix, and a hardware
                 implementation of the algorithm using large scale
                 integrated technology is envisioned. The principal
                 features of this method are the very small window
                 employed (two-by-two elements), the parallel nature of
                 the process, and the possibility of shrinking any
                 pattern, regardless of the complexity of its
                 configuration. Problems regarding merging and
                 disconnection of patterns during the process as well as
                 the determination of the maximum number of steps
                 necessary to obtain a single isolated element from a
                 pattern, are reviewed and discussed. An analogy with a
                 neural network description, in terms of McCulloch-Pitts
                 ``neurons'' is presented.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "CNR, Napoli, Italy",
  keywords =     "counting binary patterns; counting patterns;
                 disconnection; isolated element; large scale
                 integrated; matrix; merging; multiple connected;
                 multiple connected pictures; neural network; parallel
                 processing; pattern recognition; pictures; shrinking;
                 shrinking binary picture patterns; single; small
                 window; technology",
  oldlabel =     "Levialdi72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Levialdi72",
}

@Article{Duda:1972:UHT,
  author =       "Richard O. Duda and Peter E. Hart",
  title =        "Use of the {Hough} transformation to detect lines and
                 curves in pictures",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "11--15",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:36:51 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#DudaH72",
  abstract =     "Hough has proposed an interesting and computationally
                 efficient procedure for detecting lines in pictures.
                 This paper points out that the use of angle-radius
                 rather than slope-intercept parameters simplifies the
                 computation further. It also shows how the method can
                 be used for more general curve fitting, and gives
                 alternative interpretations that explain the source of
                 its efficiency.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition)",
  corpsource =   "Stanford Res. Inst., Menlo Park, CA, USA",
  keywords =     "angle radius; colinear points; curve detection;
                 curves; detecting lines; Hough transformation; line
                 detection; pattern recognition; picture processing;
                 pictures; point-line transformation",
  oldlabel =     "DudaH72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DudaH72",
}

@Article{Irons:1972:CES,
  author =       "Edgar T. Irons and Frans M. Djorup",
  title =        "A {CRT} Editing System",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "16--20",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#IronsD72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Inst. Defense Analyses, Princeton, NJ, USA",
  keywords =     "CRT editing system; entry display; manipulation
                 program; text; text editing; time sharing",
  oldlabel =     "IronsD72",
  treatment =    "A Application; E Economic; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/IronsD72",
}

@Article{Dwyer:1972:TSA,
  author =       "T. A. Dwyer",
  title =        "Teacher\slash student authored {CAI} using the
                 {NEWBASIC} system",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "21--28",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:03 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Dwyer72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7810C (Computer-aided instruction)",
  corpsource =   "Univ. Pittsburgh, PA, USA",
  keywords =     "CAI; capability; CATALYST; computer aided instruction;
                 flexible CAI scan; interactive; NEWBASIC system;
                 secondary school",
  oldlabel =     "Dwyer72",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dwyer72",
}

@Article{Shell:1972:COP,
  author =       "Donald L. Shell",
  title =        "Corrigendum: {``Optimizing the Polyphase Sort''}",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "28--28",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:37:36 1997",
  note =         "See \cite{Shell:1971:OPS}.",
  acknowledgement = ack-nhfb,
}

@Article{McCalla:1972:MMU,
  author =       "Gordon I. McCalla and Jeffrey R. Sampson",
  title =        "{MUSE}: {A} Model To Understand Simple {English}",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "29--40",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:02:25 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#McCallaS72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Univ. Alberta, Edmonton, Alta., Canada",
  keywords =     "ambiguity; computer model; English sentences;
                 generalization; information addition to memory;
                 interpretation; intersection procedure; language
                 translation and linguistics; MUSE; natural language
                 processing; network; resolution; semantic memory;
                 syntactic analysis; text",
  oldlabel =     "McCallaS72",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McCallaS72",
}

@Article{Shrager:1972:QPN,
  author =       "Richard I. Shrager",
  title =        "Quadratic Programming for Nonlinear Regression",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "41--45",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:21:26 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Shrager72",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "Dept. Health and Education, Bethesda, MD, USA",
  keywords =     "diagonal method; linear constraints; magnified;
                 nonlinear regression; quadratic programming",
  oldlabel =     "Shrager72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shrager72",
}

@Article{Salzer:1972:OFF,
  author =       "Herbert E. Salzer",
  title =        "Ordering +-f(+-f(+-f(\ldots{}+-f(x)..))) When f(x) Is
                 Positive Monotonic",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "45--46",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:18:11 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Salzer72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  keywords =     "combination; numerical methods; ordering; positive
                 monotonic; real arguments; signs",
  oldlabel =     "Salzer72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Salzer72",
  xxtitle =      "Ordering +or-f(+or-f(+or-f(\ldots{}+or-f(x)\ldots{})))
                 when f(x) is positive monotonic",
}

@Article{Einarsson:1972:AAC,
  author =       "Bo Einarsson",
  title =        "{ACM Algorithm 418}: Calculation of {Fourier}
                 Integrals [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "47--48",
  month =        jan,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:40 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Einarsson72",
  note =         "See remark
                 \cite{Einarsson:1972:RAC,Piessens:1974:RAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Res. Inst. Nat. Defense, Tumba, Sweden",
  keywords =     "calculation; FORTRAN routine; Fourier integrals;
                 integration; subroutines",
  oldlabel =     "Einarsson72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Einarsson72",
}

@Article{Macleod:1972:STR,
  author =       "I. D. G. Macleod",
  title =        "Certification of ``{Algorithm 380}: In-Situ
                 Transposition of a Rectangular Matrix [{F1}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "49--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:43 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Macleod72",
  note =         "See \cite{Laflin:1970:AAS}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Macleod72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Macleod72",
}

@Article{Schrack:1972:RAU,
  author =       "G{\"u}nther F. Schrack",
  title =        "Remark on ``{Algorithm 391}: Unitary Symmetric
                 Polynomials [{Z}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "1",
  pages =        "49--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:51 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Schrack72",
  note =         "See \cite{McKay:1970:AAU}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Schrack72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schrack72",
}

@Article{Pager:1972:PCB,
  author =       "David Pager",
  title =        "A Proposal for a Computer-Based Interactive Scientific
                 Community",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "71--75",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:11:03 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Pager72",
  abstract =     "Because of the problems created by the explosion of
                 papers in the mathematical sciences and the drawbacks
                 that this places on research, it is suggested that a
                 tree of all mathematical results and terminology be
                 maintained in a multiterminal computer
                 system.\par

                 Users of the system can store in the computer an
                 updated file of their current knowledge, and on
                 selecting a paper to read, they can obtain from the
                 computer the minimum subtree of theorems required to
                 bring them from what they already know to the
                 background knowledge which the paper assumes. Under
                 certain conditions, means are also provided for the
                 contribution of useful comments by the readers of a
                 work and for interaction between commentators and with
                 the author. \par

                 This paper describes how the system can be organized
                 and the role required of readers, writers, and
                 commentators.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7250 (Information storage and retrieval)",
  corpsource =   "Univ. Hawaii, Honolulu, HI, USA",
  keywords =     "commentators; computer utility; data structures;
                 information retrieval; information retrieval systems;
                 interactive system; organization of scientific
                 community; readers; trees; trees (mathematics);
                 writers",
  oldlabel =     "Pager72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pager72",
}

@Article{Eastman:1972:PRS,
  author =       "Charles M. Eastman",
  title =        "Preliminary report on a system for general space
                 planning",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "76--87",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Eastman72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C7400 (Engineering
                 computing)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "ALGOL; architects; CAD; computer language;
                 computer-aided design; engineering; extension of ALGOL;
                 general space planning; heuristic programming;
                 orthographic drawings; set of programs; urban
                 designers",
  oldlabel =     "Eastman72",
  treatment =    "G General Review; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Eastman72",
}

@Article{Martin:1972:OBT,
  author =       "William A. Martin and D. N. Ness",
  title =        "Optimizing Binary Trees Grown with a Sorting
                 Algorithm",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "88--93",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:02:02 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#MartinN72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "MIT, Cambridge, MA, USA",
  keywords =     "algorithm; binary trees; data handling; optimisation;
                 optimization; recursion; retrieving information;
                 sorting; trees (mathematics)",
  oldlabel =     "MartinN72",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MartinN72",
}

@Article{Oldehoeft:1972:MCP,
  author =       "Arthur E. Oldehoeft and Maurice H. Halstead",
  title =        "Maximum computing power and cost factors in the
                 centralization problem",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "94--96",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:10:33 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#OldehoeftH72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0310 (EDP management)",
  corpsource =   "Iowa State Univ., Ames, IA, USA",
  keywords =     "centralisation; computer management; cost factors;
                 decentralisation; economics; economies of scale;
                 installations; large single machine installations;
                 management; maximum computing power; multimachine",
  oldlabel =     "OldehoeftH72",
  treatment =    "E Economic",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/OldehoeftH72",
}

@Article{Jenkins:1972:AAZ,
  author =       "Michael A. Jenkins and J. F. Traub",
  title =        "{ACM Algorithm 419}: Zeros of a Complex Polynomial
                 [{C2}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "97--99",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:52:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#JenkinsT72",
  note =         "See remark \cite{Withers:1974:RAZ}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4150 (Nonlinear and functional equations); C7310
                 (Mathematics computing)",
  corpsource =   "Queen's Univ., Kingston, Ont., Canada",
  keywords =     "complex polynomial; FORTRAN; poles and zeros;
                 polynomials; roots; subroutine; subroutines; zeros",
  oldlabel =     "JenkinsT72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JenkinsT72",
}

@Article{Williamson:1972:AAH,
  author =       "Hugh Williamson",
  title =        "{ACM Algorithm 420}: Hidden-Line Plotting Program
                 [{J6}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "100--103",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:14 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Williamson72",
  note =         "See remarks
                 \cite{Macleod:1973:RAH,Williamson:1973:RAH,Ellis:1974:RAHa,Gaither:1974:RAH,Ellis:1974:RAHb}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Tracor Computing Corp., Austin, TX, USA",
  descriptors =  "Fortran; graphics; iterative method; application;
                 method; human factors; diagram manipulation; hidden
                 line algorithm;",
  keywords =     "computer graphics; data handling; FORTRAN; hidden line
                 plotting; subroutine; subroutines; surface plot",
  oldlabel =     "Williamson72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Williamson72",
}

@Article{Moorer:1972:MCC,
  author =       "James Anderson Moorer",
  title =        "Music and Computer Composition",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "104--113",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:49 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Moorer72",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C7820 (Humanities
                 computing)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "artificial intelligence; composition; computer music;
                 harmony; heuristic; humanities; models of cognitive
                 processes; music theory; program; programming",
  oldlabel =     "Moorer72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moorer72",
}

@Article{Flores:1972:CAB,
  author =       "Ivan Flores and George Madpis",
  title =        "Corrigendum: {``Average Binary Search Length for Dense
                 Ordered Lists''}",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "113--113",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:37:46 1997",
  note =         "See \cite{Flores:1971:ABS}.",
  acknowledgement = ack-nhfb,
}

@Article{Gordon:1972:CRP,
  author =       "Richard Gordon and Gabor T. Herman",
  title =        "Corrigendum: {``Reconstruction of Pictures from Their
                 Projections''}",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "113--113",
  month =        feb,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Jan 17 18:38:30 1997",
  note =         "See \cite{Gordon:1971:RPT}.",
  acknowledgement = ack-nhfb,
}

@Article{Denning:1972:PAS,
  author =       "Peter J. Denning and Brian Randell",
  title =        "Papers from the 3rd {ACM} symposium on operating
                 systems principles",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "133--134",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Apr 08 20:44:30 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  keywords =     "access; computer; operating systems; operating systems
                 (computers); parallel processing supervisory;
                 partitioning; storage; time sharing systems",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bobrow:1972:TPT,
  author =       "Daniel G. Bobrow and Jerry D. Burchfiel and Daniel L.
                 Murphy and Raymond S. Tomlinson",
  title =        "{TENEX}, {A} Paged Time-Sharing System for the
                 {PDP-10}",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "135--143",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:04 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BobrowBMT72",
  acknowledgement = ack-nhfb,
  annote =       "Includes description of file system aspects and
                 protection.",
  classcodes =   "C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Computer Sci. Div., Cambridge, UK",
  keywords =     "minicomputers; paged time sharing system; PDP 10;
                 TENEX; time-sharing programs",
  oldlabel =     "BobrowBMT72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BobrowBMT72",
}

@Article{Liskov:1972:DVO,
  author =       "Barbara H. Liskov",
  title =        "The Design of the {Venus} Operating System",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "144--149",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:59:22 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Liskov72",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture); C6150J (Operating
                 systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "MITRE Corporation. Bedford, MA, USA",
  keywords =     "architecture; computer architecture; operating systems
                 (computers); small computer; software; Venus operating
                 system",
  oldlabel =     "Liskov72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Liskov72",
}

@Article{Gaines:1972:OSB,
  author =       "R. Stockton Gaines",
  title =        "An Operating System Based on the Concept of a
                 Supervisory Computer",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "150--156",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:42:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gaines72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Inst. Defense Analyses, von Neumann Hall, Princeton,
                 NJ, USA",
  keywords =     "independent; operating system; operating systems
                 (computers); processes; supervisory computer",
  oldlabel =     "Gaines72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gaines72",
}

@Article{Schroeder:1972:HAI,
  author =       "Michael D. Schroeder and Jerome H. Saltzer",
  title =        "A Hardware Architecture for Implementing Protection
                 Rings",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "157--170",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:54 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#SchroederS72",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "MIT, Cambridge, MA, USA",
  keywords =     "access control; access privileges; architecture;
                 computer architecture; digital storage; Multics;
                 protection rings; system",
  oldlabel =     "SchroederS72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SchroederS72",
}

@Article{Habermann:1972:SCP,
  author =       "A. Nico Habermann",
  title =        "Synchronization of Communicating Processes",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "171--176",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:47:46 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Habermann72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Carnegie-Mellon Univ., Pittsburg, PA, USA",
  keywords =     "buffer store; communication; concurrency; operating
                 systems (computers); parallel processes; parallel
                 processing; synchronisation; synchronization",
  oldlabel =     "Habermann72",
  sponsororg =   "Assoc. Computing machinery",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Habermann72",
}

@Article{Teorey:1972:CAD,
  author =       "Toby J. Teorey and Tad B. Pinkerton",
  title =        "A Comparative Analysis of Disk Scheduling Policies",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "177--184",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:26:01 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/is.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#TeoreyP72",
  URL =          "http://dblp.uni-trier.de/db/journals/cacm/TeoreyP72.html",
  acknowledgement = ack-nhfb,
  annote =       "Analysis, design of hardware. Minimizing seeks and
                 latencies.",
  cdrom =        "CACMs1/CACM15/P177.pdf",
  classcodes =   "C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "criteria; disk scheduling policies; magnetic storage
                 systems; multiprogramming; performance; seek time;
                 waiting time",
  oldlabel =     "TeoreyP72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/TeoreyP72",
}

@Article{Coffman:1972:SSP,
  author =       "Edward G. {Coffman, Jr.} and T. A. {Ryan, Jr.}",
  title =        "A study of storage partitioning using a mathematical
                 model of locality",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "185--190",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:02 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#CoffmanR72",
  acknowledgement = ack-nhfb,
  classcodes =   "C1220 (Simulation, modelling and identification);
                 C6150J (Operating systems)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Pennsylvania State Univ., University Park, PA, USA",
  keywords =     "dynamic; fixed; mathematical model of locality;
                 modelling; multiprogramming; storage allocation;
                 storage partitioning",
  oldlabel =     "CoffmanR72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CoffmanR72",
  xxauthor =     "Edward G. {Coffman, Jr.} and T. A. Ryan",
  xxauthor =     "E. G. {Coffman, Jr.} and T. A. {Ryan, Jr.}",
}

@Article{Denning:1972:PWS,
  author =       "Peter J. Denning and Stuart C. Schwartz",
  title =        "Properties of the Working Set Model",
  journal =      j-CACM,
  volume =       "15",
  number =       "3",
  pages =        "191--198",
  month =        mar,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05",
  MRnumber =     "47 6119",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Mon Jan 22 06:35:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#DenningS72",
  note =         "See corrigendum \cite{Denning:1973:CWM}.",
  abstract =     "A program's working set $W(t,T)$ at time $t$ is the
                 set of distinct pages among the T most recently
                 referenced pages. Relations between the average
                 working-set size, the missing-page rate, and the
                 interreference-interval distribution may be derived
                 both from time-average definitions and from
                 ensemble-average (statistical) definitions. An
                 efficient algorithm for estimating these quantities is
                 given. The relation to LRU (least recently used) paging
                 is characterized. The independent-reference model, in
                 which page references are statistically independent, is
                 used to assess the effects to interpage dependencies on
                 working-set size observations. Under general
                 assumptions, working-set size is shown to be normally
                 distributed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  conflocation = "Palo Alto, CA, USA; 18-20 Oct. 1971",
  conftitle =    "Papers from the 3rd ACM symposium on operating systems
                 principles",
  corpsource =   "Princeton Univ., NJ, USA",
  keywords =     "model; modelling; paging; paging algorithms; program
                 behavior; program modeling; programming theory;
                 supervisory programs; working set; working-set model",
  oldlabel =     "DenningS72",
  sponsororg =   "Assoc. Computing machinery",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DenningS72",
}

@Article{Conway:1972:ISM,
  author =       "Richard W. Conway and William L. Maxwell and Howard L.
                 Morgan",
  title =        "On the Implementation of Security Measures in
                 Information Systems",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "211--220",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:33 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#ConwayMM72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "access control confidentiality; access management;
                 data banks; information systems; management; model;
                 modelling; operating systems; privacy; security;
                 security of data",
  oldlabel =     "ConwayMM72",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ConwayMM72",
}

@Article{Walden:1972:SIC,
  author =       "David C. Walden",
  title =        "A system for interprocess communication in a resource
                 sharing computer network",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "221--230",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:48 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Walden72",
  note =         "Reproduced in ``Advances in Computer Communications'',
                 W. W. Chu, (Ed.), (1974), 340--349.",
  abstract =     "A system of communication between processes in a
                 time-sharing system is described and the communication
                 system is extended so that it may be used between
                 processes distributed throughout a computer network.
                 \par

                 The hypothetical application of the system to an
                 existing network is discussed.",
  acknowledgement = ack-nhfb,
  annote =       "A system of communication between processes in a
                 time-sharing system is described and the communication
                 is extended so that it may be used between processes
                 distributed throughout a computer network. The
                 hypothetical application of the system to an existing
                 network is discussed.",
  classcodes =   "C5490 (Other aspects of analogue and digital
                 computers); C5620 (Computer networks and techniques)",
  corpsource =   "Bolt Beranek and Newman Inc., Cambridge, MA, USA",
  country =      "USA",
  descriptors =  "Resource management; computer network; time sharing;
                 interprocess communication;",
  enum =         "3213",
  keywords =     "computer networks; digital communication systems;
                 hypothetical application; interprocess communication;
                 resource sharing; time sharing; time-sharing;
                 time-sharing systems",
  language =     "English",
  oldlabel =     "Walden72",
  references =   "10",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Walden72",
}

@Article{Herbst:1972:ELP,
  author =       "N. M. Herbst and P. M. Will",
  title =        "An experimental laboratory for pattern recognition and
                 signal processing",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "231--244",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HerbstW72",
  acknowledgement = ack-nhfb,
  classcodes =   "C5490 (Other aspects of analogue and digital
                 computers)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  keywords =     "analogue input and output facilities; computer;
                 design; display systems; image; interactive terminal;
                 pattern recognition; process control digital;
                 processing; programming support; pseudorandom displays;
                 scanner control; scanners; signal processing; system;
                 TV camera",
  oldlabel =     "HerbstW72",
  treatment =    "A Application; X Experimental",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HerbstW72",
}

@Article{Matsushita:1972:HLE,
  author =       "Yutaka Matsushita",
  title =        "Hidden Lines Elimination for a Rotating Object",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "245--252",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A10",
  MRnumber =     "47 7945",
  MRreviewer =   "Rani Siromoney",
  bibdate =      "Mon Jan 22 07:02:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Matsushita72",
  abstract =     "A method is presented of determining which parts of
                 three-dimensional objects are visible and which are
                 invisible when the objects are rotated about some axis.
                 This paper describes a polygon comparison scheme in
                 which the relationships of two polygons can be
                 classified into tree types, and also discusses how the
                 relationship is changed for each pair of polygons under
                 rotation about some axis. A rotation table is defined
                 for each pair of polygons, which remains fixed as long
                 as rotation is about one axis and provides a means of
                 rapidly determining the visible and hidden line
                 relationship between two polygons. \par

                 Additional work must be done to extend this approach to
                 simultaneous rotation about several axes.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. Illinois, Urbana-Champaign, IL, USA",
  keywords =     "computer drawn picture; computer graphics; data
                 handling; display programming; displays; graphics;
                 hidden line; hidden line problem; polygon comparison
                 scheme; problem; rotating object",
  oldlabel =     "Matsushita72",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Matsushita72",
}

@Article{Chase:1972:IGA,
  author =       "Stephen M. Chase",
  title =        "An implemented graph algorithm for winning {Shannon
                 Switching Games}",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "253--256",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:30:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Chase72",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  keywords =     "artificial intelligence; computer; game playing; graph
                 algorithm; programme; Shannon Switching Games; winning
                 strategy",
  oldlabel =     "Chase72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chase72",
}

@Article{Horowitz:1972:CSP,
  author =       "Ellis Horowitz and Howard L. Morgan and Alan C. Shaw",
  title =        "Computers and Society: {A} Proposed Course for
                 Computer Scientists",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "257--261",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HorowitzMS72",
  abstract =     "The purpose of this paper is to describe a course
                 concerned with both the effects of computers on society
                 and the responsibilities of computer scientists to
                 society. The impact of computers is divided into five
                 components: political, economic, cultural, social, and
                 moral; the main part of the paper defines each
                 component and presents examples of the relevant issues.
                 In the remaining portions the possible formats for such
                 a course are discussed, a topic by topic outline is
                 given, and a selected set of references is listed. It
                 is hoped that the proposal will make it easier to
                 initiate courses on this subject.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "computer scientists; computers and society; course;
                 course proposal; cultural; economic; economic and
                 sociological effects; education; moral; political;
                 social; social implications",
  oldlabel =     "HorowitzMS72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HorowitzMS72",
}

@Article{Kuki:1972:CGF,
  author =       "Hirondo Kuki",
  title =        "Complex Gamma Function with Error Control [{S14}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "262--267",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D20",
  MRnumber =     "47 1249",
  MRreviewer =   "L. Fox",
  bibdate =      "Mon Jan 22 06:56:30 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kuki72a",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "algorithm; complex; complex gamma function; complex
                 loggamma; error control; FORTRAN; function; function
                 approximation; loggamma function; programme;
                 subroutines",
  oldlabel =     "Kuki72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kuki72a",
}

@Article{Moler:1972:MCF,
  author =       "Cleve B. Moler",
  title =        "Matrix Computations with {Fortran} and Paging",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "268--270",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:06 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Moler72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C6140D (High level
                 languages)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  keywords =     "FORTRAN; Fortran; linear equations; matrix algebra;
                 matrix computations; memory hierarchy; nested loops;
                 nla; paged memory; virtual memory",
  oldlabel =     "Moler72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moler72",
}

@Article{Kuki:1972:AAC,
  author =       "Hirondo Kuki",
  title =        "{ACM Algorithm 421}: Complex Gamma Function with Error
                 Control [{S14}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "271--272",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D20",
  MRnumber =     "47 1249",
  MRreviewer =   "L. Fox",
  bibdate =      "Mon Jan 22 06:56:30 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kuki72a",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "algorithm; complex; complex gamma function; complex
                 loggamma; error control; FORTRAN; function; function
                 approximation; loggamma function; programme;
                 subroutines",
  oldlabel =     "Kuki72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kuki72a",
}

@Article{Whitney:1972:AAM,
  author =       "V. Kevin M. Whitney",
  title =        "{ACM Algorithm 422}: Minimal Spanning Tree [{H}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "273--274",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:29:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Whitney72",
  note =         "See remark \cite{Kernighan:1973:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  keywords =     "algorithm; FORTRAN; maximal spanning tree; minimal
                 spanning tree; spanning tree; subroutines; trees
                 (mathematics); undirected graph",
  oldlabel =     "Whitney72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Whitney72",
}

@Article{Moler:1972:AAL,
  author =       "Cleve B. Moler",
  title =        "{ACM Algorithm 423}: Linear Equation Solver [{F4}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "274--274",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:10 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Moler72a",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  keywords =     "array processing; Fortran; linear algebra; linear
                 equation solver; memory; paged memory; subroutines;
                 virtual",
  oldlabel =     "Moler72a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moler72a",
}

@Article{Walden:1972:NCN,
  author =       "David C. Walden",
  title =        "A Note on {Cheney}'s Nonrecursive List-Compacting
                 Algorithm",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "275--275",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:50 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Walden72a",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "A/S Norsk Data-Elektronikk, Oslo, Norway",
  keywords =     "algorithm; garbage collection; list compacting; list
                 processing; nonrecursive; storage management",
  oldlabel =     "Walden72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Walden72a",
}

@Article{Hu:1972:CDC,
  author =       "T. C. Hu",
  key =          "file searching, double-chained tree, binary search
                 tree",
  title =        "A Comment on the Double-Chained Tree",
  journal =      j-CACM,
  volume =       "15",
  number =       "4",
  pages =        "276--276",
  month =        apr,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:14 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Hu72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "binary search tree; double chained tree; file
                 organisation; file searching; trees (mathematics)",
  oldlabel =     "Hu72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hu72",
}

@Article{Mullin:1972:IIS,
  author =       "James K. Mullin",
  title =        "An Improved Indexed-Sequential Access Method Using
                 Hashed Overflow",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "301--307",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:06:44 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Mullin72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Univ. Western Ontario, Ont., Canada",
  keywords =     "cylinder; file management systems; file organisation;
                 hashed overflow; improved index sequential access
                 method; long overflow chains; movable head disc
                 devices; overflow records; record keys; scatter; space
                 allocation; storage; storage allocation; storage
                 management; treating",
  oldlabel =     "Mullin72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Mullin72",
  xxtitle =      "An Improved Index Sequential Access Method Using
                 Hashed Overflow",
}

@Article{Bensoussan:1972:MVM,
  author =       "A. Bensoussan and C. T. Clingen and Robert C. Daley",
  title =        "The {Multics} Virtual Memory: Concepts and Design",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "308--318",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:53 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BensoussanCD72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Honeywell Information Systems Inc., Cambridge, MA,
                 USA",
  keywords =     "concepts; design; hierarchy; information sharing;
                 memory; memory management; Multics virtual memory;
                 online operating systems; Operating segments paging
                 sharing management CACM; operating systems (computers);
                 paging; segmentation",
  oldlabel =     "BensoussanCD72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BensoussanCD72",
}

@Article{Christman:1972:MSA,
  author =       "Ronald D. Christman",
  title =        "{MUX}, a Simple Approach to On-Line Computing",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "319--329",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:31:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Christman72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Univ. California, Los Alamos, NM, USA",
  keywords =     "batch system; CDC 6600 computer; cost; design
                 criteria; economics; implementation; input; modify
                 files; multi-access systems; multiplexer; MUX; online
                 computing; online operation; operating; overhead;
                 systems (computers); user reactions",
  oldlabel =     "Christman72",
  treatment =    "E Economic; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Christman72",
}

@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{Gentleman:1972:ICCa,
  author =       "W. Morven Gentleman",
  title =        "Implementing {Clenshaw--Curtis} quadrature. {I}.
                 Methodology and experience",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "337--342",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D30",
  MRnumber =     "48 5343",
  MRreviewer =   "D. F. Mayers",
  bibdate =      "Mon Jan 22 06:43:44 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gentleman72",
  abstract =     "Clenshaw--Curtis quadrature is a particularly
                 important automatic quadrature scheme for a variety of
                 reasons, especially the high accuracy obtained from
                 relatively few integrand values. However, it has
                 received little use because it requires the computation
                 of a cosine transformation and the arithmetic cost of
                 this has been prohibitive. This paper is in two parts;
                 a companion paper, ``II Computing the Cosine
                 Transformation,'' shows that this objection can be
                 overcome by computing the cosine transformation by a
                 modification of the fast Fourier transform algorithm.
                 \par

                 This first part discusses the strategy and various
                 error estimates, and summarizes experience with a
                 particular implementation of the scheme.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4110 (Error analysis in numerical methods); C4160
                 (Numerical integration and differentiation); C7310
                 (Mathematics computing)",
  corpsource =   "Univ. Waterloo, Ont., Canada",
  keywords =     "automatic quadrature; Chebyshev series; Clenshaw
                 Curtis; Clenshaw--Curtis quadrature; error analysis;
                 error estimates; experience; implementation;
                 integration; numerical integration; numerical methods;
                 strategy",
  oldlabel =     "Gentleman72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gentleman72",
}

@Article{Gentleman:1972:ICCb,
  author =       "W. Morven Gentleman",
  title =        "Implementing {Clenshaw--Curtis} quadrature. {II}.
                 Computing the cosine transformation",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "343--346",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D30",
  MRnumber =     "48 5344",
  MRreviewer =   "D. F. Mayers",
  bibdate =      "Mon Jan 22 06:43:45 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gentleman72a",
  abstract =     "In a companion paper to this, ``I Methodology and
                 Experiences,'' the automatic Clenshaw--Curtis
                 quadrature scheme was described and how each quadrature
                 formula used in the scheme requires a cosine
                 transformation of the integrand values was shown. The
                 high cost of these cosine transformations has been a
                 serious drawback in using Clenshaw--Curtis quadrature.
                 \par

                 Two other problems related to the cosine transformation
                 have also been trouble some. First, the conventional
                 computation of the cosine transformation by recurrence
                 relation is numerically unstable, particularly at the
                 low frequencies which have the largest effect upon the
                 integral. Second, in case the automatic scheme should
                 require refinement of the sampling, storage is required
                 to save the integrand values after the cosine
                 transformation is computed. This second part of the
                 paper shows how the cosine transformation can be
                 computed by a modification of the fast Fourier
                 transform and all three problems overcome. The
                 modification is also applicable in other circumstances
                 requiring cosine or sine transformations, such as
                 polynomial interpolation through the Chebyshev
                 points.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Waterloo, Ont., Canada",
  keywords =     "Chebyshev series; Clenshaw Curtis quadrature;
                 Clenshaw--Curtis quadrature; cosine; cosine
                 transformation; fast Fourier transformation; fast
                 Fourier transforms; FFT; implementation; integration;
                 numerical methods; polynomial interpolation;
                 transformation",
  oldlabel =     "Gentleman72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gentleman72a",
}

@Article{Greenspan:1972:FFD,
  author =       "D. Greenspan and D. Schultz",
  title =        "Fast finite-difference solution of biharmonic
                 problems",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "347--350",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65N05",
  MRnumber =     "47 2829",
  bibdate =      "Mon Jan 22 06:46:20 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#GreenspanS72",
  abstract =     "Setting the Reynolds number equal to zero, in a method
                 for solving the Navier-Strokes equations numerically,
                 results in a fast numerical method for biharmonic
                 problems. The equation is treated as a system of two
                 second order equations and a simple smoothing process
                 is essential for convergence. An application is made to
                 a crack-type problem.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "biharmonic equation; biharmonic problems; boundary
                 value problem; boundary-value problems; convergence;
                 convergence of numerical methods; crack type problem;
                 difference equations; fast finite difference solution;
                 Navier Stokes equations; numerical analysis; partial
                 differential equations; process; smoothing; two second
                 order equations",
  oldlabel =     "GreenspanS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GreenspanS72",
}

@Article{Dunham:1972:MNA,
  author =       "Charles B. Dunham",
  title =        "Minimax nonlinear approximation by approximation on
                 subsets",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "351--351",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:36:54 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Dunham72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Univ. Western Ontario, Ont., Canada",
  keywords =     "function approximation; minimax nonlinear
                 approximation; optimisation; subsets",
  oldlabel =     "Dunham72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dunham72",
}

@Article{Harter:1972:OWF,
  author =       "Richard Harter",
  title =        "The Optimality of {Winograd}'s Formula",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "352--352",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "352.65F05",
  MRnumber =     "47 2801",
  bibdate =      "Mon Jan 22 06:48:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Harter72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  keywords =     "inner product; linear algebra; numerical analysis;
                 optimality; vectors; Winograd's formula",
  oldlabel =     "Harter72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Harter72",
}

@Article{Gentleman:1972:AAC,
  author =       "W. Morven Gentleman",
  title =        "{ACM Algorithm 424}: {Clenshaw--Curtis} Quadrature
                 [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "353--355",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:46 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gentleman72b",
  note =         "See remark \cite{Good:1973:RAC,Geddes:1979:RCC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Waterloo, Ont., Canada",
  keywords =     "Chebyshev series; Clenshaw Curtis quadrature; cosine
                 transform; FFT; FORTRAN subroutine; integration;
                 subroutines",
  oldlabel =     "Gentleman72b",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gentleman72b",
}

@Article{Hurst:1972:AAG,
  author =       "Rex L. Hurst and Robert E. Knop",
  title =        "{ACM Algorithm 425}: Generation of Random Correlated
                 Normal Variables [{G5}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "355--357",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HurstK72",
  note =         "See remark \cite{Page:1974:GRC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Utah State Univ., Logan, UT, USA",
  keywords =     "algorithms; FORTRAN subroutine; generation;
                 multivariate normal density; random correlated normal
                 variables; statistics; subroutines; timing",
  oldlabel =     "HurstK72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HurstK72",
}

@Article{Bron:1972:AAM,
  author =       "Coenraad Bron",
  title =        "{ACM Algorithm 426}: Merge Sort Algorithm [{M1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "357--358",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:10 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bron72",
  note =         "See remark \cite{Bron:1974:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Technol. Univ., Eindhoven, Netherlands",
  keywords =     "ALGOL 60 procedure; merge sort algorithm; merging;
                 recursion; sorting; subroutines",
  oldlabel =     "Bron72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bron72",
}

@Article{Linz:1972:AAF,
  author =       "Peter Linz",
  title =        "{ACM Algorithm 427}: {Fourier} Cosine Integral
                 [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "358--360",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:59:15 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Linz72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. California, Davis, CA, USA",
  keywords =     "FORTRAN procedure; Fourier cosine integral;
                 integration; subroutines",
  oldlabel =     "Linz72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Linz72",
}

@Article{Yohe:1972:AAH,
  author =       "J. M. Yohe",
  title =        "{ACM Algorithm 428}: {Hu-Tucker} Minimum Redundancy
                 Alphabetic Coding Method [{Z}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "360--362",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:31:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Yohe72",
  note =         "See remark \cite{Byrne:1973:RAH}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6120B (Codes); C1260 (Information theory)",
  corpsource =   "Univ. Wisconsin, Madison, WI, USA",
  keywords =     "codes; encoding; FORTRAN subroutine; Hu Tucker minimum
                 redundancy alphabetic binary coding; method;
                 subroutines",
  oldlabel =     "Yohe72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Yohe72",
}

@Article{Ashenhurst:1972:RAC,
  author =       "Robert L. Ashenhurst",
  title =        "A report of the {ACM} curriculum committee on computer
                 education for management. Curriculum recommendations
                 for graduate professional programs in information
                 systems",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "363--398",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:09 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ashenhurst72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  keywords =     "course descriptions; curriculum recommendations;
                 education; implementation; information systems; systems
                 analysis",
  oldlabel =     "Ashenhurst72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ashenhurst72",
  xxtitle =      "Curriculum Recommendations for Graduate Professional
                 Programs in Information Systems",
}

@Article{Blatny:1972:OPT,
  author =       "J. Blatny and S. R. Clark and T. A. Rourke",
  title =        "On the optimization of performance of time-sharing
                 systems by simulation",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "411--420",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BlatnyCR72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C6150J (Operating
                 systems)",
  corpsource =   "Univ. Manitoba, Winnipeg, Man., Canada",
  keywords =     "computation theory; finite; infinite auxiliary store;
                 job scheduling algorithm; noncontiguous store; number
                 of jobs allowed to execute simultaneously;
                 optimisation; optimization of performance; optimum
                 round robin cycle time selection; programs; sharing
                 systems; simulation; slice techniques; store size;
                 time; time-sharing; variable time",
  oldlabel =     "BlatnyCR72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BlatnyCR72",
}

@Article{Spacek:1972:PEP,
  author =       "Thomas R. Spacek",
  title =        "A proposal to establish a pseudo virtual memory via
                 writable overlays",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "421--426",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:23:31 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Spacek72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "CIA, Washington, DC, USA",
  keywords =     "collector; display; establishment; executable storage
                 size problems; folding; graphic; linkage editor;
                 loader; overlay structure; paging; pseudovirtual
                 memory; segmentation; storage allocation; writable
                 overlays",
  oldlabel =     "Spacek72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Spacek72",
}

@Article{Gilbert:1972:IBC,
  author =       "Philip Gilbert and W. J. Chandler",
  title =        "Interference between Communicating Parallel
                 Processes",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "427--437",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:44:16 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#GilbertC72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C6150J (Operating
                 systems)",
  corpsource =   "Univ. Southern California, Los Angeles, CA, USA",
  keywords =     "computation theory; concurrent programming control;
                 cooperating processes; formal programs; inclusion;
                 interference between communicating parallel processes;
                 mutual exclusion; operating systems; parallel
                 processing; problem; sequences of states; transition
                 rule",
  oldlabel =     "GilbertC72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GilbertC72",
}

@Article{Gimpel:1972:BND,
  author =       "James F. Gimpel",
  title =        "Blocks --- {A} New Data type for {SNOBOL4}",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "438--447",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:44:25 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gimpel72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Bell Telephone Labs. Inc., Holmdel, NJ, USA",
  keywords =     "blocks; character; composing printable output;
                 datatype; dimensional aggregate of characters;
                 manipulation; overstriking; problem oriented languages;
                 right parallelepiped; SNOBOL 4; string processing; text
                 editing; text processing; three",
  oldlabel =     "Gimpel72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gimpel72",
}

@Article{Martin:1972:BMM,
  author =       "David F. Martin",
  title =        "A {Boolean} matrix method for the computation of
                 linear precedence functions",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "448--454",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "54 9175",
  MRreviewer =   "Daniel J. Rosenkrantz",
  bibdate =      "Mon Jan 22 07:01:57 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Martin72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  keywords =     "analysis; Boolean functions; boolean matrix method;
                 conflict free matrix; context; context-free grammars;
                 free parsing; linear precedence functions; matrix
                 algebra; precedence grammars; syntax",
  oldlabel =     "Martin72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Martin72",
}

@Article{OReagan:1972:CAC,
  author =       "Robert T. O'Reagan",
  title =        "Computer Assigned Codes from Verbal Responses",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "455--459",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:10:18 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#OReagan72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "US Bureau of the Census, Washington, DC, USA",
  keywords =     "codes; computer coding; concept; data handling;
                 historical response patterns; reference list;
                 translation; verbal responses; word coding; word
                 strings",
  oldlabel =     "OReagan72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/OReagan72",
}

@Article{Iguchi:1972:SMS,
  author =       "Ken Iguchi",
  title =        "A starting method for solving nonlinear {Volterra}
                 integral equations of the second kind",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "460--461",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:45 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Iguchi72",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation)",
  corpsource =   "Nagoya Univ., Japan",
  keywords =     "algorithm; fourth order method; integral equations;
                 nonlinear Volterra integral equations; numerical
                 methods; starting method",
  oldlabel =     "Iguchi72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Iguchi72",
}

@Article{Pohl:1972:SPC,
  author =       "Ira Pohl",
  title =        "A Sorting Problem and Its Complexity",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "462--464",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:12:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Pohl72",
  abstract =     "A technique for proving min-max norms of sorting
                 algorithms is given. One new algorithm for finding the
                 minimum and maximum elements of a set with fewest
                 comparisons is proved optimal with this technique.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. California, Santa Cruz, CA, USA",
  keywords =     "complexity; computational; computational
                 combinatorics; computational combinatories;
                 computational complexity; minimax norms; minimum and
                 maximum elements; sorting",
  oldlabel =     "Pohl72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pohl72",
}

@Article{Kolbig:1972:CAC,
  author =       "K. S. K{\"o}lbig",
  title =        "Certification of ``{Algorithm 363}: {Complex} error
                 function''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "465--466",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:55:38 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kolbig72",
  note =         "See \cite{Gautschi:1969:AAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4120 (Functional analysis); C7310 (Mathematics
                 computing)",
  corpsource =   "CERN, Geneva, Switzerland",
  keywords =     "complex error function; function evaluation; special
                 functions; subroutines; Voigt function",
  oldlabel =     "Kolbig72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kolbig72",
}

@Article{Niessner:1972:RAE,
  author =       "Herbert Niessner",
  title =        "Remark on ``{Algorithm 343}: Eigenvalues and
                 eigenvectors of a real general matrix''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "466--466",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Niessner72",
  note =         "See \cite{Grad:1968:AAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C7310 (Mathematics
                 computing)",
  corpsource =   "Brown, Boveri and Co., Baden, Switzerland",
  keywords =     "eigenvalues; eigenvalues and eigenfunctions;
                 eigenvectors; FORTRAN; general; matrices; matrix
                 algebra; nonsymmetric matrices; QR algorithm;
                 subroutines",
  oldlabel =     "Niessner72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Niessner72",
}

@Article{Proll:1972:RAA,
  author =       "L. G. Proll",
  title =        "Remark on ``{ACM Algorithm 370}: {General} random
                 number generator [{G5}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "467--468",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:04 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Proll72",
  note =         "See \cite{Butler:1970:AAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. Southampton, UK",
  country =      "USA",
  descriptors =  "RVG;",
  enum =         "7783",
  keywords =     "cumulative distribution function; probability density
                 function; random number generation; random number
                 generator; subroutines; transformation",
  language =     "English",
  oldlabel =     "Proll72",
  references =   "0",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Proll72",
}

@Article{Schrack:1972:RAR,
  author =       "G{\"u}nther F. Schrack",
  title =        "Remark on ``{Algorithm 381}: Random vectors uniform in
                 solid angle''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "468--468",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Schrack72a",
  note =         "See \cite{Knop:1970:AAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Univ. British Columbia, Vancouver, BC, Canada",
  keywords =     "points uniform on; random number generation; random
                 vector generator; solid angle; sphere; spherically
                 symmetric probability distribution; subroutines",
  oldlabel =     "Schrack72a",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schrack72a",
}

@Article{Sale:1972:RAS,
  author =       "Arthur H. J. Sale",
  title =        "Remark on ``{Algorithm 393}: Special series summation
                 with arbitrary precision''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "468--469",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:58 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sale72",
  note =         "See \cite{Abdali:1970:AAS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4120 (Functional analysis); C7310 (Mathematics
                 computing)",
  corpsource =   "Univ. Sydney, NSW, Australia",
  keywords =     "approximation; function evaluation; harmonic series;
                 series summation; subroutines",
  oldlabel =     "Sale72",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sale72",
}

@Article{Einarsson:1972:RAC,
  author =       "Bo Einarsson",
  title =        "Remark on ``{Algorithm 418}: Calculation of {Fourier}
                 integrals''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "469--469",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Einarsson72a",
  note =         "See \cite{Einarsson:1972:AAC,Piessens:1974:RAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Res. Inst. Nat. Defense, Tumba, Sweden",
  keywords =     "approximation; coefficients; Filon integration; Filon
                 quadrature; Fourier; Fourier integrals; Fourier series;
                 integration; numerical methods; quadrature; Richardson
                 extrapolation; spline; splines (mathematics);
                 subroutines",
  oldlabel =     "Einarsson72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Einarsson72a",
}

@Article{Johnson:1972:RAI,
  author =       "Stephen C. Johnson and Brian W. Kernighan",
  title =        "Remark on ``{Algorithm 397}: An integer programming
                 problem''",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "469--469",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:52:58 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#JohnsonK72",
  note =         "See \cite{Chang:1970:AAI}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  keywords =     "acm; cacm; change making problem; integer programming;
                 subroutines",
  oldlabel =     "JohnsonK72",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JohnsonK72",
}

@Article{Kandel:1972:CSV,
  author =       "Abraham Kandel",
  title =        "Computer Science --- {A} Vicious Circle",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "470--471",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:53:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kandel72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "New Mexico Inst. Mining and Technol., Socorro, NM,
                 USA",
  keywords =     "computer engineering; computer personnel; computer
                 science curriculum; education; personnel; systems
                 design",
  oldlabel =     "Kandel72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kandel72",
}

@Article{Koffman:1972:IIG,
  author =       "Elliot B. Koffman",
  title =        "Individualizing instruction in a generative {CAI}
                 tutor",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "472--473",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:55:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Koffman72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training); C7810C
                 (Computer-aided instruction)",
  corpsource =   "Univ. Connecticut, Storrs, CT, USA",
  keywords =     "adaptive instruction; and sequential design;
                 combinational; computer aided instruction; computer
                 assisted instructions; education; generative CAI tutor;
                 machine language programming",
  oldlabel =     "Koffman72",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Koffman72",
}

@Article{Houstis:1972:AAP,
  author =       "E. N. Houstis and W. F. Mitchell and J. R. Rice",
  title =        "{ACM Algorithm 438}: Product Type Two-point
                 {Gauss--Legendre--Simpson}'s Integration",
  journal =      j-CACM,
  volume =       "15",
  number =       "6",
  pages =        "1071",
  month =        jun,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:34:02 1994",
  acknowledgement = ack-nhfb,
}

@Article{Revens:1972:FTF,
  author =       "Lee Revens",
  title =        "The first twenty-five years: {ACM} 1947--1962",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "485--490",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68-03",
  MRnumber =     "52 16081",
  bibdate =      "Mon Jan 22 07:15:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Revens72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Revens72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Revens72",
  xxtitle =      "The First Twenty-Five Years",
  xxtitle =      "The first twenty-five years {ACM} 1947--1962",
}

@Article{Weiss:1972:PCI,
  author =       "Eric A. Weiss",
  title =        "Publications in Computing: An Informal Review",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "491--497",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68-03",
  MRnumber =     "52 16083",
  bibdate =      "Mon Jan 22 07:29:05 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Weiss72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  keywords =     "digital computers; publications in computing; review",
  oldlabel =     "Weiss72",
  treatment =    "B Bibliography",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Weiss72",
}

@Article{Ralston:1972:NTY,
  author =       "Anthony Ralston",
  title =        "The Next Two Years ({ACM President}'s Letter)",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "499--500",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:45 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ralston72",
  acknowledgement = ack-nhfb,
  oldlabel =     "Ralston72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ralston72",
}

@Article{Ershov:1972:AHF,
  author =       "Andrei P. Ershov",
  title =        "Aesthetics and the Human Factor in Programming",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "501--505",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:38:08 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ershov72",
  note =         "See corrigendum \cite{Ershov:1972:CAH}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Novosibirsk Univ., USSR",
  keywords =     "aesthetics; human factor; human factors; programming",
  oldlabel =     "Ershov72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ershov72",
}

@Article{Probst:1972:ISI,
  author =       "G. G. Probst and Robert S. Oelman and Sam Wyly and C.
                 Lester Hogan and F. T. Cary and Gordon Bell and Donald
                 P. Kircher",
  title =        "As the Industry Sees It",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "506--517",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:02 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#ProbstOWHCBK72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  keywords =     "digital computers; future of computers; industry",
  oldlabel =     "ProbstOWHCBK72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ProbstOWHCBK72",
}

@Article{Arbib:1972:TAT,
  author =       "Michael A. Arbib",
  title =        "Toward an Automata Theory of Brains",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "521--527",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A25 (92A05)",
  MRnumber =     "53 7131",
  MRreviewer =   "Jill Humphries",
  bibdate =      "Mon Jan 22 06:21:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Arbib72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4220 (Automata theory)",
  corpsource =   "Univ. Massachusetts, Amherst, MA, USA",
  keywords =     "automata theory; brain models; brains",
  oldlabel =     "Arbib72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Arbib72",
}

@Article{Manna:1972:FPA,
  author =       "Zohar Manna and Jean Vuillemin",
  title =        "Fix Point Approach to the Theory of Computation",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "528--536",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05",
  MRnumber =     "55 13859",
  MRreviewer =   "Andrea Maggiolo-Schettini",
  bibdate =      "Mon Jan 22 07:01:29 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#MannaV72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  abstract =     "Following the fix point theory of Scott, the semantics
                 of computer programs are defined in terms of the least
                 fix points of recursive programs. This allows not only
                 the justification of all existing verification
                 techniques, but also their extension to the handling,
                 in a uniform manner of various properties of computer
                 programs, including correctness, termination, and
                 equivalence.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "computation; computational induction; computational
                 linguistics; correctness; equivalence; fixpoints;
                 least; least fix points; program diagnostics;
                 programming; recursive programs; semantics of computer
                 programs; semantics of programming languages;
                 termination; theory; verification techniques",
  oldlabel =     "MannaV72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MannaV72",
  xxtitle =      "Fixpoint Approach to the Theory of Computation",
}

@Article{Traub:1972:NMC,
  author =       "J. F. Traub",
  title =        "Numerical Mathematics and Computer Science",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "537--541",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65-03",
  MRnumber =     "54 4031",
  MRreviewer =   "R. H. Bartels",
  bibdate =      "Mon Jan 22 07:26:31 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Traub72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4100 (Numerical analysis)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "algorithms; computer science; foundations; numerical
                 mathematics; numerical methods; reviews; synthesis and
                 analysis",
  oldlabel =     "Traub72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Traub72",
}

@Article{Shanno:1972:MSV,
  author =       "David F. Shanno and Roman L. Weil",
  title =        "Management science: a view from nonlinear
                 programming",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "542--549",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "90C10 (90C30)",
  MRnumber =     "55 9970",
  bibdate =      "Mon Jan 22 07:20:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#ShannoW72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques)",
  corpsource =   "Univ. Toronto, Ont., Canada",
  keywords =     "integer; management science; mathematical programming;
                 nonlinear programming; reviews",
  oldlabel =     "ShannoW72",
  treatment =    "B Bibliography; G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ShannoW72",
}

@Article{Moses:1972:TGT,
  author =       "Joel Moses",
  title =        "Toward a General Theory of Special Functions",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "550--554",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "34-02 12H05",
  MRnumber =     "53 3384",
  MRreviewer =   "K. Okugawa",
  bibdate =      "Mon Jan 22 07:06:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Moses72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1100 (Mathematical techniques)",
  keywords =     "general theory; mathematics; special functions",
  oldlabel =     "Moses72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Moses72",
}

@Article{Foster:1972:VCA,
  author =       "Caxton C. Foster",
  title =        "A View of Computer Architecture",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "557--565",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:40:14 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Foster72",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture)",
  corpsource =   "Univ. Massachusetts, Amherst, MA, USA",
  keywords =     "computer architecture; microcomputers; predict;
                 reviews",
  oldlabel =     "Foster72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Foster72",
}

@Article{Fraser:1972:IBC,
  author =       "A. G. Fraser",
  title =        "On the interface between computers and data
                 communications systems",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "566--573",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:41:35 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Fraser72",
  abstract =     "Reproduced in Advances in Computer Commun., Chu,W.W
                 (Ed.), (1974), 246-253.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5610 (Computer interfaces)",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  keywords =     "computer interfaces; computers; data communication
                 systems; data communications; interface; specifying",
  oldlabel =     "Fraser72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fraser72",
}

@Article{BrinchHansen:1972:SM,
  author =       "Per {Brinch Hansen}",
  title =        "Structured Multiprogramming",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "574--578",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:15 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib
                 and ftp://ftp.ira.uka.de/pub/bibliography/Os/os.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Hansen72",
  acknowledgement = ack-nhfb,
  annote =       "This paper presents a proposal for structured
                 representation of multiprogramming in a high level
                 language. Shared variables are introduced, and their
                 role in `critical regions (denoted by the structured
                 statement region var do Statement)' is discussed. A
                 synchronization primitive `await Boolean' delays a
                 process until the components of a shared variable
                 satisfy the boolean expression. For explicit control of
                 the scheduling of resources, an event queue is
                 associated with a shared variable, and two procedures
                 await (event) (leave a critical region associated with
                 the shared variable and join the event queue) and cause
                 (event) (enable all processes in the event queue to
                 reenter their critical regions) are provided, which can
                 control process scheduling to any degree desired.",
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "California Inst. Technol., Pasadena, CA, USA",
  keywords =     "concurrency; critical regions; event variables; high
                 level; language; multiprogramming; operating systems;
                 structured multiprogramming",
  oldlabel =     "Hansen72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hansen72",
}

@Article{Lynch:1972:OSP,
  author =       "William C. Lynch",
  title =        "Operating System Performance",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "579--585",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:26 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Lynch72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Case Western Res. Univ., Cleveland, OH, USA",
  keywords =     "computer; model; operating system performance;
                 operating systems (computers); reviews; systems; total
                 system",
  oldlabel =     "Lynch72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lynch72",
}

@Article{Kimbleton:1972:RCS,
  author =       "Stephen R. Kimbleton",
  title =        "The role of computer system models in performance
                 evaluation",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "586--590",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:54:48 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kimbleton72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0310 (EDP management); C1220 (Simulation, modelling
                 and identification); C6150J (Operating systems)",
  corpsource =   "UNIV. Michigan, Ann Arbor, MI, USA",
  keywords =     "computer selection and evaluation; computer system
                 models; evaluation; modelling; operating; operating
                 systems; performance; systems (computers)",
  oldlabel =     "Kimbleton72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kimbleton72",
}

@Article{Rosen:1972:PSL,
  author =       "Saul Rosen",
  title =        "Programming Systems and Languages (1965--1975)",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "591--600",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:00 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Rosen72",
  abstract =     "In spite of impressive gains by PL/I, Fortran and
                 Cobol remain the languages in which most of the world's
                 production programs are written and will remain so into
                 the foreseeable future. There is a great deal of
                 theoretical interest in Algol 68 and in extensible
                 languages, but so far at least they have had little
                 practical impact. Problem-oriented languages may very
                 well become the most important language development
                 area in the next five to ten years.\par

                 In the operating system area all major computer
                 manufacturers set out to produce very ambitious
                 multiprogramming systems, and they all ran into similar
                 problems. A number of university projects,though not
                 directly comparable to those of the manufacturers, have
                 contributed greatly to a better understanding of
                 operating system principles. Important trends include
                 the increased interest in the development of system
                 measurement and evaluation techniques,and increased use
                 of microprogramming for some programming system
                 functions.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140 (Programming languages); C6150J (Operating
                 systems)",
  corpsource =   "Purdue Univ., Lafayette, IN, USA",
  keywords =     "history; languages; microprogramming;
                 multiprogramming; operating system; operating systems;
                 operating systems (computers); problem oriented
                 languages; programming; programming systems; reviews",
  oldlabel =     "Rosen72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rosen72",
}

@Article{Sammet:1972:PLH,
  author =       "Jean E. Sammet",
  title =        "Programming Languages: History and Future",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "601--610",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:18:22 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sammet72",
  abstract =     "This paper discusses both the history and future of
                 programming languages (= higher level languages).
                 \par

                 Some of the difficulties in writing such a history are
                 indicated. A key part of the paper is a tree showing
                 the chronological development of languages and their
                 interrelationships. Reasons for the proliferation of
                 languages are given. The major languages are listed
                 with the reasons for their importance. A section on
                 chronology indicates the happenings of the significant
                 previous time periods and the major topics of 1972. Key
                 concepts other than specific languages are discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140 (Programming languages)",
  corpsource =   "IBM Corp., Cambridge, MA, USA",
  keywords =     "chronological; development; future; future directions;
                 higher level languages; history; language
                 interrelationships; languages; programming language
                 future; programming language history; programming
                 language tree; programming languages; reviews",
  oldlabel =     "Sammet72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sammet72",
}

@Article{Fosdick:1972:PBM,
  author =       "Lloyd D. Fosdick",
  title =        "The Production of Better Mathematical Software",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "611--617",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:40:13 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Fosdick72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Univ. Colorado, Boulder, CO, USA",
  keywords =     "computer software; mathematical software; mathematics;
                 production; programming",
  oldlabel =     "Fosdick72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fosdick72",
}

@Article{Bobrow:1972:RAP,
  author =       "Daniel G. Bobrow",
  title =        "Requirements for Advanced Programming Systems for List
                 Processing",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "618--627",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:02 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bobrow72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Xerox, Palo Alto, CA, USA",
  keywords =     "advanced programming systems; list processing;
                 requirements",
  oldlabel =     "Bobrow72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bobrow72",
}

@Article{Bachman:1972:ESS,
  author =       "Charles W. Bachman",
  title =        "The Evolution of Storage Structures",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "628--634",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:30 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bachman72",
  acknowledgement = ack-nhfb,
  annote =       "Good overview of basic definitions and their
                 relationships",
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Honeywell Information Systems, Billerica, MA, USA",
  keywords =     "data base management systems; Data Structure Diagram
                 graphic technique; data structures; evolution; storage
                 management; storage structures",
  oldlabel =     "Bachman72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bachman72",
}

@Article{Rice:1972:PFS,
  author =       "John R. Rice",
  title =        "On the Present and Future of Scientific Computation",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "637--639",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:53 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Rice72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and chemistry computing); C7490
                 (Computing in other engineering fields)",
  corpsource =   "Purdue Univ., Lafayette, IN, USA",
  keywords =     "engineering applications of computers; future; natural
                 sciences; physical sciences; physics; present;
                 scientific computation",
  oldlabel =     "Rice72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rice72",
}

@Article{Benjamin:1972:GPI,
  author =       "Robert I. Benjamin",
  title =        "A generational perspective of information system
                 development",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "640--643",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:50 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Benjamin72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7100 (Business and administration)",
  corpsource =   "Xerox Corp., Rochester, NY, USA",
  keywords =     "computing milieu; generational perspective;
                 information system development; management data
                 processing; management information systems",
  oldlabel =     "Benjamin72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Benjamin72",
}

@Article{Sedelow:1972:LAH,
  author =       "Sally Yeates Sedelow",
  title =        "Language Analysis in the Humanities",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "644--647",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:20:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sedelow72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Univ. Kansas, Lawrence, KS, USA",
  keywords =     "concordances; humanities; indices; language analysis;
                 language translation and linguistics; pattern
                 generation; pattern recognition",
  oldlabel =     "Sedelow72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sedelow72",
}

@Article{Zinn:1972:CIP,
  author =       "Karl L. Zinn",
  title =        "Computers in the instructional process: directions for
                 research and development",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "648--651",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:31:44 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Zinn72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7810C (Computer-aided instruction)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  keywords =     "computer aided instruction; computers; development;
                 directions; education; instructional process; research
                 and",
  oldlabel =     "Zinn72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Zinn72",
}

@Article{Sturman:1972:CUS,
  author =       "Gerald M. Sturman",
  title =        "Computers and Urban Society",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "652--657",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:52 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sturman72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7000 (Computer applications); C7130 (Public
                 administration)",
  corpsource =   "Parsons Brinckerhoff Quade and Douglas Inc., NY, USA",
  keywords =     "administrative data processing; brief survey;
                 computers; engineering analysis; engineering
                 applications of computers; government; information
                 systems; sciences; social and behavioural; urban
                 society; urban systems",
  oldlabel =     "Sturman72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sturman72",
}

@Article{Salton:1972:DDP,
  author =       "Gerard Salton",
  title =        "Dynamic Document Processing",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "658--668",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:18:02 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Salton72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7250 (Information storage and retrieval)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "automatic; automatic indexing; automatic search and;
                 clustered files; collection growth; dynamic document;
                 indexing; information; information retrieval;
                 interactive user controlled search process; iterative
                 searching; library automation; library mechanisation;
                 processing; query modification; retrieval",
  oldlabel =     "Salton72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Salton72",
}

@Article{Knuth:1972:ABA,
  author =       "Donald E. Knuth",
  title =        "Ancient {Babylonian} algorithms",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "671--677",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRnumber =     "52 13132",
  bibdate =      "Mon Jan 22 06:55:24 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Knuth72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery. See errata
                 \cite{Knuth:1976:EAB}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1100 (Mathematical techniques)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "ancient Babylonian algorithms; Babylonian; computer
                 science; history of computation; mathematics; origins
                 of mathematics; sexagesimal number system; tablets",
  oldlabel =     "Knuth72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knuth72",
}

@Article{Bauer:1972:PKZ,
  author =       "Friedrich L. Bauer and H. W{\"o}ssner",
  title =        "The {``Plankalk{\"u}l''} of {Konrad Zuse}: a
                 forerunner of today's programming languages.",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "678--685",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05 (68-03)",
  MRnumber =     "52 16093",
  bibdate =      "Mon Jan 22 06:23:57 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BauerW72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140 (Programming languages)",
  corpsource =   "Tech. Univ. M{\"u}nchen, West Germany",
  keywords =     "history of; Konrad Zuse; languages; notational and
                 conceptual system; Plankalkul; programming; programming
                 languages; programming theory",
  oldlabel =     "BauerW72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BauerW72",
  xxpages =      "679--685",
}

@Article{Sprague:1972:WVC,
  author =       "Richard E. Sprague",
  title =        "A {Western} View of Computer History",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "686--692",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68-03",
  MRnumber =     "52 16082",
  bibdate =      "Mon Jan 22 07:23:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sprague72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  corpsource =   "Litton ARS, Morristown, NJ, USA",
  keywords =     "1945 to 1955; computer history; digital computers",
  oldlabel =     "Sprague72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sprague72",
}

@Article{Alt:1972:ACR,
  author =       "Franz L. Alt",
  title =        "Archaeology of computers --- reminiscences,
                 1945--1947",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "693--694",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68-03",
  MRnumber =     "52 16079",
  bibdate =      "Mon Jan 22 06:21:11 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Alt72",
  note =         "Twenty-fifth anniversary of the Association for
                 Computing Machinery",
  acknowledgement = ack-nhfb,
  classcodes =   "C5420 (Mainframes and minicomputers)",
  corpsource =   "American Inst. Phys., NY, USA",
  keywords =     "1945 to 1947; digital computers; ENIAC; history of
                 computers; reminiscences; special purpose computers",
  oldlabel =     "Alt72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Alt72",
}

@Article{Borodin:1972:CE,
  author =       "Allan Borodin and C. C. Gotlieb",
  title =        "Computers and Employment",
  journal =      j-CACM,
  volume =       "15",
  number =       "7",
  pages =        "695--702",
  month =        jul,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BorodinG72",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics)",
  corpsource =   "Univ. Toronto, Ont., Canada",
  keywords =     "computers; economic and sociological effects;
                 employment; social implications; unemployment",
  oldlabel =     "BorodinG72",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BorodinG72",
}

@Article{Herriot:1972:MGF,
  author =       "John G. Herriot",
  title =        "In Memory of {George E. Forsythe}",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "719--720",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "01A70",
  MRnumber =     "52 7801",
  bibdate =      "Mon Jan 22 06:49:40 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Herrit72",
  note =         "Collection of articles in honor of {George E.
                 Forsythe} ({ACM} Student Competition Award Papers).",
  acknowledgement = ack-nhfb,
  oldlabel =     "Herrit72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Herrit72",
  xxauthor =     "John G. Herrit",
}

@Article{Knuth:1972:GFD,
  author =       "Donald E. Knuth",
  title =        "{George Forsythe} and the development of Computer
                 Science",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "721--726",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "01A70 (68-03)",
  MRnumber =     "52 7802",
  bibdate =      "Mon Jan 22 06:55:25 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Knuth72a",
  note =         "Collection of articles in honor of {George E.
                 Forsythe} ({ACM} Student Competition Award Papers).",
  acknowledgement = ack-nhfb,
  oldlabel =     "Knuth72a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knuth72a",
}

@Article{Crowe:1972:GPA,
  author =       "David Crowe",
  title =        "Generating Parsers for Affix Grammars",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "728--734",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "53 4635",
  MRreviewer =   "Ole Lehrmann Madsen",
  bibdate =      "Mon Jan 22 06:34:07 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Crowe72",
  note =         "Collection of articles in honor of {George E. Forsythe
                 (ACM Student Competition Award Papers)}.",
  abstract =     "Koster, the inventor of affix grammars, suggests a
                 top-down scheme for parsing them, based on recursive
                 procedures. This paper presents a bottom-up scheme for
                 parsing them, based on an extension of Floyd Production
                 Language (FPL). Included is an algorithm, similar to
                 that of DeRemer's, for covering a large class of affix
                 grammars into FPL. The paper discusses the
                 applicabilities of the conversion algorithm and affix
                 grammars in general, and some possible extensions to
                 Koster's definition of affix grammars.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  classification = "721; 723",
  corpsource =   "Univ. British Columbia, Vancouver, BC, Canada",
  journalabr =   "Commun ACM",
  keywords =     "affix grammars; algorithmic language processing;
                 algorithmic languages; automata theory --- Grammars;
                 bottom up; computer metatheory; grammars; parsers;
                 syntax directed compiling; translator writing systems;
                 two level grammars",
  oldlabel =     "Crowe72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Crowe72",
}

@Article{Helbig:1972:PRC,
  author =       "Robert E. Helbig and Patrick K. Orr and Robert R.
                 Roediger",
  title =        "Political Redistricting by Computer",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "735--741",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:25 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HelbigOR72",
  abstract =     "Criteria for acceptable redistricting are discussed,
                 including population equality, compactness, contiguity,
                 and preservation of natural and\slash or political
                 boundaries. Only nonpartisan criteria are considered.
                 Using 1970 Bureau of Census population data, specific
                 results are given for the ten Congressional Districts
                 in the state of Missouri and for the seven St. Louis
                 county Council seats. Results from the use of the
                 algorithm indicate the feasibility of political
                 redistricting with the aid of a computer.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7810 (Social and behavioural sciences computing)",
  classification = "723",
  corpsource =   "Washington Univ., St. Louis, MO, USA",
  journalabr =   "Commun ACM",
  keywords =     "algorithm; compactness; computer; contiguity; data
                 processing, business; equal population; legislative
                 districts; political redistricting; reapportionment;
                 social and behavioural sciences; transportation",
  oldlabel =     "HelbigOR72",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HelbigOR72",
}

@Article{Benjamin:1972:EES,
  author =       "Arthur J. Benjamin",
  title =        "Extensible Editor for a Small Machine with Disk
                 Storage",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "742--747",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:50 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Benjamin72a",
  abstract =     "A design philosophy for developing a sophisticated
                 utility program is illustrated by the actual design and
                 implementation of a text editor. A versatile data
                 structure is employed so that only a small number of
                 programmed subroutines are necessary for all types of
                 data manipulation. Such a data structure is described,
                 and its merits are illustrated by the ease with which
                 powerful extensions can be implemented in terms of a
                 few basic editing functions.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6130 (Data handling
                 techniques); C6150E (General utility programs)",
  classification = "723",
  corpsource =   "Brandeis Univ., Waltham, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "collection; command; computer programming --- Macros;
                 computer systems programming --- Supervisory and
                 Executive Programs; context searching; data processing;
                 data storage, magnetic --- Disk Storage; data
                 structures; design; disc storage; executive program;
                 extensible editor; garbage; interpreter; list
                 processing; macro language; paging; parameter
                 substitution; philosophy; processing; programs;
                 recursion; small machine; state table; storage
                 allocation; string manipulation; text editing; text
                 editor; utility; utility program; virtual memory",
  oldlabel =     "Benjamin72a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Benjamin72a",
}

@Article{Rosin:1972:ERM,
  author =       "Robert F. Rosin and Gideon Frieder and Richard H.
                 {Eckhouse, Jr.}",
  title =        "Environment for Research in Microprogramming and
                 Emulation",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "748--760",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:15 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#RosinFE72",
  abstract =     "The development of the research project in
                 microprogramming and emulation at State University of
                 New York at Buffalo consisted of three phases: the
                 evaluation of various possible machines to support this
                 research; the decision to purchase one such machine,
                 which appears to be superior to the others considered;
                 and the organization and definition of goals for each
                 group in the project. Each of these phases is reported,
                 with emphasis placed on the early results achieved in
                 this research.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture); C7430 (Computer
                 engineering)",
  classification = "722; 723",
  corpsource =   "State Univ. New York, Buffalo, NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer architecture; computer systems; computer
                 systems, digital; emulation; engineering applications
                 of computers; environment for research; hardware
                 evaluation; language processors; management;
                 microprogramming; nanoprogram; project; simulation",
  oldlabel =     "RosinFE72",
  treatment =    "X Experimental",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RosinFE72",
}

@Article{Oden:1972:MMC,
  author =       "P. H. Oden and Gerald S. Shedler",
  title =        "A Model of Memory Contention in a Paging Machine",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "761--771",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A50",
  MRnumber =     "55 13903",
  bibdate =      "Mon Jan 22 07:10:28 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#OdenS72",
  note =         "Collection of articles in honor of {George E.
                 Forsythe} ({ACM} Student Competition Award Papers).",
  abstract =     "In the model presented, the number of page-frames of
                 main memory allocated to a problem program varies in
                 time. These changes in memory configuration are
                 represented explicitly in the model, CPU requirements
                 and page exception characteristics of program material
                 being described statistically. Expressions for the
                 distribution of the number of page-frames allocated to
                 an executing program, the long run expected fraction of
                 a program's execution time in a given number of
                 page-frames, and the average execution interval of the
                 multiprogrammed load are obtained. It is pointed out
                 heuristically and demonstrated numerically that an
                 increase is obtainable in the average execution
                 interval of the multiprogrammed load over that
                 resulting from equal fixed partitioning of main
                 memory.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer operating systems; demand paging; file
                 organisation; management; memory; memory contention;
                 modelling; multiprogrammed; operating; paging machines;
                 probability --- Queueing Theory; queuing analysis;
                 storage; storage allocation; systems studies",
  oldlabel =     "OdenS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/OdenS72",
}

@Article{Bernstein:1972:CFM,
  author =       "H. J. Bernstein and H. T. Gladwin",
  title =        "Compiling fixed-point multiplications",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "772--772",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Brookhaven Nat. Lab., Upton, NY, USA",
  keywords =     "compiling multiplications; digital arithmetic; fixed
                 point arithmetic; programming",
  treatment =    "P Practical",
}

@Article{vanderPoel:1972:CCS,
  author =       "W. L. {van der Poel}",
  title =        "Comment on the composition of semantics in {Algol
                 68}",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "772--772",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:12:51 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Poel72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. Technol. Delft, Netherlands",
  keywords =     "ALGOL; ALGOL 68; composition of semantics; data;
                 design; programming languages; programming primitives;
                 recursive composition; structures",
  oldlabel =     "Poel72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Poel72",
}

@Article{Bernstein:1972:CFP,
  author =       "Herbert J. Bernstein",
  title =        "Compiling Fixed-Point Multiplications",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "772--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:25:57 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bernstein72",
  acknowledgement = ack-nhfb,
  oldlabel =     "Bernstein72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bernstein72",
}

@Article{Morris:1972:BVW,
  author =       "James H. {Morris, Jr.}",
  title =        "A Bonus from {van Wijngaarden}'s Device",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "773--773",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:06:03 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Morris72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  keywords =     "ALGOL; ALGOL 60 programs; eliminate all labels;
                 nonlocal transfers; procedure returns",
  oldlabel =     "Morris72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morris72",
}

@Article{Jones:1972:CAB,
  author =       "Peter R. Jones",
  title =        "Comment on Average Binary Search Length",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "774--774",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:53:03 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Jones72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  keywords =     "binary searching; data handling; record retrieval;
                 search length",
  oldlabel =     "Jones72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Jones72",
}

@Article{Read:1972:NGR,
  author =       "Ronald C. Read and K. Harada",
  title =        "A Note on the Generation of Rosary Permutations. With
                 a Response by {K. Harada}",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "775--775",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A10",
  MRnumber =     "53 9706",
  MRreviewer =   "Dennis White",
  bibdate =      "Mon Jan 22 07:15:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Read72",
  note =         "Collection of articles in honor of {George E.
                 Forsythe} ({ACM} Student Competition Award Papers).",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Univ. Waterloo, Ont., Canada",
  keywords =     "associating an integer; combinatorial mathematics;
                 generation; rosary permutations",
  oldlabel =     "Read72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Read72",
}

@Article{Squire:1972:AAL,
  author =       "W. Squire",
  title =        "{ACM Algorithm 429}: Localization of the Roots of a
                 Polynomial [{C2}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "776--777",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:23:45 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Squire72",
  note =         "See \cite{Williams:1973:RAL,Driessen:1973:RAL}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Squire72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Squire72",
}

@Article{Purdom:1972:AAI,
  author =       "Paul Walton {Purdom, Jr.} and Edward F. Moore",
  title =        "{ACM Algorithm 430}: Immediate Predominators in a
                 Directed Graph [{H}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "8",
  pages =        "777--778",
  month =        aug,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:11 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#PurdomM72",
  acknowledgement = ack-nhfb,
  oldlabel =     "PurdomM72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/PurdomM72",
}

@Article{Levitt:1972:CAS,
  author =       "Karl N. Levitt and William H. Kautz",
  title =        "Cellular Arrays for the Solution of Graph Problems",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "789--801",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:58:39 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#LevittK72",
  abstract =     "Several parallelized algorithms are presented for the
                 solution of certain spanning tree, distance, and path
                 problems, with direct applications to wire routing,
                 PERT chart analysis, and the analysis of many types of
                 networks. These algorithms exhibit a computation time
                 that in many cases grows at a rate not exceeding log//2
                 n, where n is the number of nodes in the graph.
                 Straightforward cellular implementations of the
                 well-known serial algorithms for these problems require
                 about n steps, and noncellular implementations require
                 from n**2 to n**3 steps.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5420 (Mainframes and minicomputers); C7310
                 (Mathematics computing)",
  classification = "722; 723",
  corpsource =   "Stanford Res. Inst., Menlo Park, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "cellular arrays; data storage, digital; graph
                 problems; graph theory; mathematical techniques ---
                 Graph Theory; special purpose computers",
  oldlabel =     "LevittK72",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LevittK72",
}

@Article{Ghosh:1972:FOC,
  author =       "Sakti P. Ghosh",
  title =        "File Organization --- The Consecutive Retrieval
                 Property",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "802--808",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:55 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ghosh72",
  abstract =     "Some important theorems on the consecutive retrieval
                 property are proved. Conditions under which the
                 consecutive retrieval property exists and remain
                 invariant have been established. An outline for
                 designing an information retrieval system based on the
                 consecutive retrieval property is discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "721; 723",
  corpsource =   "IBM, San Jose, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "consecutive; consecutive retrieval; data processing;
                 file organisation; file organization; information
                 retrieval; information retrieval system; information
                 retrieval systems; minimum access; query structure;
                 record; storage; storage on tapes; storage space;
                 structure; time",
  oldlabel =     "Ghosh72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ghosh72",
}

@Article{Mor:1972:NAA,
  author =       "Moshe Mor and T. Lamdan",
  title =        "A New Approach to Automatic Scanning of Contour Maps",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "809--812",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:52 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#MorL72",
  abstract =     "The structure of a general contour map is analyzed,
                 and its topological properties are utilized in
                 developing a new scanning algorithm. The problem of
                 detection and recognition of contour lines is solved by
                 a two color labeling method. It is shown that for maps
                 containing normal contour lines only, it suffices to
                 distinguish between so-called ``even'' and ``odd''
                 lines. The ``tangency problem'' involved in practical
                 scanning is discussed, and a solution base on
                 minimizing computer memory space and simplifying
                 control program is suggested.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7890 (Other special
                 applications of computing)",
  classification = "723",
  corpsource =   "Israeli Min. Defense, Tel-Aviv, Israel",
  journalabr =   "Commun ACM",
  keywords =     "automatic scanning; cartography; computer graphics;
                 contour maps; data handling; digitizing; image
                 processing; topology",
  oldlabel =     "MorL72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MorL72",
}

@Article{Richman:1972:AEA,
  author =       "Paul L. Richman",
  title =        "Automatic Error Analysis for Determining Precision",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "813--817",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65G05",
  MRnumber =     "47 2808",
  bibdate =      "Mon Jan 22 07:15:56 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Richman72",
  abstract =     "The problem considered is that of evaluating a
                 rational expression to within any desired tolerance on
                 a computer which performs variable-precision
                 floating-point arithmetic operations. An automatic
                 error analysis technique is given for determining,
                 directly from the results of a trial low-precision
                 interval arithmetic calculation, just how much
                 precision and data accuracy are required to achieve a
                 desired final accuracy. The technique given generalize
                 easily to the evaluation of many nonrational
                 expressions.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290B (Error analysis in numerical methods); C4110
                 (Error analysis in numerical methods); C5230 (Digital
                 arithmetic methods)",
  classification = "921",
  corpsource =   "Bell Telephone Labs. Inc., Denver, CO, USA",
  journalabr =   "Commun ACM",
  keywords =     "automatic error analysis; control; digital arithmetic;
                 error analysis; floating point arithmetic; interval
                 arithmetic; mathematical techniques; precision;
                 precision control",
  oldlabel =     "Richman72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Richman72",
}

@Article{Ravindran:1972:AAC,
  author =       "Arunachalam Ravindran",
  title =        "{ACM Algorithm 431}: {A} Computer Routine for
                 Quadratic and Linear Programming Problems [{H}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "818--820",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:08 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ravindran72",
  note =         "See remark \cite{Ravindran:1974:RAC,Proll:1974:RAC}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Ravindran72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ravindran72",
}

@Article{Bartels:1972:AAS,
  author =       "Richard H. Bartels and G. W. Stewart",
  title =        "{ACM Algorithm 432}: Solution of the Matrix Equation
                 {\boldmath {$AX+XB=C$}} [{F4}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "820--826",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:23:37 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.lin.alg.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BartelsS72",
  acknowledgement = ack-nhfb,
  keywords =     "linear algebra; linear equations; matrices",
  kwds =         "nla, Schur form, Sylvester equation, Lyapunov
                 equation, matrix equation",
  oldlabel =     "BartelsS72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BartelsS72",
}

@Article{Deutsch:1972:TAR,
  author =       "Edward S. Deutsch",
  title =        "Thinning Algorithms on Rectangular, Hexagonal, and
                 Triangular Arrays",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "827--837",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:35:45 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Deutsch72",
  abstract =     "Three thinning algorithms are developed: one each for
                 use with rectangular, hexagonal, and triangular arrays.
                 The approach to the development of each algorithm is
                 the same. Pictorial results produced by each of the
                 algorithms are presented and the relative performances
                 of the algorithms are compared. It is found that the
                 algorithm operating with the triangular array is the
                 most sensitive to image irregularities and noise, yet
                 it will yield a thinned image with an overall reduced
                 number of points. It is concluded that the algorithm
                 operating in conjunction with the hexagonal array has
                 features which strike a balance between those of the
                 other two arrays.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  classification = "723",
  corpsource =   "Univ. Maryland, College Park, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "accurate floating-point summation; comparison; digital
                 arithmetic; error; error propagation; floating point
                 summation methods; truncation",
  oldlabel =     "Deutsch72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Deutsch72",
}

@Article{Gregory:1972:CFP,
  author =       "James Gregory",
  title =        "A Comparison of Floating Point Summation Methods",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "838--838",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:46:23 MST 2001",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip and
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Gregory72",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  descriptors =  "Simulation; statistics; numeric calculation;",
  keywords =     "comparison; digital arithmetic; error; error
                 propagation; floating point summation methods;
                 truncation",
  oldlabel =     "Gregory72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gregory72",
}

@Article{Khalil:1972:EBT,
  author =       "Hatem M. Khalil",
  title =        "The Eigenproblem of Block Tridiagonal Matrices",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "839--839",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "839.65F15",
  MRnumber =     "47 2802",
  bibdate =      "Mon Jan 22 06:54:38 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Khalil72",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra)",
  corpsource =   "Univ. Delaware, Newark, DE, USA",
  keywords =     "block tridiagonal matrices; eigenvalues; eigenvalues
                 and eigenfunctions; eigenvalues and eigenvectors;
                 eigenvectors; linear algebra; matrix algebra; partial
                 differential equations",
  oldlabel =     "Khalil72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Khalil72",
}

@Article{Parnas:1972:CDP,
  author =       "David Lorge Parnas and A. Nico Habermann and R. C.
                 Holt",
  title =        "Comment on Deadlock Prevention Method",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "840--841",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:11:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#ParnasH72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "deadlock; deadlock prevention method; deadly embrace;
                 interlock; knotting; lockout; multiprogramming;
                 resource allocation; scheduling; time sharing;
                 time-sharing; time-sharing systems",
  oldlabel =     "ParnasH72",
  treatment =    "G General Review; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ParnasH72",
  xxauthor =     "David Lorge Parnas and A. Nico Habermann",
  xxauthor =     "D. L. Parnas and A. N. Habermann and R. C. Holt",
}

@Article{Rubinstein:1972:CBT,
  author =       "Richard Rubinstein and Julian Feldman",
  title =        "A controller for a {Braille} terminal",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "841--842",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#RubinsteinF72",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays); C5610
                 (Computer interfaces)",
  corpsource =   "Univ. California, Irvine, CA, USA",
  keywords =     "blind programming aid; braille; computer interfaces;
                 computer peripheral equipment; computer terminal;
                 controller; tactile terminal; terminal",
  oldlabel =     "RubinsteinF72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RubinsteinF72",
}

@Article{Tan:1972:FIS,
  author =       "K. C. Tan",
  title =        "On {Foster}'s Information Storage and Retrieval Using
                 {AVL} Trees",
  journal =      j-CACM,
  volume =       "15",
  number =       "9",
  pages =        "843--843",
  month =        sep,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:25:30 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Tan72",
  note =         "See C. C. Foster, Proc. ACM 20th National Conference,
                 pp. 192--205 (1965).",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Northwestern Univ., Evanston, IL, USA",
  keywords =     "(mathematical); AVL trees; binary trees; file
                 organisation; information retrieval; information
                 storage; search trees; trees",
  oldlabel =     "Tan72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Tan72",
}

@Article{Dijkstra:1972:HP,
  author =       "Edsger W. Dijkstra",
  title =        "The Humble Programmer",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "859--866",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  DOI =          "http://doi.acm.org/10.1145/355604.361591",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:36:07 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Dijkstra72",
  abstract =     "We shall do a much better programming job, provided
                 that we approach the task with a full appreciation if
                 its tremendous difficulty, provided that we stick to
                 modest and elegant programming languages, provided that
                 we respect the intrinsic limitations of the human mind
                 and approach the task as Very Humble Programmers.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Dijkstra72",
  remark =       "This is the 1972 ACM Turing Award Lecture. John
                 McCarthy's 1971 ACM Turing Award lecture was not
                 published until 1987.",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dijkstra72",
}

@Article{Morris:1972:DPT,
  author =       "James B. Morris",
  title =        "Demand Paging Through Utilization of Working Sets on
                 the {Maniac II}",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "867--872",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:06:05 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Morris72a",
  abstract =     "A hardware implementation on the Maniac II computer of
                 the working set model for demand paging, as introduced
                 by Denning, is discussed. characteristics of the Maniac
                 II are given, along with a description of the basic
                 demand paging scheme and the associative memory which
                 has been added to the Maniac II hardware. A description
                 of the hardware design for implementation of the
                 working set model is discussed and a specification of
                 the actions taken under various conditions which may
                 arise during the operation of the full working set
                 model, demand paging system is given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture); C6120 (File
                 organisation)",
  classification = "723",
  corpsource =   "Univ. California, Los Alamos, NM, USA",
  journalabr =   "Commun ACM",
  keywords =     "associative memory; associative storage; computer
                 architecture; computer operating systems; data storage,
                 digital; demand paging; dynamic storage allocation;
                 file; hardware implementation; MANIAC II; model;
                 organisation; storage allocation; storage management;
                 utilization of working sets; virtual memory; working
                 set",
  oldlabel =     "Morris72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morris72a",
}

@Article{Ahrens:1972:CMS,
  author =       "Joachim H. Ahrens and Ulrich Dieter",
  title =        "Computer Methods for Sampling from the Exponential and
                 Normal Distributions",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "873--882",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65C10",
  MRnumber =     "49 1728",
  MRreviewer =   "V. Dupac",
  bibdate =      "Mon Jan 22 06:20:51 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#AhrensD72",
  abstract =     "Various methods are known for transforming uniformly
                 distributed random numbers into exponentially and
                 normally distributed quantities. The most efficient
                 ones are compared, in terms of memory requirements and
                 speed, with some new algorithms. A number of procedures
                 convert Taylor series expansions directly into sampling
                 steps, an approach which may be used for sampling from
                 any continuous distribution. For the exponential
                 distribution a definite recommendation can be made,
                 whereas in the case of the normal distribution there
                 remains a choice between slower and shorter algorithms
                 and faster but space consuming methods.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "913; 922",
  corpsource =   "Nova Scotia Tech. Coll., Halifax, NS, Canada",
  country =      "USA",
  descriptors =  "RVG;",
  enum =         "6926",
  journalabr =   "Commun ACM",
  keywords =     "computer aided sampling; computer methods; distributed
                 random numbers; distributions; exponential; normal
                 distributions; random number generation; sampled data
                 systems; sampling; sampling steps; uniformly",
  language =     "English",
  oldlabel =     "AhrensD72",
  references =   "0",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AhrensD72",
}

@Article{Hanson:1972:IEI,
  author =       "Richard J. Hanson",
  title =        "Integral Equations of Immunology",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "883--890",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65R05",
  MRnumber =     "48 10166",
  MRreviewer =   "S. Malon",
  bibdate =      "Mon Jan 22 06:48:23 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Hanson72",
  abstract =     "The inversion of a particular integral equation of the
                 first (Fredholm) kind is the basic problem considered.
                 The strategy which yielded success consisted of three
                 essential points: (1) fit the known experimental data
                 by a curve with properties which derive from properties
                 of the (as yet unknown) function; (2) stabilize the
                 computation for the unknown function by using singular
                 value decomposition; (3) constrain the unknown function
                 approximation (since it represents a probability
                 distribution) to be nonnegative. \par

                 A number of test cases are presented. One set of actual
                 experimental data is analyzed with the procedures
                 presented.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290R (Integral equations); C4180 (Integral
                 equations)",
  classification = "461; 921",
  corpsource =   "California Inst. Technol., Pasadena, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "biomedical engineering; curve fitting; decomposition;
                 experimental data; first kind; immunology; integral
                 equation of; integral equations; integral equations of
                 the first kind; inversion; mathematical techniques;
                 medicine; nonnegative constraints; numerical methods;
                 singular value; singular value analysis",
  oldlabel =     "Hanson72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hanson72",
}

@Article{Simmons:1972:GED,
  author =       "Robert F. Simmons and Jonathan Slocum",
  title =        "Generating {English} Discourse from Semantic
                 Networks",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "891--905",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:21:47 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#SimmonsS72",
  abstract =     "A system is described for generating English sentences
                 from a form of semantic nets in which the nodes are
                 word-sense meanings and the paths are primarily deep
                 case relations. The grammar used by the system is in
                 the form of a network that imposes an ordering on a set
                 of syntactic transformations that are expressed as LISP
                 functions. The generation algorithm uses the
                 information in the semantic network to select
                 appropriate generation paths through the grammar. The
                 system is designed for use as a computational tool that
                 allows a linguist to develop and study methods for
                 generating surface strings from an underlying semantic
                 structure. Initial findings with regard to form
                 determiners such as voice, form, tense, and mood, some
                 rules for embedding sentences, and some attention to
                 pronominal substitution are reported. The system is
                 programmed in LISP 1.5 and is available from the
                 authors.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  classification = "721; 723; 901",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "automata theory; computer applications; computer
                 programming languages --- lisp; data processing ---
                 Humanities Applications; deep case relations; English
                 sentence generation; information science --- Language
                 Translation and Linguistics; language translation and
                 linguistics; LISP functions; semantic generation;
                 semantic networks",
  oldlabel =     "SimmonsS72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SimmonsS72",
  xxauthor =     "Reid G. Simmons and Jonathan Slocum",
}

@Article{Dathe:1972:CDT,
  author =       "Gert Dathe",
  title =        "Conversion of Decision Tables by Rule Mask Method
                 without Rule Mask",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "906--909",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:34:36 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Dathe72",
  abstract =     "Two algorithms for generating computer programs from
                 decision tables are described. The algorithms allow
                 handling limited entry, extended entry, and mixed entry
                 tables. The algorithms are based on the rule mask
                 method but need not have the masks at execution time.
                 They perform the logical operations immediately rather
                 than at the end of the interpreting process. Execution
                 time can be considerably reduced by instantly marking
                 rules which are not applicable or conditions which are
                 already tested. The new algorithms combine to a certain
                 degree the advantages of mask methods with those of
                 tree methods.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming); C6150C
                 (Compilers, interpreters and other processors)",
  classification = "723",
  corpsource =   "Software AG, Darmstadt, West Germany",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; conversion; decision tables;
                 mask; program generation; program processors; rule mask
                 method without rule",
  oldlabel =     "Dathe72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dathe72",
}

@Article{Frazer:1972:SNS,
  author =       "W. D. Frazer and C. K. Wong",
  title =        "Sorting by Natural Selection",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "910--913",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:41:39 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#FrazerW72",
  abstract =     "A family of sorting algorithms is proposed, the
                 members of which make fuller use of the memory space
                 and thus yield longer sorted strings. Extensive
                 simulation results are presented, and various
                 implications and further applications are discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "IBM Thomas J.Watson Res. Center, Yorktown Heights, NY,
                 USA",
  journalabr =   "Commun ACM",
  keywords =     "CACM; computer programming --- Subroutines; computer
                 systems programming; natural selection; sorting",
  oldlabel =     "FrazerW72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FrazerW72",
}

@Article{Ershov:1972:CAH,
  author =       "A. P. Ershov",
  title =        "Corrigendum: {``Aesthetics and the Human Factor in
                 Programming''}",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "913--913",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Jan 18 14:08:57 1997",
  note =         "See \cite{Ershov:1972:AHF}.",
  acknowledgement = ack-nhfb,
}

@Article{Akima:1972:AAI,
  author =       "Hiroshi Akima",
  title =        "{ACM Algorithm 433}: Interpolation and Smooth Curve
                 Fitting Based on Local Procedures [{E2}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "914--918",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:20:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Akima72",
  note =         "See also \cite{Anderson:1976:RIS}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Akima72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Akima72",
}

@Article{Robertson:1972:RAT,
  author =       "J. Douglas Robertson",
  title =        "Remark on ``{Algorithm 398}: Tableless Date
                 Conversion''",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "918--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Robertson72",
  note =         "See \cite{Stone:1970:AAT}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Robertson72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Robertson72",
}

@Article{Fox:1972:CSC,
  author =       "Phyllis Fox",
  title =        "Comparative Study of Computer Programs for Integrating
                 Differential Equations",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "941--948",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:40:33 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Fox72",
  abstract =     "The integration methods represented include multistep
                 methods (predictor-correctors), single-step methods
                 (Runge--Kutta) and extrapolation methods (both
                 polynomial and rational). The testing procedure is
                 described together with the evaluation criteria
                 applied. A set of test problems on which the programs
                 were tested is included in appendix. For the particular
                 problems and criteria used in the investigation it was
                 found that a program based on rational extrapolation
                 showed the best performance.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  classification = "723; 921",
  corpsource =   "Newark Coll. Engng., NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "comparative study; computer programming; computer
                 programs; differential; differential equations;
                 equations; extrapolation methods; integration methods;
                 mathematical techniques --- Differential Equations;
                 mathematical techniques --- Integration;
                 predictor-corrector methods",
  oldlabel =     "Fox72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fox72",
}

@Article{Malcolm:1972:ARP,
  author =       "Michael A. Malcolm",
  title =        "Algorithms to Reveal Properties of Floating-Point
                 Arithmetic",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "949--951",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:01:07 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Malcolm72",
  note =         "See also \cite{Gentleman:1974:MAR}.",
  abstract =     "Two algorithms are presented in the form of Fortran
                 subroutines. Each subroutine computes the radix and
                 number of digits of the floating-point numbers and
                 whether rounding or chopping is done by the machine on
                 which it is run. The methods are shown to work on any
                 ``reasonable'' floating-point computer.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "chopping; computer programming; computer programming
                 languages --- Fortran; digital arithmetic; digits;
                 floating point arithmetic; Fortran subroutines;
                 mathematical techniques --- Digital Arithmetic; number
                 of; properties; radix; rounding",
  oldlabel =     "Malcolm72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Malcolm72",
}

@Article{Patrick:1972:HPA,
  author =       "Merrell L. Patrick",
  title =        "A Highly Parallel Algorithm for Approximating All
                 Zeros of a Polynomial with Only Real Zeros",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "952--955",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65H05",
  MRnumber =     "48 1455",
  bibdate =      "Mon Jan 22 07:11:36 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Patrick72",
  abstract =     "An algorithm is described based on Newton's method
                 which simultaneously approximates all zeros of a
                 polynomial with only real zeros. The algorithm, which
                 is conceptually suitable for parallel computation,
                 determines its own starting values so that convergence
                 to the zeros is guaranteed. Multiple zeros and their
                 multiplicity are readily determined. At no point in the
                 method is polynomial deflation used.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  classification = "723; 921",
  corpsource =   "Duke Univ., Durham, NC, USA",
  journalabr =   "Commun ACM",
  keywords =     "approximation with real zeros; computer programming;
                 function approximation; guaranteed convergence; highly;
                 mathematical techniques --- Poles and Zeros;
                 mathematical techniques --- Polynomials; multiple
                 zeros; Newton's method; parallel algorithm; parallel
                 numerical algorithms; poles and zeros; polynomial
                 zeros; polynomials; real polynomials; real zeros;
                 starting values",
  oldlabel =     "Patrick72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Patrick72",
}

@Article{Ledgard:1972:MTC,
  author =       "Henry F. Ledgard",
  title =        "Model for Type Checking --- with an Application to
                 {Algol 60}",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "956--966",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:58:05 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Ledgard72",
  abstract =     "This paper attempts to isolate the notion of type
                 checking and presents a partial solution to the type
                 checking problem based on the notions of abstraction
                 and application of functions. A program is mapped into
                 an expression within a decidable subset of the
                 lambda-calculus, which characterizes the type relations
                 within the program and eliminates all other
                 information. The determination of the type-wise
                 correctness or incorrectness of the program is resolved
                 by reducing its corresponding lambda-calculus
                 expression to one of two normal forms, the constant
                 ``correct'' for a type-wise correct program or the
                 constant ``error.'' An application to type checking in
                 Algol 60 is made, and the attendant problems faced for
                 any notion of type checking are discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  classification = "723",
  corpsource =   "Johns Hopkins Univ., Baltimore, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "abstraction; ALGOL; ALGOL 60; application of
                 functions; compilation; computer programming languages;
                 execution; lambda calculus; model; program compilers;
                 type checking",
  oldlabel =     "Ledgard72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ledgard72",
}

@Article{Henderson:1972:DSS,
  author =       "Peter B. Henderson",
  title =        "Derived Semantics for Some Programming Language
                 Constructs",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "967--973",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:30 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Henderson72",
  abstract =     "The constructs of a simple programming language are
                 introduced and described informally in terms of values
                 and side-effects. a translator is defined which
                 translates the language into flowcharts for a simple
                 machine. The action of the machine in executing a
                 flowchart is defined. A proof is constructed that the
                 effect of translating and executing any program can be
                 expressed solely in terms of the value and side-effect
                 of the program. during the course of constructing the
                 proof, formal definitions of the concepts of value and
                 side-effect are derived in order to make the proof
                 rigorous. Correctness of the implementation involves
                 checking that the definitions derived in the step above
                 are an acceptable formalization of the informal
                 description given in the first step.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Univ. Newcastle upon Tyne, UK",
  journalabr =   "Commun ACM",
  keywords =     "computer programming languages; constructs; derived
                 semantics; flowcharts; lambda calculus; programming
                 language; programming theory; side effects; translator;
                 values",
  oldlabel =     "Henderson72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Henderson72",
}

@Article{Verhelst:1972:CLE,
  author =       "M. Verhelst",
  title =        "The Conversion of Limited-Entry Decision Tables to
                 Optimal and Near-Optimal Flowcharts: Two New
                 Algorithms",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "974--980",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:15 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Verhelst72",
  abstract =     "The algorithms are first derived for treating decision
                 tables not containing an ELSE-rule, but the
                 optimum-approaching algorithm is shown to be equally
                 valid for tables including such a rule. Both algorithms
                 are compared with existing ones and are applied to a
                 somewhat large decision table derived from a real
                 case.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "Univ. Louvain, Belgium",
  journalabr =   "Commun ACM",
  keywords =     "algorithm; computer programming --- Subroutines;
                 computer programming languages; conversion; decision
                 tables; flowcharting; limited entry decision tables;
                 minimum execution time; near; optimal flowcharts;
                 optimisation; optimum approaching algorithm; optimum
                 finding",
  oldlabel =     "Verhelst72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Verhelst72",
}

@Article{Baecker:1972:GCV,
  author =       "H. D. Baecker",
  title =        "Garbage Collection for Virtual Memory Computer
                 Systems",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "981--986",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:35 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Baecker72",
  abstract =     "In list processing there is typically a growing demand
                 for space during program execution. This paper examines
                 the practical implications of this growth within a
                 virtual memory computer system, proposes two new
                 garbage collection techniques for virtual memory
                 systems, and compares them with traditional methods by
                 discussion and by simulation.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723",
  corpsource =   "Univ. Calgary, Alta., Canada",
  journalabr =   "Commun ACM",
  keywords =     "computer operating systems --- Storage Allocation;
                 computer programming languages; data storage, digital;
                 file organisation; garbage collection; list; paging;
                 processing; segmentation; storage allocation; storage
                 management; virtual memory; virtual memory computer
                 systems",
  oldlabel =     "Baecker72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Baecker72",
}

@Article{Ramberg:1972:AMG,
  author =       "John S. Ramberg and Bruce W. Schmeiser",
  title =        "Approximate Method for Generating Symmetric Random
                 Variables",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "987--990",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:55 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#RambergS72",
  abstract =     "A method for generating values of continuous symmetric
                 random variables that is relatively fast, requires
                 essentially no computer memory, and is easy to use is
                 developed. The method, which uses a uniform zero-one
                 random number source, is based on the inverse function
                 of the lambda distribution of Tukey. Since it
                 approximates many of the continuous theoretical
                 distributions and empirical distributions frequently
                 used in simulations, the method should be useful to
                 simulation practitioners.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  classification = "922",
  corpsource =   "Univ. Iowa, Iowa City, IA, USA",
  journalabr =   "Commun ACM",
  keywords =     "approximate method; inverse function; lambda
                 distribution of Tukey; mathematical models;
                 mathematical statistics; random number generation;
                 random number source; simulation; symmetric random
                 variable generation; uniform zero one",
  oldlabel =     "RambergS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RambergS72",
}

@Article{March:1972:AAE,
  author =       "David L. March",
  title =        "{ACM Algorithm 434}: Exact Probabilities for
                 ${R\times{C}}$ Contingency Tables [{G2}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "991--992",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:01:41 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#March72",
  note =         "See remark
                 \cite{Boulton:1974:RAE,Hancock:1975:RAE,Boulton:1976:REP}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "March72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/March72",
}

@Article{Fullerton:1972:AAM,
  author =       "Wayne Fullerton",
  title =        "{ACM Algorithm 435}: Modified Incomplete Gamma
                 Function [{S14}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "993--995",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:42:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Fullerton72",
  note =         "See also \cite{Schoene:1978:RMI}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Fullerton72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fullerton72",
}

@Article{Lum:1972:ARK,
  author =       "Vincent Y. Lum and P. S. T. Yuen",
  title =        "Additional results on key-to-address transform
                 techniques: a fundamental performance study on large
                 existing formatted files",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "996--997",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:17 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#LumY72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "IBM Res. Lab., San Jose, CA, USA",
  keywords =     "file; file organisation; fundamental performance; hash
                 coding; key to address transform techniques; large
                 existing formatted files; organization; study",
  oldlabel =     "LumY72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LumY72",
}

@Article{Kennedy:1972:NOD,
  author =       "Steve Kennedy",
  title =        "A Note on Optimal Doubly-Chained Trees",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "997--998",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:54:23 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Kennedy72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "California Inst. Technol., Pasadena, CA, USA",
  keywords =     "binary search; file organisation; file searching;
                 optimal doubly chained trees; tree; trees
                 (mathematical)",
  oldlabel =     "Kennedy72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kennedy72",
}

@Article{Eisenberg:1972:FCD,
  author =       "Murray A. Eisenberg and Michael R. McGuire",
  title =        "Further comments on {Dijkstra}'s concurrent
                 programming control problem",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "999--999",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:45 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#EisenbergM72",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  keywords =     "critical; Dijkstra's concurrent programming control
                 problem; multiprocessing; multiprocessing programs;
                 section",
  oldlabel =     "EisenbergM72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EisenbergM72",
}

@Article{Smoliar:1972:CMM,
  author =       "Stephen W. Smoliar",
  title =        "Comments on {Moorer's Music} and computer
                 composition",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "1000--1001",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:23:00 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Smoliar72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Tech. Israel Inst. Technol., Haifa, Israel",
  keywords =     "artificial intelligence; computer composition;
                 computer music; heuristic; humanities; programming",
  oldlabel =     "Smoliar72",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Smoliar72",
}

@Article{Phillips:1972:DPA,
  author =       "J. Richard Phillips and H. C. Adams",
  title =        "Dynamic Partitioning for Array Languages",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1023--1032",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:12:35 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#PhillipsA72",
  abstract =     "The classical process of partitioning an array into
                 subarrays is extended to a more useful array language
                 operation. Various modes of partitioning are defined
                 for different types of arrays, so that subarrays may
                 vary over the original array in a nearly arbitrary
                 manner. These definitions are motivated with several
                 realistic examples to illustrate the value of
                 partitioning for array languages. Of general interest
                 is the data structure for partitioning. This consists
                 of dynamic tree structures which are used to derive and
                 maintain the array control information. These are
                 described in sufficient detail to be of value in the
                 design of other array languages. The description
                 presented in this paper is implemented in a new array
                 language, OL/2, currently under development at the
                 University of Illinois.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6140D (High level
                 languages)",
  classification = "723",
  corpsource =   "Univ. Illinois, Urbana-Champaign, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "array languages; array partitioning; computer
                 programming languages; data processing --- Data
                 Structures; data structure; data structures; dynamic
                 partitioning; dynamic tree structures; OL/2;
                 programming languages",
  oldlabel =     "PhillipsA72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/PhillipsA72",
}

@Article{Bayer:1972:IRM,
  author =       "Rudolf Bayer and C. Witzgall",
  title =        "Index Ranges for Matrix Calculi",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1033--1039",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:02 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BayerW72",
  abstract =     "The paper describes a scheme for symbolic manipulation
                 of index expressions which arise as a by-product of the
                 symbolic manipulation of expressions in the matrix
                 calculi described by the authors in a previous paper.
                 This scheme attempts program optimization by
                 transforming the original algorithm rather than the
                 machine code. The goal is to automatically generate
                 code for handling the tedious address calculations
                 necessitated by complicated data structures. The paper
                 is therefore preoccupied with ``indexing by position.''
                 The relationship of ``indexing by name'' and ``indexing
                 by position'' is discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "Boeing Sci. Res. Labs., Seattle, WA, USA",
  journalabr =   "Commun ACM",
  keywords =     "address calculations; algorithm; computer programming
                 languages; data handling; data processing; data
                 structures; expressions; index; index ranges; indexing
                 by name; indexing by position; matrix algebra; matrix
                 calculi; program optimization; symbolic manipulation;
                 transformation",
  oldlabel =     "BayerW72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BayerW72",
}

@Article{Earley:1972:MIC,
  author =       "Jay Earley and Paul Caizergues",
  title =        "Method for Incrementally Compiling Languages with
                 Nested Statement Structure",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1040--1044",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:37:13 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#EarleyC72",
  abstract =     "The method permits editing of the source language
                 using a general purpose text editor, and incremental
                 processing of changes without frequent recompilation of
                 entire routines. The essential points of the method
                 are: the syntax of the language is restricted insofar
                 as which constructs may occur on lines; an internal
                 data structure (called the skeleton) is maintained to
                 represent the statement structure; the recompilation is
                 partially batched in the sense that recompilation of
                 modified lines does not occur until the last of a set
                 of editing commands has been received; and the parsing
                 and compilation are factored into two parts, that done
                 on individual lines and that done globally to handle
                 the relationships between the lines.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  classification = "723",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "ALGOL; computer operating systems --- Program
                 Compilers; computer programming languages; data
                 processing --- Data Structures; editor; general purpose
                 text; incremental compilation; nested statement
                 structure; PL/I; program compilers; programming
                 languages; source language",
  oldlabel =     "EarleyC72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EarleyC72",
}

@Article{Luccio:1972:WIL,
  author =       "Fabrizio Luccio",
  title =        "Weighted Increment Linear Search for Scatter Tables",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1045--1047",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:04 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Luccio72",
  abstract =     "A new linear search for hash tables whose increment
                 step is a function of the key being addressed is
                 presented. Comparisons with known methods are given, in
                 terms of efficiency and computation complexity. In
                 particular, the new method applies to tables of size n
                 equals 2**r. It allows full table searching, and
                 practically eliminates primary clustering at a very low
                 cost.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "Univ. Pisa, Italy",
  journalabr =   "Commun ACM",
  keywords =     "clustering; computer programming; hash; information
                 retrieval systems; information searching techniques;
                 scatter tables; table lookup; tables; weighted
                 increment linear search",
  oldlabel =     "Luccio72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Luccio72",
}

@Article{Barr:1972:CMN,
  author =       "Donald R. Barr and Norman L. Sezak",
  title =        "A Comparison of Multivariate Normal Generators",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1048--1049",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:23:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#BarrS72",
  acknowledgement = ack-nhfb,
  classcodes =   "C7890 (Other special applications of computing)",
  corpsource =   "Naval Postgraduate School, Monterey, CA, USA",
  keywords =     "comparison; covariance matrix; Gaussian random number
                 generator; multivariate; multivariate normal
                 generators; normal random vectors; random number
                 generation; simulation; triangular factorization",
  oldlabel =     "BarrS72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BarrS72",
}

@Article{Moore:1972:NMS,
  author =       "John Moore and Prentiss Robinson",
  title =        "New Method for the Solution of the {Cauchy} Problem
                 for Parabolic Equations",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1050--1052",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:45 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#MooreR72",
  abstract =     "An integral equation representation is given for
                 parabolic partial differential equations. When the
                 equations are defined in unbounded domains, as in the
                 initial value (Cauchy) problem, the solution of the
                 integral equation by the method of successive
                 approximation has inherent advantages over other
                 methods. Error bounds for the method are of order
                 h**3**/**2 and h**7**/**2 (h is the increment size)
                 depending on the finite difference approximations
                 involved.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  classification = "921",
  corpsource =   "Univ. Newcastle, UK",
  journalabr =   "Commun ACM",
  keywords =     "Cauchy problem; initial value problem; integral
                 equation representation; mathematical techniques;
                 parabolic; partial differential equations; successive
                 approximation",
  oldlabel =     "MooreR72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MooreR72",
}

@Article{Parnas:1972:CUD,
  author =       "David Lorge Parnas",
  title =        "On the Criteria To Be Used in Decomposing Systems into
                 Modules",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1053--1058",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:11:21 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/softeng.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Parnas72a",
  abstract =     "This paper discusses modularization as a mechanism for
                 improving the flexibility and comprehensibility of a
                 system while allowing the shortening of its development
                 time. The effectiveness of a ``modularization'' is
                 dependent upon the criteria used in dividing the system
                 into modules. A system design problem presented and
                 both a conventional and unconventional decomposition
                 are described. It is shown that the unconventional
                 decompositions have distinct advantages for the goals
                 outlined. The criteria used in arriving at the
                 decompositions are discussed. The unconventional
                 decomposition, if implemented with the conventional
                 assumption that a module consists of one or more
                 subroutines, will be less efficient in most cases. An
                 alternative approach to implementation which does not
                 this effect is sketched.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  journalabr =   "Commun ACM",
  keywords =     "comprehensibility; computer programming; criteria;
                 decomposition; flexibility; modularization; modules;
                 programming; software engineering; systems",
  oldlabel =     "Parnas72a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Parnas72a",
}

@Article{Brown:1972:LLP,
  author =       "P. J. Brown",
  title =        "Levels of Language for Portable Software",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1059--1062",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:20 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Brown72",
  abstract =     "An increasing amount of software is being implemented
                 in a portable form. A popular way of accomplishing this
                 is to encode the software in a specially designed
                 machine-independent language and then to map this
                 language, often using a macro processor, into the
                 assembly language of each desired object machine. The
                 design of the machine-independent language is the key
                 factor in this operation. This paper discusses the
                 relative merits of pitching this language at a high
                 level or a low level, and presents some comparative
                 results.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  classification = "723",
  corpsource =   "Univ. Kent, Canterbury, UK",
  journalabr =   "Commun ACM",
  keywords =     "assembly language; computer programming; levels of
                 language; machine independent language; macro
                 processor; portable software; procedure oriented
                 languages",
  oldlabel =     "Brown72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brown72",
}

@Article{Sherman:1972:TDM,
  author =       "Stephen Sherman and Forest {Baskett III} and James C.
                 Browne",
  title =        "Trace-Driven Modeling and Analysis of {CPU} Scheduling
                 in a Multiprogramming System",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1063--1069",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:21:02 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#ShermanBB72",
  abstract =     "The scheduling methods tested included the best
                 possible and worst possible methods, the traditional
                 methods of multiprogramming theory, round-robin,
                 first-come-first-served, and dynamic predictors. The
                 relative and absolute performances of these scheduling
                 methods are given. It is concluded that a successful
                 CPU scheduling method must be preemptive and must
                 prevent a given job from holding the CPU for too long a
                 period.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  classification = "723",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "analysis; computer systems programming; CPU
                 scheduling; first come first served; microscopic level
                 job stream data; modelling; multiprogramming;
                 multiprogramming system; round robin; trace driven
                 modelling",
  oldlabel =     "ShermanBB72",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ShermanBB72",
  xxtitle =      "Trace-Driven Modeling and Analysis of {CPU} Scheduling
                 in Multiprogramming System",
}

@Article{Boland:1972:AAPa,
  author =       "W. Robert Boland",
  title =        "{ACM Algorithm 436}: Product Type Trapezoidal
                 Integration",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1070--1070",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:13 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Boland72",
  acknowledgement = ack-nhfb,
  oldlabel =     "Boland72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Boland72",
}

@Article{Boland:1972:AAPb,
  author =       "W. Robert Boland",
  title =        "{ACM Algorithm 437}: Product Type {Simpson}'s
                 Integration [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1070--1071",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:14 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Boland72a",
  acknowledgement = ack-nhfb,
  oldlabel =     "Boland72a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Boland72a",
}

@Article{Boland:1972:AAPc,
  author =       "W. Robert Boland",
  title =        "{ACM Algorithm 438}: Product Type Two-Point
                 {Gauss--Legendre--Simpson}'s Integration [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1071--??",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:15 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Boland72b",
  acknowledgement = ack-nhfb,
  oldlabel =     "Boland72b",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Boland72b",
  xxpages =      "1072",
}

@Article{Sullins:1972:CAP,
  author =       "Walter L. Sullins",
  title =        "Certification of ``{Algorithm 266}: Pseudo-Random
                 Numbers [{G5}]''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1072--1073",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:25:02 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Sullins72",
  note =         "See \cite{Pike:1965:AAP}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Sullins72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sullins72",
}

@Article{Boland:1972:AAPd,
  author =       "W. Robert Boland",
  title =        "{ACM Algorithm 439}: Product Type Three-point
                 {Gauss--Legendre--Simpson}'s Integration [{D1}]",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1072--??",
  month =        dec,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:16 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Boland72b;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Boland72c",
  acknowledgement = ack-nhfb,
  oldlabel =     "Boland72b; Boland72c",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Boland72b;
                 ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Boland72c",
  xxpages =      "1071--??",
}

@Article{Hallet:1972:CAS,
  author =       "P. Hallet and E. Mund",
  title =        "Certification of ``{Algorithm 379}: Squank''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1073--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:00 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#HalletM72",
  note =         "See \cite{Lyness:1970:AAS}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "HalletM72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HalletM72",
}

@Article{Schuegraf:1972:RAL,
  author =       "Ernst Schuegraf",
  title =        "Remark on ``{Algorithm 176}: Least Squares Surface
                 Fit''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1073--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:58 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Schuegraf72",
  note =         "See \cite{Arthurs:1963:AAL}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Schuegraf72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schuegraf72",
}

@Article{Frisch:1972:RAR,
  author =       "Michael J. Frisch",
  title =        "Remark on ``{Algorithms 352, 385, 392}: Remarks on
                 Characteristic Values and Associated Solutions of
                 {Mathieu}'s Differential Equation, Exponential
                 Integral, and Systems of Hyperbolic {P.D.E.}''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1074--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:42:24 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Frisch72",
  note =         "See
                 \cite{Clemm:1969:AAC,Paciorek:1970:AAE,Smith:1970:AAS}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Frisch72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Frisch72",
}

@Article{Marshall:1972:RAD,
  author =       "D. R. T. Marshall",
  title =        "Remark on ``{Algorithm 394}: Decision Table
                 Translation''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1074--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:01:53 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Marshall72",
  note =         "See remark \cite{Dial:1970:AAD}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Marshall72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Marshall72",
}

@Article{Schuegraf:1972:RAB,
  author =       "Ernst Schuegraf",
  title =        "Remark on ``{Algorithm 195}: {BANDSOLVE}''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1074--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:59 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Schuegraf72a",
  note =         "See \cite{Thurnau:1963:AAB}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Schuegraf72a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Schuegraf72a",
}

@Article{Heiberger:1972:RAR,
  author =       "Richard M. Heiberger",
  title =        "Remark on ``{Algorithm 405}: Roots of Matrix
                 Pencils''",
  journal =      j-CACM,
  volume =       "15",
  number =       "12",
  pages =        "1075--??",
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Heiberger72",
  note =         "See \cite{Dell:1971:AAR}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Heiberger72",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Heiberger72",
}

@Article{Denning:1973:CWM,
  author =       "Peter J. Denning and Stuart C. Schwartz",
  title =        "Corrigendum: ``{Properties of the working-set
                 model}''",
  journal =      j-CACM,
  volume =       "15",
  number =       "2",
  pages =        "191--198",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue May 28 11:37:15 1996",
  note =         "See \cite{Denning:1972:PWS}.",
  acknowledgement = ack-nhfb,
}

@Article{Shedler:1973:QMM,
  author =       "Gerald S. Shedler",
  title =        "A Queuing Model of a Multiprogrammed Computer with a
                 Two-Level Storage System",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "3--10",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A50",
  MRnumber =     "51 14680",
  MRreviewer =   "K. Vairaran",
  bibdate =      "Mon Jan 22 07:20:52 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Shedler73",
  abstract =     "The results are presented of an analysis of a
                 probabilistic model of a multiprogrammed computer
                 system with a two-level storage system in which there
                 is sequential dependency of accesses between the
                 devices. Expressions are obtained for the long-run
                 probability that both the CPU and each of the storage
                 devices are busy. Some numerical results are given
                 which quantify the gains in CPU utilization obtainable
                 by multiprogramming in the presence of this type of
                 storage system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  classification = "723; 922",
  corpsource =   "IBM, San Jose, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer systems programming --- Multiprogramming;
                 data storage, digital; dependency of accesses;
                 hierarchical index ses; hierarchical index sets;
                 modelling; multiprogrammed computer; multiprogrammed
                 computer system; multiprogramming; probability;
                 queueing theory; queuing model; sequential; storage
                 system; two level",
  oldlabel =     "Shedler73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shedler73",
}

@Article{Bays:1973:RHC,
  author =       "Carter Bays",
  title =        "The Reallocation of Hash-Coded Tables",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "11--14",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:05 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bays73",
  abstract =     "When the space allocation for a hash-coded table is
                 altered, the table entries must be rescattered over the
                 new space. A technique for accomplishing this
                 rescattering is presented. The technique is independent
                 of both the length of the table and the hashing
                 function used, and can be utilized in conjunction with
                 a linear reallocation of the table being rescattered.
                 Moreover, it can be used to eliminate previously
                 flagged deletions from any hash-coded table, or to
                 change from one hashing method to another. The
                 efficiency of the technique is discussed and
                 theoretical statistics are given.",
  acknowledgement = ack-nhfb,
  annote =       "Algorithm to handle increase or decrease within a
                 direct access table containing entries.",
  classcodes =   "C6110 (Systems analysis and programming); C6120 (File
                 organisation)",
  classification = "723",
  corpsource =   "Univ. South Carolina, Columbia, SC, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer systems programming; data storage, digital;
                 deletions; dynamic storage; hash code; programming;
                 reallocation; scatter storage; storage allocation",
  oldlabel =     "Bays73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bays73",
}

@Article{Morris:1973:PPL,
  author =       "James H. {Morris, Jr.}",
  title =        "Protection in Programming Languages",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "15--21",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:06:05 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Morris73",
  abstract =     "Linguistic mechanisms which can be used to protect one
                 subprogram from another's malfunctioning are described.
                 Function-producing functions and various type-tagging
                 schemes are considered. An attempt is made to
                 distinguish between access limitation and
                 authentication.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6100 (Software techniques and systems)",
  classification = "723",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "access control; access keys; authentication; computer
                 programming languages; environments; programming
                 languages; protection; seals; secrecy; security of
                 data; trademarks; types",
  oldlabel =     "Morris73",
  treatment =    "G General Review; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morris73",
}

@Article{Muraoka:1973:TRS,
  author =       "Yoichi Muraoka and David J. Kuck",
  title =        "On the Time Required for a Sequence of Matrix
                 Products",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "22--26",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A20",
  MRnumber =     "51 2347",
  MRreviewer =   "M. Tetruasvili",
  bibdate =      "Mon Jan 22 07:07:03 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MuraokaK73",
  abstract =     "This paper discusses the multiplication of conformable
                 sequences of row vectors, column vectors, and square
                 matrices. The minimum time required to evaluate such
                 products on ordinary serial computers as well as
                 parallel computers is discussed. Algorithms are
                 presented which properly parse such matrix sequences
                 subject to the constraints of the machine
                 organization.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723",
  corpsource =   "Univ. Illinois, Urbana-Champaign, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; computer programming languages;
                 computers; digital arithmetic; matrix algebra; matrix
                 expressions; matrix multiplication; operation
                 minimization; parallel computers; parallel machine;
                 parallel processing; sequence of matrix products;
                 serial; time required",
  oldlabel =     "MuraokaK73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MuraokaK73",
}

@Article{James:1973:ACP,
  author =       "E. B. James and Derek P. Partridge",
  title =        "Adaptive Correction of Program Statements",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "27--37",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:52:38 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#JamesP73",
  abstract =     "A method of analyzing statements in a programming
                 language which can tolerate a considerable inaccuracy
                 in their specification is proposed. This method
                 involves principles at present mainly confined to
                 studies in the area of artificial intelligence such as
                 feature extraction, approximate tree matching, and
                 strategy improvement by feedback from the matching
                 process. A pilot program incorporating the principles
                 is described and preliminary operating results are
                 presented. A final section surveys further principles
                 which are currently being investigated.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Imperial Coll. Sci. and Technol., London, UK",
  journalabr =   "Commun ACM",
  keywords =     "adaptive correction; artificial intelligence;
                 automatic parsing; compiler; computer metatheory;
                 computer programming languages; linguistic pattern
                 matching; program statements; programming; programming
                 languages; syntax analysis; theory",
  oldlabel =     "JamesP73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JamesP73",
}

@Article{Richman:1973:VPE,
  author =       "Paul L. Richman",
  title =        "Variable-Precision Exponentiation",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "38--40",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D20",
  MRnumber =     "51 4631",
  MRreviewer =   "V. V. Ivanov",
  bibdate =      "Mon Jan 22 07:15:57 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Richman73",
  abstract =     "A previous paper presented an efficient algorithm,
                 called the Recomputation Algorithm, for evaluating a
                 rational expression to within any desired tolerance on
                 a computer which performs variable-precision arithmetic
                 operations. The Recomputation Algorithm can be applied
                 to expressions involving any variable-precision
                 operations having $O(10^(-p) + \sum_i|E_i|)$ error
                 bounds, where $p$ denotes the operation's precision and
                 $E_i$ denotes the error in the operation's $i$-th
                 argument. \par

                 This paper presents an efficient variable-precision
                 exponential operation with an error bound of the above
                 order. Other operations such as log, sin, and cos,
                 which have simple series expansions, can be handled
                 similarly.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723; 921",
  corpsource =   "Bell Telephone Labs. Inc., Denver, CO, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; digital arithmetic; error
                 analysis; exponential function; exponentiation;
                 interval arithmetic; mathematical programming; variable
                 precision; variable-precision",
  oldlabel =     "Richman73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Richman73",
}

@Article{Crawford:1973:RBS,
  author =       "C. R. Crawford",
  title =        "Reduction of a Band-Symmetric Generalized Eigenvalue
                 Problem",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "41--44",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65F15",
  MRnumber =     "51 7266",
  MRreviewer =   "W. Niethammer",
  bibdate =      "Mon Jan 22 06:33:30 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Crawford73",
  abstract =     "An algorithm is described for reducing a generalized
                 eigenvalue problem to an ordinary problem, in case A
                 and B are symmetric band matrices with B positive
                 definite. If n is the order of the matrix and m the
                 bandwidth, the matrices A and B are partitioned into
                 m-by-m blocks; and the algorithm is described in terms
                 of these blocks. The algorithm reduces the generalized
                 problem to an ordinary eigenvalue problem for a
                 symmetric band matrix C whose bandwidth is the same as
                 A and B. The algorithm is similar to those of
                 Rutishauser and Schwartz for the reduction of symmetric
                 matrices to band form. The calculation of C requires
                 order N**2m operation. The round-off error in the
                 calculation of C is of the same order as the sum of the
                 errors at each of the n/m steps of the algorithm, the
                 latter errors being largely determined by the condition
                 of B with respect to inversion.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra)",
  classification = "723; 921",
  corpsource =   "Univ. Toronto, Ont., Canada",
  journalabr =   "Commun ACM",
  keywords =     "computer programming --- Subroutines; eigenvalues and
                 eigenfunctions; generalized eigenvalues; mathematical
                 techniques; matrix algebra; reduction; symmetric band
                 matrices",
  kwds =         "nla, geig, band matrix, symmetric matrix",
  oldlabel =     "Crawford73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Crawford73",
}

@Article{Blount:1973:PAC,
  author =       "Sumner E. Blount and Louis Fein",
  title =        "The practical aspect of computer science education ---
                 discussion",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "45--46",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:56 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BlountF73",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Digital Equipment Corp., Acton, MA, USA",
  keywords =     "computer engineering; computer science; curriculum;
                 digital computers; education; systems design",
  oldlabel =     "BlountF73",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BlountF73",
}

@Article{Bays:1973:NWC,
  author =       "Carter Bays",
  title =        "A note on when to chain overflow items within a
                 direct-access table",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "46--47",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:06 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bays73a",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. South Carolina, Columbia, SC, USA",
  keywords =     "chaining; collision; data handling; direct access
                 table; hash code; information; open hash; overflow
                 items; retrieval",
  oldlabel =     "Bays73a",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bays73a",
}

@Article{Atkins:1973:MRA,
  author =       "M. Stella Atkins",
  title =        "Mutual recursion in {Algol 60} using restricted
                 compilers",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "47--48",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Atkins73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Univ. Warwick, Coventry, UK",
  keywords =     "ALGOL; ALGOL 60; mutual recursion; program compilers;
                 restricted compilers",
  oldlabel =     "Atkins73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Atkins73",
}

@Article{Gallaher:1973:AAM,
  author =       "L. J. Gallaher",
  title =        "{ACM Algorithm 440}: {A} Multidimensional {Monte
                 Carlo} Quadrature with Adaptive Stratified Sampling
                 [{D1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "49--50",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:42:57 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Gallaher73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290M (Numerical integration and differentiation);
                 C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Georgia Inst. Technol., Atlanta, GA, USA",
  keywords =     "adaptive quadrature; ALGOL; integral; integration;
                 Monte Carlo methods; Monte Carlo Quadrature;
                 multidimensional; sampling; sequential stratification;
                 stratified; subroutines",
  oldlabel =     "Gallaher73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gallaher73",
}

@Article{Knop:1973:AAR,
  author =       "Robert E. Knop",
  title =        "{ACM Algorithm 441}: Random Deviates from the Dipole
                 Distribution [{G5}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "51--51",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:55:18 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Knop73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Florida State Univ., Tallahassee, FL, USA",
  country =      "USA",
  descriptors =  "RVG;",
  enum =         "7514",
  keywords =     "dipole distribution; FORTRAN; probability density;
                 random deviates; random number; statistics;
                 subroutines",
  language =     "English",
  oldlabel =     "Knop73",
  references =   "0",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knop73",
}

@Article{Hill:1973:AAN,
  author =       "G. W. Hill and A. W. Davis",
  title =        "{ACM Algorithm 442}: Normal Deviate [{S14}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "1",
  pages =        "51--52",
  month =        jan,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:54 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#HillD73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "CSIRO, Glen Osmond, Australia",
  country =      "USA",
  descriptors =  "RVG;",
  enum =         "7393",
  keywords =     "ALGOL; normal deviate; normal distribution inverse;
                 probit; statistics; subroutines; Taylor series
                 approximation; transform",
  language =     "English",
  oldlabel =     "HillD73",
  references =   "0",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HillD73",
}

@Article{Merrill:1973:RCR,
  author =       "R. D. Merrill",
  title =        "Representation of Contours and Regions for Efficient
                 Computer Search",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "69--82",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A10",
  MRnumber =     "51 7362",
  MRreviewer =   "Arnold Griffith",
  bibdate =      "Mon Jan 22 07:04:03 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Merrill73",
  abstract =     "A novel computer-searchable representation for the
                 three basic pictorial features, contour maps, region
                 coverage, and line structures, is described. The
                 representation, which has practical storage
                 requirements, provides a rapid means of searching large
                 files for data associated with geometric position as
                 well as with attribute value. An application of this
                 representation to handling terrain information
                 illustrates its utility. The algebraic properties of
                 the data structure make it computationally easy to
                 determine whether a point lies within a closed
                 boundary; compute the area contained by a closed
                 boundary; generate the closed boundary representing the
                 union or intersection of two closed boundaries; and
                 determine the neighboring boundaries to a point and the
                 minimum distances between them and the point. Pertinent
                 to mapping.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7400 (Engineering
                 computing)",
  classification = "405; 723",
  corpsource =   "Lockheed Palo Alto Res. Laboratory, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "applications of computers; cartography; computer
                 graphics; computer searchable structure; contour map
                 representation; data handling; data processing --- Data
                 Handling; data processing --- Data Structures;
                 engineering; graphic data retrieval; maps and mapping;
                 region boundary representation",
  oldlabel =     "Merrill73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Merrill73",
}

@Article{Crespi-Reghizzi:1973:UGI,
  author =       "Stefano Crespi-Reghizzi and Michel A. Melkanoff and L.
                 Lichten",
  title =        "The Use of Grammatical Inference for Designing
                 Programming Languages",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "83--90",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A30",
  MRnumber =     "50 15446",
  MRreviewer =   "Leon Levy",
  bibdate =      "Mon Jan 22 06:34:00 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/colt.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Crespi-ReghizziML73",
  abstract =     "Both in designing a new programming language and in
                 extending an existing language, the designer is faced
                 with the problem of deriving a ``natural'' grammar for
                 the language. We are proposing an interactive approach
                 to the grammar design problem wherein the designer
                 presents a sample of sentences and structures as input
                 to a grammatical inference algorithm. The algorithm
                 then constructs a grammar which is a reasonable
                 generalization of the examples submitted by the
                 designer. \par

                 The implementation is presently restricted to a
                 subclass of operator precedence grammars, but a second
                 algorithm is outlined which applies to a larger class
                 of context-free grammars.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6140 (Programming languages)",
  classification = "723",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming languages; context; context-free
                 grammars; extensible languages; free grammars; grammar
                 design; grammatical inference; identification in the
                 limit; inference; language definition; operator;
                 precedence grammars; programming languages",
  oldlabel =     "Crespi-ReghizziML73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Crespi-ReghizziML73",
}

@Article{Gimpel:1973:TDP,
  author =       "James F. Gimpel",
  title =        "A Theory of Discrete Patterns and Their Implementation
                 in {SNOBOL4}",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "91--100",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A15 (68A45)",
  MRnumber =     "52 7198",
  MRreviewer =   "John K. Debenham",
  bibdate =      "Mon Jan 22 06:44:26 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Gimpel73",
  abstract =     "The notion of a discrete pattern is formalized and
                 certain properties deduced. A pattern is shown to be a
                 generalization of a formal language. Algorithms for
                 implementing the kinds of patterns in SNOBOL4 are
                 given. The general approach is to create, in-so-far as
                 possible, a bottom-up parse from a top-down
                 specification.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6140 (Programming languages)",
  classification = "723",
  corpsource =   "Bell Telephone Labs., Holmdel, NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming languages; data processing ---
                 Data Structures; discrete patterns; formal language;
                 formal languages; parsing; pattern implementation;
                 pattern matching; pattern recognition systems; pattern
                 theory; patterns; programming languages; SNOBOL4;
                 string processing",
  oldlabel =     "Gimpel73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gimpel73",
}

@Article{Rokne:1973:AES,
  author =       "J. Rokne",
  title =        "Automatic Errorbounds for Simple Zeros of Analytic
                 Functions",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "101--104",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65E05",
  MRnumber =     "51 4638",
  MRreviewer =   "E. Maliszewski",
  bibdate =      "Mon Jan 22 07:16:52 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Rokne73",
  abstract =     "The Cauchy-Ostrowski theorem on convergence of Newton
                 iterates for an analytic function in one variable is
                 extended to include computational errors using complex
                 interval arithmetic. Several numerical examples are
                 given for polynomials with real and complex roots and
                 one example for the Bessel function of the first
                 kind.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290B (Error analysis in numerical methods); B0290D
                 (Functional analysis); B0290K (Nonlinear and functional
                 equations); C4110 (Error analysis in numerical
                 methods); C4120 (Functional analysis); C4150 (Nonlinear
                 and functional equations)",
  classification = "723",
  corpsource =   "Univ. Calgary, Alta., Canada",
  journalabr =   "Commun ACM",
  keywords =     "analysis; analytic functions; automatic errorbounds;
                 Bessel functions; Cauchy-Ostrowski theorem; complex
                 interval arithmetic; complex intervals; convergence of
                 numerical methods; data processing --- Data Handling;
                 data processing --- Data Structures; error; interval
                 arithmetic; iterative methods; mathematical techniques;
                 Newton's method; poles and zeros; polynomials; real
                 interval arithmetic; real intervals; simple zeros;
                 zeros of Bessel functions; zeros of polynomials",
  oldlabel =     "Rokne73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rokne73",
}

@Article{Brent:1973:RRT,
  author =       "Richard P. Brent",
  title =        "Reducing the Retrieval Time of Scatter Storage
                 Techniques",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "105--109",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:04 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Brent73",
  note =         "Modification of open addressing with double hashing to
                 reduce the average number of probes for a successful
                 search.",
  abstract =     "A new method for entering and retrieving information
                 in a hash table is described. The method is intended to
                 be efficient if most entries are looked up several
                 times. The expected number of probes to look up an
                 entry, predicted theoretically and verified by Monte
                 Carlo experiments, is considerably less than for other
                 comparable methods if the table is nearly full. An
                 example of a possible Fortran implementation is
                 given.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723; 901",
  journalabr =   "Commun ACM",
  keywords =     "address; address calculation; addressing; calculation;
                 computer programming languages --- Fortran; content
                 addressing; data storage, digital --- Random Access;
                 file organisation; file searching; has; has code; hash
                 addressing; information retrieval systems; linear
                 probing; linear quotient; linear quotient method;
                 method; retrieval time; scatter storage techniques;
                 storage management; symbol table",
  oldlabel =     "Brent73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brent73",
}

@Article{Graham:1973:SDE,
  author =       "Robert M. Graham and Gerald J. {Clancy, Jr.} and David
                 B. DeVaney",
  title =        "A Software Design and Evaluation System",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "110--116",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:45:59 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#GrahamCD73",
  abstract =     "A critical failure of current software system design
                 and implementation methodology is that the performance
                 of a proposed design is not evaluated before it is
                 actually implemented. In this paper the reasons for
                 this failure are explored, and a new methodology which
                 overcomes many of the difficulties is proposed. A
                 system which integrates performance evaluation with
                 design and implementation is described. This system is
                 based on a simple, high level language which is used to
                 describe the evolving system at all stages of its
                 development. The source language description is used as
                 direct input to performance analysis and simulation
                 routines. using the performance information obtained
                 from these routines as feedback, the problems which
                 adversely affect performance are detected early enough
                 so that they can be corrected without costly major
                 reimplementation of the proposed system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C6150J (Operating systems)",
  classification = "723",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "compilers; computer programming languages; computer
                 software; computer systems programming; computer
                 systems programming --- Supervisory and Executive
                 Programs; data processing --- Data Structures;
                 debugging; des language; evaluation; executive
                 programs; high level language; performance analysis;
                 program maintenance; program processors; simulation;
                 software design; supervisory and; supervisory systems;
                 system programming",
  oldlabel =     "GrahamCD73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GrahamCD73",
}

@Article{Balzer:1973:OIC,
  author =       "Robert M. Balzer",
  title =        "An Overview of the {ISPL} Computer System Design",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "117--122",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:23:01 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Balzer73",
  abstract =     "This paper explores the advantages of the concurrent
                 design of the language, operating system, and machine
                 (via microcode) to create an interactive programming
                 laboratory. It describes the synergistic effect that
                 the freedom to move and alter features from one of
                 these domains to another has had on the design of this
                 system (which has not been implemented). This freedom
                 simplified both incremental compilation and the
                 system's addressing structure, and centralized the
                 communication mechanisms enabling the construction of
                 hierarchical subsystems. It also suggested an important
                 new concept for operating systems: separation of the
                 scheduling from the maintenance functions in resource
                 allocation. This separation enables incorporation of
                 new scheduling algorithms (decision of what to do)
                 without endangering the system integration (correctly
                 performing the scheduling decisions).",
  acknowledgement = ack-nhfb,
  classcodes =   "C6100 (Software techniques and systems); C6150J
                 (Operating systems)",
  classification = "723",
  journalabr =   "Commun ACM",
  keywords =     "computer programming languages; computer system
                 design; computer systems, digital --- Time Sharing;
                 computers --- Data Communication Systems; hierarchical
                 subsystems; incremental compilation; interactive
                 programming laboratory; interprogram communication;
                 ISPL; language; machine; operating system; operating
                 systems (computers); programming",
  oldlabel =     "Balzer73",
  treatment =    "G General Review; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Balzer73",
}

@Article{Fritsch:1973:AAS,
  author =       "Fred N. Fritsch and R. E. Shafer and W. P. Crowley",
  title =        "{ACM Algorithm 443}: Solution of the Transcendental
                 Equation $w e^w = x$ [{C5}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "2",
  pages =        "123--124",
  month =        feb,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:42:27 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#FritschSC73",
  note =         "See remarks \cite{Einarsson:1974:STE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290D (Functional analysis); C4120 (Functional
                 analysis); C7310 (Mathematics computing)",
  corpsource =   "Univ. California, Livermore, CA, USA",
  keywords =     "FORTRAN; function evaluation; iteration; iterative
                 methods; subroutines; transcendental equation",
  oldlabel =     "FritschSC73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FritschSC73",
}

@Article{Austing:1973:CSC,
  author =       "Richard H. Austing and Gerald L. Engel",
  title =        "A Computer Science Course Program for Small Colleges",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "139--147",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:22 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#AustingE73",
  abstract =     "This report gives recommendations for the content,
                 implementation, and operation of a program of computer
                 science courses specifically directed to small
                 colleges. Implementation problems are discussed,
                 specifically within the constraints of limited faculty
                 and for the purposes of satisfying a wide variety of
                 objectives. Detailed descriptions of four courses are
                 given; suggestions are made for more advanced work; and
                 an extensive library list is included.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  classification = "723; 901",
  corpsource =   "Univ. Maryland, College Park, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer organization course; computer science course;
                 computer science education; data processing; education;
                 file organization course; programming course; reviews;
                 small colleges; social implications course;
                 universities",
  oldlabel =     "AustingE73",
  treatment =    "B Bibliography; G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AustingE73",
}

@Article{Wagner:1973:CPM,
  author =       "Robert A. Wagner",
  title =        "Common Phrases and Minimum-Space Text Storage",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "148--152",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:42 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Wagner73",
  abstract =     "A method for saving storage space for text strings,
                 such as compiler diagnostic messages, is described. The
                 method relies on hand selection of a set of text
                 strings which are common to one or more messages. These
                 phrases are then stored only once. The storage
                 technique gives rise to a mathematical optimization
                 problem: determine how each message should use the
                 available phrases to minimize its storage requirement.
                 This problem is nontrivial when phrases which overlap
                 exist. However, a dynamic programming algorithm is
                 presented which solves the problem in time which grows
                 linearly with the number of characters in the text.
                 Algorithm 444 applies to this paper.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C6120 (File organisation); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  classification = "723",
  corpsource =   "Cornell Univ., NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "common phrases; computer operating systems --- Program
                 Compilers; computer programming; diagnostic messages;
                 dynamic programming; error messages; file organisation;
                 minimum space; optimization; program diagnostics; text
                 storage",
  oldlabel =     "Wagner73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wagner73",
}

@Article{Feinroth:1973:TUF,
  author =       "Y. Feinroth and E. Franceschini and M. Goldstein",
  title =        "Telecommunications Using a Front-End Minicomputer",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "153--160",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:08 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#FeinrothFG73",
  abstract =     "The use of a front-end minicomputer to provide varied
                 remote terminal access to a large scale computer is
                 considered. The problems of embedding
                 telecommunications I/O within an operating system are
                 discussed, and it is shown how the decentralization of
                 intelligence acquired by front-end processing vastly
                 simplifies the problem. A specific implementation is
                 discussed with emphasis on the main
                 processor-minicomputer link, the hardware-software
                 implementation, the effect on the main processor
                 operating system, and an assessment of the advantages
                 over a hardwired line controller.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5600 (Data communication equipment and techniques)",
  classification = "718; 723",
  corpsource =   "New York Univ., NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "computers; computers, miniature; digital communication
                 systems; front end processor; front-end processor;
                 large scale computer; minicomputer; minicomputers;
                 operating; operating system; remote; remote job entry;
                 systems (computers); telecommunication systems;
                 telecommunications; terminals",
  oldlabel =     "FeinrothFG73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FeinrothFG73",
  xxauthor =     "Y. Feinroth and Ed Franceschini and M. Goldstein",
}

@Article{Pack:1973:EMC,
  author =       "Charles D. Pack",
  title =        "The Effects of Multiplexing on a
                 Computer-Communications System",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "161--168",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:10:56 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/network.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Pack73",
  abstract =     "A study is made of the way in which asynchronous time
                 division multiplexing changes the stochastic nature of
                 the arrival process from a user to the computer and,
                 consequently, affects the performance of a time-shared
                 computer-communications system. It is concluded that
                 while, for certain values of system parameters, there
                 is noticeable improvement in the performance of the
                 computer (model), in the sense that time-shared
                 scheduling delays are reduced, these improvements are
                 offset by the transmission delays imposed by
                 multiplexing so that there may be little or no change
                 in the computer-communications system performance.
                 Analytical and simulation results are based on the
                 model of the computer-communications system being an
                 M/D/I queue (the multiplexor) in tandem with a single
                 exponential server (the computer). Analytical results
                 include a general description of the output process of
                 an M/D/1 queue and the conditions under which this
                 output process is approximately Poisson.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5600 (Data communication equipment and techniques)",
  classification = "718; 722; 723",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  journalabr =   "Commun ACm",
  keywords =     "computer communications; computer programming ---
                 Subroutines; computers; digital communication systems;
                 multiplexing; operating systems; scheduling algorithms;
                 systems; time sharing; time-sharing",
  oldlabel =     "Pack73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pack73",
}

@Article{Conway:1973:DID,
  author =       "Richard W. Conway and Thomas R. Wilcox",
  title =        "Design and Implementation of a Diagnostic Compiler for
                 {PL/I}",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "169--179",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:34 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#ConwayW73",
  abstract =     "PL/C is a compiler for a dialect for PL/I. The design
                 objective was to provide a maximum degree of diagnostic
                 assistance in a batch processing environment. For the
                 most part this assistance is implicit and is provided
                 automatically by the compilers. The most remarkable
                 characteristic of PL/C is its perseverance --- it
                 completes translation of every program submitted and
                 continues execution until a user-established error
                 limit is reached. This requires that the compiler
                 repair errors encountered during both translation and
                 execution, and the design of PL/C is dominated by this
                 consideration. PL/C also introduces several explicit
                 user-controlled facilities for program testing. To
                 accommodate these extensions to PL/I without abandoning
                 compatibility with the IBM compiler, PL/C permits
                 ``pseudo comments'' --- constructions whose contents
                 can optionally be considered either source text or
                 comment. In spite of the diagnostic effort PL/C is a
                 fast and efficient processor. It effectively
                 demonstrates that compilers can provide better
                 diagnostic assistance than is customarily offered, even
                 when a sophisticated source language is employed, and
                 that this assistance need not be prohibitively
                 costly.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  classification = "723",
  corpsource =   "Cornell Univ., NY, USA",
  journalabr =   "Commun ACM",
  keywords =     "batch processing environment; batch-processing;
                 computer operating systems; computer programming
                 languages --- Program Debugging; computer programming
                 languages --- Program Diagnostics; design; diagnostic
                 compiler; diagnostics; implementation; PL/1; PL/C;
                 PL/I; program; program compilers",
  oldlabel =     "ConwayW73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/ConwayW73",
}

@Article{Salzer:1973:GCS,
  author =       "Herbert E. Salzer",
  title =        "{Gray} code and the $\pm$ sequence when $\pm f(\pm
                 f(\pm f(\cdots \pm f(x) \cdots)))$ is ordered",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "180--180",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:18:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Salzer73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  keywords =     "binary sequences; binary system; codes; functions;
                 Galois sum; Gray code; ordering; positive monotonic;
                 sign sequences",
  oldlabel =     "Salzer73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Salzer73",
}

@Article{Bookstein:1973:HST,
  author =       "Abraham Bookstein",
  title =        "On {Harrison}'s Substring Testing Technique",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "180--181",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bookstein73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "data handling; hashing; information storage;
                 retrieval; substring testing technique",
  oldlabel =     "Bookstein73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bookstein73",
}

@Article{Payne:1973:GEP,
  author =       "William H. Payne",
  title =        "Graduate Education: The Ph.{D}. Glut",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "181--182",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:11:43 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Payne73",
  note =         "See response and rebuttal \cite{Freeman:1974:GEP}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "Univ. Illinois, Urbana-Champaign, IL, USA",
  keywords =     "accreditation; education; graduate education; Ph.D.
                 glut; Ph.D. production",
  oldlabel =     "Payne73",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Payne73",
}

@Article{Wagner:1973:AAA,
  author =       "Robert A. Wagner",
  title =        "{ACM Algorithm 444}: An Algorithm for Extracting
                 Phrases in a Space-Optimal Fashion [{Z}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "183--185",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:43 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Wagner73a",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Vanderbilt Univ., Nashville, TN, USA",
  keywords =     "algorithm; coding; data handling; extracting phrases;
                 information retrieval; PARSE; PL/I; subroutines; text
                 compression",
  oldlabel =     "Wagner73a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wagner73a",
}

@Article{Chang:1973:AAB,
  author =       "Shi-Kuo Chang",
  title =        "{ACM Algorithm 445}: Binary Pattern Reconstruction
                 from Projections [{Z}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "185--186",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:30:24 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Chang73",
  note =         "See remark \cite{Lau:1973:RAB}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition); C7800 (Other
                 computer applications)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "ALGOL; binary pattern; compression; data; picture
                 processing; projections; reconstruction; subroutines",
  oldlabel =     "Chang73",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Chang73",
}

@Article{Lau:1973:RAB,
  author =       "John Lau",
  title =        "Remark on ``{Algorithm 445: Binary Pattern
                 Reconstruction from Projections [{Z}]}''",
  journal =      j-CACM,
  volume =       "16",
  number =       "3",
  pages =        "186--186",
  month =        mar,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:57:45 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Lau73",
  note =         "See \cite{Chang:1973:AAB}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B6140C (Optical information, image and video signal
                 processing); C1250 (Pattern recognition); C7800 (Other
                 computer applications)",
  corpsource =   "Univ. British Columbia, Vancouver, BC, Canada",
  keywords =     "ALGOL; binary pattern reconstruction; compression;
                 data; picture processing; projections; subroutines",
  oldlabel =     "Lau73",
  treatment =    "P Practical; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lau73",
}

@Article{Hassitt:1973:IHL,
  author =       "Anthony Hassitt and J. W. Lageschulte and Leonard E.
                 Lyon",
  title =        "Implementation of a High Level Language Machine",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "199--212",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:54 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#HassittLL73",
  abstract =     "Computing machines which directly execute the
                 statements of a high level language have been proposed
                 in the past. This report describes the actual
                 implementation of such a machine: it is a computer
                 whose ``machine language'' is APL. The machine is fully
                 operational and correctly executes almost all of the
                 APL operations on scalars, vectors, and arrays. The
                 machine automatically allocates memory, executes
                 statements, calls functions, converts numbers from one
                 type to another, checks subscripts, and automatically
                 detects many types of programmer errors.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture); C6140D (High level
                 languages)",
  classification = "723",
  corpsource =   "IBM Palo Alto, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "APL; computer architecture; computer operating systems
                 --- Program Compilers; computer programming languages;
                 computing machines; emulators; high level language;
                 high level language machine; implementation;
                 interpreters; microprogramming; procedure oriented
                 languages",
  oldlabel =     "HassittLL73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HassittLL73",
  xxtitle =      "Implementation of High Level Language Machine",
}

@Article{Williams:1973:AMH,
  author =       "John G. Williams",
  title =        "Asymmetric Memory Hierarchies",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "213--222",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A50",
  MRnumber =     "51 2378",
  MRreviewer =   "I. Kaufmann",
  bibdate =      "Mon Jan 22 07:30:08 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Williams73",
  abstract =     "A study is presented of some of the system
                 implications of memory hierarchies in which the backing
                 or secondary store has a very small read time, relative
                 of both the time required for writing and to the read
                 time of conventional backing storage devices. Several
                 analytic models are introduced, and it is shown that
                 such hierarchies may operate in ways which differ from
                 those of more conventional hierarchies. In particular,
                 it is shown that it may not be necessary to
                 multiprogram in such a situation. \par

                 In the past, backing storage devices have been roughly
                 symmetric with respect to their read and write times.
                 This situation may not continue, as several devices are
                 currently under development which may have a very small
                 read-time/write-time ratio. This study places
                 particular emphasis on one such system-the RCA
                 read/write holographic optical memory.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5320Z (Other digital storage); C6120 (File
                 organisation)",
  classification = "722; 723; 741",
  corpsource =   "RCA, Princeton, NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "asymmetric memory; asymmetric memory hierarchies;
                 asymmetric memory hierarchy; computer systems
                 programming --- Multiprogramming; data storage,
                 optical; demand paging; file organisation; holographic;
                 holographic optical memory; holography; memory device;
                 memory hierarchy; optical memory; optical stores;
                 paging; Performance Evaluation: Analytic; storage
                 device; storage hierarchy; virtual memory",
  oldlabel =     "Williams73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Williams73",
}

@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 =      "Wed Aug 31 13:47:33 1994",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/cacm1960.bib",
  abstract =     "This paper presents the statistical results of tests
                 of the accuracy of certain arithmetic systems in
                 evaluating sums, products and inner products, and
                 analytic error estimates for some of the computations.
                 The arithmetic systems studied are 6-digit hexadecimal
                 and 22-digit binary floating point number
                 representations combined with the usual chop and round
                 modes of arithmetic with various numbers of guard
                 digits, and with a modified round mode with guard
                 digits. In a certain sense, arithmetic systems
                 differing only in their use of binary or hexadecimal
                 number representations are shown to be approximately
                 statistically equivalent in accuracy. Further, the
                 usual round mode with guard digits is shown to be
                 statistically superior in accuracy to the usual chop
                 mode in all cases save one. The modified round mode is
                 found to be superior to the chop mode in all cases.",
  acknowledgement = ack-nhfb # " and " # ack-nj,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723",
  corpsource =   "Univ. Chicago, IL, USA",
  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{Burkhard:1973:SAB,
  author =       "Walter A. Burkhard and Robert M. Keller",
  title =        "Some Approaches to Best-Match File Searching",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "230--236",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:51 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/pre75.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BurkhardK73",
  abstract =     "The problem of searching the set of keys in a file to
                 find a key which is closest to a given query key is
                 discussed. After ``closest'', in terms of a metric on
                 the key space, is suitably defined, three file
                 structures are presented together with their
                 corresponding search algorithms, which are intended to
                 reduce the number of comparisons required to achieve
                 the desired result. These methods are derived using
                 certain inequalities satisfied by metrics and by
                 graph-theoretic concepts. Some empirical results are
                 presented which compare the efficiency of the
                 methods.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723; 901",
  corpsource =   "Univ. California, San Diego, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "best match; data processing; file organisation; file
                 searching; file structuring; heuristics; information
                 retrieval systems",
  oldlabel =     "BurkhardK73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BurkhardK73",
}

@Article{Strong:1973:RCT,
  author =       "James P. {Strong, III} and Azriel Rosenfeld",
  title =        "A Region Coloring Technique for Scene Analysis",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "237--246",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:47 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#StrongR73",
  abstract =     "A method of converting a picture into a ``cartoon'' or
                 ``map'' whose regions correspond to differently
                 textured regions is described. Texture edges in the
                 picture are detected, and solid regions surrounded by
                 these (usually broken) edges are ``colored in'' using a
                 propagation process. The resulting map is cleaned by
                 comparing the region colors with the textures of the
                 corresponding regions in the picture, and also by
                 merging some regions with others according to criteria
                 based on topology and size. The method has been applied
                 to the construction of could cover maps from cloud
                 cover pictures obtained by satellites.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays)",
  classification = "405; 723; 741",
  corpsource =   "NASA, Greenbelt, MD, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer graphics; data processing --- Natural
                 Sciences Applications; edge detection; maps and
                 mapping; pattern recognition systems; picture; picture
                 processing; processing; region colouring technique;
                 scene analysis",
  oldlabel =     "StrongR73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/StrongR73",
}

@Article{Rodriguez-Rosell:1973:DIE,
  author =       "Juan Rodriguez-Rosell and Jean-Pierre Dupuy",
  title =        "The design, implementation, and evaluation of a
                 working set dispatcher",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "247--253",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:48 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Rodriguez-RosellD73",
  abstract =     "The behavior of a computer system is largely dependent
                 upon the algorithm employed to allocate the system
                 resources to the processes competing for them. Recent
                 research in time-sharing paging systems has developed
                 the working set model for program behavior, and a
                 resource allocation strategy based on this model has
                 been proposed. Two implementations along these
                 principles have been reported, but it seems that in
                 neither case have further results been announced. This
                 report discusses the design and implementation of a
                 dispatcher based on the working set principle, presents
                 data to permit analysis of its behavior, and indicates
                 future directions of research on methods of controlling
                 a computer system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  classification = "722; 723",
  corpsource =   "Royal Inst. Technol., Stockholm, Sweden",
  journalabr =   "Commun ACM",
  keywords =     "computer systems, digital; computers --- Operating
                 Procedures; design; evaluation; implementation;
                 operating systems; resource allocation; scheduler;
                 software evaluation; supervisory and executive
                 programs; supervisory systems; time sharing;
                 time-sharing systems; working set; working set
                 dispatcher",
  oldlabel =     "Rodriguez-RosellD73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rodriguez-RosellD73",
}

@Article{Broucke:1973:AAT,
  author =       "R. Broucke",
  title =        "{ACM Algorithm 446}: Ten Subroutines for the
                 Manipulation of {Chebyshev} Series [{C1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "254--256",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:17 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Broucke73",
  note =         "See remark and certification
                 \cite{Piessens:1975:RCA}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C7310
                 (Mathematics computing)",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  keywords =     "approximations; Chebyshev approximation; Chebyshev
                 series; curve fitting; Manipulation; negative powers;
                 series (mathematics); subroutines",
  oldlabel =     "Broucke73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Broucke73",
}

@Article{Ragland:1973:CAG,
  author =       "Larry C. Ragland and Donald I. Good",
  title =        "Certification of ``{Algorithm 386}: Greatest Common
                 Divisor of $n$ Integers and Multipliers''",
  journal =      j-CACM,
  volume =       "16",
  number =       "4",
  pages =        "257--257",
  month =        apr,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:14:38 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#RaglandG73",
  note =         "See \cite{Bradley:1970:AAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  keywords =     "Euclidean algorithm; greatest common divisor;
                 inductive assertion method; integers; multipliers;
                 number theory; proof of algorithms",
  oldlabel =     "RaglandG73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RaglandG73",
}

@Article{Pager:1973:PCC,
  author =       "David Pager",
  title =        "On the Problem of Communicating Complex Information",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "275--281",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:11:04 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Pager73",
  abstract =     "The nature of the difficulty involved in communicating
                 mathematical results between scientists using a
                 computer based information retrieval system is
                 examined. The problem is analyzed in terms of
                 psychological and information-processing processes, and
                 what turns out to be a vicious circle of effects is
                 described. The paper then considers how the
                 presentation of information by a computer-based
                 information retrieval system, or by other media, can be
                 improved. Some trade-offs which affect the design of
                 the presentation are mentioned, and a number of ideas
                 for improvement are described. These include ways of
                 augmenting written language by various notational and
                 linguistic devices, the exhibition of the structure
                 inherent in the information the authors are
                 communicating, and a sophisticated interactive system
                 controlled by computer.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7250 (Information storage and retrieval)",
  classification = "723; 901",
  corpsource =   "Univ. Hawaii, Honolulu, HI, USA",
  journalabr =   "Commun ACM",
  keywords =     "communication; complex information; computer based
                 information retrieval; computers --- Data Communication
                 Systems; information; information retrieval systems;
                 information science --- Information Retrieval;
                 interactive system; language; mathematics; proof;
                 psychology; system",
  oldlabel =     "Pager73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pager73",
}

@Article{Low:1973:PQE,
  author =       "David W. Low",
  title =        "Programming by Questionnaire: an Effective Way to Use
                 Decision Tables",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "282--286",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:59:47 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Low73",
  abstract =     "Programming by questionnaire combines aspects of
                 decision table programming and general purpose
                 programming by using decision tables to construct an
                 application program through the selection of certain
                 source statements from a predefined file. It is
                 proposed that programming by questionnaire is a useful
                 compromise between general and special purpose
                 programming for a significant class of large scale
                 problems. The elements of the approach are discussed
                 and an existing application is described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "IBM Corp., Los Angeles, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "automatic program; automatic program generation;
                 computer systems programming; decision tables;
                 generation; productivity; programmer; programming;
                 questionnaire; simulator generation",
  oldlabel =     "Low73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Low73",
}

@Article{King:1973:SCU,
  author =       "Peter J. H. King and Roger G. Johnson",
  title =        "Some Comments on the Use of Ambiguous Decision Tables
                 and Their Conversion to Computer Programs",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "287--290",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:54:52 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#KingJ73",
  abstract =     "This paper comments upon recently published work on
                 decision table translation using methods similar to
                 rule-mask technique. The applicability of these methods
                 under various possible conventions on overall table
                 meaning is discussed, and it is argued that there is a
                 place both for the multi-rule and the single-rule (or
                 action set) convention in decision table usage.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "Birbeck Coll., Univ. London, UK",
  journalabr =   "Commun ACM",
  keywords =     "computer programs; computer systems programming;
                 conversion; decision tables",
  oldlabel =     "KingJ73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KingJ73",
}

@Article{Salasin:1973:HSI,
  author =       "John Salasin",
  title =        "Hierarchical Storage in Information Retrieval",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "291--295",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:56 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/storage.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Salasin73",
  abstract =     "A probabilistic analysis is employed to determine the
                 effect of hierarchical storage organizations on
                 information retrieval operations. The data storage
                 hardware is assumed to consist of n-levels of linearly
                 connected memory hardware with increasing data access
                 times and increasing data storage capabilities. A
                 system might, for example, consist of fast
                 semiconductor memory, computer core memory, extended
                 core storage, disk memory, and data cells. Equations
                 are derived to predict the effect of such a system on
                 data access times using sequential files, random access
                 files, and structured files employing
                 multiple-hierarchical linked lists.",
  acknowledgement = ack-nhfb,
  annote =       "Simple evaluation of record fetch costs using various
                 accessing sequences.",
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  classification = "723; 901",
  corpsource =   "Univ. Minneapolis, MN, USA",
  journalabr =   "Commun ACM",
  keywords =     "analysis; analytic; computer operating systems ---
                 Storage Allocation; data access times; file
                 organisation; files; hierarchical storage; information
                 retrieval; information retrieval systems; linked lists;
                 memory hierarchy; performance evaluation;
                 probabilistic; random access; sequential files;
                 structured files",
  oldlabel =     "Salasin73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Salasin73",
}

@Article{Corneil:1973:MEN,
  author =       "Derek G. Corneil and C. C. Gotlieb and Y. M. Lee",
  title =        "Minimal Event-Node Network of Project Precedence
                 Relations",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "296--298",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:32:46 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#CorneilGL73",
  abstract =     "A procedure for constructing a minimal event-node
                 network to represent a set of precedence relations
                 without parallel activities is presented. A minimal
                 even-node network is an event-node network in which
                 both the number of nodes and the number of arcs are the
                 minima to preserve the given precedence relations.
                 Counterexamples are given to show that the algorithm
                 presented by A. C. Fisher, J. S. Liebman, and G. L.
                 Nemhauser (1968) produces event-node networks which are
                 not minimal. Since our procedure includes the
                 set-covering problem, the time required may grow
                 exponentially with the number of given activities.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7100 (Business and administration)",
  classification = "912",
  corpsource =   "Univ. Toronto, Ont., Canada",
  journalabr =   "Commun ACM",
  keywords =     "event node network; event-node network; management
                 science; management sciences; minimal; minimal
                 event-node network; network analysis; operations
                 research; project precedence relations",
  oldlabel =     "CorneilGL73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CorneilGL73",
}

@Article{Mercer:1973:AGP,
  author =       "Andrew Mercer and Azriel Rosenfeld",
  title =        "An Array Grammar Programming System",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "299--305",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:03:56 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MercerR73",
  abstract =     "A package of Fortran programs has been developed that
                 permits a user to interactively design and test array
                 grammars. The user can control the rule selection
                 procedure in a derivation or parse, using weighted
                 programming matrices; he also has a choice of instance
                 selection schemes (raster, random, parallel). Examples
                 are given involving array languages consisting of
                 simple geometrical patterns, as well as a language of
                 ``neuron pictures.''",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C7430 (Computer engineering)",
  classification = "721; 723",
  corpsource =   "Kappa Systems Inc., Arlington, VA, USA",
  journalabr =   "Commun ACM",
  keywords =     "array grammar; array grammars; automata theory ---
                 Grammars; automatic testing; CAD; computer graphics;
                 computer programming languages; computer-aided design;
                 Fortran programs; grammars; interactively; picture
                 grammars; programming system; test",
  oldlabel =     "MercerR73",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MercerR73",
}

@Article{Reingold:1973:NLM,
  author =       "Edward M. Reingold",
  title =        "A Nonrecursive List Moving Algorithm",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "305--307",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:25 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Reingold73",
  abstract =     "An efficient, nonrecursive algorithm is given for
                 moving any LIST-type list. In particular, the algorithm
                 requires no storage other than the new nodes into which
                 the list is to be moved, and no additional bits per
                 node for marking; the algorithm runs in time
                 proportional to the number of nodes in the list. The
                 original list structure is destroyed as it is moved.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "Univ. Illinois, Urbana-Champaign, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming --- Subroutines; computer
                 programming languages; computer programming languages
                 --- lisp; garbage collection; LISP; list moving; list
                 processing; nonrecursive algorithm; storage
                 management",
  oldlabel =     "Reingold73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Reingold73",
}

@Article{Vos:1973:RAC,
  author =       "H. Vos",
  title =        "Remark on ``{Algorithm 300}: {Coulomb} Wave
                 Functions''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "308--309",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:27:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Vos73",
  note =         "See \cite{Gunn:1967:AAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290D (Functional analysis); C4120 (Functional
                 analysis); C7310 (Mathematics computing)",
  corpsource =   "Vrije Univ., Amsterdam, Netherlands",
  keywords =     "Coulomb wave functions; function evaluation;
                 mathematics; wave functions",
  oldlabel =     "Vos73",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Vos73",
}

@Article{Bayer:1973:M,
  author =       "G. Bayer",
  title =        "Maxflow",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "309--309",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Tech. Univ., Braunschweig, West Germany",
  keywords =     "arcs; flows; input parameters; maxflow; network;
                 network analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bayer:1973:RAM,
  author =       "G. Bayer",
  title =        "Remark on ``{Algorithm 324}: Maxflow''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "309--??",
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:01 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bayer73",
  note =         "See \cite{Bayer:1968:AAM}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Bayer73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bayer73",
}

@Article{Holmgren:1973:RAM,
  author =       "B. Holmgren and D. Obradovi{\'c} and {\AA}. Kolm",
  title =        "Remark on ``{Algorithm 333}: Minit Algorithm for
                 Linear Programming''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "310--310",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:38 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#HolmgrenOK73",
  note =         "See \cite{Salazar:1968:AAM,Obradovic:1973:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "ASEA, Vasteras, Sweden",
  keywords =     "linear programming; minit algorithm",
  oldlabel =     "HolmgrenOK73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HolmgrenOK73",
  xxauthor =     "B. Holmgren and {\AA}. Kolm and D. Obradovi{\'c}",
}

@Article{Obradovic:1973:RAM,
  author =       "D. Obradovi{\'c}",
  title =        "Remark on ``{Algorithm 333}: Minit Algorithm for
                 Linear Programming''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "310--310",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:10:26 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Obradovic73",
  note =         "See \cite{Salazar:1968:AAM,Holmgren:1973:RAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "Boris Kidric Inst. Nuclear Sci., Beograd, Yugoslavia",
  keywords =     "linear programming; mini algorithm",
  oldlabel =     "Obradovic73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Obradovic73",
}

@Article{Howell:1973:RAE,
  author =       "Jo Ann Howell",
  title =        "Remark on ``{Algorithm 406}: Exact Solution of Linear
                 Equations Using Residue Arithmetic''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "311--311",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:10 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Howell73",
  note =         "See \cite{Howell:1971:AAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C5230
                 (Digital arithmetic methods); C7310 (Mathematics
                 computing)",
  corpsource =   "Yale Univ., New Haven, CT, USA",
  keywords =     "digital arithmetic; exact solution; inversion; linear
                 algebra; linear equations; matrix; mixed radix
                 conversion; modulus; prime number; residue arithmetic",
  oldlabel =     "Howell73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Howell73",
}

@Article{Sale:1973:SMP,
  author =       "Arthur H. J. Sale",
  title =        "Remark on ``{Algorithm 408}: {A} Sparse Matrix
                 Package''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "311--311",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:59 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Sale73",
  note =         "See \cite{McNamee:1971:AAS,Lawrence:1973:RAS}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C7310
                 (Mathematics computing)",
  corpsource =   "Univ. Sydney, NSW, Australia",
  keywords =     "algorithm; matrix algebra; sparse matrix package",
  oldlabel =     "Sale73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Sale73",
}

@Article{Wheeler:1973:IEQ,
  author =       "Robert E. Wheeler",
  title =        "Remark on ``{Algorithm 402}: Increasing the Efficiency
                 of {Quicksort}''",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "311--311",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:29:24 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Wheeler73",
  note =         "See \cite{vanEmden:1970:AAI}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "E. I. du Pont Nemours and Co., Wilmington, DE, USA",
  keywords =     "efficiency; quicksort; sorting",
  oldlabel =     "Wheeler73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wheeler73",
}

@Article{Roy:1973:RPR,
  author =       "M. K. Roy",
  title =        "Reflection-free permutations, rosary permutations and
                 adjacent transposition algorithms",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "312--312",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Jadavpur Univ., Calcutta, India",
  keywords =     "adjacent transposition algorithms; combinatorial
                 analysis; combinatorial mathematics; permutation;
                 reflection free; rosary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Roy:1973:RFP,
  author =       "Mohit Kumar Roy",
  title =        "Reflection-Free Permutations, Rosary Permutations, and
                 Adjacent Transposition Algorithms",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "312--313",
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:26 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Roy73",
  acknowledgement = ack-nhfb,
  oldlabel =     "Roy73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Roy73",
}

@Article{McMorrow:1973:CMC,
  author =       "Clyde H. McMorrow",
  title =        "Concerning music and computer composition in
                 computational linguistics",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "313--313",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:03:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#McMorrow73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Eagle Signal Corp., Davenport, IA, USA",
  keywords =     "computational linguistics; computer composition;
                 humanities; music",
  oldlabel =     "McMorrow73",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McMorrow73",
}

@Article{Wexelblat:1973:ACC,
  author =       "Richard L. Wexelblat",
  title =        "Another Comment on Computer Music",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "313--314",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:29:21 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Wexelblat73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7820 (Humanities computing)",
  corpsource =   "Bell Labs., Holmdel, NJ, USA",
  keywords =     "composer; computer music; humanities; musical taste;
                 value judgment",
  oldlabel =     "Wexelblat73",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wexelblat73",
}

@Article{Estell:1973:CPA,
  author =       "Robert G. Estell",
  title =        "A comment on the practical aspects of computer science
                 education",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "314--315",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:38:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Estell73",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  keywords =     "computer science education; curriculum; digital
                 computers; education",
  oldlabel =     "Estell73",
  treatment =    "G General Review; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Estell73",
}

@Article{Fajman:1973:WIT,
  author =       "Roger Fajman and John Borgelt",
  title =        "{WYLBUR}, An Interactive Text Editing and Remote Job
                 Entry System",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "314--322",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:38:31 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/os.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#FajmanB73",
  abstract =     "WYLBUR is a comprehensive system for manipulating all
                 kinds of text, such as computer programs, letters, and
                 manuscripts, using typewriter terminals connected to a
                 computer. It has facilities for remote job entry and
                 retrieval as well as facilities for text alignment and
                 justification. A powerful method for addressing text by
                 content is provided. This paper describes the external
                 appearance of WYLBUR as well as its internal structure.
                 A short description of the major features of ORVYL, a
                 general purpose time-sharing system which operates in
                 conjunction with WYLBUR, is also included.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6150J (Operating
                 systems)",
  classification = "723",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "addressing; computer systems programming; content;
                 content addressing; data entry; data handling; data
                 processing; document preparation; interactive text
                 editing; ORVYL; remote; remote job entry; remote job
                 retrieval; terminal; text editing",
  oldlabel =     "FajmanB73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FajmanB73",
}

@Article{Frailey:1973:PAM,
  author =       "Dennis J. Frailey",
  title =        "A Practical Approach to Managing Resources and
                 Avoiding Deadlocks",
  journal =      j-CACM,
  volume =       "16",
  number =       "5",
  pages =        "323--329",
  month =        may,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:41:13 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Frailey73",
  abstract =     "Resource scheduling and allocation can be expensive
                 with regard to time and space in multiprogramming or
                 time-sharing environments involving large numbers of
                 tasks and resources with conflicting requirements.
                 \par

                 Detection and\slash or prevention of deadlocks can
                 require massive amounts of additional overhead if
                 efficient usage of resources is to be maintained. A
                 resource management program is described which uses
                 linked lists along with other techniques to overcome a
                 large portion of this overhead. The program, which is
                 currently running as part of a large scale general
                 purpose operating system, keeps resources relatively
                 active but does not detect or prevent all deadlocks in
                 its implemented state. Certain changes, which would
                 permit more comprehensive levels of deadlock
                 prevention\slash detection at additional cost, have not
                 been incorporated in the running system due to the
                 infrequency of deadlock situations.",
  acknowledgement = ack-nhfb,
  annote =       "Description of a limited implementation and good
                 overview.",
  classcodes =   "C6150J (Operating systems)",
  classification = "723",
  corpsource =   "Southern Methodist Univ., Dallas, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "(computers); allocation; computer systems programming;
                 deadlock; deadly embrace; file organisation;
                 multiprocessing; multiprogramming; operating systems;
                 resource; resource allocation; resource management;
                 resource scheduling; scheduling; storage allocation;
                 time sharing; time-sharing; time-sharing programs",
  oldlabel =     "Frailey73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Frailey73",
}

@Article{Hamlet:1973:EMR,
  author =       "Richard G. Hamlet",
  title =        "Efficient multiprogramming resource allocation and
                 accounting",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "337--342",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:48:07 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Hamlet73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6150J (Operating
                 systems)",
  corpsource =   "Univ. Maryland, Baltimore, MD, USA",
  keywords =     "accounting; efficient; executive; memory; monitor;
                 multiprogramming; resource allocation; storage
                 allocation",
  oldlabel =     "Hamlet73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hamlet73",
  xxpages =      "337--343",
}

@Article{Gelenbe:1973:MWS,
  author =       "Erol Gelenbe and J. C. A. Boekhorst and J. L. W.
                 Kessels",
  title =        "Minimizing Wasted Space in Partitioned Segmentation",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "343--349",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:34 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Gelenbe73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6150J (Operating
                 systems)",
  corpsource =   "Univ. Michigan, Ann Arbor, MI, USA",
  keywords =     "algorithms; dynamic storage allocation; file
                 organisation; fragmentation; multiple; page sizes;
                 paged virtual memory; partitioned segmentation; storage
                 allocation; storage management; system; wasted space",
  oldlabel =     "Gelenbe73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gelenbe73",
  xxauthor =     "Erol Gelenbe",
  xxauthor =     "E. Gelenbe and J. C. A. Boekhorst and J. L. W.
                 Kessels",
}

@Article{Hill:1973:SPM,
  author =       "J. Carver Hill",
  title =        "Synchronizing processors with memory-content-generated
                 interrupts",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "350--351",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:49:51 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Hill73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  corpsource =   "Univ. California, Livermore, CA, USA",
  keywords =     "associative memories; debugging; interrupts;
                 microprogramming; monitors; multiprocessing programs;
                 multiprocessor; parallel processing; supervisors;
                 synchronisation; synchronizing processors",
  oldlabel =     "Hill73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hill73",
}

@Article{Stone:1973:NOS,
  author =       "Harold S. Stone and Samuel H. Fuller",
  title =        "On the Near-Optimality of the
                 Shortest-Latency-Time-First Drum Scheduling
                 Discipline",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "352--353",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:34 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#StoneF73",
  note =         "Also published in/as: Technical Note No.12, DSL.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "computer systems; drum scheduling discipline; file
                 organisation; latency scheduling; minimal; shortest
                 latency time first; storage allocation; storage
                 management",
  oldlabel =     "StoneF73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/StoneF73",
}

@Article{Stockhausen:1973:AOC,
  author =       "Peter F. Stockhausen",
  title =        "Adapting optimal code generation for arithmetic
                 expressions to the instruction sets available on
                 present-day computers",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "353--354",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:29 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Stockhausen73",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Bell Labs., Murray Hill., NJ, USA",
  keywords =     "arithmetic expressions; codes; digital arithmetic;
                 instruction; optimal code generation; sets",
  oldlabel =     "Stockhausen73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Stockhausen73",
}

@Article{Ling:1973:CGA,
  author =       "Robert F. Ling",
  title =        "A Computer Generated Aid for Cluster Analysis",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "355--361",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:59:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Ling73",
  acknowledgement = ack-nhfb,
  classcodes =   "C5530 (Pattern recognition and computer vision
                 equipment); C5540 (Terminals and graphic displays)",
  corpsource =   "Univ. Chicago, IL, USA",
  keywords =     "cluster analysis; computer aided analysis; computer
                 graphics; factor analysis; hierarchical clustering;
                 numerical taxonomy; pattern; recognition",
  oldlabel =     "Ling73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Ling73",
}

@Article{Shneiderman:1973:ODB,
  author =       "Ben Shneiderman",
  title =        "Optimum Data Base Reorganization Points",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "362--365",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:21:10 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Shneiderman73",
  URL =          "http://dblp.uni-trier.de/db/journals/cacm/Shneiderman73.html",
  acknowledgement = ack-nhfb,
  annote =       "Criteria for file reorganization",
  cdrom =        "CACMs1/CACM16/P362.pdf",
  classcodes =   "C6120 (File organisation)",
  corpsource =   "State Univ. New York, Stony Brook, NY, USA",
  keywords =     "cost per access; data base; file organisation; files;
                 information retrieval; optimum; reorganization;
                 strategies",
  oldlabel =     "Shneiderman73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Shneiderman73",
}

@Article{Strunz:1973:DDT,
  author =       "Horst Strunz",
  title =        "The development of decision tables via parsing of
                 complex decision situations",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "366--369",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:24:51 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Strunz73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Mathematischer Beratungs- and Programmierungsdienst
                 GmbH, Cologne, West Germany",
  keywords =     "decision grid chart; decision tables; development;
                 parsing; problem analysis",
  oldlabel =     "Strunz73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Strunz73",
}

@Article{Bell:1973:TC,
  author =       "James R. Bell",
  title =        "Threaded Code",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "370--372",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:24:22 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bell73",
  abstract =     "The concept of ``threaded code'' is presented as an
                 alternative to machine language code. Hardware and
                 software realizations of it are given. In software it
                 is realized as interpretive code not needing an
                 interpreter. Extensions and optimizations are
                 mentioned.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220 (Computer architecture); C6110 (Systems analysis
                 and programming); C6140B (Machine-oriented languages)",
  corpsource =   "Digital Equipment Corp., Maynard, MA, USA",
  keywords =     "code; compiled code; hardware; interpreter; machine;
                 machine code; machine oriented languages;
                 microprogramming; programming; software; space
                 tradeoff; subroutine calls; threaded code; time
                 tradeoff",
  oldlabel =     "Bell73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bell73",
}

@Article{Hopcroft:1973:AAE,
  author =       "John E. Hopcroft and Robert Endre Tarjan",
  title =        "{ACM Algorithm 447}: Efficient Algorithms for Graph
                 Manipulation [{H}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "372--378",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:48 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#HopcroftT73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Cornell Univ., Ithaca, NY, USA",
  keywords =     "ALGOL; algorithms; graph manipulation; graph theory;
                 mathematics; partitioning; subroutines",
  oldlabel =     "HopcroftT73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HopcroftT73",
}

@Article{Beyer:1973:AAN,
  author =       "Terry Beyer and D. F. Swinehart",
  title =        "{ACM Algorithm 448}: Number of Multiply-Restricted
                 Partitions [{A1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "379--379",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:26:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BeyerS73",
  acknowledgement = ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  corpsource =   "Univ. Oregon, Eugene, OR, USA",
  keywords =     "change making; digital arithmetic; enumeration;
                 FORTRAN; multiply restricted partitions; positive
                 integer; subroutine; subroutines",
  oldlabel =     "BeyerS73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BeyerS73",
}

@Article{Ferguson:1973:LSP,
  author =       "J. Ferguson and P. A. Staley",
  title =        "Least Squares Piecewise Cubic Curve Fitting",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "380--382",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D10",
  MRnumber =     "50 15267",
  MRreviewer =   "Bernard H. Rosman",
  bibdate =      "Mon Jan 22 06:39:23 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#FergusonS73",
  abstract =     "The matrices involved in a linear least squares
                 formulation are determined for the problem of fitting
                 piecewise cubic functions, those possessing a
                 continuous derivative, to arrays of planar data.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Teledyne Ryan Aeronaut. Co., San Diego, CA, USA",
  keywords =     "approximation splines; curve fitting; data; data
                 reduction; data reduction and analysis; function
                 approximation; least; least squares; piecewise cubic;
                 reduction; squares approximations",
  oldlabel =     "FergusonS73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FergusonS73",
}

@Article{Hoskins:1973:CSS,
  author =       "W. D. Hoskins",
  title =        "Cubic spline solutions to fourth-order boundary value
                 problems",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "382--385",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65L10",
  MRnumber =     "58 31861",
  bibdate =      "Mon Jan 22 06:50:58 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Hoskins73",
  abstract =     "The cubic spline approximation to the fourth-order
                 differential equation $y''''+p(x)y''+q(x)y'+r(x)y=t(x)$
                 is shown to reduce to the solution of a five-term
                 recurrence relationship. For some special cases the
                 approximation is shown to be simply related to a finite
                 difference representation with a local truncation error
                 of order $(y/720)\delta^8$.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 B0290P (Differential equations); C4130 (Interpolation
                 and function approximation); C4170 (Differential
                 equations)",
  corpsource =   "Univ. Manitoba, Winnipeg, Man., Canada",
  keywords =     "(mathematics); boundary value problem; boundary value
                 problems; boundary-value problems; cubic spline;
                 differential; differential equations; equations; fourth
                 order; splines",
  oldlabel =     "Hoskins73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoskins73",
}

@Article{Alt:1973:CPT,
  author =       "Franz L. Alt and Judith Yuni Kirk",
  title =        "Computer Photocomposition of Technical Text",
  journal =      j-CACM,
  volume =       "16",
  number =       "6",
  pages =        "386--391",
  month =        jun,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:21:12 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#AltK73",
  note =         "Describes the typesetting system used by the American
                 Institute of Physics.",
  abstract =     "In computer assisted typesetting by means of
                 photocomposition, special problems arise in highly
                 technical material such as mathematical formulas. New
                 solutions to several of these problems have been
                 devised in the information system of the American
                 Institute of Physics. They include: the representation
                 of special characters (foreign alphabets, mathematical
                 symbols, etc.) not available on input keyboards or on
                 the photocomposer; the generation of such symbols, e.g.
                 by overprinting; the precise positioning of accent
                 marks (floating diacritics); line breaks, i.e. words or
                 formulas placed partly at the end of one line and
                 partly at the beginning of the next; and certain
                 aspects of error correction.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7230 (Publishing and reproduction)",
  corpsource =   "American Inst. Phys., New York, NY, USA",
  keywords =     "computer; computer controlled typesetting; graphics;
                 photocomposition; printing; technical text; text
                 processing; typesetting",
  oldlabel =     "AltK73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AltK73",
}

@Article{Nolan:1973:MCR,
  author =       "Richard L. Nolan",
  title =        "Managing the Computer Resource: {A} Stage Hypothesis",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "399--405",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:44 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Nolan73",
  abstract =     "Based on the study of expenditures for data
                 processing, a descriptive stage hypothesis is
                 presented. It is suggested that the planning,
                 organizing, and controlling activities associated with
                 managing the computer resource will change in character
                 over a period of time, and will evolve in patterns
                 roughly correlated to four stages of the computer
                 budget: Stage I (computer acquisition), Stage II
                 (intense system development), Stage III (proliferation
                 of controls), and Stage IV (user\slash service
                 orientation). Each stage is described and related to
                 individual tasks for managing the computer resource.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0310 (EDP management)",
  classification = "723",
  corpsource =   "Harvard Univ. Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer; computer budget; computer expenditures;
                 computer management; computer resource; control; data
                 processing; data processing, business; economics;
                 management; organizing; planning; resource; stage
                 hypothesis",
  oldlabel =     "Nolan73",
  treatment =    "E Economic",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nolan73",
}

@Article{Huang:1973:NIO,
  author =       "J. C. Huang",
  title =        "A Note on Information Organization and Storage",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "406--410",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A50",
  MRnumber =     "55 13900",
  bibdate =      "Mon Jan 22 06:51:15 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Huang73",
  abstract =     "Since the logical structure of a data base can be
                 represented by a tree or graph, it is quite natural for
                 us to view the process of designing a data base as that
                 of constructing a tree or a graph. \par

                 A general method for constructing such a tree or a
                 graph is provided. There are three important elements
                 in this general construction method; namely, a set of
                 binary relations, an algorithm for constructing subsets
                 of a set, and an algorithm for selecting an element
                 from the given set of objects. The use of different
                 relations and algorithms results in different
                 information structures, as list, tree, ring, etc. Thus
                 the problem of information organization and storage is
                 reduced to that of defining relations and formulating
                 algorithms under a given set of constraints. \par

                 The results presented may be valuable to designers as
                 useful design concepts, and may serve as a basis for
                 developing a formal theory on the subject.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723; 901; 921",
  corpsource =   "Univ. Houston, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "(mathematical); data base; data-base management; file
                 organisation; file organization; graph; graph theory;
                 information; information retrieval; information
                 retrieval systems; information structure; management;
                 mathematical techniques --- Graph Theory; storage
                 allocation; structure; tree; trees",
  oldlabel =     "Huang73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Huang73",
}

@Article{Kozdrowicki:1973:CIC,
  author =       "Edward W. Kozdrowicki and Dennis W. Cooper",
  title =        "{COKO III}: the {Cooper-Koz} Chess Program",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "411--427",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:56:03 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#KozdrowickiC73",
  abstract =     "COKO III is a chess player written entirely in
                 Fortran. On the IBM 360-65, COKO III plays a minimal
                 chess game at the rate of. 2 sec cpu time per move,
                 with a level close to lower chess club play. A
                 selective tree searching procedure controlled by
                 tactical chess logistics allows a deployment of
                 multiple minimal game calculations to achieve some
                 optimal move selection. In addition, an interesting
                 phenomenon called a tree searching catastrophe has
                 plagued COKO's entire development just as it troubles a
                 human player. Standard exponential growth is curbed to
                 a large extent by the definition and trimming of the
                 Fischer set. Representation of the chess environment is
                 described along with a strategic preanalysis procedure
                 that maps the Lasker regions. Specific chess algorithms
                 are described which could be used as a command
                 structure by anyone desiring to do some chess program
                 experimentation. A comparison is made of some
                 mysterious actions of human players and COKO III.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C7810 (Social and
                 behavioural sciences computing)",
  classification = "723",
  corpsource =   "Univ. California, Davis, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "artificial intelligence; chess program; COKO III;
                 computer systems programming; FORTRAN; games of skill;
                 heuristic programming; minimal chess game; selective
                 searching; tree searching",
  oldlabel =     "KozdrowickiC73",
  treatment =    "A Application",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KozdrowickiC73",
}

@Article{Howard:1973:MSD,
  author =       "John H. {Howard, Jr.}",
  title =        "Mixed Solutions for the Deadlock Problem",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "427--430",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:04 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Howard73",
  abstract =     "Mixtures of detection, avoidance, and prevention
                 provide more effective and practical solutions to the
                 deadlock problem than any one of these alone. The
                 individual techniques can be tailored for subproblems
                 of resource allocation and still operate together to
                 prevent deadlocks. This paper presents a method, based
                 on the concept of the hierarchical operating system,
                 for constructing appropriate mixtures and suggests
                 appropriate subsystems for the most frequently
                 occurring resource allocation problems.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  classification = "723",
  corpsource =   "Univ. Texas, Austin, TX, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer operating systems; computer systems
                 programming --- Multiprogramming; deadlock problem;
                 deadlocks; hierarchical systems; mixed solutions;
                 multiprogramming; operating systems; operating systems
                 (computers); resource allocation",
  oldlabel =     "Howard73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Howard73",
}

@Article{Gelenbe:1973:DPP,
  author =       "Erol Gelenbe",
  title =        "Distribution of a Program in Primary and Fast Buffer
                 Storage",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "431--434",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:35 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Gelenbe73a",
  abstract =     "A virtual memory computer system with a fast buffer
                 (cache) memory between primary memory and central
                 processing unit is considered. The optimal distribution
                 of a program between the buffer and primary memory is
                 studied using the program's lifetime function.
                 Expressions for the distribution of a program which
                 maximizes the useful fraction of the cost-time integral
                 of primary and fast buffer storage are obtained for
                 swapping and nonswapping buffer management policies.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723",
  journalabr =   "Commun ACM",
  keywords =     "cache; computer systems programming; cost time
                 integral; distribution of a program; fast buffer;
                 function; lifetime; lifetime function; storage; virtual
                 memory; virtual memory computer system; virtual
                 storage",
  oldlabel =     "Gelenbe73a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gelenbe73a",
}

@Article{Rosin:1973:TAP,
  author =       "Robert F. Rosin",
  title =        "Teaching ``About Programming''",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "435--438",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:14 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Rosin73",
  abstract =     "This paper presents the goals and organization of a
                 course about programming designed to provide entering
                 students in a graduate program with a cultural
                 enrichment in their professional lives. The students
                 are expected to have taken at least two programming
                 courses prior to this one and, therefore, to be
                 familiar with at least two programming languages, both
                 as students and users. Teaching someone how to program
                 is similar to teaching him to play a musical
                 instrument: neither skill can be taught-they must be
                 learned. However, the teacher still serves several
                 vital purposes: to present a set of rules for producing
                 well-formed utterances; to offer numerous
                 demonstrations of his own skill; and to function as an
                 involved critic. Finally, the teacher is the source of
                 information about the process in which the student is
                 involved.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training); C6110
                 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "Univ. Aarhus, Denmark",
  journalabr =   "Commun ACM",
  keywords =     "computer systems programming; education;
                 professionalism; programming; programming concepts;
                 teaching",
  oldlabel =     "Rosin73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rosin73",
  xxpages =      "435--439",
}

@Article{McFarlan:1973:CRG,
  author =       "F. Warren McFarlan and Richard L. Nolan",
  title =        "Curriculum Recommendations for Graduate Professional
                 Programs in Information Systems: Recommended Addendum
                 on Information Systems Administration",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "439--441",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:02:49 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#McFarlanN73",
  abstract =     "An addendum to the Report of the ACM Curriculum
                 Committee on Computer Education for Management is
                 proposed. The proposed addendum is to include in the
                 curriculum a course on Information Systems
                 administration. It is important for two reasons: (1)
                 the systems designer must understand the administrative
                 framework in which he must operate to work effectively,
                 and (2) an important objective of the curriculum
                 recommendations is to prepare the future manager of the
                 computer activity. \par

                 It is felt that the importance of these two reasons
                 justifies the addition of the recommended course.
                 \par

                 The course is outlined in the format of the original
                 report.",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training); C0310 (EDP
                 management); C7100 (Business and administration)",
  classification = "723; 901",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "administration; computer management; curriculum
                 recommendations; education; information retrieval
                 systems; information systems; information systems
                 administration; information systems management;
                 management; management information systems",
  oldlabel =     "McFarlanN73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McFarlanN73",
  xxpages =      "439--442",
}

@Article{Kandel:1973:CSS,
  author =       "Abraham Kandel",
  title =        "Computer Science --- Seminars for Undergraduates",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "442--442",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:53:35 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Kandel73",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Computing education and training)",
  corpsource =   "New Mexico Inst. Mining Technol., Soccorro., NM, USA",
  keywords =     "computer science; curriculum; digital computers;
                 education; fuzzy educational structure; imprecise
                 synthesis; seminars; undergraduates",
  oldlabel =     "Kandel73",
  treatment =    "G General Review; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kandel73",
}

@Article{vonBochmann:1973:MEL,
  author =       "Gregor von Bochmann",
  title =        "Multiple Exits from a Loop Without the {GOTO}",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "443--444",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:07 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bochmann73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140 (Programming languages)",
  corpsource =   "Univ. Montreal, Que., Canada",
  keywords =     "control structures; exit statement; from loops; goto
                 free programming; multiple exits; multiple exits from
                 loops; programming languages",
  oldlabel =     "Bochmann73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bochmann73",
}

@Article{Hall:1973:EBA,
  author =       "Patrick A. V. Hall",
  title =        "Equivalence Between {AND\slash OR} Graphs and
                 Context-Free Grammars",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "444--445",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:47:55 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Hall73",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "City Univ., London, UK",
  keywords =     "AND/OR graphs; artificial intelligence; context free
                 grammars; context-free grammars; equivalance; graph
                 theory; language theory",
  oldlabel =     "Hall73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hall73",
}

@Article{Fiala:1973:AAS,
  author =       "Frantisek Fiala",
  title =        "{ACM Algorithm 449}: Solution of Linear Programming
                 Problems in $0$-$1$ Variables [{H1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "445--447",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:27 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Fiala73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "Univ. Alberta, Edmonton, Alta., Canada",
  keywords =     "FORTRAN; linear programming; subroutine; subroutines;
                 zero one programming",
  oldlabel =     "Fiala73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fiala73",
}

@Article{Kernighan:1973:RAM,
  author =       "Brian W. Kernighan",
  title =        "Remark on ``{Algorithm 422: Minimal Spanning Tree}''",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "448--448",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:54:32 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Kernighan73",
  note =         "See \cite{Whitney:1972:AAM}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Bell Telephone Labs. Inc., Murray Hill, NJ, USA",
  keywords =     "minimal spanning tree; Prim algorithm; spanning tree;
                 subroutine; trees (mathematical)",
  oldlabel =     "Kernighan73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Kernighan73",
}

@Article{Macleod:1973:RAH,
  author =       "I. D. G. Macleod and A. M. Collins",
  title =        "Remark on ``{Algorithm 420}: Hidden-Line Plotting
                 Program''",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "448--448",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:44 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MacleodC73",
  note =         "See remark
                 \cite{Williamson:1972:AAH,Ellis:1974:RAHb,Gaither:1974:RAH,Williamson:1973:RAH,Ellis:1974:RAHa}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays); C6130 (Data
                 handling techniques)",
  corpsource =   "Australian Nat. Univ., Canberra, Australia",
  keywords =     "computer graphics; data handling; hidden line; surface
                 plot",
  oldlabel =     "MacleodC73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MacleodC73",
}

@Article{Nikolai:1973:CAD,
  author =       "Paul J. Nikolai",
  title =        "Certification of ``{Algorithm 407}: {DIFSUB} for
                 Solution of Ordinary Differential Equations''",
  journal =      j-CACM,
  volume =       "16",
  number =       "7",
  pages =        "448--448",
  month =        jul,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:09:36 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Nikolai73",
  note =         "See \cite{Gear:1971:AAD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations); C7310 (Mathematics computing)",
  corpsource =   "Wright-Patterson Air Force Base, OH, USA",
  keywords =     "boundary value; certification; differential equations;
                 DIFSUB; ordinary differential equations; problems",
  oldlabel =     "Nikolai73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nikolai73",
}

@Article{Smith:1973:LPW,
  author =       "Michael H. Smith",
  title =        "A Learning Program Which Plays Partnership Dominoes",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "462--467",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:22:38 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Smith73",
  abstract =     "A learning program has been written in BASIC to play
                 four-player partnership dominoes. Because dominoes is a
                 game of incomplete information, the program uses
                 somewhat different principles of artificial
                 intelligence from those used in programs for games of
                 complete information, such as checkers, chess, and go.
                 The program was constructed to use a ``strategy
                 signature table'' which classifies board situations
                 through the interactions of game parameters. Each entry
                 in the table contains adaptively determined weights
                 indicating the advisability of various strategies. Once
                 chosen, a strategy then employs probability analysis
                 and linear polynomial evaluation to choose a move. Our
                 program wins approximately two-thirds of its games in
                 tournament situations, and has defeated championship
                 players.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C7890 (Other special
                 applications of computing)",
  classification = "461; 912",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "artificial intelligence; BASIC; game playing; games of
                 skill; heuristic; intelligence; learning program;
                 learning: heuristic procedures; partnership dominoes;
                 problem; programming; solving; systems science and
                 cybernetics",
  oldlabel =     "Smith73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Smith73",
}

@Article{MacLennan:1973:FAB,
  author =       "B. J. MacLennan",
  title =        "{Fen} --- an Axiomatic Basis for Program Semantics",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "468--474",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05 (02G99)",
  MRnumber =     "51 9561",
  MRreviewer =   "W. D. Maurer",
  bibdate =      "Mon Jan 22 07:00:38 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MacLennan73",
  abstract =     "The notions of data item, function, and relation. It
                 is argued that the system is more suitable than set
                 theory (or its derivatives) for the concise and
                 accurate description of program semantics. It is shown
                 how the system can be used to build composite data
                 types out of simper ones with the operations of rowing,
                 structuring, and uniting. It is also demonstrated that
                 completely new primitive types can be introduced into
                 languages through the mechanism of singleton data
                 types. Both deterministic and nondeterministic
                 functions are shown to be definable in the system.
                 \par

                 It is described how the local environment can be
                 modeled as a data item and how imperative statements
                 can be considered functions on the environment. The
                 nature of recursive functions is briefly discussed, and
                 a technique is presented by which they can be
                 introduced into the system. The technique is contrasted
                 with the use of the paradoxical combinator, Y. The
                 questions of local and global environments and of
                 various modes of function calling and parameter passing
                 are touched upon. The theory is applied to the proof of
                 several elementary theorems concerning the semantics of
                 the assignment, conditional, and iterative statements.
                 An appendix is included which presents in detail the
                 formal system governing webs and fen, the abstractions
                 used informally in the body of the paper.",
  abstract2 =    "A formal system is presented which abstracts the
                 notions of data item, function, and relation. It is
                 shown how the system can be used to build composite
                 data types out of simpler ones with the operations of
                 rowing, structuring, and uniting. It is also
                 demonstrated that completely new primitive types can be
                 introduced into languages through the mechanism of
                 singleton data types. Both deterministic and
                 nondeterministic functions are shown to be definable in
                 the system. It is described how the local environment
                 can be modeled as a data item and how imperative
                 statements can be considered functions on the
                 environment. The nature of recursive functions is
                 briefly discussed, and a technique is presented by
                 which they can be introduced into the system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  classification = "723",
  corpsource =   "Florida State Univ., Tallahassee, FL, USA",
  journalabr =   "Commun ACM",
  keywords =     "axioms; computer metatheory; correctness; data; data
                 structures; data types; definition; description
                 languages; extensible languages; fen; formal
                 description; formal language; formal language
                 definition; formal languages; formal systems;
                 lambda-calculus; models of computation; modes;
                 semantics; types",
  oldlabel =     "MacLennan73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MacLennan73",
}

@Article{Misunas:1973:PNS,
  author =       "David Misunas",
  title =        "{Petri} Nets and Speed Independent Design",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "474--481",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:04:42 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/async.circuits.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Misunas73",
  abstract =     "Petri nets are investigated as one method of modeling
                 speed independent asynchronous circuits. A study of
                 circuit realization of Petri nets leads to a
                 demonstration of their usefulness in modeling speed
                 independent operation. This usefulness is emphasized by
                 the design of a speed independent processor from
                 modules developed in the investigation of Petri net
                 implementation.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4230D (Sequential switching theory); C5210 (Logic
                 design methods)",
  classification = "721; 723",
  corpsource =   "MIT, Cambridge, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "asynchronous circuits; asynchronous sequential logic;
                 design; logic design; Petri nets; speed independent",
  oldlabel =     "Misunas73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Misunas73",
}

@Article{Machura:1973:AAR,
  author =       "Marek Machura and Andrzej Mulawa",
  title =        "{ACM Algorithm 450}: {Rosenbrock} Function
                 Minimization [{E4}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "482--483",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:40 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MachuraM73",
  note =         "See remarks
                 \cite{Bultheel:1974:RAR,Klemes:1974:RAR,Ellis:1974:RAHa,Davies:1976:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "Inst. Automation and Measurements, Warsaw, Poland",
  keywords =     "direct search; FORTRAN; function minimization;
                 minimisation; Rosenbrock; subroutine; subroutines;
                 unconstrained problem",
  oldlabel =     "MachuraM73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MachuraM73",
}

@Article{Goldstein:1973:AAC,
  author =       "Richard B. Goldstein",
  title =        "{ACM Algorithm 451}: Chi-Square Quantiles [{G1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "483--485",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:45:14 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Goldstein73",
  note =         "See certification \cite{Knight:1975:CAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Providence Coll., RI, USA",
  keywords =     "Chi square quantiles; probability; statistic;
                 statistics; subroutines",
  oldlabel =     "Goldstein73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Goldstein73",
}

@Article{Liu:1973:AAE,
  author =       "C. N. Liu and D. T. Tang",
  title =        "{ACM Algorithm 452}: Enumerating Combinations of $m$
                 Out of $n$ Objects [{G6}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "485--485",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:59:30 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#LiuT73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  keywords =     "combinations; FORTRAN; NXCBN; permutations;
                 statistics; subroutines",
  oldlabel =     "LiuT73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/LiuT73",
}

@Article{Piessens:1973:AAG,
  author =       "Robert Piessens",
  title =        "{ACM Algorithm 453}: {Gaussian} Quadrature Formulas
                 for {Bromwich}'s Integral [{D1}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "486--487",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:12:42 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Piessens73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290M (Numerical integration and differentiation);
                 C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Univ. Leuven, Heverlee, Belgium",
  keywords =     "BROMIN; Bromwich's integral; complex; FORTRAN;
                 Gaussian quadrature formulas; integration; Laplace
                 transform; Laplace transforms; numerical inversion;
                 subroutines",
  oldlabel =     "Piessens73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Piessens73",
}

@Article{Richardson:1973:AAC,
  author =       "Joel A. Richardson and J. L. Kuester",
  title =        "{ACM Algorithm 454}: The Complex Method for
                 Constrained Optimization [{E4}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "487--489",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:15:55 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#RichardsonK73",
  note =         "See remark \cite{Shere:1974:RAC}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C7310 (Mathematics computing)",
  corpsource =   "Arizona State Univ., Tempe, AZ, USA",
  keywords =     "Box's algorithm; complex method; constrained
                 optimization; FORTRAN; maximum; multivariable;
                 nonlinear function; optimisation; subroutines",
  oldlabel =     "RichardsonK73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RichardsonK73",
}

@Article{Andrejkova:1973:RCA,
  author =       "G. Andrejkova and J. Vinar",
  title =        "Remark and Certification on ``{Algorithm 404}: Complex
                 Gamma Function''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "489--489",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:21:31 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#AndrejkovaV73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Safarik Univ., Kosice, Czechoslovakia",
  keywords =     "algorithm; certification; comment; complex gamma
                 function; functions",
  oldlabel =     "AndrejkovaV73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AndrejkovaV73",
}

@Article{DeMorgan:1973:RAE,
  author =       "Richard M. {De Morgan}",
  title =        "Remark on ``{Algorithm 357: An Efficient Prime Number
                 Generator [A1]}''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "489--489",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:05:55 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Morgan73",
  note =         "See \cite{Singleton:1969:AAEb}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Digital Equipment Co. Ltd., Reading, UK",
  keywords =     "algorithm; mathematics; prime number generator",
  oldlabel =     "Morgan73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Morgan73",
}

@Article{Watkins:1973:RAG,
  author =       "Richard P. Watkins",
  title =        "Remark on ``{Algorithm 412}: Graph Plotter''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "489--490",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:28:26 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Watkins73",
  note =         "See \cite{Cermak:1971:AAG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays); C6130 (Data
                 handling techniques)",
  corpsource =   "Royal Melbourne Inst. Technol., Vic., Australia",
  keywords =     "algorithm; computer graphics; graph plotter;
                 plotters",
  oldlabel =     "Watkins73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Watkins73",
}

@Article{Byrne:1973:HMR,
  author =       "J. G. Byrne",
  title =        "{Hu-Tucker} minimum redundancy alphabetic coding
                 method",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "490--490",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Trinity Coll., Dublin, Ireland",
  keywords =     "algorithm; alphabetic coding method; encoding; Hu;
                 minimum redundancy; Tucker",
  treatment =    "P Practical",
}

@Article{Good:1973:CQ,
  author =       "A. J. Good",
  title =        "{Clenshaw--Curtis} quadrature",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "490--490",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290M (Numerical integration and differentiation);
                 C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Systems, Sci. and Software, La Jolla, CA, USA",
  keywords =     "algorithm; Clenshaw Curtis quadrature; integration",
  treatment =    "P Practical",
}

@Article{Williams:1973:RAL,
  author =       "Edward J. Williams",
  title =        "Remark on ``{Algorithm 429}: Localization of the Roots
                 of a Polynomial''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "490--490",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Williams73a",
  note =         "See \cite{Squire:1972:AAL,Driessen:1973:RAL}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C7310
                 (Mathematics computing)",
  corpsource =   "Ford Motor Co., Dearborn, MI, USA",
  keywords =     "algorithm; localization; polynomials; roots of a
                 polynomial",
  oldlabel =     "Williams73a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Williams73a",
}

@Article{Byrne:1973:RAH,
  author =       "J. G. Byrne",
  title =        "Remark on ``{Algorithm 428}: {Hu-Tucker} Minimum
                 Redundancy Alphabetic Coding Method''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "490--??",
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:29:11 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Byrne73",
  note =         "See \cite{Yohe:1972:AAH}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Byrne73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Byrne73",
}

@Article{Good:1973:RAC,
  author =       "Albert J. Good",
  title =        "Remark on ``{Algorithm 424}: {Clenshaw--Curtis}
                 Quadrature''",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "490--??",
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:45:23 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Good73",
  note =         "See \cite{Gentleman:1972:AAC}.",
  acknowledgement = ack-nhfb,
  oldlabel =     "Good73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Good73",
}

@Article{Manna:1973:IMP,
  author =       "Zohar Manna and Stephen Ness and Jean Vuillemin",
  title =        "Inductive Methods for Proving Properties of Programs",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "491--502",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05",
  MRnumber =     "51 2331",
  MRreviewer =   "W. D. Maurer",
  bibdate =      "Mon Jan 22 07:01:27 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MannaNV73",
  abstract =     "There are two main purposes in this paper: first,
                 clarification and extension of known results about
                 computation of recursive programs, with emphasis on the
                 difference between the theoretical and practical
                 approaches; second, presentation and examination of
                 various known methods for proving properties of
                 recursive programs. Discussed in detail are two
                 powerful inductive methods, computational induction and
                 structural induction, including examples of their
                 application.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Stanford Univ., CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computability and decidability; computation induction;
                 computer metatheory; inductive methods; least
                 fixedpoint; programming theory; properties of programs;
                 proving; recursive programs; structural induction",
  oldlabel =     "MannaNV73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MannaNV73",
  xxauthor =     "Zohar Manna and Stephen Nes and Jean Vuillemin",
}

@Article{Peterson:1973:CWR,
  author =       "W. W. Peterson and Tadao Kasami and Nobuki Tokura",
  title =        "On the Capabilities of While, Repeat, and Exit
                 Statements",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "503--512",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A05",
  MRnumber =     "51 4707",
  MRreviewer =   "J. E. L. Peck",
  bibdate =      "Mon Jan 22 07:12:24 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#PetersonKT73",
  abstract =     "A well-formed program is defined as a program in which
                 loops and if statements are properly nested and can be
                 entered only at their beginning. A corresponding
                 definition is given for a well-formed flowchart. It is
                 shown that a program is well formed if and only if it
                 can be written with if, repeat, and multi-level exit
                 statements for sequence control. It is also shown that
                 if, while, and repeat statements with single-level exit
                 do not suffice. It is also shown that any flowchart can
                 be converted to a well-formed flowchart by node
                 splitting. Practical implications are discussed.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723",
  corpsource =   "Univ. Hawaii, Honolulu, HI, USA",
  journalabr =   "Commun ACM",
  keywords =     "capabilities; computer metatheory; exit; exit
                 statement; flowchart; go to statement; node splitting;
                 programming theory; repeat statement; software
                 reliability; statement; well formed program;
                 well-formed program; while statement",
  oldlabel =     "PetersonKT73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/PetersonKT73",
}

@Article{Foster:1973:GAT,
  author =       "Caxton C. Foster",
  title =        "A Generalization of {AVL} Trees",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "513--517",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:40:15 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Foster73",
  abstract =     "A generalization of AVL trees is proposed in which
                 imbalances up to (triangle shape) is a small integer.
                 An experiment is performed to compare these trees with
                 standard AVL trees and with balanced trees on the basis
                 of mean retrieval time, of amount of restructuring
                 expected, and on the worst case of retrieval time. It
                 is shown that, by permitting imbalances of up to five
                 units, the retrieval time is increased a small amount
                 while the amount of restructuring required is decreased
                 by a factor of ten. \par

                 A few theoretical results are derived, including the
                 correction of an earlier paper, and are duly compared
                 with the experimental data. Reasonably good
                 correspondence is found.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6120 (File organisation)",
  classification = "723; 901",
  corpsource =   "Univ. Massachusetts, Amherst, MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "AVL trees; balanced trees; file organisation;
                 generalisation; information retrieval systems;
                 information storage and; information storage and
                 retrieval; retrieval; trees (mathematical)",
  oldlabel =     "Foster73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Foster73",
}

@Article{Buzen:1973:CAC,
  author =       "Jeffrey P. Buzen",
  title =        "Computational Algorithms for Closed Queueing Networks
                 with Exponential Servers",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "527--531",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "68A10",
  MRnumber =     "50 15423",
  bibdate =      "Mon Jan 22 06:29:10 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Buzen73",
  abstract =     "Methods are presented for computing the equilibrium
                 distribution of customers in closed queueing networks
                 with exponential servers. Expressions for various
                 marginal distributions are also derived. The
                 computational algorithms are based on two-dimensional
                 iterative techniques which are highly efficient and
                 quite simple to implement. Implementation
                 considerations such as storage allocation strategies
                 and order of evaluation are examined in some detail.",
  acknowledgement = ack-nhfb,
  annote =       "Methods are presented for computing the equilibrium
                 distribution of customers in closed queueing networks
                 with exponential servers. Expressions for various
                 marginal distributions are also derived.",
  classcodes =   "B0240C (Queueing theory); C1140C (Queueing theory)",
  classification = "912; 922",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  country =      "USA",
  date =         "14/12/79",
  descriptors =  "Exponential queueing network; number of elements in
                 system; method;",
  enum =         "483",
  journalabr =   "Commun ACM",
  keywords =     "closed queueing networks; computational algorithms;
                 distributions; equilibrium distributions; exponential
                 servers; operations research; probability; queueing
                 networks; queueing theory; steady state",
  language =     "English",
  oldlabel =     "Buzen73",
  references =   "6",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Buzen73",
}

@Article{Ganapathy:1973:ITA,
  author =       "S. Ganapathy and V. Rajaraman",
  title =        "Information Theory Applied to the Conversion of
                 Decision Tables to Computer Programs",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "532--539",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:04 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/inductive.inference.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#GanapathyR73",
  abstract =     "Using ideas from information theory, this paper
                 develops a heuristic algorithm that converts a limited
                 entry decision table to a tree structured computer
                 program with near minimum average processing time. The
                 method is applicable to any limited entry decision
                 table and does not require that actions have single
                 rules or that the cost of testing conditions be equal.
                 It is thus more general than the previously published
                 heuristic algorithms. Compared to the optimal algorithm
                 of Reinwald and Soland, this algorithm is easy to code
                 and takes a much smaller translation time; it is thus
                 felt that it is more useful in practice. The algorithm
                 is well suited for manual conversion of decision tables
                 to flowcharts.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  classification = "723; 731; 922",
  corpsource =   "Indian Inst. Technol., New Delhi, India",
  journalabr =   "Commun ACM",
  keywords =     "computer; computer systems programming --- Decision
                 Tables; conversion; decision tables; decision theory
                 and analysis; information measure; information theory;
                 optimum computer programs; programming theory;
                 programs",
  oldlabel =     "GanapathyR73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GanapathyR73",
}

@Article{Cardenas:1973:ESF,
  author =       "Alfonso F. Cardenas",
  title =        "Evaluation and Selection of File Organization --- {A}
                 Model and System",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "540--548",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:29:33 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Cardenas73",
  abstract =     "This work first discusses the factors that affect file
                 (data base) organization performance, an elusive
                 subject, and then presents a methodology, a model and a
                 programmed system to estimate primarily total storage
                 costs and average access time of several file
                 organizations, given a specific data base, query
                 characterization and device-related specifications.
                 Based on these estimates, an appropriate file structure
                 may be selected for the specific situation. The system
                 is a convenient tool to study file structures and to
                 facilitate as much as possible the process of data base
                 structure design and evaluation.",
  acknowledgement = ack-nhfb,
  annote =       "Tree, indexed, and ring files compared for six files
                 and various retrieval requests.",
  classcodes =   "C6120 (File organisation)",
  classification = "723",
  corpsource =   "Univ. California, Los Angeles, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "access time; data base; data management; data
                 processing; data structures; design; evaluation; file
                 management; file organisation; file organization; file
                 structures; model; selection; simulation; storage
                 requirement",
  oldlabel =     "Cardenas73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Cardenas73",
  xxtitle =      "Evaluation and Selection of File Organization --- {A}
                 Model and a System",
}

@Article{Casey:1973:DTS,
  author =       "Richard G. Casey",
  title =        "Design of Tree Structures for Efficient Querying",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "549--556",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:29:57 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Casey73",
  abstract =     "This paper poses an optimization problem in the design
                 of such trees to serve a well-specified application.
                 The problem is academic in the sense that ordinarily
                 the optimal tree cannot be implemented by means of
                 practical techniques. On the other hand, it is
                 potentially useful for the comparison it affords
                 between observed performance and that of an intuitively
                 attractive ideal search procedure. As a practical
                 application of such a model this paper considers the
                 design of a novel tree search scheme based on a bit
                 vector representation of data and shows that
                 essentially the same algorithm can be used to design
                 either an ideal search tree or a bit-vector tree. An
                 experimental study of a small formatted file
                 illustrates the concepts.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  classification = "723; 901",
  corpsource =   "IBM, San Jose, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "clustering; data; data structure; data structures;
                 design; file organisation; information retrieval;
                 information retrieval systems; information storage;
                 information storage and; management; querying;
                 retrieval; search; tree file; tree structures",
  oldlabel =     "Casey73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Casey73",
}

@Article{Rodriguez-Rosell:1973:EWS,
  author =       "Juan Rodriguez-Rosell",
  title =        "Empirical Working Set Behavior",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "556--560",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:47 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Rodriguez-Rosell73",
  abstract =     "The working set model for program behavior has been
                 proposed in recent years as a basis for the design of
                 scheduling and paging algorithms. Although the words
                 ``working set'' are now commonly encountered in the
                 literature dealing with resource allocation, there is a
                 dearth of published data on program working set
                 behavior. It is the purpose of this paper to present
                 empirical data from actual program measurements, in the
                 hope that workers in the field might find experimental
                 evidence upon which to substantiate and base
                 theoretical work.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6150J (Operating
                 systems)",
  classification = "723",
  corpsource =   "Royal Inst. Technol., Stockholm, Sweden",
  journalabr =   "Commun ACM",
  keywords =     "computer metatheory; measurement; operating systems
                 (computers); paging; program behaviour; scheduling;
                 software; software measurement; virtual memory; virtual
                 storage; working set",
  oldlabel =     "Rodriguez-Rosell73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rodriguez-Rosell73",
}

@Article{Gates:1973:STS,
  author =       "Geoffrey W. Gates and David A. Poplawski",
  title =        "A Simple Technique for Structured Variable Lookup",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "561--565",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:43:20 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#GatesP73",
  abstract =     "A simple technique for the symbol-table lookup of
                 structured variables based on simple automata theory is
                 presented. The technique offers a deterministic
                 solution to a problem which is currently handled in a
                 nondeterministic manner in PL/I and COBOL compilers.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  classification = "723",
  corpsource =   "Michigan State Univ., East Lansing, MI, USA",
  journalabr =   "Commun ACM",
  keywords =     "automata theory; COBOL; computer programming
                 languages; computer systems programming; deterministic;
                 PL/1; PL/I; structured variable; table lookup",
  oldlabel =     "GatesP73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/GatesP73",
}

@Article{Zelkowitz:1973:RE,
  author =       "Marvin V. Zelkowitz",
  title =        "Reversible Execution",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "566--566",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:31:38 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/debug.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Zelkowitz73",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Univ. Maryland, Baltimore, MD, USA",
  keywords =     "backtracking; computer program; debugging; PL/I;
                 program debugging; programming language; programming
                 languages; reversible execution",
  oldlabel =     "Zelkowitz73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Zelkowitz73",
}

@Article{Barnhill:1973:SKC,
  author =       "Robert E. Barnhill and David T. Pilcher",
  title =        "{Sard} kernels for certain bivariate cubatures",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "567--570",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  MRclass =      "65D30",
  MRnumber =     "52 2150",
  MRreviewer =   "P. Brock",
  bibdate =      "Mon Jan 22 06:23:28 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BarnhillP73",
  abstract =     "An error analysis for some bivariate cubatures is
                 given. The remainders are obtained by the use of Sard
                 kernels. Numerical results and computer graphs are
                 given for some of the kernel functions.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290B (Error analysis in numerical methods); B0290M
                 (Numerical integration and differentiation); C4110
                 (Error analysis in numerical methods); C4160 (Numerical
                 integration and differentiation)",
  classification = "921",
  corpsource =   "Univ. Utah, Salt Lake City, UT, USA",
  journalabr =   "Commun ACM",
  keywords =     "bivariate cubatures; cubatures; error analysis;
                 integration; mathematical techniques; numerical
                 integration; numerical methods; remainder formulas;
                 Sard kernels",
  oldlabel =     "BarnhillP73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BarnhillP73",
}

@Article{Hunter:1973:AAA,
  author =       "D. B. Hunter and Julia M. Williams",
  title =        "{ACM Algorithm 455}: Analysis of Skew Representations
                 of the Symmetric Group",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "571--572",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:51:28 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#HunterW73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Bradford, UK",
  keywords =     "ALGOL; analysis; binary model; group theory; lattice;
                 outer product; permutation; skew representations;
                 subroutines; symmetric group",
  oldlabel =     "HunterW73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/HunterW73",
}

@Article{Fencl:1973:AAR,
  author =       "Zden{\v{e}}k Fencl",
  title =        "{ACM Algorithm 456}: Routing Problem",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "572--574",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:39:17 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Fencl73",
  note =         "See remark \cite{Tesch:1974:RAR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "RCA, Marlborough, MA, USA",
  keywords =     "FORTRAN; graph theory; Hamiltonian circuit;
                 optimisation; routing problem; shortest path;
                 subroutines; travelling salesman problem",
  oldlabel =     "Fencl73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fencl73",
}

@Article{Bron:1973:AAF,
  author =       "Coen Bron and Joep Kerbosch",
  title =        "{ACM Algorithm 457}: Finding All Cliques of an
                 Undirected Graph",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "575--577",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:12 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib
                 and
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/clique.color.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BronK73",
  acknowledgement = ack-nhfb,
  annote =       "An implicit enumeration algorithm for listing all
                 cliques in a graph. Includes easily translated code.",
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Technol. Univ., Eindhoven, Netherlands",
  keywords =     "ALGOL; backtracking algorithm; branch and bound
                 technique; cliques; clusters; fgraph coloring related
                 clique backtracking branch and bound; graph theory;
                 maximal complete; recursion; subgraph; subroutines;
                 undirected graph",
  oldlabel =     "BronK73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BronK73",
}

@Article{Roy:1973:RAG,
  author =       "Mohit Kumar Roy",
  title =        "Remark on ``{Algorithm 323}: Generation of
                 Permutations in Lexicographic Order [{G6}]''",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "577--578",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:17:27 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Roy73a",
  note =         "See \cite{Ord-Smith:1968:AAG,Leitch:1969:CGP}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Jadavpur Univ., Calcutta, India",
  keywords =     "algorithm; generation; lexicographic order;
                 permutations; statistics",
  oldlabel =     "Roy73a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Roy73a",
}

@Article{Lawrence:1973:RAS,
  author =       "E. E. Lawrence",
  title =        "Remark on ``{Algorithm 408}: {A} Sparse Matrix
                 Package''",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "578--578",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:57:55 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Lawrence73",
  note =         "See \cite{McNamee:1971:AAS,Sale:1973:SMP}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C7310
                 (Mathematics computing)",
  corpsource =   "Mullard Ltd., Mitcham, UK",
  keywords =     "algorithm; matrix algebra; sparse matrix package",
  oldlabel =     "Lawrence73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lawrence73",
}

@Article{Williamson:1973:RAH,
  author =       "Hugh Williamson",
  title =        "Remark on ``{Algorithm 420}: Hidden-Line Plotting
                 Program''",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "578--579",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:30:15 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Williamson73",
  note =         "See
                 \cite{Williamson:1972:AAH,Macleod:1973:RAH,Ellis:1974:RAHa,Ellis:1974:RAHb,Gaither:1974:RAH}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays); C6130 (Data
                 handling techniques)",
  corpsource =   "Nat. Con-Serv. Inc., Austin, TX, USA",
  keywords =     "algorithm; computer graphics; data handling; hidden
                 line plotting; program",
  oldlabel =     "Williamson73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Williamson73",
}

@Article{Driessen:1973:RAL,
  author =       "H. B. Driessen and E. W. LeM. Hunt",
  title =        "Remark on ``{Algorithm 429: Localization of the Roots
                 of a Polynomial}''",
  journal =      j-CACM,
  volume =       "16",
  number =       "9",
  pages =        "579--579",
  month =        sep,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:36:46 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#DriessenH73",
  note =         "See \cite{Squire:1972:AAL,Williams:1973:RAL}.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C7310
                 (Mathematics computing)",
  corpsource =   "Supreme Headquarters Allied Powers Europe, The Hague,
                 Netherlands",
  keywords =     "algorithm; localization; polynomial; polynomials;
                 roots",
  oldlabel =     "DriessenH73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/DriessenH73",
}

@Article{McGeachie:1973:MTU,
  author =       "John S. McGeachie",
  title =        "Multiple Terminals Under User Program Control in a
                 Time-Sharing Environment",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "587--590",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:02:50 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#McGeachie73",
  abstract =     "User-written programs on the Dartmouth Time-Sharing
                 System can communicate with many remote terminals
                 simultaneously and can control the interactions between
                 these terminals. Such programs can be written using
                 standard input and output instructions in any language
                 available on the system. This paper describes how this
                 multiple-terminal facility was implemented without
                 requiring any changes in the system executive or in any
                 of the system's compilers or interpreters.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150J (Operating systems)",
  classification = "722",
  corpsource =   "Dartmouth Coll., Hanover, NH, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer systems, digital; multiple terminals; on-line
                 interaction; remote consoles; time sharing;
                 time-sharing programs; user program control",
  oldlabel =     "McGeachie73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McGeachie73",
}

@Article{Bobrow:1973:MSI,
  author =       "Daniel G. Bobrow and Ben Wegbreit",
  title =        "A Model and Stack Implementation of Multiple
                 Environments",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "591--603",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:27:06 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BobrowW73",
  abstract =     "This paper presents an implementation technique using
                 a single stack to hold procedure activation storage
                 which allows retention of that storage for durations
                 not necessarily tied to control flow. The technique has
                 the property that, in the simple case, it runs
                 identically to the usual automatic stack allocation and
                 deallocation procedure. Applications of this technique
                 to multitasking, coroutines, backtracking, label-valued
                 variables, and functional arguments are discussed. In
                 the initial model, a single real processor is assumed,
                 and the implementation assumes multiple-processes
                 coordinate by passing control explicitly to one
                 another.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming); C6120 (File
                 organisation)",
  classification = "723",
  corpsource =   "Xerox Palo Alto Res. Center, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer programming; control; coroutines; dendrarchy;
                 dynamic; funarg problem; label-valued variables; model;
                 multiple environments; multiprocessing programs;
                 multiprocessor; multitasking; programming; retention;
                 stack allocation; stack implementation; storage
                 allocation; structures; systems",
  oldlabel =     "BobrowW73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BobrowW73",
}

@Article{Lum:1973:GPA,
  author =       "Vincent Y. Lum",
  title =        "General Performance Analysis of Key-to-Address
                 Transformation Methods Using an Abstract File Concept",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "603--612",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:00:15 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Lum73",
  abstract =     "This paper presents a new approach to the analysis of
                 performance of the various key-to-address
                 transformation methods. In this approach the keys in a
                 file are assumed to have been selected from the key
                 space according to a certain probabilistic selection
                 algorithm. All files with the same number of keys
                 selected from this key space will be suitably weighted
                 in accordance with the algorithm, and the average
                 performance of the transformation methods on these
                 files will be used as the potential of these methods.
                 Using this analysis, methods with the same overall
                 performance can be classified and key distributions
                 partial to certain transformations can be identified.
                 All this can be done analytically. The approach is
                 applied to a group of transformation methods using
                 files whose keys are selected randomly.",
  acknowledgement = ack-nhfb,
  annote =       "analysis and results using distributions from the
                 entire key domain.",
  classcodes =   "C6120 (File organisation)",
  classification = "723; 901",
  corpsource =   "IBM Res. Lab., San Jose, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "abstract file concept; access; direct addressing; file
                 organisation; hashing; information retrieval systems;
                 key to address transformation; performance analysis;
                 random; scatter storage; storage management",
  oldlabel =     "Lum73",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lum73",
}

@Article{Lampson:1973:NCP,
  author =       "Butler W. Lampson",
  title =        "A Note on the Confinement Problem",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "613--615",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:57:21 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Lampson73",
  abstract =     "This note explores the problem of confining a program
                 during its execution so that it cannot transmit
                 information to any other program except its caller. A
                 set of examples attempts to stake out the boundaries of
                 the problem. Necessary conditions for a solution are
                 stated and informally justified.",
  acknowledgement = ack-nhfb,
  annote =       "Prevention of privacy leaks between programs.",
  classcodes =   "C6130 (Data handling techniques); C6150J (Operating
                 systems)",
  classification = "723",
  corpsource =   "Xerox Palo Alto Res. Center, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer systems programming; confinement; leakage of
                 data; operating systems (computers); privacy;
                 proprietary program; protection; security; security of
                 data",
  oldlabel =     "Lampson73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lampson73",
}

@Article{Hirschberg:1973:CDM,
  author =       "Daniel S. Hirschberg",
  title =        "A Class of Dynamic Memory Allocation Algorithms",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "615--618",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:50:09 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Hirschberg73",
  abstract =     "A new dynamic memory allocation algorithm, the
                 Fibonacci system, is introduced. This algorithm is
                 similar to, but seems to have certain advantages over,
                 the ``buddy'' system. A generalization is mentioned
                 which includes both of these systems as special
                 cases.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  classification = "723",
  corpsource =   "Princeton Univ., NJ, USA",
  journalabr =   "Commun ACM",
  keywords =     "buddy system; computer operating systems; dynamic
                 memory allocation algorithms; dynamic storage
                 allocation; Fibonacci; Fibonacci system; fragmentation;
                 simulation; storage allocation",
  oldlabel =     "Hirschberg73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hirschberg73",
}

@Article{Prieve:1973:UPR,
  author =       "Barton G. Prieve",
  title =        "Using Page Residency to Select the Working Set
                 Parameter",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "619--620",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:13:58 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Prieve73",
  abstract =     "Denning's method for selecting the working set
                 parameter, which uses interreference intervals, is
                 examined. Several omissions in his model are noted, and
                 new assumptions are introduced to overcome these
                 omissions. Using this modified model, Denning's results
                 on page residency are rederived and reconsidered for
                 selecting the working set parameter.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6120 (File
                 organisation)",
  classification = "723",
  corpsource =   "Bell Telephone Labs., Inc., Naperville, IL, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer operating systems; page residency; program
                 behaviour; programming theory; virtual storage; working
                 set parameter",
  oldlabel =     "Prieve73",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Prieve73",
}

@Article{Millstein:1973:CSI,
  author =       "Robert E. Millstein",
  title =        "Control Structures in {Illiac IV Fortran}",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "621--627",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:04:30 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Millstein73",
  abstract =     "As part of an effort to design and implement a Fortran
                 compiler on the ILLIAC IV, an extended Fortran, called
                 IVTRAN, has been developed. This language provides a
                 means of expressing data and control structures
                 suitable for exploiting ILLIAC IV parallelism.
                 \par

                 This paper reviews the hardware characteristics of the
                 ILLIAC and singles out unconventional features which
                 could be expected to influence language (and compiler)
                 design. The implications of these features for data
                 layout and algorithm structure are discussed, and the
                 conclusion is drawn that data allocation rather than
                 code structuring is the crucial ILLIAC optimization
                 problem. A satisfactory method of data allocation is
                 then presented. Language structures to utilize this
                 storage method and express parallel algorithms are
                 described.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  classification = "723",
  corpsource =   "Massachusetts Computer Associates, Inc., Wakefield,
                 MA, USA",
  journalabr =   "Commun ACM",
  keywords =     "array allocation; array processing; computer
                 programming languages; control structures; explicit
                 parallelism; FORTRAN; ILLIAC IV; ILLIAC IV Fortran;
                 parallel control; parallel control structures; parallel
                 processing; parallelism detection; procedure oriented
                 languages; program compilers; structures",
  oldlabel =     "Millstein73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Millstein73",
}

@Article{Mifsud:1973:AMP,
  author =       "Charles J. Mifsud and Michael J. Bohlen",
  title =        "Addendum to a Multiple-Precision Division Algorithm",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "628--??",
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:04:18 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#MifsudB73",
  acknowledgement = ack-nhfb,
  oldlabel =     "MifsudB73",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/MifsudB73",
}

@Article{Robers:1973:AAD,
  author =       "P. D. Robers and S. S. Robers",
  title =        "{ACM Algorithm 458}: Discrete Linear ${L}_1$
                 Approximation by Interval Linear Programming [{E2}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "629--631",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:16:25 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#RobersR73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); B0290F (Interpolation
                 and function approximation); C1180 (Optimisation
                 techniques); C4130 (Interpolation and function
                 approximation); C7310 (Mathematics computing)",
  corpsource =   "Ernst and Ernst, Washington, DC, USA",
  keywords =     "discrete linear; FORTRAN; function approximation;
                 interval linear programming; L/sub 1/ approximation;
                 linear programming; suboptimisation method; subroutine;
                 subroutines",
  oldlabel =     "RobersR73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobersR73",
}

@Article{Syslo:1973:AAE,
  author =       "Maciej M. Syslo",
  title =        "{ACM Algorithm 459}: The Elementary Circuits of a
                 Graph [{H}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "632--633",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:25:13 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Syslo73",
  note =         "See remark \cite{Syslo:1975:RAE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. Wroclaw, Poland",
  keywords =     "ALGOL; elementary circuits; graph; graph theory; path
                 search algorithm; subroutines",
  oldlabel =     "Syslo73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Syslo73",
}

@Article{Saylor:1973:AAC,
  author =       "Paul E. Saylor and James D. Sebastian",
  title =        "{ACM Algorithm 460}: Calculation of Optimum Parameters
                 for Alternating Direction Implicit Procedures [{D3}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "633--635",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 07:19:09 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#SaylorS73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations); C7310 (Mathematics computing)",
  corpsource =   "Univ. Illinois, Urbana, IL, USA",
  keywords =     "alternating direction implicit; differential
                 equations; elliptic difference; equations; FORTRAN;
                 optimum parameters; procedures; simultaneous equations;
                 subroutine; subroutines",
  oldlabel =     "SaylorS73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SaylorS73",
}

@Article{Burkowski:1973:AAC,
  author =       "Forbes J. Burkowski and W. D. Hoskins",
  title =        "{ACM Algorithm 461}: Cubic Spline Solutions to a Class
                 of Functional Differential Equations [{D2}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "635--637",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:28:54 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#BurkowskiH73",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 B0290P (Differential equations); C4130 (Interpolation
                 and function approximation); C4170 (Differential
                 equations); C7310 (Mathematics computing)",
  corpsource =   "Univ. Manitoba, Winnipeg, Man., Canada",
  keywords =     "(mathematics); boundary value problem; boundary-value
                 problems; cubic spline solutions; differential
                 equations; FORTRAN; functional differential equations;
                 piecewise continuous approximation; splines; SPNBVF;
                 subroutine; subroutines",
  oldlabel =     "BurkowskiH73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BurkowskiH73",
}

@Article{Donnelly:1973:AAB,
  author =       "Thomas G. Donnelly",
  title =        "{ACM Algorithm 462}: Bivariate Normal Distribution
                 [{S15}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "638--638",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:36:33 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Donnelly73",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Univ. North Carolina, Chapel Hill, NC, USA",
  keywords =     "bivariate normal distribution; FORTRAN; frequency
                 distribution; statistics; subroutine; subroutines",
  oldlabel =     "Donnelly73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Donnelly73",
}

@Article{Lewart:1973:AAA,
  author =       "C. R. Lewart",
  title =        "{ACM Algorithm 463}: Algorithms {SCALE1}, {SCALE2},
                 and {SCALE3} for Determination of Scales on Computer
                 Generated Plots [{J6}]",
  journal =      j-CACM,
  volume =       "16",
  number =       "10",
  pages =        "639--640",
  month =        oct,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:58:44 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Lewart73",
  acknowledgement = ack-nhfb,
  classcodes =   "C5540 (Terminals and graphic displays); C6130 (Data
                 handling techniques)",
  corpsource =   "Bell Telephone Lab., Inc., Holmdel, NJ, USA",
  keywords =     "algorithms; computer generated plots; computer
                 graphics; determination of; FORTRAN; SCALE 1; SCALE 2;
                 SCALE 3; scales; subroutines",
  oldlabel =     "Lewart73",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lewart73",
}

@Article{Bachman:1973:PN,
  author =       "Charles W. Bachman",
  title =        "The Programmer as Navigator",
  journal =      j-CACM,
  volume =       "16",
  number =       "11",
  pages =        "653--658",
  month =        nov,
  year =         "1973",
  CODEN =        "CACMA2",
  DOI =          "http://doi.acm.org/10.1145/355611.362534",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:22:31 MST 2001",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bachman73",
  note =         "This is the 1973 ACM Turing Award Lecture.",
  acknowledgement = ack-nhfb,
  annote =       "Turing award acceptance speech-general view of the
                 state of database work from a DBTG originator.",
  classcodes =   "C6110 (Systems analysis and programming); C6120 (File
                 organisation); C6130 (Data handling techniques)",
  corpsource =   "Honeywell Information Systems Inc., Waltham, MA, USA",
  keywords =     "access; addressing; data handling; database; file
                 organisation; network hierarchical data model CACM;
                 programmer; programming",
  oldlabel =     "Bachman73",
  treatment =    "G General Review",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bachman73",
}

@Article{Fabry:1973:DVO,
  author =       "Robert S. Fabry",
  title =        "Dynamic Verification of Operating System Decisions",
  journal =      j-CACM,
  volume =       "16",
  number =       "11",
  pages =        "659--668",
  month =        nov,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Jan 22 06:38:26 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Fabry73",
  abstract =     "Dynamic verification of a decision implies that every
                 time the decision is made there is a consistency check
                 performed on the decision using independent hardware
                 and software. The dynamic verification of operating
                 system decisions is used on the PRIME system being
                 designed and constructed at the University of
                 California, Berkeley. PRIME is an experimental
                 time-sharing system which is to have the properties of
                 continuous availability, data privacy, and cost
                 effectiveness. The technique of dynamic verification
                 allows the construction of an operating system which
                 does not make certain decisions improperly even in the
                 presence of a single hardware or software fault.
                 Furthermore, multiple faults lead to unreliable
                 operation only if the faults happen to reinforce each
                 other. On PRIME, dynamic verification is used to ensure
                 that one user's information cannot become available to
                 another user gratuitously even in the presence of a
                 single hardware or software fault.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150G (Diagnostic, testing, debugging and evaluating
                 systems); C6150J (Operating systems)",
  classification = "722; 723",
  corpsource =   "Univ. California, Berkeley, CA, USA",
  journalabr =   "Commun ACM",
  keywords =     "computer operating systems; computer systems; computer
                 systems, digital; data privacy; data security; dynamic
                 verification; fault tolerance; modular; operating
                 systems; operating systems (computers); program
                 verification; reliability; security of data; software",
  oldlabel =     "Fabry73",
  treatment =    "P Practical; X Experimental",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Fabry73",
}

@Article{Mickunas:1973:PGS,
  author =       "M. Dennis Mickunas and Victor B. Schneider",
  title =        "A Parser-Generating System for Constructing Compressed
                 Compilers",
  journal =