%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.228",
%%%     date            = "20 February 2026",
%%%     time            = "07:24:22 MDT",
%%%     filename        = "jacm.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",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "26109 113287 553986 5204593",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; JACM; Journal of the
%%%                        ACM",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a COMPLETE bibliography of the
%%%                        Journal of the Association for Computing
%%%                        Machinery (CODEN JACOAH, ISSN 0004-5411),
%%%                        covering all published articles, letters,
%%%                        remarks, and corrigenda from all volumes
%%%                        (1954--date).
%%%
%%%                        At version 1.228, the COMPLETE year coverage
%%%                        looked like this:
%%%
%%%                             1954 (  29)    1979 (  59)    2004 (  33)
%%%                             1955 (  29)    1980 (  61)    2005 (  30)
%%%                             1956 (  48)    1981 (  52)    2006 (  31)
%%%                             1957 (  62)    1982 (  65)    2007 (  32)
%%%                             1958 (  45)    1983 (  51)    2008 (  28)
%%%                             1959 (  54)    1984 (  52)    2009 (  38)
%%%                             1960 (  43)    1985 (  51)    2010 (  34)
%%%                             1961 (  48)    1986 (  39)    2011 (  26)
%%%                             1962 (  41)    1987 (  48)    2012 (  32)
%%%                             1963 (  50)    1988 (  48)    2013 (  45)
%%%                             1964 (  43)    1989 (  42)    2014 (  41)
%%%                             1965 (  58)    1990 (  37)    2015 (  51)
%%%                             1966 (  56)    1991 (  37)    2016 (  49)
%%%                             1967 (  64)    1992 (  38)    2017 (  56)
%%%                             1968 (  53)    1993 (  45)    2018 (  42)
%%%                             1969 (  57)    1994 (  47)    2019 (  45)
%%%                             1970 (  64)    1995 (  46)    2020 (  38)
%%%                             1971 (  52)    1996 (  32)    2021 (  49)
%%%                             1972 (  55)    1997 (  34)    2022 (  46)
%%%                             1973 (  53)    1998 (  35)    2023 (  42)
%%%                             1974 (  64)    1999 (  32)    2024 (  42)
%%%                             1975 (  53)    2000 (  35)    2025 (  43)
%%%                             1976 (  66)    2001 (  38)    2026 (   7)
%%%                             1977 (  51)    2002 (  31)
%%%                             1978 (  57)    2003 (  53)
%%%
%%%                             Article:       3281
%%%                             Book:             2
%%%
%%%                             Total entries: 3283
%%%
%%%                        The author will be grateful for reports of
%%%                        any errors or omissions in this file; they
%%%                        will be corrected in future editions.
%%%
%%%                        Articles and letters or corrections that
%%%                        comment on them are cross-referenced in both
%%%                        directions, so that citation of one of them
%%%                        will automatically include the others.
%%%
%%%                        All entries in the years 1954--1994 have
%%%                        been checked against the original journal
%%%                        articles (NOT the tables of contents, which
%%%                        abbreviate names and titles, and sometimes
%%%                        have other errors as well) for correct
%%%                        accents, capitalization, and spelling of
%%%                        author and title data.
%%%
%%%                        Volumes 1 and 2 used all-cap titles, with
%%%                        mixed caps in the table of contents; for
%%%                        readability, and consistency with all other
%%%                        journal volumes, mixed caps have been used
%%%                        for article titles in all volumes.
%%%
%%%                        Bibliography software has been used to make
%%%                        further checks for consistency of
%%%                        pages/number/month data.
%%%
%%%                        The initial draft of this file was
%%%                        developed from the TeX Users Group
%%%                        bibliography collection on
%%%                        ftp.math.utah.edu in /pub/tex/bib, and from
%%%                        the Computer Science bibliography
%%%                        collection on ftp.ira.uka.de in
%%%                        /pub/bibliography, to which many people of
%%%                        have contributed.  Math Review MRclass and
%%%                        MRnumber values were supplied from a search
%%%                        of the American Mathematical Society's
%%%                        MathSciNet database.  A search of the
%%%                        Compendex databases (1970--1996) provided
%%%                        many missing abstracts, and cross checks of
%%%                        existing data.
%%%
%%%                        The ACM maintains Web pages with journal
%%%                        tables of contents for 1954--date at
%%%                        http://www.acm.org/pubs/toc, with pages for
%%%                        this journal at
%%%
%%%                            http://www.acm.org/pubs/contents/journals/jacm/
%%%                            http://portal.acm.org/browse_dl.cfm?idx=J401
%%%                            https://dl.acm.org/loi/jacm
%%%
%%%                        That data has been automatically converted
%%%                        to BibTeX form, corrected for spelling and
%%%                        page number errors, and merged into this
%%%                        file.
%%%
%%%                        ACM copyrights explicitly permit abstracting
%%%                        with credit, so article abstracts, keywords,
%%%                        and subject classifications have been
%%%                        included in this bibliography wherever
%%%                        available.  Article reviews have been
%%%                        omitted, until their copyright status has
%%%                        been clarified.
%%%
%%%                        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 the biblabel software
%%%                        developed for the BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, with the help of
%%%                        ``bibsort -byvolume''.  The bibsort utility,
%%%                        and several related programs for
%%%                        bibliography maintenance, is available on
%%%                        ftp.math.utah.edu in /pub/tex/bib, and at
%%%                        other Internet sites which mirror it,
%%%                        including the Comprehensive TeX Archive
%%%                        Network (CTAN); the command `finger
%%%                        ctan<at>tug.org' will produce a list of
%%%                        CTAN hosts.
%%%
%%%                        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 path.sty" #
   "\ifx \undefined \mathbb  \def \mathbb #1{{\bf #1}}\fi" #
   "\ifx \undefined \mathrm  \def \mathrm #1{{\rm #1}}\fi" #
   "\ifx \undefined \poly    \def \poly {\mathrm{poly}}\fi" #
   "\ifx \undefined \polylog \def \polylog {\mathrm{polylog}}\fi" #
   "\hyphenation{
                Cher-vo-nen-kis
                Eh-ren-feucht
                Hal-pern
                Jean-ette
                Kam-eda
                Leigh-ton
                Mehl-horn
                Metro-po-lis
                Pra-sad
                Prep-a-ra-ta
                Press-er
                Pros-ku-row-ski
                Ros-en-krantz
                Ru-dolph
                Schie-ber
                Schnei-der
                Te-zu-ka
                Vis-wa-na-than
                Yech-ez-kel
                Yech-i-ali
                data-base
                data-bases
                dead-lock
                poly-adic
                }"
        }

%%% ====================================================================
%%% 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,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

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

@String{j-CACM                  = "Communications of the Association for
                                  Computing Machinery"}

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

@String{j-J-COMPUT-APPL-MATH    = "Journal of Computational and Applied
                                  Mathematics"}

@String{j-TOPLAS                = "ACM Transactions on Programming
                                  Languages and Systems"}

%%% ====================================================================
%%% Publishers and their addresses:

@String{pub-U-ILLINOIS-PRESS    = "University of Illinois Press"}

@String{pub-U-ILLINOIS-PRESS:adr = "Urbana, IL, USA"}

%%% ====================================================================
%%% Bibliography entries.  To satisfy cross references, a few entries
%%% from other journals and books are included here.

@Book{vonNeumann:1966:TSR,
  author =       "John {von Neumann}",
  editor =       "A. W. Burks",
  title =        "Theory of Self-Reproducing Automata",
  publisher =    pub-U-ILLINOIS-PRESS,
  address =      pub-U-ILLINOIS-PRESS:adr,
  pages =        "xix + 388",
  year =         "1966",
  LCCN =         "QA267 .V55",
  bibdate =      "Wed Jan 10 19:22:59 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Von Neumann's work on self-reproducing automata,
                 completed and edited after his death by Arthur Burks.
                 Also includes transcripts of von Neumann's 1949
                 University of Illinois lectures on the ``Theory and
                 Organization of Complicated Automata''. See
                 \cite{Burks:1970:ECA}.",
  acknowledgement = ack-nhfb,
  keywords =     "refs-general, CA, automata-theory, complex,
                 automata-selfrepro",
}

@Book{Burks:1970:ECA,
  author =       "Arthur W. Burks",
  title =        "Essays on Cellular Automata",
  publisher =    pub-U-ILLINOIS-PRESS,
  address =      pub-U-ILLINOIS-PRESS:adr,
  pages =        "xxvi + 375",
  year =         "1970",
  LCCN =         "QA267.5.S4 B87",
  bibdate =      "Wed Jan 10 19:23:20 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "A classic collection of papers on cellular automata
                 intended as a companion to von Neumann's {\em Theory of
                 Self Reproducing Automata\/}
                 \cite{vonNeumann:1966:TSR}. Includes papers by Burks,
                 Thatcher, Moore, Myhill, Ulam, and Holland. See
                 \cite{Holland:1962:OLT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  keywords =     "CA, refs-general, refs-bottomup, automata-selfrepro,
                 automata-biol",
}

@Article{Ercoli:1960:LEE,
  author =       "Paolo Ercoli",
  title =        "Letters to the {Editor}: Errors Due to Overflow in
                 Arithmetic Operations",
  journal =      j-CACM,
  volume =       "3",
  number =       "12",
  pages =        "A9--A9",
  month =        dec,
  year =         "1960",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:29 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Ercoli:1957:EDO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "Commun. ACM",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Tarjan:1979:SST,
  author =       "Robert Endre Tarjan and Andrew Chi-Chih Yao",
  title =        "Storing a Sparse Table",
  journal =      j-CACM,
  volume =       "22",
  number =       "11",
  pages =        "606--611",
  month =        nov,
  year =         "1979",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sun May 02 10:02:29 1999",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Fredman:1984:SST}.",
  acknowledgement = ack-nhfb,
  ajournal =     "Commun. ACM",
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

%%% ====================================================================
%%% Entries for the Journal of the Association for Computing Machinery:

@Article{Williams:1954:ACM,
  author =       "S. B. Williams",
  title =        "The {Association for Computing Machinery}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "1--3",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Apr 10 18:09:03 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Backus:1954:ISS,
  author =       "J. W. Backus",
  title =        "The {IBM 701 Speedcoding} System",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "4--6",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "http://community.computerhistory.org/scc/projects/FORTRAN/paper/p4-backus.pdf",
  abstract =     "The IBM 701 Speedcoding System is a set of
                 instructions which causes the 701 to behave like a
                 three-address floating point calculator. Let us call
                 this the Speedcoding calculator. In addition to
                 operating in floating point, this Speedcoding
                 calculator has extremely convenient means for getting
                 information into the machine and for printing results;
                 it has an extensive set of operations to make the job
                 of programming as easy as possible. Speedcoding also
                 provides automatic address modification, flexible
                 tracing, convenient use of auxiliary storage, and
                 built-in checking.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wiseman:1954:LIP,
  author =       "R. T. Wiseman",
  title =        "Life Insurance Premium Billing and Combined Operations
                 by Electronic Equipment",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "7--12",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamilton:1954:IMD,
  author =       "F. E. Hamilton and E. C. Kubie",
  title =        "The {IBM Magnetic Drum Calculator Type 650}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "13--20",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:56:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Jacobs:1954:ERA,
  author =       "H. {Jacobs, Jr.}",
  title =        "Equipment Reliability as Applied to Analogue
                 Computers",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "21--26",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:52:51 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Edwards:1954:SAM,
  author =       "C. M. Edwards",
  title =        "Survey of Analog Multiplication Schemes",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "27--35",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Perley:1954:ASG,
  author =       "Richmond Perley",
  title =        "Automatic Strain-Gage and Thermocouple Recording on
                 Punched Cards",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "36--43",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1954:NNa,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "44--44",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:53:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1954:SODa,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "1",
  pages =        "45--55",
  month =        jan,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:49:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Leiner:1954:SSD,
  author =       "Alan L. Leiner",
  title =        "System Specifications for the {DYSEAC}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "57--81",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brock:1954:PAT,
  author =       "Paul Brock and Sybil Rock",
  title =        "Problems in Acceptance Testing in Digital Computers",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "82--87",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moshman:1954:GPR,
  author =       "Jack Moshman",
  title =        "The Generation of Pseudo-Random Numbers on a Decimal
                 Calculator",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "88--91",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320772.320775",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  HDnumber =     "85",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1954:NNb,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "92--92",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1954:SODb,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "2",
  pages =        "93--100",
  month =        apr,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:49:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bergman:1954:MSB,
  author =       "Stefan Bergman",
  title =        "A Method of Solving Boundary Value Problems of
                 Mathematical Physics on Punch Card Machines",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "101--104",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wasel:1954:MDP,
  author =       "A. D. Wasel",
  title =        "A Method of Determining Plate Bending by Use of a
                 Punched-Card Machine",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "105--110",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 23:18:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Crandall:1954:NTF,
  author =       "Stephen H. Crandall",
  title =        "Numerical Treatment of a Fourth Order Parabolic
                 Partial Differential Equation",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "111--117",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:56:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Elgot:1954:SVT,
  author =       "Calvin C. Elgot",
  title =        "On Single vs. Triple Address Computing Machines",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "118--123",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gotlieb:1954:RCE,
  author =       "C. C. Gotlieb",
  title =        "Running a Computer Efficiently",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "124--127",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wadel:1954:EDA,
  author =       "Louis B. Wadel",
  title =        "An Electronic Differential Analyzer as a Difference
                 Analyzer",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "128--136",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:57:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1954:NNc,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "137--138",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1954:SODc,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "3",
  pages =        "139--148",
  month =        jul,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:49:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bashe:1954:IT,
  author =       "C. J. Bashe and W. Buchholz and N. Rochester",
  title =        "The {IBM Type 702}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "149--169",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:49:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Atta:1954:CGH,
  author =       "Susie E. Atta and Ward C. Sangren",
  title =        "Calculation of Generalized Hypergeometric Series",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "170--172",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Trexler:1954:PUC,
  author =       "George F. Trexler",
  title =        "Public Utility Customer Accounting on the {Type 650
                 Magnetic Drum Data Processing Machine}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "173--176",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bauer:1954:DHS,
  author =       "Walter F. Bauer and John W. {Carr III}",
  title =        "On the Demonstration of High-Speed Digital Computers",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "177--182",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Davis:1954:MPO,
  author =       "Philip Davis and Philip Rabinowitz",
  title =        "A Multiple Purpose Orthonormalizing Code and Its
                 Uses",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "183--191",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1954:NNd,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "192--192",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:39 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1954:SODd,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "1",
  number =       "4",
  pages =        "193--200",
  month =        oct,
  year =         "1954",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:18:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rutishauser:1955:SPT,
  author =       "Heinz Rutishauser",
  title =        "Some Programming Techniques for the {ERMETH}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "1--4",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gray:1955:PTE,
  author =       "H. J. {Gray, Jr.}",
  title =        "Propagation of Truncation Errors in the Numerical
                 Solution of Ordinary Differential Equations by Repeated
                 Closures",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "6--17",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Titus:1955:GCP,
  author =       "C. K. Titus",
  title =        "A General Card-Program for the Evaluation of the
                 Inverse {Laplace} Transform",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "18--27",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jun 26 19:31:29 1997",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Logan:1955:ASE,
  author =       "Benjamin F. Logan and George R. Welti and George C.
                 Sponsler",
  title =        "Analogue Study of Electron Trajectories",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "28--41",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Crandall:1955:IVE,
  author =       "Stephen H. Crandall",
  title =        "Implicit vs. Explicit Recurrence Formulas for the
                 Linear Diffusion Equation",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "42--49",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 23:18:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1955:NNa,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "50--52",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1955:SODa,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "1",
  pages =        "53--60",
  month =        jan,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Murray:1955:MR,
  author =       "F. J. Murray",
  title =        "Mechanisms and Robots",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "61--82",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moshos:1955:AIA,
  author =       "George J. Moshos",
  title =        "Analog Interpolator for Automatic Control",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "83--91",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamer:1955:TOA,
  author =       "Howard Hamer and Jerome D. Kennedy",
  title =        "Testing of Operational Amplifiers",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "92--94",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Graney:1955:MAT,
  author =       "Edward P. Graney",
  title =        "Maintenance and Acceptance Tests Used on the {MIDAC}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "95--98",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weil:1955:RRM,
  author =       "Herschel Weil",
  title =        "Reduction of Runs in Multiparameter Computations",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "99--110",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cohn:1955:SEI,
  author =       "Harvey Cohn",
  title =        "Some Experiments in Ideal Factorization on the
                 {MIDAC}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "111--116",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1955:NNb,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "117--118",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1955:SODb,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "2",
  pages =        "119--136",
  month =        apr,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:50:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Young:1955:OSD,
  author =       "David M. Young",
  title =        "{ORDVAC} Solutions of the {Dirichlet} Problem",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "137--161",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jun 26 19:30:54 1997",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Abramowitz:1955:VSC,
  author =       "Milton Abramowitz and William F. Cahill",
  title =        "On the Vibration of a Square Clamped Plate",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "162--168",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pulvari:1955:MMU,
  author =       "Charles F. Pulvari",
  title =        "Memory Matrix Using Ferroelectric Condensers as
                 Bistable Elements",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "169--185",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:58:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rubinoff:1955:DCR,
  author =       "Morris Rubinoff",
  title =        "Digital Computers for Real-Time Simulation",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "186--204",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:00:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Parsons:1955:SDC,
  author =       "Frances L. Parsons",
  title =        "A Simple Desk-Calculator Method for Checking Binary
                 Results of Digital Computer Arithmetic Operations",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "205--207",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:00:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1955:NNc,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "208--210",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1955:SODc,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "3",
  pages =        "211--228",
  month =        jul,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blanyer:1955:PMD,
  author =       "Carl G. Blanyer",
  title =        "Precision Modulators and Demodulators",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "229--242",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hume:1955:TSA,
  author =       "J. N. P. Hume and Beatrice H. Worsley",
  title =        "{Transcode}: a System of Automatic Coding for
                 {FERUT}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "243--252",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:01:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gorman:1955:ACI,
  author =       "T. P. Gorman and R. G. Kelly and R. B. Reddy",
  title =        "Automatic Coding for the {IBM 701}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "253--261",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Macon:1955:CEH,
  author =       "Nathaniel Macon",
  title =        "On the Computation of Exponential and Hyperbolic
                 Functions Using Continued Fractions",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "262--266",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Haneman:1955:CCA,
  author =       "V. S. Haneman and J. W. Senders",
  title =        "Correlation Computation on Analog Devices",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "267--279",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1955:NNd,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "280--282",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:23:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Neumann:1955:SODd,
  author =       "A. J. Neumann",
  title =        "Supplement: {ONR Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "2",
  number =       "4",
  pages =        "283--298",
  month =        oct,
  year =         "1955",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1956:PAA,
  author =       "Alston S. Householder",
  title =        "{Presidential Address to the ACM, Philadelphia,
                 September 14, 1955}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:24:06 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gordon:1956:OPI,
  author =       "Barry Gordon",
  title =        "An Optimizing Program for the {IBM 650}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "3--5",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Henrici:1956:SCR,
  author =       "Peter Henrici",
  title =        "A Subroutine for Computations with Rational Numbers",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "6--9",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Henrici:1956:ACP,
  author =       "Peter Henrici",
  title =        "Automatic Computations with Power Series",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "10--15",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:33:31 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/auto.diff.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The use of recursion relations in the calculation of
                 power series is suggested. The recursion relations for
                 two example power series are given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "point algorithms; recursion relations",
}

@Article{Wadel:1956:SDF,
  author =       "Louis B. Wadel",
  title =        "Simulation of Digital Filters on an Electronic Analog
                 Computer",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "16--21",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Conte:1956:KTO,
  author =       "S. D. Conte and R. F. Reeves",
  title =        "A {Kutta} Third-Order Procedure for Solving
                 Differential Equations Requiring Minimal Storage",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "22--25",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Young:1956:REA,
  author =       "Robert L. Young",
  title =        "Report on Experiments in Approximating the Solution of
                 a Differential Equation",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "26--28",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stark:1956:RCN,
  author =       "R. H. Stark",
  title =        "Rates of Convergence in Numerical Solution of the
                 Diffusion Equation",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "29--40",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:NNa,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "41--43",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:DCNa,
  author =       "Anonymous",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "1",
  pages =        "44--64",
  month =        jan,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Perkins:1956:EPC,
  author =       "Robert Perkins",
  title =        "{EASIAC}, a Pseudo-Computer",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "65--72",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "One of the primary functions of the MIDAC installation
                 at the University of Michigan is the instruction of
                 beginners in the various aspects of digital machine use
                 including programming and coding. \ldots{} In
                 conducting these courses it was soon found to be
                 extremely difficult, in five or six instruction
                 periods, to bring a complete newcomer up to the point
                 where he can code and check out on MIDAC anything more
                 than a rather trivial routine. As might be expected the
                 difficulty centers around problems of scaling,
                 instruction modification and binary representation.
                 \ldots{} To alleviate these problems it was decided
                 that a new computer was needed: one designed to make
                 programming easier. At the cost of some of MIDAC's
                 speed and capacity plus two or three man-months of
                 programming time EASIAC, the EASy Instruction Automatic
                 Computer, was realized as a translation-interpretation
                 program in MIDAC.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "Early example of a decimal floating-point machine.",
}

@Article{Hammersley:1956:CMC,
  author =       "J. M. Hammersley",
  title =        "Conditional {Monte Carlo}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "73--76",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Glantz:1956:NM,
  author =       "Herbert T. Glantz",
  title =        "A Note on Microprogramming",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "77--84",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1956:BNA,
  author =       "Alston S. Householder",
  title =        "Bibliography on Numerical Analysis",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "85--100",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hoover:1956:WTD,
  author =       "William R. Hoover and John J. Wedel and Joseph R.
                 Bruman",
  title =        "Wind Tunnel Data Reduction Using Paper-Tape Storage
                 Media",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "101--109",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:NNb,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "110--111",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1956:BRa,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "112--113",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:33:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:DCNb,
  author =       "Anonymous",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "2",
  pages =        "114--128",
  month =        apr,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lebedev:1956:HSE,
  author =       "S. A. Lebedev",
  title =        "The High-Speed Electronic Calculating Machine of the
                 {Academy of Sciences} of the {U.S.S.R.}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "129--133",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Translated by Curtis D. Benster.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Friend:1956:SEC,
  author =       "Edward Harry Friend",
  title =        "Sorting on Electronic Computer Systems",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "134--168",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Isaac:1956:SAC,
  author =       "E. J. Isaac and R. C. Singleton",
  title =        "Sorting by Address Calculation",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "169--174",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bracken:1956:GSH,
  author =       "Robert H. Bracken and Bruce G. Oldfield",
  title =        "A General System for Handling Alphameric Information
                 on the {IBM 701} Computer",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "175--180",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bauer:1956:ICS,
  author =       "Walter F. Bauer",
  title =        "An Integrated Computation System for the {ERA-1103}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "181--185",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Heizer:1956:TFS,
  author =       "L. E. Heizer and S. J. Abraham",
  title =        "Transfer Function Simulation by Means of Amplifiers
                 and Potentiometers",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "186--198",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Macon:1956:GED,
  author =       "Nathaniel Macon and Margaret Baskervill",
  title =        "On the Generation of Errors in the Digital Evaluation
                 of Continued Fractions",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "199--202",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Downing:1956:SIC,
  author =       "A. C. {Downing, Jr.} and A. S. Householder",
  title =        "Some Inverse Characteristic Value Problems",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "203--207",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lotkin:1956:NMM,
  author =       "Mark Lotkin",
  title =        "A Note on the Midpoint Method of Integration",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "208--211",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 19:00:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Keitel:1956:EMT,
  author =       "Glenn H. Keitel",
  title =        "An Extension of {Milne}'s Three-Point Method",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "212--222",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{vonHoldt:1956:IPC,
  author =       "Richard Elton {von Holdt}",
  title =        "An Iterative Procedure for the Calculation of the
                 Eigenvalues and Eigenvectors of a Real Symmetric
                 Matrix",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "223--238",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:25:33 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1956:BRb,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "239--239",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:NNc,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "240--243",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:DCNc,
  author =       "Anonymous",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "3",
  pages =        "244--263",
  month =        jul,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:EN,
  author =       "Anonymous",
  title =        "{Editor}'s Note",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "265--265",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Melahn:1956:DCV,
  author =       "Wesley S. Melahn",
  title =        "A Description of a Cooperative Venture in the
                 Production of an Automatic Coding System",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "266--271",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baker:1956:PCS,
  author =       "Charles L. Baker",
  title =        "The {PACT I} Coding System for the {IBM Type 701}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "272--278",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145%2F320843.320845",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mock:1956:LOP,
  author =       "Owen R. Mock",
  title =        "Logical Organization of the {PACT I} Compiler",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "279--287",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145%2F320843.320846",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Miller:1956:PCI,
  author =       "Robert C. {Miller, Jr.} and Bruce G. Oldfield",
  title =        "Producing Computer Instructions for the {PACT I}
                 Compiler",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "288--291",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145%2F320843.320847",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jun 11 18:09:16 1999",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hempstead:1956:PLE,
  author =       "Gus Hempstead and Jules I. Schwartz",
  title =        "{PACT} Loop Expansion",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "292--298",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Derr:1956:SAA,
  author =       "J. I. Derr and R. C. Luke",
  title =        "Semi-Automatic Allocation of Data Storage for {PACT
                 I}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "299--308",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Greenwald:1956:CAU,
  author =       "I. D. Greenwald and H. G. Martin",
  title =        "Conclusions After Using the {PACT I} Advanced Coding
                 Technique",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "309--313",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1956:CMI,
  author =       "Alston S. Householder",
  title =        "On the Convergence of Matrix Iterations",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "314--324",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fisher:1956:HOD,
  author =       "Michael E. Fisher",
  title =        "Higher Order Differences in the Analogue Solution of
                 Partial Differential Equations",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "325--347",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brown:1956:PPM,
  author =       "J. H. Brown and John W. {Carr III} and Boyd Larrowe
                 and J. R. McReynolds",
  title =        "Prevention of Propagation of Machine Error in Long
                 Problems",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "348--354",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 23:46:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mason:1956:DAC,
  author =       "Robert M. Mason",
  title =        "The Digital Approximation of Contours",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "355--359",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:30:38 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 364 is notice page

@Article{Jeffrey:1956:AAD,
  author =       "Richard C. Jeffrey",
  title =        "Arithmetical Analysis of Digital Computing Nets",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "360--375",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:03:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Cordray:1957:RRP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1956:BRc,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "376--378",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:04:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:NNd,
  author =       "Anonymous",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "379--382",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:04:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1956:DCNd,
  author =       "Anonymous",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "3",
  number =       "4",
  pages =        "383--403",
  month =        oct,
  year =         "1956",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 21:51:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1957:RPA,
  author =       "Alston S. Householder",
  title =        "Retiring Presidential Address",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "1--4",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Carr:1957:IPA,
  author =       "John W. {Carr III}",
  title =        "Inaugural Presidential Address",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "5--7",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Steel:1957:PI,
  author =       "T. B. {Steel, Jr.}",
  title =        "{Pact IA}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "8--11",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bauer:1957:SGP,
  author =       "Walter F. Bauer and George P. West",
  title =        "A System for General-Purpose Analog-Digital
                 Computation",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "12--17",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Conte:1957:SIF,
  author =       "S. D. Conte",
  title =        "A Stable Implicit Finite Difference Approximation to a
                 Fourth Order Parabolic Equation",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "18--23",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Luke:1957:RAE,
  author =       "Yudell L. Luke",
  title =        "Rational Approximations to the Exponential Function",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "24--29",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320856.320862",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:39 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shenitzer:1957:CAC,
  author =       "A. Shenitzer",
  title =        "{Chebyshev} Approximation of a Continuous Function by
                 a Class of Functions",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "30--35",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Atta:1957:EPE,
  author =       "Susie E. Atta",
  title =        "Effect of Propagated Error on Inverse of {Hilbert}
                 Matrix",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "36--40",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lehmer:1957:SCR,
  author =       "D. H. Lehmer",
  title =        "Sorting Cards with Respect to a Modulus",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "41--46",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:49 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Huffman:1957:DUH,
  author =       "David A. Huffman",
  title =        "The Design and Use of Hazard-Free Switching Networks",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "47--62",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wang:1957:VTT,
  author =       "Hao Wang",
  title =        "A Variant to {Turing}'s Theory of Computing Machines",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "63--92",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1957:BRa,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "93--94",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alt:1957:NNa,
  author =       "F. L. Alt",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "95--96",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1957:DCNa,
  author =       "Gordon D. Goldstein",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "1",
  pages =        "97--120",
  month =        jan,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:59:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chung:1957:TIC,
  author =       "J. H. Chung and C. C. Gotlieb",
  title =        "Test of an Inventory Control System on {FERUT}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "121--130",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bracken:1957:ISC,
  author =       "R. H. Bracken and H. E. Tillitt",
  title =        "Information Searching with the 701 Calculator",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "131--136",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harlow:1957:HPI,
  author =       "Francis H. Harlow",
  title =        "Hydrodynamic Problems Involving Large Fluid
                 Distortions",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "137--142",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Leichner:1957:DCC,
  author =       "Gene H. Leichner",
  title =        "Designing Computer Circuits With a Computer",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "143--147",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ward:1957:HMS,
  author =       "James A. Ward",
  title =        "The Down-Hill Method of Solving $f(z) = 0$",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "148--150",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yates:1957:APR,
  author =       "F. Yates and S. Lipton",
  title =        "An Automatic Programming Routine for the {Elliott}
                 401",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "151--156",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mercer:1957:MP,
  author =       "Robert J. Mercer",
  title =        "Micro-Programming",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "157--171",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Swift:1957:MFM,
  author =       "Charles J. Swift",
  title =        "Machine Features for a More Automatic Monitoring
                 System on Digital Computers",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "172--173",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kister:1957:EC,
  author =       "J. Kister and P. Stein and S. Ulam and W. Walden and
                 M. Wells",
  title =        "Experiments in Chess",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "174--177",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Glantz:1957:RID,
  author =       "Herbert T. Glantz",
  title =        "On the Recognition of Information With a Digital
                 Computer",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "178--188",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:14 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Miehle:1957:BTF,
  author =       "William Miehle",
  title =        "{Burroughs} Truth Function Evaluator",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "189--192",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Burks:1957:LAPa,
  author =       "Arthur W. Burks and Hao Wang",
  title =        "The Logic of Automata, {Part I}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "193--218",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1957:BRb,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "219--220",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alt:1957:NNb,
  author =       "F. L. Alt",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "221--224",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1957:DCNb,
  author =       "Gordon D. Goldstein",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "2",
  pages =        "225--244",
  month =        apr,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Oettinger:1957:AIA,
  author =       "Anthony G. Oettinger",
  title =        "Account Identification for Automatic Data Processing",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "245--253",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gorn:1957:SPM,
  author =       "Saul Gorn",
  title =        "Standardized Programming Methods and Universal
                 Coding",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "254--273",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lipton:1957:TPT,
  author =       "S. Lipton",
  title =        "Two Programming Techniques for One-Plus-One Address
                 Computers",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "274--278",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Burks:1957:LAPb,
  author =       "Arthur W. Burks and Hao Wang",
  title =        "The Logic of Automata, {Part II}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "279--297",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Givens:1957:CVV,
  author =       "Wallace Givens",
  title =        "The Characteristic Value-Vector Problem",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "298--307",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dwyer:1957:MRM,
  author =       "Paul S. Dwyer and Bernard A. Galler",
  title =        "The Method of Reduced Matrices for a General
                 Transportation Problem",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "308--313",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Thompson:1957:BMS,
  author =       "Gene Thomas Thompson",
  title =        "On {Bateman}'s Method for Solving Linear Integral
                 Equations",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "314--328",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Halton:1957:MIE,
  author =       "J. H. Halton and D. C. Hanscomb",
  title =        "A Method of Increasing the Efficiency of {Monte Carlo}
                 Integration",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "329--340",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1957:BLA,
  author =       "Allen A. Goldstein and Norman Levine and James B.
                 Hereshoff",
  title =        "On the ``Best'' and ``Least ${Q}$th'' Approximation of
                 an Overdetermined System of Linear Equations",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "341--347",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rowan:1957:PTS,
  author =       "T. C. Rowan",
  title =        "Psychological Tests and Selection of Computer
                 Programmers",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "348--353",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Israel:1957:STT,
  author =       "David R. Israel",
  title =        "Simulation Techniques for the Test and Evaluation of
                 Real-Time Computer Programs",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "354--361",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1957:BRc,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "362--366",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alt:1957:NNc,
  author =       "F. L. Alt",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "367--370",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1957:DCNc,
  author =       "Gordon D. Goldstein",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "3",
  pages =        "371--391",
  month =        jul,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Williams:1957:CFE,
  author =       "Theodore J. Williams and R. Curtis Johnson and Arthur
                 Rose",
  title =        "Computations in the Field of Engineering Chemistry",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "393--419",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weinberger:1957:SDE,
  author =       "A. Weinberger and H. Loberman",
  title =        "Symbolic Designations for Electrical Connections",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "420--427",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loberman:1957:FPC,
  author =       "H. Loberman and A. Weinberger",
  title =        "Formal Procedures for Connecting Terminals with a
                 Minimum Total Wire Length",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "428--437",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Nelson:1957:SCS,
  author =       "R. T. Nelson and J. R. Jackson",
  title =        "{SWAC} Computations for Some $m \times n$ Scheduling
                 Problems",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "438--441",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Boyell:1957:PMI,
  author =       "Roger L. Boyell",
  title =        "Programmed Multiplication on the {IBM 407}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "442--449",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ercoli:1957:EDO,
  author =       "Paolo Ercoli and Roberto Vacca",
  title =        "Errors Due to Overflow in Arithmetic Operations
                 Particularly as Regards {FINAC} Electronic Computer",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "450--455",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 08 09:28:48 2005",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See letter \cite{Ercoli:1960:LEE}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "floating-point arithmetic; overflow",
}

@Article{Macon:1957:CLP,
  author =       "Nathaniel Macon",
  title =        "Condensation and Look-Up Procedures for Double Entry
                 Tables",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "456--458",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pope:1957:MFR,
  author =       "David A. Pope and C. Tompkins",
  title =        "Maximizing Functions of Rotations---Experiments
                 Concerning Speed of Diagonalization of Symmetric
                 Matrices Using {Jacobi}'s Method",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "459--466",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:59 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "eig; Jacobi's method; nla",
}

@Article{Crandall:1957:ORF,
  author =       "Stephen H. Crandall",
  title =        "Optimum Recurrence Formulas for a Fourth Order
                 Parabolic Partial Differential Equation",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "467--471",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sherman:1957:DTP,
  author =       "Bernard Sherman",
  title =        "Determination of Three Percentiles of the $\omega_n$
                 Distribution Function",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "472--476",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gerberich:1957:CCM,
  author =       "C. L. Gerberich and W. C. Sangren",
  title =        "Codes for the Classical Membrane Problem",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "477--486",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Minnick:1957:TAP,
  author =       "Robert C. Minnick",
  title =        "{Tshebysheff} Approximations for Power Series",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "487--504",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{deVogelaere:1959:RPT}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lehmer:1957:CNS,
  author =       "Emma Lehmer and H. S. Vandiver",
  title =        "On the Computation of the Number of Solutions of
                 Certain Trinomial Congruences",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "505--510",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bazilevskii:1957:UED,
  author =       "IU. IA. Bazilevsk\t{\i\i}",
  title =        "The Universal Electronic Digital Machine ({URAL}) for
                 Engineering Research",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "511--519",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1957:CMC,
  author =       "Anonymous",
  title =        "Conference on Matrix Computations",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "520--523",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cordray:1957:RRP,
  author =       "R. E. Cordray and Robert M. Mason",
  title =        "Remarks on a Recent Paper: ``{Arithmetical} Analysis
                 of Digital Computing Nets''",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "524--529",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Jeffrey:1956:AAD}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1957:BRd,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "530--533",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alt:1957:NNd,
  author =       "F. L. Alt",
  title =        "News and Notices",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "534--540",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1957:DCNd,
  author =       "Gordon D. Goldstein",
  title =        "{Digital Computer Newsletter}",
  journal =      j-J-ACM,
  volume =       "4",
  number =       "4",
  pages =        "541--558",
  month =        oct,
  year =         "1957",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brown:1958:LT,
  author =       "A. F. R. Brown",
  title =        "Language Translation",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "1--8",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ascher:1958:SEU,
  author =       "Marcia Ascher and George E. Forsythe",
  title =        "{SWAC} Experiments on the Use of Orthogonal
                 Polynomials for Data Fitting",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "9--21",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Spitzbart:1958:CFC,
  author =       "A. Spitzbart and D. L. Shell",
  title =        "A {Chebycheff} Fitting Criterion",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "22--31",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Laasonen:1958:TED,
  author =       "Pentti Laasonen",
  title =        "On the Truncation Error of Discrete Approximations to
                 the Solutions of {Dirichlet} Problems in a Domain with
                 Corners",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "32--38",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jun 26 19:30:58 1997",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Carr:1958:EBR,
  author =       "John W. {Carr III}",
  title =        "Error Bounds for the {Runge--Kutta} Single-Step
                 Integration Process",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "39--44",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Franklin:1958:NSC,
  author =       "J. N. Franklin",
  title =        "On the Numerical Solution of Characteristic Equations
                 in Flutter Analysis",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "45--51",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bashkow:1958:CPR,
  author =       "T. R. Bashkow",
  title =        "A ``Curve Plotting'' Routine for the Inverse {Laplace}
                 Transform of Rational Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "52--56",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jun 26 19:31:21 1997",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Scott:1958:APF,
  author =       "A. E. Scott",
  title =        "Automatic Preparation of Flow Chart Listings",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "57--66",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hirschhorn:1958:SCB,
  author =       "Edwin Hirschhorn",
  title =        "Simplification of a Class of {Boolean} Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "67--75",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baumann:1958:HSR,
  author =       "D. M. Baumann",
  title =        "A High-Scanning-Rate Storage Device for Computer
                 Applications",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "76--88",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zaroodny:1958:ASP,
  author =       "Serge J. Zaroodny and Tadeusz Leser",
  title =        "{AYDAR}, Special Purpose Analog Machine for Yaw Data
                 Reduction",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "89--99",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Givens:1958:CMC,
  author =       "Wallace Givens",
  title =        "Conference on Matrix Computations",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "100--115",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1958:BRa,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "116--116",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1958:A,
  author =       "Anonymous",
  title =        "Announcement",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "1",
  pages =        "117--117",
  month =        jan,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{deWitte:1958:EII,
  author =       "Leendeert de Witte and Kenneth P. Fournier",
  title =        "Evaluation of Integrals Involving Combinations of
                 {Bessel} Functions and Circular Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "119--126",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Causey:1958:SEB,
  author =       "Robert L. Causey",
  title =        "On Some Error Bounds of {Givens}",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "127--131",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dennis:1958:HSC,
  author =       "Jack B. Dennis",
  title =        "A High-Speed Computer Technique for the Transportation
                 Problem",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "132--153",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Frank:1958:FZA,
  author =       "Werner L. Frank",
  title =        "Finding Zeros of Arbitrary Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "154--160",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ehrlich:1958:NMS,
  author =       "L. W. Ehrlich",
  title =        "A Numerical Method of Solving a Heat Flow Problem with
                 Moving Boundary",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "161--176",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Raney:1958:SF,
  author =       "George N. Raney",
  title =        "Sequential Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "177--180",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Copi:1958:REL,
  author =       "Irving M. Copi and Calvin C. Elgot and Jesse B.
                 Wright",
  title =        "Realization of Events by Logical Nets",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "181--196",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:59:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "regular expressions",
}

@Article{Hamming:1958:BRb,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "2",
  pages =        "197--203",
  month =        apr,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1958:ASM,
  author =       "A. S. Householder",
  title =        "The Approximate Solution of Matrix Problems",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "205--243",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:52 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "iter; linear system; nla",
}

@Article{denBroeder:1958:PSD,
  author =       "George G. {den Broeder, Jr.} and Harry J. Smith",
  title =        "A Property of Semi-Definite {Hermitian} Matrices",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "244--245",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bauer:1958:MMI,
  author =       "F. L. Bauer",
  title =        "On Modern Matrix Iteration Processes of {Bernoulli}
                 and {Graeffe} Type",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "246--257",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:55 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Bernoulli's method; Graeffe's method; nla; nlop;
                 polynomial",
}

@Article{Cole:1958:NNS,
  author =       "R. W. Cole",
  title =        "A Note on Numerical Solution of Certain Linear
                 Boundary Value Problems",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "258--260",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bofinger:1958:PPP,
  author =       "Eve Bofinger and V. J. Bofinger",
  title =        "On a Periodic Property of Pseudo-Random Sequences",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "261--265",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1958:LSU,
  author =       "Seymour Ginsburg",
  title =        "On the Length of the Smallest Uniform Experiment Which
                 Distinguishes the Terminal States of a Machine",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "266--280",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lesh:1958:MSD,
  author =       "F. Lesh",
  title =        "Methods of Simulating a Differential Analyzer on a
                 Digital Computer",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "281--288",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goodman:1958:COL,
  author =       "N. R. Goodman and S. Katz",
  title =        "Calculating Open Loop Transfer Functions from Closed
                 Loop Measurements",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "289--297",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:06:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1958:BRc,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "3",
  pages =        "298--308",
  month =        jul,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tillitt:1958:CPY,
  author =       "Harley Tillitt",
  title =        "Computer Programming for Young Students",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "309--318",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:14 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blumenthal:1958:DMF,
  author =       "Sherman Blumenthal",
  title =        "A Dual Master File System for a Tape Processing
                 Computer",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "319--327",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Korolev:1958:CCC,
  author =       "L. N. Korolev",
  title =        "Coding and Code Compression",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "328--330",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Translated by Morris D. Friedman.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Markov:1958:ICS,
  author =       "A. A. Markov",
  title =        "On the Inversion Complexity of a System of Functions",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "331--334",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Translated by Morris D. Friedman.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1958:GER,
  author =       "Alston S. Householder",
  title =        "Generated Error in Rotational Tridiagonalization",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "335--338",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Householder:1958:UTN,
  author =       "Alston S. Householder",
  title =        "Unitary Triangularization of a Nonsymmetric Matrix",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "339--342",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:18 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Householder transformation; nla; qrd",
}

@Article{Moshman:1958:ASE,
  author =       "Jack Moshman",
  title =        "The Application of Sequential Estimation to Computer
                 Simulation and {Monte Carlo} Procedures",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "343--352",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Certaine:1958:SPR,
  author =       "J. Certaine",
  title =        "On Sequences of Pseudo-Random Numbers of Maximal
                 Length",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "353--356",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fisher:1958:PMA,
  author =       "Michael E. Fisher",
  title =        "Proposed Methods for the Analog Solution of
                 {Fredholm}'s Integral Equation",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "357--369",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Laasonen:1958:SPD,
  author =       "Pentti Laasonen",
  title =        "On the Solution of {Poisson}'s Difference Equation",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "370--382",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Berman:1958:MTM,
  author =       "Martin F. Berman",
  title =        "A Method for Transposing a Matrix",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "383--384",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Wheeler:1959:LEM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Young:1958:ASR,
  author =       "Frederick H. Young",
  title =        "Analysis of Shift Register Counters",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "385--388",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1958:BRd,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "389--396",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1958:AI,
  author =       "Anonymous",
  title =        "Author Index, 1954--1958",
  journal =      j-J-ACM,
  volume =       "5",
  number =       "4",
  pages =        "397--403",
  month =        oct,
  year =         "1958",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McGee:1959:GKS,
  author =       "W. C. McGee",
  title =        "Generalization: {Key} to Successful Electronic Data
                 Processing",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "1--23",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 10:29:47 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Description of early system with Data Dictionaries for
                 tape files.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zarechnak:1959:TLL,
  author =       "Michael Zarechnak",
  title =        "Three Levels of Linguistic Analysis in Machine
                 Translation",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "24--32",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Eldred:1959:TRB,
  author =       "Richard D. Eldred",
  title =        "Test Routines Based on Symbolic Logical Statements",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "33--36",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:00:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1959:SPC,
  author =       "R. W. Hamming",
  title =        "Stable Predictor-Corrector Methods for Ordinary
                 Differential Equations",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "37--47",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Douglas:1959:REN,
  author =       "Jim {Douglas, Jr.}",
  title =        "Round-Off Error in the Numerical Solution of the Heat
                 Equation",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "48--58",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstine:1959:JMR,
  author =       "H. H. Goldstine and F. J. Murray and J. von Neumann",
  title =        "The {Jacobi} Method for Real Symmetric Matrices",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "59--96",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lance:1959:SAT,
  author =       "G. N. Lance",
  title =        "Solution of Algebraic and Transcendental Equations on
                 an Automatic Digital Computer",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "97--101",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Li:1959:ODC,
  author =       "Shu-T'ien Li",
  title =        "Origin and Development of the {Chinese} Abacus",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "102--110",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{deVogelaere:1959:RPT,
  author =       "Ren{\'e} de Vogelaere",
  title =        "Remarks on the Paper ``{Tchebysheff} Approximations
                 for Power Series''",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "111--114",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Minnick:1957:TAP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1959:BRa,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "1",
  pages =        "115--120",
  month =        jan,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bauer:1959:APP,
  author =       "Walter F. Bauer and Mario L. Juncosa and Alan J.
                 Perlis",
  title =        "{ACM} Publications Policies and Plans",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "121--122",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shell:1959:SSC,
  author =       "Donald L. Shell",
  title =        "The {\sc Share} 709 System: a Cooperative Effort",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "123--127",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Greenwald:1959:SSP,
  author =       "Irwin D. Greenwald and Maureen Kane",
  title =        "The {\sc Share} 709 System: {Programming} and
                 Modification",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "128--133",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:59:14 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Boehm:1959:SSM,
  author =       "E. M. Boehm and T. B. {Steel, Jr.}",
  title =        "The {\sc Share} 709 System: {Machine} Implementation
                 of Symbolic Programming",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "134--140",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{DiGri:1959:SSI,
  author =       "Vincent J. DiGri and Jane E. King",
  title =        "The {\sc Share} 709 System: {Input-Output}
                 Translation",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "141--144",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320964.320969",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mock:1959:SSP,
  author =       "Owen Mock and Charles J. Swift",
  title =        "The {\sc Share} 709 System: {Programmed} Input-Output
                 Buffering",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "145--151",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bratman:1959:SSS,
  author =       "Harvey Bratman and Ira V. {Boldt, Jr.}",
  title =        "The {\sc Share} 709 System: {Supervisory} Control",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "152--155",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hildebrandt:1959:REI,
  author =       "Paul Hildebrandt and Harold Isbitz",
  title =        "Radix Exchange---An Internal Sorting Method for
                 Digital Computers",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "156--163",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Marimont:1959:NMC,
  author =       "Rosalind B. Marimont",
  title =        "A New Method for Checking the Consistency of
                 Precedence Matrices",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "164--171",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Joachim:1959:ME,
  author =       "Gertrud S. Joachim",
  title =        "Memory Efficiency",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "172--175",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstine:1959:PDN,
  author =       "H. H. Goldstine and L. P. Horowitz",
  title =        "A Procedure for the Diagonalization of Normal
                 Matrices",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "176--195",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:26 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "eig; nla; normal matrix",
}

@Article{Milne:1959:SNS,
  author =       "W. E. Milne and R. R. Reynolds",
  title =        "Stability of a Numerical Solution of Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "196--203",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320964.320976",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In 1926 Milne [1] published a numerical method for the
                 solution of ordinary differential equations. This
                 method turns out to be unstable, as shown by Muhin [2],
                 Hildebrand [3], Liniger [4], and others. Instability
                 was not too serious in the day of desk calculators but
                 is fatal in the modern era of high speed computers. The
                 basic cause of the instability in this particular
                 method is the use of Simpson's rule to perform the
                 final integration. Simpson's rule integrates over two
                 intervals, and under certain conditions can produce an
                 error which alternates in sign from step to step and
                 which increases in magnitude exponentially. It is the
                 purpose of this paper to show that the occasional
                 application of Newton's ``three eighths'' quadrature
                 formula over three intervals can effectively damp out
                 the unwanted oscillation without harm to the desired
                 solution.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ehrlich:1959:MCS,
  author =       "Louis W. Ehrlich",
  title =        "{Monte Carlo} Solutions of Boundary Value Problems
                 Involving the Difference Analogue of
                 $\partial^2u/\partial x^2 + \partial^2u/\partial y^2 +
                 ({K}/y)(\partial u/\partial y) = 0$",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "204--218",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morrison:1959:NQM,
  author =       "David Morrison",
  title =        "Numerical Quadrature in Many Dimensions",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "219--222",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Caldwell:1959:NDM,
  author =       "George C. Caldwell",
  title =        "A Note on the Downhill Method",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "223--225",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Milnes:1959:BCS,
  author =       "Harold W. Milnes and Renfrey B. Potts",
  title =        "Boundary Contraction Solution of {Laplace}'s
                 Differential Equation",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "226--235",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cuthill:1959:MNB,
  author =       "Elizabeth H. Cuthill and Richard S. Varga",
  title =        "A Method of Normalized Block Iteration",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "236--244",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1959:FCF,
  author =       "H. Allen Curtis",
  title =        "A Functional Canonical Form",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "245--258",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1959:RSS,
  author =       "Seymour Ginsburg",
  title =        "On the Reduction of Superfluous States in a Sequential
                 Machine",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "259--282",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blum:1959:EDF,
  author =       "Marvin Blum",
  title =        "On Exponential Digital Filters",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "283--304",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wheeler:1959:LEM,
  author =       "D. J. Wheeler and H. P. F. Swinnerton-Dyer",
  title =        "Letter to the Editor: ``{A} Method for Transposing a
                 Matrix''",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "305--305",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:39 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Berman:1958:MTM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1959:BRb,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "2",
  pages =        "306--312",
  month =        apr,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Leiner:1959:PNM,
  author =       "A. L. Leiner and W. A. Notz and J. L. Smith and A.
                 Weinberger",
  title =        "{PILOT} --- a New Multiple Computer System",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "313--335",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilkinson:1959:SRM,
  author =       "J. H. Wilkinson",
  title =        "Stability of the Reduction of a Matrix to Almost
                 Triangular and Triangular Forms by Elementary
                 Similarity Transformations",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "336--359",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:14 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fike:1959:NPC,
  author =       "C. T. Fike",
  title =        "Note on the Practical Computation of Proper Values",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "360--362",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilf:1959:SCN,
  author =       "Herbert S. Wilf",
  title =        "A Stability Criterion for Numerical Integration",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "363--365",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Corbato:1959:GSB,
  author =       "Fernando J. Corbat{\'o} and Jack L. Uretsky",
  title =        "Generation of Spherical {Bessel} Functions in Digital
                 Computers",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "366--375",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Muller:1959:CMG,
  author =       "Mervin E. Muller",
  title =        "A Comparison of Methods for Generating Normal Deviates
                 on Digital Computers",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "376--383",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320986.320992",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:33:26 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "RVG",
  fjournal =     "Journal of the ACM",
  HDnumber =     "87",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ralston:1959:FQF,
  author =       "A. Ralston",
  title =        "A Family of Quadrature Formulas Which Achieve High
                 Accuracy in Composite Rules",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "384--394",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1959:ADP,
  author =       "Philip C. {Curtis, Jr.} and Werner L. Frank",
  title =        "An Algorithm for the Determination of the Polynomial
                 of Best Minimax Approximation to a Function Defined on
                 a Finite Point Set",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "395--404",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Netherwood:1959:LMT,
  author =       "Douglas B. Netherwood",
  title =        "Logic Matrices and the Truth Function Problem",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "405--414",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ashenhurst:1959:UFP,
  author =       "Robert L. Ashenhurst and Nicholas Metropolis",
  title =        "Unnormalized Floating Point Arithmetic",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "415--428",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/320986.320996",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "68.00",
  MRnumber =     "MR0105833 (21 \#4568)",
  MRreviewer =   "H. H. Goldstine",
  bibdate =      "Fri Dec 08 13:06:24 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  ZMnumber =     "0121.12102",
  abstract =     "Algorithms for floating point computer arithmetic are
                 described, in which fractional parts are not subject to
                 the usual normalization convention. These algorithms
                 give results in a form which furnishes some indication
                 of their degree of precision. An analysis of one-stage
                 error propagation is developed for each operation; a
                 suggested statistical model for long-run error
                 propagation is also set forth.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blair:1959:CTM,
  author =       "Charles R. Blair",
  title =        "On Computer Transcription of Manual {Morse}",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "429--442",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1959:BRc,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "3",
  pages =        "443--458",
  month =        jul,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:07:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Nagler:1959:AS,
  author =       "H. Nagler",
  title =        "Amphisbaenic Sorting",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "459--468",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:44:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also
                 \cite{Lively:1960:LER,Nagler:1961:LEA,Goetz:1961:LEI}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lieblein:1959:GAV,
  author =       "Julius Lieblein",
  title =        "A General Analysis of Variance Scheme Applicable to a
                 Computer With a Very Large Memory",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "469--475",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gauss:1959:CMO,
  author =       "E. J. Gauss",
  title =        "A Comparison of Machine Organizations by Their
                 Performance of the Iteration Solution of Linear
                 Equations",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "476--485",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 10:27:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Gauss:1960:CCM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bellman:1959:ADP,
  author =       "Richard Bellman and John Holland and Robert Kalaba",
  title =        "On an Application of Dynamic Programming to the
                 Synthesis of Logical Systems",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "486--493",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sheldon:1959:SNS,
  author =       "J. W. Sheldon",
  title =        "On the Spectral Norms of Several Iterative Processes",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "494--505",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hoffman:1959:MSB,
  author =       "Walter Hoffman and Richard Pavley",
  title =        "A Method for the Solution of the ${N}$th Best Path
                 Problem",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "506--514",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{DiDonato:1959:NFC,
  author =       "A. R. DiDonato and A. V. Hershey",
  title =        "New Formulas for Computing Incomplete Elliptic
                 Integrals of the First and Second Kind",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "515--526",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Green:1959:ETA,
  author =       "Bert F. {Green, Jr.} and J. E. Keith Smith and Laura
                 Klem",
  title =        "Empirical Tests of an Additive Random Number
                 Generator",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "527--537",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:10:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1959:MCF,
  author =       "H. Allen Curtis",
  title =        "Multifunctional Circuits in Functional Canonical
                 Form",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "538--547",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1959:BRd,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "6",
  number =       "4",
  pages =        "548--556",
  month =        oct,
  year =         "1959",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ferguson:1960:IOB,
  author =       "David E. Ferguson",
  title =        "Input-Output Buffering and {Fortran}",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "1--9",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stein:1960:CAD,
  author =       "Marvin L. Stein and Jack Rose",
  title =        "Changing from Analog to Digital Programming by Digital
                 Techniques",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "10--23",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bellman:1960:SMA,
  author =       "Richard Bellman",
  title =        "Sequential Machines, Ambiguity, and Dynamic
                 Programming",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "24--28",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Juncosa:1960:ICR,
  author =       "M. L. Juncosa and T. W. Mullikin",
  title =        "On the Increase of Convergence Rates of Relaxation
                 Procedures for Elliptic Partial Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "29--36",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chow:1960:BCS,
  author =       "Tse-Sun Chow and Harold Willis Milnes",
  title =        "Boundary Contraction Solution of {Laplace}'s
                 Differential Equation {II}",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "37--45",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Milne:1960:SNS,
  author =       "W. E. Milne and R. R. Reynolds",
  title =        "Stability of a Numerical Solution of Differential
                 Equations---{Part II}",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "46--56",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Galler:1960:GTC,
  author =       "B. A. Galler and D. P. Rozenburg",
  title =        "A Generalization of a Theorem of {Carr} on Error
                 Bounds for {Runge--Kutta} Procedures",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "57--60",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anderson:1960:NMS,
  author =       "W. H. Anderson and R. B. Ball and J. R. Voss",
  title =        "A Numerical Method for Solving Control Differential
                 Equations on Digital Computers",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "61--68",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weeg:1960:TEG,
  author =       "Gerard P. Weeg",
  title =        "Truncation Error in the {Graeffe} Root-Squaring
                 Method",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "69--71",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coveyou:1960:SCG,
  author =       "R. R. Coveyou",
  title =        "Serial Correlation in the Generation of Pseudo-Random
                 Numbers",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "72--74",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rotenburg:1960:NPR,
  author =       "A. Rotenburg",
  title =        "A New Pseudo-Random Number Generator",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "75--77",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:32 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "RNG; linear congruential generator",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstine:1960:FRP,
  author =       "H. H. Goldstine",
  title =        "Footnote to a Recent Paper",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "78--79",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In a recent paper [1] I stated that von Neumann had
                 originated the suggestion for the use of Schur's
                 canonical form for arbitrary matrices. I have since
                 learned that the suggestion actually is due in the
                 first instance to John Greenstadt, who brought it to
                 von Neumann's attention. The history of this is rather
                 interesting and was communicated to me in a letter from
                 John Greenstadt, which I quote below. ``The full story
                 is, that the triangularization occurred to me early in
                 1953, after trying in vain to find a general iterative
                 diagonalization procedure, even where one knew that it
                 was possible to diagonalize (defective degeneracy being
                 the impossible case). It seemed to me that one thing
                 that made for the stability of the Jacobi method was
                 the fact that all the elements in the transformation
                 matrix were less than 1. A natural generalization
                 embodying this requirement was to consider unitary
                 transformations. Then, a quick check of Murnaghan's
                 book showed that one could hope only to triangularize,
                 but that this was always possible. ``I did some hand
                 calculations on this, and lo and behold! it converged
                 in the few cases I tried. I then programmed it for the
                 CPC and tried many other cases. For several months
                 thereafter, Kogbetliantz, John Sheldon, and I tried to
                 prove convergence, when the algorithm involved the
                 sequential annihilation of off-diagonal elements. We
                 (particularly Sheldon) tried many approaches, but with
                 no hint of success. Finally, in the latter part of
                 1953, we decided to ask von Neumann, who was then a
                 consultant for IBM, when he was in New York at our
                 offices. ``I had prepared a writeup describing the
                 procedure, but von Neumann (rightly) didn't want to
                 bother reading it, so I explained it to him in about
                 two minutes. He spent the next 15 minutes thinking up
                 all the approaches we had thought of in three or four
                 months, plus a few ones --- all, however, without
                 promise.'' At this point he decided that it was a
                 nontrivial problem, and perhaps not worth it anyway,
                 and immediately suggested minimizing the sum of squares
                 of subdiagonal elements, which is, of course, the truly
                 natural generalization of the Jacobi method. For the
                 next 15 minutes he investigated the case when it would
                 be impossible to make an improvement for a particular
                 pivotal element and found that these cases were of
                 measure zero. ``I recoded my procedure for the 701 and
                 tried many other matrices of various sizes. I myself
                 never had a failure, but it has since been demonstrated
                 that the method will indeed fail for a class of
                 matrices. Hence, a proof is clearly impossible.
                 However, I think a statistical proof is possible, along
                 lines suggested by Kogbetliantz, which, however, I have
                 not been able to find. I do not think von Neumann's
                 variation of the method would fail. (However, it is
                 more complicated and time consuming.)''",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1960:BR,
  author =       "R. W. Hamming",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "1",
  pages =        "80--86",
  month =        jan,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gelernter:1960:FCL,
  author =       "Herbert Gelernter and J. R. Hansen and C. L.
                 Gerberich",
  title =        "A {Fortran}-Compiled List-Processing Language",
  journal =      j-j-ACM,
  volume =       "7",
  number =       "2",
  pages =        "87--101",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:52 1994",
  bibsource =    "Ai/lisp.bib; Compiler/garbage.collection.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Prawitz:1960:MPP,
  author =       "Dag Prawitz and H{\aa}kan Prawitz and Neri Voghera",
  title =        "A Mechanical Proof Procedure and its Realization in an
                 Electronic Computer",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "102--128",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1960:NMP,
  author =       "Gerard Salton",
  title =        "A New Method for the Payment of Bills and the Transfer
                 of Credit",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "140--149",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maehly:1960:MFR,
  author =       "Hans J. Maehly",
  title =        "Methods for Fitting Rational Approximations, {Part I}:
                 Telescoping Procedures for Continued Fractions",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "150--162",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Esch:1960:NSC,
  author =       "Robin E. Esch",
  title =        "A Necessary and Sufficient Condition for Stability of
                 Partial Difference Equation Problems",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "163--175",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:04:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alonso:1960:SMT,
  author =       "R. Alonso",
  title =        "A Starting Method for the Three-Point {Adams}
                 Predictor-Corrector Method",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "176--180",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Flinn:1960:MFM,
  author =       "E. A. Flinn",
  title =        "A Modification of {Filon}'s Method of Numerical
                 Integration",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "181--184",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morrison:1960:RUT,
  author =       "David D. Morrison",
  title =        "Remarks on the Unitary Triangularization of a
                 Nonsymmetric Matrix",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "185--186",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lively:1960:LER,
  author =       "J. A. Lively",
  title =        "Letter to the Editor: {Remarks} on ``{Amphisbaenic}
                 Sorting''",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "187--187",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See
                 \cite{Nagler:1959:AS,Nagler:1961:LEA,Goetz:1961:LEI}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gauss:1960:CCM,
  author =       "E. J. Gauss",
  title =        "Corrigendum: ``{A} Comparison of Machine Organizations
                 by Their Performance of the Iteration Solution of
                 Linear Equations''",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "188--188",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Gauss:1959:CMO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1960:BR,
  author =       "Anonymous",
  title =        "Book Reviews",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "189--200",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "The {\em Book Reviews\/} contributions move to {\em
                 ACM Computing Reviews\/} after this issue.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Davis:1960:CPQ,
  author =       "Martin Davis and Hilary Putman",
  title =        "A Computing Procedure for Quantification Theory",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "201--215",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:02 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Logic",
}

@Article{Maron:1960:RPI,
  author =       "M. E. Maron and J. L. Kuhns",
  title =        "On Relevance, Probabilistic Indexing and Information
                 Retrieval",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "216--244",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:19 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/bibdb.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Freiberger:1960:CFF,
  author =       "Walter F. Freiberger and Richard H. Jones",
  title =        "Computation of the Frequency Function of a Quadratic
                 Form in Random Normal Variables",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "245--250",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gill:1960:ANN,
  author =       "Arthur Gill",
  title =        "Analysis of Nets by Numerical Methods",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "251--254",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harary:1960:CPM,
  author =       "Frank Harary",
  title =        "On the Consistency of Precedence Matrices",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "255--259",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ortega:1960:SST,
  author =       "J. M. Ortega",
  title =        "On {Sturm} Sequences for Tridiagonal Matrices",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "260--263",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Conte:1960:ADM,
  author =       "Samuel D. Conte and Ralph T. Dames",
  title =        "On an Alternating Direction Method for Solving the
                 Plate Problem with Mixed Boundary Conditions",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "264--273",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Frank:1960:SLS,
  author =       "Werner L. Frank",
  title =        "Solution of Linear Systems by {Richardson}'s Method",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "274--286",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fitzpatrick:1960:SBR,
  author =       "G. B. Fitzpatrick",
  title =        "Synthesis of Binary Ring Counters of Given Periods",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "3",
  pages =        "287--297",
  month =        jul,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Prather:1960:CAD,
  author =       "Ronald Prather",
  title =        "Computational Aids for Determining the Minimal Form of
                 a Truth Function",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "299--310",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1960:CPP,
  author =       "Seymour Ginsburg",
  title =        "Connective Properties Preserved in Minimal State
                 Machines",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "311--325",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Miller:1960:IPF,
  author =       "C. E. Miller and A. W. Tucker and R. A. Zemlin",
  title =        "Integer Programming Formulation of Traveling Salesman
                 Problems",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "326--329",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kleinfeld:1960:TEV,
  author =       "Erwin Kleinfeld",
  title =        "Techniques for Enumerating {Veblen-Wedderburn}
                 Systems",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "330--337",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Osborne:1960:PCM,
  author =       "E. E. Osborne",
  title =        "On Pre-Conditioning of Matrices",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "338--345",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:09 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "nla; preconditioning; scaling",
}

@Article{Bareiss:1960:RPM,
  author =       "Erwin H. Bareiss",
  title =        "Resultant Procedure and the Mechanization of the
                 {Graeffe} Process",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "346--386",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gordon:1960:NMC,
  author =       "N. L. Gordon and A. H. Flasterstein",
  title =        "A Note on a Method of Computing the Gamma Function",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "387--388",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Flores:1960:CTA,
  author =       "Ivan Flores",
  title =        "Computer Time for Address Calculation Sorting",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "4",
  pages =        "389--409",
  month =        oct,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wadey:1960:FPA,
  author =       "W. G. Wadey",
  title =        "Floating-Point Arithmetics",
  journal =      j-J-ACM,
  volume =       "7",
  number =       "2",
  pages =        "129--139",
  month =        apr,
  year =         "1960",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "65.00 (68.00)",
  MRnumber =     "22\#6090",
  bibdate =      "Fri Dec 08 14:44:46 1995",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Three types of floating-point arithmetics with error
                 control are discussed and compared with conventional
                 floating-point arithmetic. General multiplication and
                 division shift criteria are derived (for any base) for
                 Metropolis-style arithmetics. The limitations and most
                 suitable range of application for each arithmetic are
                 discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  reviewer =     "C. B. Haselgrove",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Keller:1961:FAP,
  author =       "Herbert B. Keller",
  title =        "Finite Automata, Pattern Recognition and Perceptrons",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "1--20",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:15:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gautschi:1961:RCC,
  author =       "Walter Gautschi",
  title =        "Recursive Computation of Certain Integrals",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "21--40",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:16:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Flores:1961:AIC,
  author =       "Ivan Flores",
  title =        "Analysis of Internal Computer Sorting",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "41--80",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:16:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Goetz:1961:LEI}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1961:STA,
  author =       "Seymour Ginsburg",
  title =        "Sets of Tapes Accepted by Different Types of
                 Automata",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "81--86",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fraenkel:1961:UIC,
  author =       "Aviezri S. Fraenkel",
  title =        "The User of Index Calculus and {Mersenne} Primes for
                 the Design of a High-Speed Digital Multiplier",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "87--96",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Leiner:1961:SGP,
  author =       "A. L. Leiner and W. W. Youden",
  title =        "A System for Generating ``Pronounceable'' Names Using
                 a Computer",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "97--103",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:01:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Denman:1961:CGO,
  author =       "Harry H. Denman",
  title =        "Computer Generation of Optimized Subroutines",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "104--116",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:02:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Gardner:1961:LEO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Nagler:1961:LEA,
  author =       "H. Nagler",
  title =        "Letter to the Editor: an Answer to {Mr. J. A.
                 Lively}'s Remarks on the Paper ``{Amphisbaenic}
                 Sorting''",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "1",
  pages =        "117--117",
  month =        jan,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:37:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See
                 \cite{Lively:1960:LER,Nagler:1959:AS,Goetz:1961:LEI}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Knuth:1961:MDL,
  author =       "Donald E. Knuth",
  title =        "Minimizing Drum Latency Time",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "119--150",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:23:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lehmer:1961:MMS,
  author =       "D. H. Lehmer",
  title =        "A Machine Method for Solving Polynomial Equations",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "151--162",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:26 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Lehmer's method; nlop; polynomial",
}

@Article{Greenberger:1961:NNP,
  author =       "Martin Greenberger",
  title =        "Notes on a New Pseudo-Random Number Generator",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "163--167",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:28 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "The IBM RNG!",
  descriptors =  "RNG; linear congruential generator",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lombardi:1961:SHF,
  author =       "Lionello Lombardi",
  title =        "System Handling of Functional Operators",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "168--185",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Calingaert:1961:TDP,
  author =       "Peter Calingaert",
  title =        "Two-Dimensional Parity Checking",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "186--200",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Walsh:1961:CFM,
  author =       "John E. Walsh",
  title =        "Computer-Feasible Method for Handling Incomplete Data
                 in Regression Analysis",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "201--211",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hooke:1961:DSS,
  author =       "Robert Hooke and T. A. Jeeves",
  title =        "``Direct Search'' Solution of Numerical and
                 Statistical Problems",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "212--229",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Totschek:1961:IRT,
  author =       "R. Totschek and R. C. Wood",
  title =        "An Investigation of Real-Time Solution of the
                 Transportation Problem",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "230--239",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gutenmakher:1961:PUI,
  author =       "L. I. Gutenmakher and G. E. Vleduts",
  title =        "The Prospects for the Utilization of
                 Informational-Logical Machines in Chemistry ({USSR})",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "240--251",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brigham:1961:GSP,
  author =       "R. C. Brigham and P. D. Burgess",
  title =        "Generalized Simulation of Post Office Systems",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "252--259",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gurk:1961:DSI,
  author =       "Herbert M. Gurk and Jack Minker",
  title =        "The Design and Simulation of an Information Processing
                 System",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "260--270",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stiles:1961:AFI,
  author =       "H. Edmund Stiles",
  title =        "The Association Factor in Information Retrieval",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "2",
  pages =        "271--279",
  month =        apr,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:37 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/bibdb.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilkinson:1961:EAD,
  author =       "J. H. Wilkinson",
  title =        "Error Analysis of Direct Methods of Matrix Inversion",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "281--330",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:51 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "lud; nla; rounding error",
}

@Article{Johansen:1961:MGM,
  author =       "Donald E. Johansen",
  title =        "A Modified {Givens} Method for the Eigenvalue
                 Evaluation of Large Matrices",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "331--335",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chow:1961:NSN,
  author =       "Tse-Sun Chow and Harold Willis Milnes",
  title =        "Numerical Solution of the {Neumann} and Mixed Boundary
                 Value Problems by Boundary Contraction",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "336--358",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Parter:1961:SCR,
  author =       "Seymour V. Parter",
  title =        "Some Computational Results on ``Two-line'' Iterative
                 Methods for the Biharmonic Difference Equation",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "359--365",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Klopfenstein:1961:ZNF,
  author =       "R. W. Klopfenstein",
  title =        "Zeros of Nonlinear Functions",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "366--373",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Campbell:1961:NCT,
  author =       "Edwin S. Campbell and R. Buehler and J. O.
                 Hirschfelder and D. Hughes",
  title =        "Numerical Construction of {Taylor} Series
                 Approximations for a Set of Simultaneous First Order
                 Differential Equations",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "374--383",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lee:1961:CAM,
  author =       "C. Y. Lee",
  title =        "Categorizing Automata by ${W}$-Machine Programs",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "384--399",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:42:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1961:CSI,
  author =       "Seymour Ginsburg",
  title =        "Compatibility of States in Input-Independent
                 Machines",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "400--403",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maron:1961:AIE,
  author =       "M. E. Maron",
  title =        "Automatic Indexing: an Experiment Inquiry",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "404--417",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gauss:1961:LLW,
  author =       "E. J. Gauss",
  title =        "Locating the Largest Word in a File Using a Modified
                 Memory",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "418--425",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:08:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Heller:1961:SAM,
  author =       "J. Heller",
  title =        "Sequencing Aspects of Multiprogramming",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "426--439",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ormsby:1961:DNF,
  author =       "Joseph F. A. Ormsby",
  title =        "Design of Numerical Filters with Applications to
                 Missile Data Processing",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "3",
  pages =        "440--466",
  month =        jul,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Arbib:1961:TMF,
  author =       "Michael Arbib",
  title =        "{Turing} Machines, Finite Automata and Neural Nets",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "467--475",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Watanabe:1961:SSS,
  author =       "Shigere Watanabe",
  title =        "$5$-Symbol $8$-State and $5$-Symbol $6$-State
                 Universal {Turing} Machines",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "476--483",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 01 16:57:47 2002",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1961:GTC,
  author =       "H. Allen Curtis",
  title =        "A Generalized Tree Circuit",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "484--496",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 252 is title page

@Article{Chu:1961:SMS,
  author =       "J. T. Chu",
  title =        "Some Methods for Simplifying Switching Circuits Using
                 ``Don't Care'' Conditions",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "497--512",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schwartz:1961:ASP,
  author =       "Eugene S. Schwartz",
  title =        "An Automatic Sequencing Procedure With Application to
                 Parallel Programming",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "513--537",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bourne:1961:SMS,
  author =       "Charles P. Bourne and Donald F. Ford",
  title =        "A Study of Methods for Systematically Abbreviating
                 {English} Words and Names",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "538--552",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Doyle:1961:SRM,
  author =       "Lauren B. Doyle",
  title =        "Semantic Road Maps for Literature Searchers",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "553--578",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 570 is notice page

@Article{Floyd:1961:DLS,
  author =       "Robert W. Floyd",
  title =        "A Descriptive Language for Symbol Manipulation",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "579--584",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ott:1961:DSM,
  author =       "Gene Ott and Neil H. Feinstein",
  title =        "Design of Sequential Machines from Their Regular
                 Expressions",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "585--600",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hibbard:1961:LUB,
  author =       "Thomas N. Hibbard",
  title =        "Least Upper Bounds on Minimal Terminal State
                 Experiments for Two Classes of Sequential Machines",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "601--612",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Spielberg:1961:RPS,
  author =       "Kurt Spielberg",
  title =        "Representation of Power Series in Terms of
                 Polynomials, Rational Approximations and Continued
                 Fractions",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "613--627",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Osborne:1961:LSS,
  author =       "E. E. Osborne",
  title =        "On Least Squares Solutions of Linear Equations",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "628--636",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:22 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Cited in {\AA ke Bj\"orck's} bibliography on least
                 squares, which is available by anonymous ftp from {\tt
                 math.liu.se} in {\tt pub/references}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "least squares; linear system; nla",
}

@Article{Froese:1961:ERK,
  author =       "Charlotte Froese",
  title =        "An Evaluation of {Runge--Kutta} Type Methods for
                 Higher Order Differential Equations",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "637--644",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blum:1961:ABB,
  author =       "E. K. Blum and P. C. {Curtis, Jr.}",
  title =        "Asymptotic Behavior of the Best Polynomial
                 Approximation",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "645--647",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gardner:1961:LEO,
  author =       "R. J. Gardner and T. H. Gosling",
  title =        "Letter to the Editor: ``{Optimized} Subroutines''",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "648--649",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Denman:1961:CGO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goetz:1961:LEI,
  author =       "Martin Goetz",
  title =        "Letter to the Editor: ``{Internal} Sorting and
                 External Merging''",
  journal =      j-J-ACM,
  volume =       "8",
  number =       "4",
  pages =        "649--650",
  month =        oct,
  year =         "1961",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See
                 \cite{Nagler:1959:AS,Lively:1960:LER,Flores:1961:AIC,Nagler:1961:LEA}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brooker:1962:GTP,
  author =       "R. A. Brooker and D. Morris",
  title =        "A General Translation Program for Phrase Structure
                 Languages",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "1--10",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Warshall:1962:TBM,
  author =       "Stephen Warshall",
  title =        "A Theorem on {Boolean} Matrices",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "11--12",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hibbard:1962:SCP,
  author =       "Thomas N. Hibbard",
  title =        "Some Combinatorial Properties of Certain Trees With
                 Applications to Sorting and Searching",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "13--28",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:39:52 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Description of a binary tree algorithm.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Williams:1962:APS,
  author =       "Leland H. Williams",
  title =        "Algebra of Polynomials in Several Variables for a
                 Digital Computer",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "29--40",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:31:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Estrin:1962:OFP,
  author =       "G. Estrin and C. R. Viswanathan",
  title =        "Organization of a ``Fixed-Plus-Variable'' Structure
                 Computer for Computation of Eigenvalues and
                 Eigenvectors of Real Symmetric Matrices",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "41--60",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:31:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Estrin:1962:CAO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bellman:1962:DPT,
  author =       "Richard Bellman",
  title =        "Dynamic Programming Treatment of the Travelling
                 Salesman Problem",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "61--63",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Milne:1962:FOM,
  author =       "W. E. Milne and R. R. Reynolds",
  title =        "Fifth-Order Methods for the Numerical Solution of
                 Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "64--70",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{vonHoldt:1962:ITD,
  author =       "Richard E. {von Holdt}",
  title =        "Inversion of Triple-Diagonal Compound Matrices",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "71--83",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:25:38 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 150 is notice page

@Article{Phillips:1962:TNS,
  author =       "David L. Phillips",
  title =        "A Technique for the Numerical Solution of Certain
                 Integral Equations of the First Kind",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "84--97",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morrison:1962:OMS,
  author =       "D. Morrison",
  title =        "Optimal Mesh Size in the Numerical Integration of an
                 Ordinary Differential Equation",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "98--103",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Crane:1962:SGC,
  author =       "Roger L. Crane and Robert J. Lambert",
  title =        "Stability of a Generalized Corrector Formula",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "104--117",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hansen:1962:QJM,
  author =       "Eldon R. Hansen",
  title =        "On Quasicyclic {Jacobi} Methods",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "118--135",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:24 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "nla",
}

@Article{Lombardi:1962:MSN,
  author =       "Lionello Lombardi",
  title =        "Mathematical Structure of Nonarithmetic Data
                 Processing Procedures",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "1",
  pages =        "136--159",
  month =        jan,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:02:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bottenbruch:1962:SUA,
  author =       "H. Bottenbruch",
  title =        "Structure and Use of {ALGOL 60}",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "161--221",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Arden:1962:ATB,
  author =       "Bruce W. Arden and Bernard A. Galler and Robert M.
                 Graham",
  title =        "An Algorithm for Translating {Boolean} Expressions",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "222--239",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alt:1962:DPR,
  author =       "Franz L. Alt",
  title =        "Digital Pattern Recognition by Moments",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "240--258",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:54 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Doyle:1962:OUS,
  author =       "W. Doyle",
  title =        "Operations Useful for Similarity-Invariant Pattern
                 Recognition",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "259--267",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1962:MAN,
  author =       "D. R. Smith and C. H. Davidson",
  title =        "Maintained Activity in Neural Nets",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "268--279",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kramer:1962:NSC,
  author =       "Henry P. Kramer",
  title =        "A Note on the Self-Consistency Definitions of
                 Generalization and Inductive Inference",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "280--281",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:57 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/colt.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bose:1962:SP,
  author =       "R. C. Bose and R. J. Nelson",
  title =        "A Sorting Problem",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "2",
  pages =        "282--296",
  month =        apr,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:05:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Holland:1962:OLT,
  author =       "John H. Holland",
  title =        "Outline for a Logical Theory of Adaptive Systems",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "297--314",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:23 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/alife.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Early work on genetic algorithms. Reprinted in
                 \cite{Burks:1970:ECA}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Friedman:1962:DPC,
  author =       "Joyce Friedman",
  title =        "A Decision Procedure for Computations of Finite
                 Automata",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "315--323",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1962:MRV,
  author =       "H. Allen Curtis",
  title =        "Multiple Reduction of Variable Dependency of
                 Sequential Machines",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "324--344",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weeg:1962:SAO,
  author =       "G. P. Weeg",
  title =        "The Structure of an Automaton and Its
                 Operation-Preserving Transformation Group",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "345--349",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1962:TFL,
  author =       "Seymour Ginsburg and H. Gordon Rice",
  title =        "Two Families of Languages Related to {ALGOL}",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "350--371",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sobel:1962:OSN,
  author =       "Sheldon Sobel",
  title =        "Oscillating Sort --- a New Sort Merging Technique",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "372--374",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bailey:1962:SFS,
  author =       "John S. Bailey and George Epstein",
  title =        "Single Function Shifting Counters",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "375--378",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 422 is blank

@Article{Peterka:1962:MOS,
  author =       "James J. Peterka",
  title =        "A Method for Obtaining Specific Values of
                 Compiling-Parameter Functions",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "379--386",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Holdiman:1962:MTR,
  author =       "Thomas A. Holdiman",
  title =        "Management Techniques for Real Time Computer
                 Programming",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "387--404",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weintraub:1962:CBP,
  author =       "Sol Weintraub",
  title =        "Cumulative Binomial Probabilities",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "3",
  pages =        "405--407",
  month =        jul,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:09:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dulmage:1962:MAH,
  author =       "A. L. Dulmage and N. S. Mendelsohn",
  title =        "Matrices Associated with the {Hitchcock} Problem",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "409--418",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kurtzberg:1962:AMA,
  author =       "Jerome M. Kurtzberg",
  title =        "On Approximation Methods for the Assignment Problem",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "419--439",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Jones:1962:ANA,
  author =       "Terence G. Jones",
  title =        "An Algorithm for the Numerical Application of a Linear
                 Operator",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "440--449",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Douglas:1962:ADM,
  author =       "Jim {Douglas, Jr.} and James E. Gunn",
  title =        "Alternating Direction Methods for Parabolic Systems in
                 $m$ Space Variables",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "450--456",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chase:1962:SPP,
  author =       "P. E. Chase",
  title =        "Stability Properties of Predictor-Corrector Methods
                 for Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "457--468",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fleck:1962:IGA,
  author =       "A. C. Fleck",
  title =        "Isomorphism Groups of Automata",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "469--476",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cantor:1962:APB,
  author =       "David G. Cantor",
  title =        "On the Ambiguity Problem of {Backus} Systems",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "477--479",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grau:1962:TOS,
  author =       "A. A. Grau",
  title =        "A Translator-Oriented Symbolic Programming Language",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "480--487",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Falkoff:1962:APS,
  author =       "A. D. Falkoff",
  title =        "Algorithms for Parallel-Search Memories",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "488--511",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:36 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baker:1962:IRB,
  author =       "Frank B. Baker",
  title =        "Information Retrieval Based Upon Latent Class
                 Analysis",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "512--521",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Estrin:1962:CAO,
  author =       "G. Estrin and C. R. Viswanathan",
  title =        "Correction and Addendum: ``{Organization} of a
                 `Fixed-Plus-Variable' Structure Computer for
                 Computation of Eigenvalues and Eigenvectors of Real
                 Symmetric Matrices''",
  journal =      j-J-ACM,
  volume =       "9",
  number =       "4",
  pages =        "522--522",
  month =        oct,
  year =         "1962",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 20:11:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Estrin:1962:OFP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1963:FRS,
  author =       "J. Hartmanis",
  title =        "Further Results on the Structure of Sequential
                 Machines",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "78--88",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Gluss:1963:MOS,
  author =       "Brian Gluss",
  title =        "A Method for Obtaining Suboptimal Group-Testing
                 Policies Using Dynamic Programming and Information
                 Theory",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "89--96",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Twomey:1963:NSF,
  author =       "S. Twomey",
  title =        "On the Numerical Solution of {Fredholm} Integral
                 Equations of the First Kind by the Inversion of the
                 Linear System Produced by Quadrature",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "97--101",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Hansen:1963:DM,
  author =       "Eldon R. Hansen",
  title =        "On the {Danilewski} Method",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "102--109",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Gill:1963:WDP,
  author =       "Arthur Gill",
  title =        "On a Weight Distribution Problem, with Application to
                 the Design of Stochastic Generators",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "110--122",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321150.321159",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Corbato:1963:CJM,
  author =       "F. J. Corbat{\'{o}}",
  title =        "On the Coding of {Jacobi}'s Method for Computing
                 Eigenvalues and Eigenvectors of Symmetric Matrices",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "123--125",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:42:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Allard:1963:MCR,
  author =       "J. L. Allard and A. R. Dobell and T. E. Hull",
  title =        "Mixed Congruential Random Number Generators for
                 Decimal Machines",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "131--141",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Hibbard:1963:SSA,
  author =       "Thomas N. Hibbard",
  title =        "A Simple Sorting Algorithm",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "142--150",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Borko:1963:ADC,
  author =       "Harold Borko and Myrna Bernick",
  title =        "Automatic Document Classification",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "151--162",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:45:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Borko:1964:ADC}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Robinson:1963:TPC,
  author =       "J. A. Robinson",
  title =        "Theorem-Proving on the Computer",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "163--174",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Ginsburg:1963:OWP,
  author =       "Seymour Ginsburg and G. F. Rose",
  title =        "Operations Which Preserve Definability in Languages",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "175--195",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Gorn:1963:DGA,
  author =       "Saul Gorn",
  title =        "Detection of Generative Ambiguities in Context-Free
                 Mechanical Languages",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "196--208",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Liu:1963:SVA,
  author =       "C. N. Liu",
  title =        "A State Variable Assignment Method for Asynchronous
                 Sequential Switching Circuits",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "209--216",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:43:09 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/async.circuits.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{House:1963:ECP,
  author =       "R. W. House and T. Rado",
  title =        "Erratum: ``{On} a Computer Program for Obtaining
                 Irreducible Representations for Two-Level Multiple
                 Input-Output Logical Systems''",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "256--256",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:00:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{House:1963:CPO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Maehly:1963:MFR,
  author =       "Hans J. Maehly",
  title =        "Methods for Fitting Rational Approximations, Parts
                 {II} and {III}",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "257--278",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Ralston:1963:ERF,
  author =       "Anthony Ralston",
  title =        "On Economization of Rational Functions",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "279--282",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:43:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Valentine:1963:AMP,
  author =       "Charles W. Valentine and C. Peter {Van Dine}",
  title =        "An Algorithm for Mimimax Polynomial Curve-Fitting of
                 Discrete Data",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "283--290",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:43:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Hull:1963:EPC,
  author =       "T. E. Hull and A. L. Creemer",
  title =        "Efficiency of Predictor-Corrector Procedures",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "291--301",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Hartley:1963:MCC,
  author =       "H. O. Hartley and D. L. Harris",
  title =        "{Monte Carlo} Computations in Normal Correlation
                 Problems",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "302--306",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Floyd:1963:SAO,
  author =       "Robert W. Floyd",
  title =        "Syntactic Analysis and Operator Precedence",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "316--333",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Klein:1963:CAG,
  author =       "Sheldon Klein and Robert F. Simmons",
  title =        "A Computational Approach to Grammatical Coding of
                 {English} Words",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "334--347",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Friedman:1963:CPS,
  author =       "Joyce Friedman",
  title =        "A Computer Program for a Solvable Case of the Decision
                 Problem",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "348--356",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Berlekamp:1963:PDD,
  author =       "Elwyn R. Berlekamp",
  title =        "Program for Double-Dummy Bridge Problems --- a New
                 Strategy for Mechanical Game Playing",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "357--364",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Farr:1963:LPS,
  author =       "Edwin H. Farr",
  title =        "Lattice Properties of Sequential Machines",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "365--385",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Curtis:1963:UDT,
  author =       "H. Allen Curtis",
  title =        "Use of Decomposition Theory in the Solution of the
                 State Assignment Problem of Sequential Machines",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "386--411",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:47:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Lee-Whiting:1963:EFC,
  author =       "G. E. Lee-Whiting",
  title =        "Erratum: ``{Formulas} for Computing Incomplete
                 Elliptic Integrals of the First and Second Kinds''",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "412--412",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:59:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Lee-Whiting:1963:FCI}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Salton:1963:ADR,
  author =       "Gerard Salton",
  title =        "Associative Document Retrieval Techniques Using
                 Bibliographic Information",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "440--457",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Mattson:1963:FWC,
  author =       "R. L. Mattson and O. Firschein",
  title =        "Feature Word Construction for Use with Pattern
                 Recognition Algorithms: an Experimental Study",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "458--477",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:43:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Ginsburg:1963:QCF,
  author =       "Seymour Ginsburg and Edwin H. Spanier",
  title =        "Quotients of Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "487--492",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Simon:1963:EHC,
  author =       "Herbert A. Simon",
  title =        "Experiments with a Heuristic Compiler",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "493--506",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Slagle:1963:HPS,
  author =       "James R. Slagle",
  title =        "A Heuristic Program that Solves Symbolic Integration
                 Problems in Freshman Calculus",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "507--520",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Oehmke:1963:SAI,
  author =       "Robert H. Oehmke",
  title =        "On the Structures of an Automaton and Its Input
                 Semigroup",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "521--525",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Rabin:1963:WHT,
  author =       "Michael O. Rabin and Hao Wang",
  title =        "Words in the History of a {Turing} Machine with a
                 Fixed Input",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "526--527",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Ritchie:1963:FAS,
  author =       "Robert W. Ritchie",
  title =        "Finite Automata and the Set of Squares",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "528--531",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Ben-Israel:1963:EMC,
  author =       "A. Ben-Israel and S. J. Wersan",
  title =        "An Elimination Method for Computing the Generalized
                 Inverse of an Arbitrary Complex Matrix",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "532--537",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Grau:1963:RNR,
  author =       "A. A. Grau",
  title =        "On the Reduction of Number Range in the Use of the
                 {Graeffe} Process",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "538--544",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Rich:1963:MFA,
  author =       "Robert P. Rich and Harry Shaw",
  title =        "A Method for Finding All the Zeros of $f(z)$",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "545--549",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Freudenstein:1963:NSS,
  author =       "Ferdinand Freudenstein and Bernard Roth",
  title =        "Numerical Solution of Systems of Nonlinear Equations",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "550--556",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Emanuel:1963:WSC,
  author =       "George Emanuel",
  title =        "The {Wilf} Stability Criterion for Numerical
                 Integration",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "557--561",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Curtis:1963:GTC,
  author =       "H. Allen Curtis",
  title =        "Generalized Tree Circuit---The Basic Building Block of
                 an Extended Decomposition Theory",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "562--581",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:00:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Youden:1963:IV,
  author =       "W. W. Youden",
  title =        "Index, Volumes 1--10 (1954--1963)",
  journal =      j-J-ACM,
  volume =       "10",
  pages =        "583--646",
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:00:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  xxmonth =      "none",
  xxnumber =     "none",
}

@Article{Friedman:1963:SDP,
  author =       "Joyce Friedman",
  title =        "A Semi-Decision Procedure for the Functional
                 Calculus",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "1--24",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 23:17:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harrison:1963:NCI,
  author =       "Michael A. Harrison",
  title =        "The Number of Classes of Invertible {Boolean}
                 Functions",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "25--28",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:19:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1963:SRU,
  author =       "Seymour Ginsburg and Gene F. Rose",
  title =        "Some Recursively Unsolvable Problems in {ALGOL}-Like
                 Languages",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "29--47",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:19:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{House:1963:CPO,
  author =       "R. W. House and T. Rado",
  title =        "On a Computer Program for Obtaining Irreducible
                 Representations for Two-Level Multiple Input-Output
                 Logical Systems",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "1",
  pages =        "48--77",
  month =        jan,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{House:1963:ECP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lee-Whiting:1963:FCI,
  author =       "G. E. Lee-Whiting",
  title =        "Formulas for Computing Incomplete Elliptic Integrals
                 of the First and Second Kinds",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "2",
  pages =        "126--130",
  month =        apr,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 22:55:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Lee-Whiting:1963:EFC}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shepherdson:1963:CRF,
  author =       "J. C. Shepherdson and H. E. Sturgis",
  title =        "Computability of Recursive Functions",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "2",
  pages =        "217--255",
  month =        apr,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:47:23 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Math/hilbert10.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Trainiter:1963:ARA,
  author =       "M. Trainiter",
  title =        "Addressing for Random-Access Storage with Multiple
                 Bucket Capabilities",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "3",
  pages =        "307--315",
  month =        jul,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jul 21 10:19:36 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schwartz:1963:DMR,
  author =       "Eugene S. Schwartz",
  title =        "A Dictionary for Minimum Redundancy Encoding",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "4",
  pages =        "413--439",
  month =        oct,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:43:54 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Data on and use of word frequencies.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baber:1963:TST,
  author =       "R. L. Baber",
  title =        "Tape Searching Techniques",
  journal =      j-J-ACM,
  volume =       "10",
  number =       "4",
  pages =        "478--486",
  month =        oct,
  year =         "1963",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:43:33 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Backspacing versus rewinding (no backward reading) to
                 known records.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rutledge:1964:IPS,
  author =       "J. D. Rutledge",
  title =        "On {Ianov}'s Program Schemata",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "1--9",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brown:1964:TSA,
  author =       "R. R. Brown",
  title =        "Tape Sets and Automata",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "10--14",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cocke:1964:UTS,
  author =       "John Cocke and Marvin Minsky",
  title =        "Universality of Tag Systems with ${P} = 2$",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "15--20",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Farber:1964:SSM,
  author =       "D. J. Farber and R. E. Griswold and I. P. Polonsky",
  title =        "{SNOBOL}, a String Manipulation Language",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "21--30",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321207",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:44:13 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  checked =      "19 July 1993",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hull:1964:MCR,
  author =       "T. E. Hull and A. R. Dobell",
  title =        "Mixed Congruential Random Number Generators for Binary
                 Machines",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "31--40",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321208",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Random number generators of the mixed congruential
                 type have recently been proposed. They appear to have
                 some advantages over those of the multiplicative type,
                 except that their statistical behavior is
                 unsatisfactory in some cases. It is shown theoretically
                 that a certain class of these mixed generators should
                 be expected to fail statistical tests for randomness.
                 Extensive testing confirms this hypothesis and makes
                 possible a more precise definition of the
                 unsatisfactory class. It is concluded that the
                 advantages of mixed generators can be realized only in
                 special circumstances. On machines with relatively
                 short multiplication times the multiplicative
                 generators are to be preferred.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stockmal:1964:CPR,
  author =       "Frank Stockmal",
  title =        "Calculations with Pseudo-Random Numbers",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "41--52",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321209",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{LaBudde:1964:TNC,
  author =       "C. Donald {La Budde}",
  title =        "Two New Classes of Algorithms for Finding the
                 Eigenvalues and Eigenvectors of Real Symmetric
                 Matrices",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "53--58",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:44:38 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/gvl.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stoer:1964:DMC,
  author =       "Josef Stoer",
  title =        "A Direct Method for {Chebyshev} Approximation by
                 Rational Functions",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "59--69",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pickard:1964:TGS,
  author =       "William F. Pickard",
  title =        "Tables of the Generalized {Stirling} Numbers of the
                 First Kind",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "70--78",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Giammo:1964:MMA,
  author =       "T. Giammo",
  title =        "A Mathematical Model for the Automatic Scaling of a
                 Function",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "79--83",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yoeli:1964:ATA,
  author =       "Michael Yoeli and Shlomo Rinon",
  title =        "Application of Ternary Algebra to the Study of Static
                 Hazards",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "84--97",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gauss:1964:EPS,
  author =       "E. J. Gauss",
  title =        "Estimation of Power Spectral Density by Filters",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "98--103",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pollack:1964:MRC,
  author =       "Maurice Pollack",
  title =        "Message Route Control in a Large Teletype Network",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "104--116",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cooper:1964:FRD,
  author =       "William S. Cooper",
  title =        "Fact Retrieval and Deductive Question-Answering
                 Information Retrieval Systems",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "117--137",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Borko:1964:ADC,
  author =       "Harold Borko and Myrna Bernick",
  title =        "Automatic Document Classification. {Part II}.
                 {Additional} Experiments",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "138--151",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:45:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Borko:1963:ADC}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schroeder:1964:IDS,
  author =       "R. Schroeder",
  title =        "Input Data Source Limitations for Real-Time Operation
                 of Digital Computers",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "152--158",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:13:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Randell:1964:SST,
  author =       "B. Randell and L. J. Russell",
  title =        "Single-Scan Techniques for the Translation of
                 Arithmetic Expressions in {ALGOL 60}",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "159--167",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ashenhurst:1964:FEU,
  author =       "R. L. Ashenhurst",
  title =        "Function Evaluation in Unnormalized Arithmetic",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "168--187",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 202 is notice page

@Article{Gragg:1964:GMP,
  author =       "William B. Gragg and Hans J. Stetter",
  title =        "Generalized Multistep Predictor-Corrector Methods",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "188--209",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tornheim:1964:CMI,
  author =       "Leonard Tornheim",
  title =        "Convergence of Multipoint Iterative Methods",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "210--220",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:45:13 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "iter; multipoint method; nlop",
}

@Article{Ferguson:1964:MCI,
  author =       "James Ferguson",
  title =        "Multivariable curve interpolation",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "221--228",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 3 22:44:40 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pickard:1964:TSS,
  author =       "William F. Pickard",
  title =        "Tables for the Step-by-Step Integration of Ordinary
                 Differential Equations of the First Order",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "229--233",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hemmerle:1964:ASS,
  author =       "W. J. Hemmerle",
  title =        "Algebraic Specification of Statistical Models for
                 Analysis of Variance Computations",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "234--239",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1964:DCS,
  author =       "K. U. Smith and S. D. Ansell and J. Koehler and G. H.
                 Servos",
  title =        "Digital Computer System for Dynamic Analysis of Speech
                 and Sound Feedback Mechanisms",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "2",
  pages =        "240--251",
  month =        apr,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1964:EAF,
  author =       "James R. Slagle",
  title =        "An Efficient Algorithm for Finding Certain
                 Minimum-Cost Procedures for Making Binary Decisions",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "253--264",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:33:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Flores:1964:DWT,
  author =       "Ivan Flores",
  title =        "Derivation of a Waiting-Time Factor for a
                 Multiple-Bank Memory",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "265--282",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lawler:1964:AMB,
  author =       "Eugene L. Lawler",
  title =        "An Approach to Multilevel {Boolean} Minimization",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "283--294",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cohn:1964:PLM,
  author =       "Martin Cohn",
  title =        "Properties of Linear Machines",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "296--301",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1964:SMM,
  author =       "Seymour Ginsburg and Thomas N. Hibbard",
  title =        "Solvability of Machine Mappings of Regular Sets to
                 Regular Sets",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "302--312",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Elgot:1964:RMA,
  author =       "C. C. Elgot and J. D. Rutledge",
  title =        "{RS}-Machines with Almost Blank Tape",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "313--337",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 23:22:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Winograd:1964:IEL,
  author =       "S. Winograd",
  title =        "Input-Error-Limiting Automata",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "338--351",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gershinsky:1964:AHI,
  author =       "Morris Gershinsky and David A. Levine",
  title =        "{Aitken-Hermite} Interpolation",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "352--356",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kronmal:1964:EPN,
  author =       "Richard Kronmal",
  title =        "Evaluation of a Pseudorandom Normal Number Generator",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "3",
  pages =        "357--363",
  month =        jul,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321229.321238",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:45:35 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "RVG",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Elgot:1964:RAS,
  author =       "Calvin C. Elgot and Abraham Robinson",
  title =        "Random-Access Stored Program Machines, an Approach to
                 Programming Languages",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "365--399",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:52:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Klingman:1964:NPA,
  author =       "W. R. Klingman and D. M. Himmelblau",
  title =        "Nonlinear Programming with the Aid of a
                 Multiple-Gradient Summation Technique",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "400--415",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:24:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartt:1964:SAP,
  author =       "Kenneth Hartt",
  title =        "Some Analytical Procedures for Computers and their
                 Applications to a Class of Multidimensional Integrals",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "416--421",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pyle:1964:GIC,
  author =       "L. Duane Pyle",
  title =        "Generalized Inverse Computations Using the Gradient
                 Projection Method",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "422--428",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krider:1964:FAA,
  author =       "Lee Krider",
  title =        "A Flow Analysis Algorithm",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "429--436",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{OConnor:1964:MIM,
  author =       "John O'Connor",
  title =        "Mechanized Indexing Methods and their Testing",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "437--449",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sackman:1964:ICO,
  author =       "Harold Sackman and J. B. Munson",
  title =        "Investigation of Computer Operating Time and System
                 Capacity for Man-Machine Digital Systems",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "450--464",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Edwards:1964:CPP,
  author =       "A. Wood Edwards and Robert L. Chambers",
  title =        "Can {A} Priori Probabilities Help in Character
                 Recognition?",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "465--470",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dressler:1964:ERT,
  author =       "R. F. Dressler and W. Werner",
  title =        "Error Rates for Two Methods of Statistical Pattern
                 Recognition",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "471--480",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:23:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brzozowski:1964:DRE,
  author =       "Janusz A. Brzozowski",
  title =        "Derivatives of Regular Expressions",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "4",
  pages =        "481--494",
  month =        oct,
  year =         "1964",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:53:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Curtis:1965:TMS,
  author =       "M. W. Curtis",
  title =        "A {Turing} Machine Simulator",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "1--13",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McLure:1965:PLS,
  author =       "Robert M. McLure",
  title =        "A Programming Language for Simulating Digital
                 Systems",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "14--22",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:47:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Robinson:1965:MOL,
  author =       "J. A. Robinson",
  title =        "A Machine-Oriented Logic Based on the Resolution
                 Principle",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "23--41",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:47:12 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/CLiCS.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "foundations; history; Prolog; resolution;
                 unification",
}

@Article{Greibach:1965:NNF,
  author =       "Sheila A. Greibach",
  title =        "A New Normal-Form Theorem for Context-Free Phrase
                 Structure Grammars",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "42--52",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wolman:1965:FOC,
  author =       "Eric Wolman",
  title =        "A Fixed Optimum Cell-Size for Records of Various
                 Lengths",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "53--70",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:47:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Glass:1965:SSM,
  author =       "H. Glass and L. Cooper",
  title =        "Sequential Search: a Method for Solving Constrained
                 Optimized Problems",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "71--82",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{MacLaren:1965:URN,
  author =       "M. Donald MacLaren and George Marsaglia",
  title =        "Uniform Random Number Generators",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "83--89",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321250.321257",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "65.15",
  MRnumber =     "30 \#687 (MR 170449)",
  bibdate =      "Mon Jan 22 17:05:44 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 MathSciNet database",
  ZMnumber =     "0143.40101",
  abstract =     "This paper discusses the testing of methods for
                 generating uniform random numbers in a computer---the
                 commonly used multiplicative and mixed congruential
                 generators as well as two new methods. Tests proposed
                 here are more stringent than those usually applied,
                 because the usual tests for randomness have passed
                 several of the commonly-used procedures which
                 subsequently gave poor results in actual Monte Carlo
                 calculations. The principal difficulty seems to be that
                 certain simple functions of $n$-tuples of uniform
                 random numbers do not have the distribution that
                 probability theory predicts.\par

                 Two alternative generating methods are described, one
                 of them using a table of uniform numbers, the other one
                 combining two congruential generators. Both of these
                 methods passed the tests, whereas the conventional
                 multiplicative and mixed congruential methods did
                 not.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "numerical analysis",
  oldlabel =     "MacLarenM65",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/jacm/MacLarenM65",
}

@Article{Booker:1965:NES,
  author =       "Aaron Booker",
  title =        "Numerical Evaluation of Symmetric Polynomials",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "90--94",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hockney:1965:FDS,
  author =       "R. W. Hockney",
  title =        "A Fast Direct Solution of {Poisson}'s Equation Using
                 {Fourier} Analysis",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "95--113",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:46:32 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "direct Poisson solver; FFT; nla",
}

@Article{Bramble:1965:ASM,
  author =       "J. H. Bramble and B. E. Hubbard",
  title =        "Approximation of Solutions of Mixed Boundary Value
                 Problems for {Poisson}'s Equation by Finite
                 Differences",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "114--123",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Butcher:1965:MMM,
  author =       "J. C. Butcher",
  title =        "A Modified Multistep Method for the Numerical
                 Integration of Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "124--135",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anders:1965:EBN,
  author =       "Edward B. Anders",
  title =        "An Error Bound for a Numerical Filtering Technique",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "136--140",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gill:1965:ASS,
  author =       "Arthur Gill",
  title =        "Analysis and Synthesis of Stable Linear Sequential
                 Circuits",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "1",
  pages =        "141--149",
  month =        jan,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:47:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Broome:1965:DOS,
  author =       "Paul W. Broome",
  title =        "Discrete Orthogonal Sequences",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "151--168",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 23:26:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moursund:1965:EMR,
  author =       "David G. Moursund",
  title =        "Examination of Multiple Roots and Root Clusters of a
                 Polynomial Using the {Bernoulli} Procedure",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "169--174",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Glauz:1965:NSO,
  author =       "R. D. Glauz",
  title =        "On the Numerical Solution of Ordinary and Partial
                 Differential Equations Using Integral Relations",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "175--180",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dunham:1965:CPM,
  author =       "Charles B. Dunham",
  title =        "Convergence Problems in {Maehly}'s Second Method",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "181--186",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weeg:1965:AGD,
  author =       "G. P. Weeg",
  title =        "The Automorphism Group of the Direct Product of
                 Strongly Related Automata",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "187--195",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 00:13:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Weeg:1967:CAG}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lin:1965:CST,
  author =       "Shen Lin and Tibor Rado",
  title =        "Computer Studies of {Turing} Machine Problems",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "196--212",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chu:1965:ODF,
  author =       "J. T. Chu",
  title =        "Optimum Decision Functions for Computer Character
                 Recognition",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "213--226",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Crane:1965:PCA,
  author =       "R. L. Crane and R. W. Klopfenstein",
  title =        "A Predictor-Corrector Algorithm with an Increased
                 Range of Absolute Stability",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "227--241",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kanner:1965:NBC,
  author =       "Herbert Kanner",
  title =        "Number Base Conversion in Significant Digit
                 Arithmetic",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "242--246",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Penney:1965:BSC,
  author =       "Walter Penney",
  title =        "A ``Binary'' System for Complex Numbers",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "247--248",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sanders:1965:DAC,
  author =       "Jerry Sanders",
  title =        "Document Association and Classification Based on
                 ${L}$-Languages",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "249--253",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:42:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Glicksman:1965:CME,
  author =       "Stephen Glicksman",
  title =        "Concerning the Merging of Equal Length Tape Files",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "254--258",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:24:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dixon:1965:COS,
  author =       "W. J. Dixon and R. A. Kronmal",
  title =        "The Choice of Origin and Scale for Graphs",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "259--261",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sheng:1965:TLE,
  author =       "C. L. Sheng",
  title =        "Threshold Logic Elements Used as a Probability
                 Transformer",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "262--276",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:30:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Sheng:1965:CTL}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Winograd:1965:TRP,
  author =       "S. Winograd",
  title =        "On the Time Required to Perform Addition",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "277--285",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stineman:1965:DTD,
  author =       "R. W. Stineman",
  title =        "Digital Time-Domain Analysis of Systems with Widely
                 Separated Poles",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "2",
  pages =        "286--294",
  month =        apr,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fraser:1965:SMC,
  author =       "W. Fraser",
  title =        "A Survey of Methods for Computing Minimax and
                 Near-Minimax Polynomial Approximations for Functions of
                 a Single Independent Variable",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "295--314",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321281.321282",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Methods are described for the derivation of minimax
                 and near-minimax polynomial approximations. For minimax
                 approximations techniques are considered for both
                 analytically defined functions and functions defined by
                 a table of values. For near-minimax approximations
                 methods of determining the coefficients of the
                 Fourier--Chebyshev expansion are first described. These
                 consist of the rearrangement of the coefficients of a
                 power polynomial, and also direct determination of the
                 coefficients from the integral which defines them, or
                 the differential equation which defines the function.
                 Finally there is given a convenient modification of an
                 interpolation scheme which finds coefficients of a
                 near-minimax approximation without requiring numerical
                 integration or the numerical solution of a system of
                 equations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yershov:1965:OVM,
  author =       "A. P. Yersh{\'{o}}v",
  title =        "One View of Man-Machine Interaction (Translated by
                 {Nicholas Zvegintzov})",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "315--325",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Conn:1965:ODS,
  author =       "Richard W. Conn and Richard E. von Holdt",
  title =        "An Online Display for the Study of Approximating
                 Functions",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "326--349",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Menon:1965:PCC,
  author =       "M. V. Menon",
  title =        "On a Problem Concerning a Central Storage Device
                 Served by Multiple Terminals",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "350--355",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Winters:1965:MML,
  author =       "William K. Winters",
  title =        "A Modified Method of Latent Class Analysis for File
                 Organization in Information Retrieval",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "356--363",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mileto:1965:SCA,
  author =       "Franco Mileto and Gianfranco Putzolu",
  title =        "Statistical Complexity of Algorithms for {Boolean}
                 Function Minimization",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "364--375",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:14:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Mileto:1966:CSC}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{SimoesPereira:1965:BME,
  author =       "J. M. S. {Sim{\~o}es Pereira}",
  title =        "On the {Boolean} Matrix Equation
                 {$M'=\vee_{i=1}M^i$}",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "376--382",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:41:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{SimoesPereira:1967:CBM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moursund:1965:CSL,
  author =       "David Moursund",
  title =        "{Chebyshev} Solution of $n + 1$ Linear Equations in
                 $n$ Unknowns",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "383--387",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fischer:1965:GPO,
  author =       "Patrick C. Fischer",
  title =        "Generation of Primes by a One-Dimensional Real-Time
                 Iterative Array",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "388--394",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:17:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Newman:1965:LMU,
  author =       "D. J. Newman",
  title =        "Location of the Maximum on Unimodal Surfaces",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "395--398",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Paz:1965:UDS,
  author =       "A. Paz and B. Peleg",
  title =        "Ultimate-Definite and Symmetric-Definite Events and
                 Automata",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "399--410",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yoeli:1965:GCD,
  author =       "Michael Yoeli",
  title =        "Generalized Cascade Decompositions of Automata",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "411--422",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1965:MLT,
  author =       "Seymour Ginsburg and Edwin H. Spanier",
  title =        "Mappings of Languages by Two-Tape Devices",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "423--434",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:47:10 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  comment =      "Introduces shuffle operator",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sheng:1965:CTL,
  author =       "C. L. Sheng",
  title =        "Correction: ``{Threshold} Logic Elements Used as a
                 Probability Transformer''",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "3",
  pages =        "435--435",
  month =        jul,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:24:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Sheng:1965:TLE}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Meyers:1965:MCN,
  author =       "Leroy F. Meyers",
  title =        "Morphological Classification in the {National Bureau
                 of Standards} Mechanical Translation System",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "437--472",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:56:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Doyle:1965:ACR,
  author =       "Lauren B. Doyle",
  title =        "Is Automatic Classification a Reasonable Application
                 of Statistical Analysis of Text?",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "473--489",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:50:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{OConnor:1965:ASR,
  author =       "John O'Connor",
  title =        "Automatic Subject Recognition in Scientific Papers:
                 {An} Empirical Study",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "490--515",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Golomb:1965:BP,
  author =       "Solomon W. Golomb and Leonard D. Baumert",
  title =        "Backtrack Programming",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "516--524",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 00:50:33 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "graph coloring related algorithm",
}

@Article{Srinivasan:1965:ISC,
  author =       "A. V. Srinivasan",
  title =        "An Investigation of Some Computational Aspects of
                 Integer Programming",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "525--535",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wos:1965:ECS,
  author =       "Lawrence Wos and George A. Robinson and Daniel F.
                 Carson",
  title =        "Efficiency and Completeness of the Set of Support
                 Strategy in Theorem Proving",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "536--541",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:51:05 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rao:1965:MMA,
  author =       "T. R. N. Rao and N. Zierler",
  title =        "On Mappings for Modular Arithmetic, {I}",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "542--544",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Berkovits:1965:MMA,
  author =       "S. Berkovits and M. Schlessing and N. Zierler",
  title =        "On Mappings for Modular Arithmetic, {II}",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "545--546",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anderson:1965:IPN,
  author =       "Donald G. Anderson",
  title =        "Iterative Procedures for Nonlinear Integral
                 Equations",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "547--560",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Barnes:1965:GAS,
  author =       "Bruce Barnes",
  title =        "Groups of Automorphisms and Sets of Equivalence
                 Classes of Input for Automata",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "561--565",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fleck:1965:AGA,
  author =       "A. C. Fleck",
  title =        "On the Automorphism Group of an Automaton",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "566--569",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fischer:1965:FTM,
  author =       "Patrick C. Fischer",
  title =        "On Formalisms for {Turing} Machines",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "570--580",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chang:1965:ART,
  author =       "Wei Chang and Donald J. Wong",
  title =        "Analysis of Real Time Multiprogramming",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "581--588",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dennis:1965:SDM,
  author =       "Jack B. Dennis",
  title =        "Segmentation and the Design of Multiprogrammed
                 Computer Systems",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "589--602",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 08:47:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dantzig:1965:UPF,
  author =       "G. B. Dantzig and R. P. Harvey and R. D. McKnight",
  title =        "Updating the Product Form of the Inverse for the
                 Revised Simplex Method ({A} Summary)",
  journal =      j-J-ACM,
  volume =       "12",
  number =       "4",
  pages =        "603--603",
  month =        oct,
  year =         "1965",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:52:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "The complete paper is published in {\em Proceedings of
                 the 20th National Conference of the Association for
                 Computing Machinery, Cleveland, August 1965}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Arden:1966:PAS,
  author =       "B. W. Arden and B. A. Galler and T. C. O'Brien and F.
                 H. Westervelt",
  title =        "Program and Addressing Structure in a Time-Sharing
                 Environment",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "1--16",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yershov:1966:AAP,
  author =       "A. P. Yersh{\'{o}}v",
  title =        "{ALPHA}---An Automatic Programming System of High
                 Efficiency",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "17--24",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Sep 30 16:00:04 1996",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schwartz:1966:LPC,
  author =       "J. Schwartz",
  title =        "Large Parallel Computers",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "25--32",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gill:1966:RIO,
  author =       "A. Gill",
  title =        "Realization of Input-Output Relations by Sequential
                 Machines",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "33--42",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Horwitz:1966:IRA,
  author =       "L. P. Horwitz and R. M. Karp and R. E. Miller and S.
                 Winograd",
  title =        "Index Register Allocation",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "43--61",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 3 22:59:07 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "optimization compilation assignment classic",
}

@Article{Ginsburg:1966:ACF,
  author =       "Seymour Ginsburg and Joseph Ullian",
  title =        "Ambiguity in Context Free Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "62--89",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 10 11:15:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gilbert:1966:SAL,
  author =       "Philip Gilbert",
  title =        "On the Syntax of Algorithmic Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "90--107",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:16:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dunham:1966:CPM,
  author =       "Charles B. Dunham",
  title =        "Convergence Problems in {Maehly}'s Second Method:
                 {Part II}",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "108--113",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Byrne:1966:PRK,
  author =       "George D. Byrne and Robert J. Lambert",
  title =        "Pseudo-{Runge--Kutta} Methods Involving Two Points",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "114--123",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maddison:1966:PNL,
  author =       "R. N. Maddison",
  title =        "A Procedure for Nonlinear Least Squares Refinement in
                 Adverse Practical Conditions",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "124--134",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Barlow:1966:MSR,
  author =       "C. A. {Barlow, Jr.} and E. L. Jones",
  title =        "A Method for the Solution of Roots of a Nonlinear
                 Equation and for Solution of the General Eigenvalue
                 Problem",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "135--142",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tsuda:1966:NLE,
  author =       "Takao Tsuda and Hiroshi Matsumoto",
  title =        "A Note on Linear Extrapolation of Multivariable
                 Functions by the {Monte Carlo} Method",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "143--150",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harrison:1966:AES,
  author =       "Michael A. Harrison",
  title =        "On Asymptotic Estimates in Switching and Automata
                 Theory",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "151--157",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salomaa:1966:TCA,
  author =       "Arto Salomaa",
  title =        "Two Complete Axiom Systems for the Algebra of Regular
                 Events",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "158--169",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/math.prog.construction.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Trauth:1966:GTA,
  author =       "Charles A. {Trauth, Jr.}",
  title =        "Group-Type Automata",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "1",
  pages =        "170--175",
  month =        jan,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:34:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kleinrock:1966:SPM,
  author =       "Leonard Kleinrock",
  title =        "Sequential Processing Machines ({S.P.M.}) Analyzed
                 with a Queueing Theory Model",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "179--193",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:35:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weiss:1966:VPI,
  author =       "Ruth A. Weiss",
  title =        "{BE VISION}, a Package of {IBM 7090 FORTRAN}
                 Programs to Draw Orthographic Views of Combinations of
                 Plane and Quadric Surfaces",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "194--204",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "algorithms; curves and surfaces; graphics",
}

@Article{Welch:1966:MAC,
  author =       "John T. {Welch, Jr.}",
  title =        "A Mechanical Analysis of the Cyclic Structure of
                 Undirected Linear Graphs",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "205--210",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ramamoorthy:1966:AGC,
  author =       "C. V. Ramamoorthy",
  title =        "Analysis of Graphs by Connectivity Considerations",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "211--222",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cook:1966:SDP,
  author =       "Stephen A. Cook",
  title =        "The Solvability of the Derivability Problem for
                 One-Normal Systems",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "223--225",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maurer:1966:TCI,
  author =       "Ward Douglas Maurer",
  title =        "A Theory of Computer Instructions",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "226--235",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kobayashi:1966:CPD,
  author =       "Kojiro Kobayashi and Shigeru Sekiguchi",
  title =        "On the Class of Predicates Decidable by Two-Way
                 Multitape Finite Automata",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "236--261",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Holtz:1966:SRD,
  author =       "Howard Holtz and C. T. Leondes",
  title =        "The Synthesis of Recursive Digital Filters",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "262--280",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Minsky:1966:USN,
  author =       "Marvin Minsky and Seymour Papert",
  title =        "Unrecognizable Sets of Numbers",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "281--286",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Usmani:1966:BVT,
  author =       "Riaz A. Usmani",
  title =        "Boundary Value Techniques for the Numerical Solution
                 of Certain Initial Value Problems in Ordinary
                 Differential Equations",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "287--295",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rabinowitz:1966:NEC,
  author =       "Philip Rabinowitz",
  title =        "Numerical Experiments in Conformal Mapping by the
                 Method of Orthonormal Polynomials",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "296--303",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:36:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bledsoe:1966:SRM,
  author =       "W. W. Bledsoe",
  title =        "Some Results on Multicategory Pattern Recognition",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "2",
  pages =        "304--316",
  month =        apr,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krishnamoorthi:1966:TSO,
  author =       "B. Krishnamoorthi and Roger C. Wood",
  title =        "Time-Shared Operations with Both Interarrival and
                 Service Times Exponential",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "317--338",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reinwald:1966:CLE,
  author =       "Lewis T. Reinwald and Richard M. Soland",
  title =        "Conversion of Limited-Entry Decision Tables to Optimal
                 Computer Programs {I}: {Minimum} Average Processing
                 Time",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "339--358",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hooper:1966:MPN,
  author =       "Philip K. Hooper",
  title =        "Monogenic Post Normal Systems of Arbitrary Degree",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "359--363",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1966:PUI,
  author =       "Seymour Ginsburg and Joseph Ullian",
  title =        "Preservation of Unambiguity and Inherent Ambiquity in
                 Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "364--368",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Porter:1966:UMG,
  author =       "Sigmund N. Porter",
  title =        "Use of Multiwrite for General Programmability of
                 Search Memories",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "369--373",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krogh:1966:PCM,
  author =       "Fred T. Krogh",
  title =        "Predictor-Corrector Methods of High Order With
                 Improved Stability Characteristics",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "374--385",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chartres:1966:ACP,
  author =       "Bruce A. Chartres",
  title =        "Automatic Controlled Precision Calculations",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "386--403",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 28 16:23:06 2003",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Recent developments in computer design and error
                 analysis have made feasible the use of variable
                 precision arithmetic and the preparation of programs
                 that automatically determine their own precision
                 requirements. Such programs enable the user to specify
                 the accuracy he wants, and yield answers guaranteed to
                 lie within the bounds prescribed. A class of such
                 programs, called ``contracting error programs'', is
                 defined in which the precision is determined by
                 prescribing error bounds on the data. A variant of
                 interval arithmetic is defined which enables a limited
                 class of algorithms to be programmed as contracting
                 error programs. A contracting error program for the
                 solution of simultaneous linear equations is described,
                 demonstrating the application of the idea to a wider
                 class of problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{MacLaren:1966:ISR,
  author =       "M. Donald MacLaren",
  title =        "Internal Sorting by Radix Plus Sifting",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "404--411",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bailey:1966:GSE,
  author =       "John S. Bailey",
  title =        "Generalized Single-Ended Counters",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "412--418",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weeks:1966:NIL,
  author =       "William T. Weeks",
  title =        "Numerical Inversion of {Laplace} Transforms Using
                 {Laguerre} Functions",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "419--429",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:00:46 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "Mathematics; Laplace transform; inversion",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1966:CIF,
  author =       "R. W. Hamming and R. S. Pinkham",
  title =        "A Class of Integration Formulas",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "430--438",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Erdelyi:1966:ROL,
  author =       "Ivan Erdelyi",
  title =        "On the ``Reverse Order Law'' Related to the
                 Generalized Inverse of Matrix Products",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "439--443",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Overheu:1966:AMS,
  author =       "D. L. Overheu",
  title =        "An Abstract Machine for Symbolic Computation",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "444--468",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mileto:1966:CSC,
  author =       "Franco Mileto and Gianfranco Potzolu",
  title =        "Corrigenda: ``{Statistical} Complexity of Algorithms
                 for {Boolean} Function Minimization''",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "3",
  pages =        "469--469",
  month =        jul,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:36:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Mileto:1965:SCA}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenfeld:1966:SOD,
  author =       "Azriel Rosenfeld and John L. Pfaltz",
  title =        "Sequential Operations in Digital Picture Processing",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "471--494",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:40:47 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blum:1966:FSD,
  author =       "E. K. Blum",
  title =        "A Formal System of Differentiation",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "495--504",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anders:1966:ERI,
  author =       "Edward B. Anders",
  title =        "An Extension of {Romberg} Integration Procedures to
                 ${N}$-Variables",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "505--510",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:37:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dubey:1966:SDC,
  author =       "Satya D. Dubey",
  title =        "Statistical Determination of Certain Mathematical
                 Constants and Functions Using Computers",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "511--525",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Toyoda:1966:AAA,
  author =       "Junichi Toyoda and Yoshikazu Tezuka and Yoshiro
                 Kasahara",
  title =        "Analysis of the Address Assignment Problem for
                 Clustered Keys",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "526--532",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:41:45 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hennie:1966:TTS,
  author =       "F. C. Hennie and R. E. Stearns",
  title =        "Two-Tape Simulations of Multitape {Turing} Machines",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "533--546",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:17:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chaitin:1966:LPC,
  author =       "Gregory J. Chaitin",
  title =        "On the Length of Programs for Computing Finite Binary
                 Sequences",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "547--569",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321356.321363",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The use of Turing machines for calculating finite
                 binary sequences is studied from the point of view of
                 information theory and the theory of recursive
                 functions. Various results are obtained concerning the
                 number of:instructions ia programs. A modified form of
                 Turing machine is studied from the same point of view.
                 Aa application to the problem of defining a patternless
                 sequence is proposed in terms of the concepts here
                 developed.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  rawdata =      "Chaitin, Gregory J. (1966) ``On the Lengths of
                 Programs for Computing Finite Binary Sequences,'' {\it
                 Journal of the ACM}, {\bf13}(4):547--569, October.",
}

@Article{Parikh:1966:CFL,
  author =       "Rohit J. Parikh",
  title =        "On Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "570--581",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:17:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Greibach:1966:URL,
  author =       "Sheila A. Greibach",
  title =        "The Unsolvability of the Recognition of Linear
                 Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "582--587",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hibbard:1966:IIA,
  author =       "Thomas N. Hibbard and Joseph Ullian",
  title =        "The Independence of Inherent Ambiguity From
                 Complementedness Among Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "588--593",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:17:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hooper:1966:IPP,
  author =       "Philip K. Hooper",
  title =        "The Immortality Problem for Post Normal Systems",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "594--599",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shaw:1966:DAC,
  author =       "H. Shaw",
  title =        "Discrete Analogs for Continuous Filters",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "600--604",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Negron:1966:DOT,
  author =       "C. D. Negron",
  title =        "Digital One-Third Octave Spectral Analysis",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "605--614",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:59:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mamelak:1966:PCL,
  author =       "J. S. Mamelak",
  title =        "The Placement of Computer Logic Modules",
  journal =      j-J-ACM,
  volume =       "13",
  number =       "4",
  pages =        "615--629",
  month =        oct,
  year =         "1966",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:01:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Perlis:1967:SAS,
  author =       "Alan J. Perlis",
  title =        "The Synthesis of Algorithmic Systems",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "1--9",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321371.321372",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:37:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This is the 1966 ACM Turing Award Lecture, and the
                 first award.",
}

@Article{Wunderlich:1967:SPD,
  author =       "Marvin C. Wunderlich",
  title =        "Sieving Procedures on a Digital Computer",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "10--19",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:08:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lewis:1967:SDS,
  author =       "P. A. W. Lewis and P. B. Baxendale and J. L. Bennett",
  title =        "Statistical Discrimination of the Synonymy\slash
                 Antonymy Relationship Between Words",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "20--44",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:08:39 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brans:1967:CPN,
  author =       "Carl H. Brans",
  title =        "A Computer Program for the Nonnumerical Testing and
                 Reduction of Sets of Algebraic Partial Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "45--62",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 23:40:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chartres:1967:CEB,
  author =       "Bruce A. Chartres and James C. Geuder",
  title =        "Computable Error Bounds for Direct Solution of Linear
                 Equations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "63--71",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:48:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stewart:1967:MDM,
  author =       "G. W. {Stewart III}",
  title =        "A Modification of {Davidon}'s Minimization Method to
                 Accept Difference Approximations to Derivatives",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "72--83",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:42:13 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "nlop; quasi-Newton",
}

@Article{Butcher:1967:MGR,
  author =       "John C. Butcher",
  title =        "A Multistep Generalization of {Runge--Kutta} Methods
                 With Four or Five Stages",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "84--99",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 23:41:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coveyou:1967:FAU,
  author =       "R. R. Coveyou and R. D. MacPherson",
  title =        "{Fourier} Analysis of Uniform Random Number
                 Generators",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "100--119",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321371.321379",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:22 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method of analysis of uniform random number
                 generators is developed, applicable to almost all
                 practical methods of generation. The method is that of
                 Fourier analysis of the output sequences of such
                 generators. With this tool it is possible to understand
                 and predict relevant statistical properties of such
                 generators and compare and evaluate such methods. Many
                 such analyses and comparisons have been carried out.
                 The performance of these methods as implemented on
                 differing computers is also studied. The main practical
                 conclusions of the study are: (a) Such a priori
                 analysis and prediction of statistical behavior of
                 uniform random number generators is feasible. (b) The
                 commonly used multiplicative congruence method of
                 generation is satisfactory with careful choice of the
                 multiplier for computers with an adequate ($\geq
                 \approx 35$-bit) word length. (c) Further work may be
                 necessary on generators to be used on machines of
                 shorter word length.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "Shift register sequences; method; spectral analysis;
                 interdependence; multidimensional uniformity; RNG;
                 test",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This article is believed to be the origin of the
                 spectral test for randomness.",
}

@Article{Young:1967:BWO,
  author =       "Tzay Y. Young",
  title =        "Binomial-Weighted Orthogonal Polynomials",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "120--127",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Collins:1967:SRP,
  author =       "George E. Collins",
  title =        "Subresultants and Reduced Polynomial Remainder
                 Sequences",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "128--142",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:49:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shaw:1967:MMM,
  author =       "Brian Shaw",
  title =        "Modified Multistep Methods Based on a Nonpolynomial
                 Interpolant",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "143--154",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:38:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kohfeld:1967:MMM,
  author =       "J. J. Kohfeld and G. T. Thompson",
  title =        "Multistep Methods With Modified Predictors and
                 Correctors",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "155--166",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yasuhara:1967:RPN,
  author =       "Ann Yasuhara",
  title =        "A Remark on Post Normal Systems",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "167--171",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1967:SAC,
  author =       "Seymour Ginsburg and Sheila A. Greibach and Michael A.
                 Harrison",
  title =        "Stack Automata and Compiling",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "1",
  pages =        "172--201",
  month =        jan,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:21:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Minnick:1967:SMR,
  author =       "Robert C. Minnick",
  title =        "Survey of Microcellular Research",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "203--241",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 3 23:43:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kleinrock:1967:TSS,
  author =       "Leonard Kleinrock",
  title =        "Time-shared Systems: a Theoretical Treatment",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "242--261",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Models are analyzed in which time-shared computer
                 usage is obtained by giving each request a fixed
                 quantum $q$ of time on the processor, after which the
                 request is placed at the end of a queue of other
                 requests; the queue of requests is constantly cycled,
                 giving each user $q$ seconds on the machine per cycle.
                 The case for which $q\rightarrow0$ (a processor-shared
                 model) is then analyzed using methods from queueing
                 theory. A general time-shared facility is \ldots{}.",
  descriptors =  "M/M/1; processor sharing; HOL priority; time sharing",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shemer:1967:SMC,
  author =       "Jack E. Shemer",
  title =        "Some Mathematical Considerations of Time-Sharing
                 Scheduling Algorithms",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "262--272",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chu:1967:EPD,
  author =       "J. T. Chu and J. C. Chueh",
  title =        "Error Probability in Decision Functions for Character
                 Recognition",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "273--280",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:48:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Martin:1967:MCS,
  author =       "David Martin and Gerald Estrin",
  title =        "Models of Computations and Systems---Evaluation of
                 Vertex Probabilities in Graph Models of Computations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "281--299",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Waite:1967:PDM,
  author =       "William M. Waite",
  title =        "Path Detection in Multidimensional Iterative Arrays",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "300--310",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moore:1967:CAS,
  author =       "J. B. Moore",
  title =        "A Convergent Algorithm for Solving Polynomial
                 Equations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "311--315",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:09:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moler:1967:IRF,
  author =       "Cleve B. Moler",
  title =        "Iterative Refinement in Floating Point",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "316--321",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:38:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "ir; iterative refinement; lud; nla",
}

@Article{Blum:1967:MIT,
  author =       "Manuel Blum",
  title =        "A Machine-Independent Theory of the Complexity of
                 Recursive Functions",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "322--336",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Math/hilbert10.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  comment =      "Russki{\u\i perevod v sb. Problemy matem. logiki. M.:
                 Mir, 1970.- S.401-422.}",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Westlake:1967:URN,
  author =       "W. J. Westlake",
  title =        "A Uniform Random Number Generator Based on the
                 Combination of Two Congruential Generators",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "337--340",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321386.321396",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A method of generating pseudo-random uniform numbers
                 based on the combination of two congruential generators
                 is described. It retains two of the desirable features
                 of congruential generators, namely, the long cycle and
                 the case of implementation on a digital computer.
                 Furthermore, unlike the method of combining
                 congruential generators recently proposed by MacLaren
                 and Marsaglia, it does not require the retention in
                 computer memory of a table of generated numbers. The
                 generator gave completely satisfactory results on a
                 fairly stringent series of statistical tests.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  descriptors =  "RNG",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mancino:1967:RIS,
  author =       "O. G. Mancino",
  title =        "Resolution by Iteration of Some Nonlinear Systems",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "341--350",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krogh:1967:TIN,
  author =       "Fred T. Krogh",
  title =        "A Test for Instability in the Numerical Solution of
                 Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "351--354",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginzburg:1967:PCE,
  author =       "A. Ginzburg",
  title =        "A Procedure for Checking Equality of Regular
                 Expressions",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "355--362",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:10:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cryer:1967:NSQ,
  author =       "C. W. Cryer",
  title =        "On the Numerical Solution of a Quasi-Linear Elliptic
                 Equation",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "363--375",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:10:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Natapoff:1967:ITC,
  author =       "Alan Natapoff",
  title =        "Irreducible Topological Components of an Arbitrary
                 {Boolean} Truth Function and Generation of Their
                 Minimal Coverings",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "376--381",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pickett:1967:NCA,
  author =       "H. E. Pickett",
  title =        "Note Concerning the Algebraic Theory of Automata",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "382--388",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1967:OWS,
  author =       "Seymour Ginsburg and Sheila A. Greibach and Michael A.
                 Harrison",
  title =        "One-Way Stack Automata",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "389--418",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:51:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{SimoesPereira:1967:CBM,
  author =       "J. M. S. {Sim{\~o}es Pereira}",
  title =        "Corrigendum: {``On the Boolean Matrix Equation $M' =
                 \vee_{i = 1} M^i$''}",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "419--420",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 28 08:29:05 1995",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{SimoesPereira:1965:BME}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weeg:1967:CAG,
  author =       "G. P. Weeg",
  title =        "Corrigendum: {``The Automorphism Group of the Direct
                 Product of Strongly Related Automata''}",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "2",
  pages =        "421--421",
  month =        apr,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Weeg:1965:AGD}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gaver:1967:PMM,
  author =       "D. P. {Gaver, Jr.}",
  title =        "Probability Models for Multiprogramming Computer
                 Systems",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "423--438",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A probabilistic model is developed for a
                 multiprogramming computer configuration, one in which
                 several program segments are simultaneously in main
                 memory (core). The model relates speed and number of
                 input-output devices, core size, and central processor
                 speed(?) to central processor and system productivity.
                 Incorporated in the model are parameters describing the
                 statistical variability of input-output and central
                 processor activities.",
  descriptors =  "Model; multiprogramming; computer system",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Manacher:1967:PSR,
  author =       "G. K. Manacher",
  title =        "Production and Stabilization of Real-Time Task
                 Schedules",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "439--465",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brzozowski:1967:RSE,
  author =       "J. A. Brzozowski",
  title =        "Roots of Star Events",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "466--477",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:46:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Karp:1967:SBS,
  author =       "Richard M. Karp",
  title =        "Some Bounds on the Storage Requirements of Sequential
                 Machines and {Turing} Machines",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "478--489",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McNaughton:1967:PG,
  author =       "Robert McNaughton",
  title =        "Parenthesis Grammars",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "490--500",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenkrantz:1967:MEN,
  author =       "Daniel J. Rosenkrantz",
  title =        "Matrix Equations and Normal Forms for Context-Free
                 Grammars",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "501--507",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Oliver:1967:AFE,
  author =       "I. Oliver",
  title =        "Analysis of Factorial Experiments Using Generalized
                 Matrix Operations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "508--519",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:49 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Klee:1967:MCC,
  author =       "Victor Klee",
  title =        "A Method for Constructing Circuit Codes",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "520--528",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mowle:1967:AGS,
  author =       "Frederic J. Mowle",
  title =        "An Algorithm for Generating Stable Feedback Shift
                 Registers of Order $n$",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "529--542",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rigal:1967:CGS,
  author =       "J. L. Rigal and J. Gaches",
  title =        "On the Compatibility of a Given Solution With the Data
                 of a Linear System",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "543--548",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "backward perturbation; la; nla; pert",
}

@Article{Hicks:1967:NSP,
  author =       "J. S. Hicks and J. Wei",
  title =        "Numerical Solution of Parabolic Partial Differential
                 Equations With Two-Point Boundary Conditions by Use of
                 the Method of Lines",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "549--562",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:10:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Karp:1967:OCU,
  author =       "Richard M. Karp and Raymond E. Miller and Shmuel
                 Winograd",
  title =        "The Organization of Computations for Uniform
                 Recurrence Relations",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "563--590",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Carroll:1967:APP,
  author =       "A. B. Carroll and R. T. Wetherald",
  title =        "Applications of Parallel Processing to Numerical
                 Weather Prediction",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "3",
  pages =        "591--614",
  month =        jul,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/ovr.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Page 164 is notice page

@Article{Knuth:1967:PLA,
  author =       "Donald E. Knuth and Richard H. Bigelow",
  title =        "Programming Languages for Automata",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "615--635",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:20:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Floyd:1967:NA,
  author =       "Robert W. Floyd",
  title =        "Nondeterministic Algorithms",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "636--644",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:43:36 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenberg:1967:RTD,
  author =       "Arnold L. Rosenberg",
  title =        "Real-Time Definable Languages",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "645--662",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:11:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1967:MRC,
  author =       "J. Hartmanis",
  title =        "On Memory Requirements for Context-Free Language
                 Recognition",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "663--665",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:11:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gill:1967:PDS,
  author =       "Arthur Gill and J. Robert Flexer",
  title =        "Periodic Decomposition of Sequential Machines",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "666--676",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:11:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aanderaa:1967:SHP,
  author =       "St{\aa}l Aanderaa and Patrick C. Fischer",
  title =        "The Solvability of the Halting Problem for $2$-State
                 Post Machines",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "677--682",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 01 16:57:50 2002",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Barnes:1967:MEI,
  author =       "Bruce H. Barnes and John M. Fitzgerald",
  title =        "Minimal Experiments for Input-Independent Machines",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "683--686",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:45:35 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1967:ATP,
  author =       "James R. Slagle",
  title =        "Automatic Theorem Proving with Renamable and Semantic
                 Resolution",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "687--697",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:20:51 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wos:1967:CDT,
  author =       "Lawrence Wos and George A. Robinson and Daniel F.
                 Carson and Leon Shalla",
  title =        "The Concept of Demodulation in Theorem Proving",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "698--709",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 3 23:55:44 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fairthorne:1967:MIF,
  author =       "Robert A. Fairthorne",
  title =        "Morphology of ``Information Flow''",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "710--719",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:50:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shapiro:1967:ARP,
  author =       "Marvin B. Shapiro",
  title =        "An Algorithm for Reconstructing Protein and {RNA}
                 Sequences",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "720--731",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:44:47 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  comment =      "An algorithm for deriving the primary sequence of a
                 protein or {RNA} is presented. The data is in the form
                 of short sequences of letters which must be fitted
                 together to form the unknown complete sequence. A
                 computer program for carrying out the steps is
                 described, with an example. It is shown that the
                 algorithm cannot make an error and empirical results
                 are given which illustrate the successful use of the
                 algorithm in reconstructing complete sequences known to
                 be solvable.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sigillito:1967:CMA,
  author =       "V. G. Sigillito",
  title =        "On a Continuous Method of Approximating Solutions of
                 the Heat Equation",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "732--741",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:12:22 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reinwald:1967:CLE,
  author =       "Lewis T. Reinwald and Richard M. Soland",
  title =        "Conversion of Limited-Entry Decision Tables to Optimal
                 Computer Programs {II}: {Minimum} Storage Requirement",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "742--756",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 4 00:12:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pease:1967:MIU,
  author =       "Marshall C. Pease",
  title =        "Matrix Inversion Using Parallel Processing",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "757--764",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:45:11 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/OVR.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "inverse matrix; linear system; lud; nla; prll",
}

@Article{Odell:1967:CFP,
  author =       "P. L. Odell and H. P. Decell",
  title =        "On Computing the Fixed-Point Probability Vector of
                 Ergodic Transition Matrices",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "765--768",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:45:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brush:1967:SOD,
  author =       "D. G. Brush and J. J. Kohfeld and G. T. Thompson",
  title =        "Solution of Ordinary Differential Equations Using Two
                 ``Off-Step'' Points",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "769--784",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Nov 04 00:12:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{VanGelder:1967:SNR,
  author =       "A. {Van Gelder}",
  title =        "Some New Results in Pseudo-Random Number Generation",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "785--792",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321420.321437",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:50:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Pseudo-random number generators of the power residue
                 (sometimes called congruential or multiplicative) type
                 are discussed and results of statistical tests
                 performed on specific examples of this type are
                 presented. Tests were patterned after the methods of
                 MacLaren and Marsaglia (M\&M). The main result
                 presented is the discovery of several power residue
                 generators which performed well in these tests. This is
                 important because, of all the generators using standard
                 methods (including power residue) that were tested by
                 M\&M, none gave satisfactory results. The overall
                 results here provide further evidence for their
                 conclusion that the types of tests usually encountered
                 in the literature do not provide an adequate index of
                 the behavior of $n$-tuples of consecutively generated
                 numbers. In any Monte Carlo or simulation problem where
                 $n$ supposedly independent random numbers are required
                 at each step, this behavior is likely to be important.
                 Finally, since the tests presented here differ in
                 certain details from those of M\&M, some of their
                 generators were retested as a check. A cross-check
                 shows that results are compatible; in particular, if a
                 generator failed one of their tests badly, it also
                 failed the present author's corresponding test badly.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Winograd:1967:TRP,
  author =       "S. Winograd",
  title =        "On the Time Required to Perform Multiplication",
  journal =      j-J-ACM,
  volume =       "14",
  number =       "4",
  pages =        "793--802",
  month =        oct,
  year =         "1967",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilkes:1968:CTN,
  author =       "Maurice V. Wilkes",
  title =        "Computers Then and Now",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "1--7",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321439.321440",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:45:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Reminiscences on the early developments leading to
                 large scale electronic computers show that it took much
                 longer than was expected for the first of the more
                 ambitious and fully engineered computers to be
                 completed and prove themselves in practical operation.
                 Comments on the present computer field assess the needs
                 for future development.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This is the 1967 ACM Turing Award Lecture.",
}

@Article{Salton:1968:CEI,
  author =       "G. Salton and M. E. Lesk",
  title =        "Computer Evaluation of Indexing and Text Processing",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "8--36",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wirth:1968:PPL,
  author =       "Niklaus Wirth",
  title =        "{PL360}, a Programming Language for the 360
                 Computers",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "37--74",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:10:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Wirth:1968:CPP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Echols:1968:SIL,
  author =       "Robert E. Echols and Leon Cooper",
  title =        "Solution of Integer Linear Programming Problems by
                 Direct Search",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "75--84",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:45:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1968:EMT,
  author =       "James R. Slagle and Philip Bursky",
  title =        "Experiments With a Multipurpose, Theorem-Proving
                 Heuristic Program",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "85--99",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:21:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Strand:1968:SEN,
  author =       "Otto Neall Strand and Ed R. Westwater",
  title =        "Statistical Estimation of the Numerical Solution of a
                 {Fredholm} Integral Equation of the First Kind",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "100--114",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:46:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dubner:1968:NIL,
  author =       "H. Dubner and J. Abate",
  title =        "Numerical Inversion of {Laplace} Transforms by
                 Relating Them to the Finite {Fourier} Cosine
                 Transform",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "115--123",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 8 22:02:07 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "In this paper the problem of readily determining the
                 inverse La-place transform numerically is discussed.
                 Because the resultant inverse function is given as a
                 Fourier cosine series, the procedure requires only
                 about ten FORTRAN statements and uses only cosines and
                 exponentials. The basis of the method hinges on the
                 fact that in evaluating the inverse Laplace transform
                 integral there exists a freedom in choosing the contour
                 of integration.",
  descriptors =  "Laplace transform; numerical method",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kaplan:1968:SCR,
  author =       "Donald M. Kaplan",
  title =        "Some Completeness Results in the Mathematical Theory
                 of Computation",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "124--134",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Constr.logic.prog.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bavel:1968:STP,
  author =       "Zamir Bavel",
  title =        "Structure and Transition-Preserving Functions of
                 Finite Automata",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "135--158",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Waksman:1968:PN,
  author =       "Abraham Waksman",
  title =        "A Permutation Network",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "1",
  pages =        "159--163",
  month =        jan,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:00:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Waksman:1968:CPN}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sklansky:1968:FPT,
  author =       "J. Sklansky and M. Finkelstein and E. C. Russell",
  title =        "A Formalism for Program Translation",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "165--175",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gilmore:1968:SPA,
  author =       "P. A. Gilmore",
  title =        "Structuring of Parallel Algorithms",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "176--192",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/OVR.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kubert:1968:PRF,
  author =       "B. Kubert and J. Szabo and S. Guilieri",
  title =        "The Perspective Representation of Functions of Two
                 Variables",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "193--204",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "height field",
}

@Article{Morse:1968:MMA,
  author =       "Stephen P. Morse",
  title =        "A Mathematical Model for the Analysis of Contour-Line
                 Data",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "205--220",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 5 23:40:35 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Orden:1968:BSA,
  author =       "A. Orden and V. Nalbandian",
  title =        "A Bidirectional Simplex Algorithm",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "221--235",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 5 23:41:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loveland:1968:MTP,
  author =       "Donald W. Loveland",
  title =        "Mechanical Theorem-Proving by Model Elimination",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "236--251",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:45:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Loveland:1969:EMT}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pease:1968:AFF,
  author =       "Marshall C. Pease",
  title =        "An Adaptation of the Fast {Fourier} Transform for
                 Parallel Processing",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "252--264",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:46:47 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zeleznik:1968:QNM,
  author =       "Frank J. Zeleznik",
  title =        "Quasi-{Newton} Methods for Nonlinear Equations",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "265--271",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morris:1968:CSM,
  author =       "Gerald L. Morris and Patrick L. Odell",
  title =        "Common Solutions for $n$ Matrix Equations With
                 Applications",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "272--274",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aberth:1968:ACN,
  author =       "Oliver Aberth",
  title =        "Analysis in the Computable Number Field",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "275--299",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schutzenberger:1968:RAS,
  author =       "Marcel Paul Sch{\"{u}}tzenberger",
  title =        "A Remark on Acceptable Sets of Numbers",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "300--303",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yeh:1968:GPA,
  author =       "Raymond T. Yeh",
  title =        "Generalized Pair Algebra With Applications to Automata
                 Theory",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "304--316",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hopcroft:1968:DUQ,
  author =       "J. E. Hopcroft and J. D. Ullman",
  title =        "Decidable and Undecidable Questions About Automata",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "317--324",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:24:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1968:CCO,
  author =       "J. Hartmanis",
  title =        "Computational Complexity of One-Tape {Turing} Machine
                 Computations",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "325--339",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Waksman:1968:CPN,
  author =       "Abraham Waksman",
  title =        "Corrigendum: ``{A} Permutation Network''",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "2",
  pages =        "340--340",
  month =        apr,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:25:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Waksman:1968:PN}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coffman:1968:ATT,
  author =       "E. G. {Coffman, Jr.}",
  title =        "Analysis of Two Time-Sharing Algorithms Designed for
                 Limited Swapping",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "341--353",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Oct 23 00:15:58 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Time-sharing algorithms are discussed which are
                 designed primarily for the reduction of swapping
                 without intolerable changes in the waiting time
                 distributions. A particular class of such algo-rithms
                 in which conventional procedures are modified by making
                 the quantum allocation dependent on input activity is a
                 given a more detailed treatment. Queueing models
                 corresponding to these algorithms are devised and then
                 analyzed for obtaining the wait.t",
  descriptors =  "Analysis; time sharing; algorithm; queueing system;
                 model; waiting time",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Comba:1968:PDI,
  author =       "Paul G. Comba",
  title =        "A Procedure for Detecting Intersections of
                 Three-Dimensional Objects",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "354--366",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Andrews:1968:RM,
  author =       "Peter B. Andrews",
  title =        "Resolution With Merging",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "367--381",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:21:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Andrews:1968:CCR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1968:RPA,
  author =       "J. Hartmanis and H. Shank",
  title =        "On the Recognition of Primes by Automata",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "382--389",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kohfeld:1968:MNM,
  author =       "J. J. Kohfeld and G. T. Thompson",
  title =        "A Modification of {Nordsieck}'s method Using an
                 ``Off-Step'' Point",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "390--401",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zielke:1968:IMS,
  author =       "Gerhard Zielke",
  title =        "Inversion of Modified Symmetric Matrices",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "402--408",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Griffiths:1968:UEP,
  author =       "T. V. Griffiths",
  title =        "The Unsolvability of the Equivalence Problem for
                 ${\Lambda}$-Free Nondeterministic Generalized
                 Machines",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "409--413",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hopcroft:1968:RBT,
  author =       "John E. Hopcroft and Jeffrey D. Ullman",
  title =        "Relations Between Time and Tape Complexities",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "414--427",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:24:23 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1968:OWN,
  author =       "Seymour Ginsburg and Michael A. Harrison",
  title =        "One-Way Nondeterministic Real-Time List-Storage
                 Languages",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "428--446",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chartres:1968:USD,
  author =       "B. A. Chartres and J. J. Florentin",
  title =        "A Universal Syntax-Directed Top-Down Analyzer",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "447--464",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:47:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lewis:1968:SDT,
  author =       "P. M. {Lewis II} and R. E. Stearns",
  title =        "Syntax-Directed Transduction",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "3",
  pages =        "465--488",
  month =        jul,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:47:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wirth:1968:CPP,
  author =       "Niklaus Wirth",
  title =        "Corrigendum: ``{PL360}, a Programming Language for
                 the 360 Computers''",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "489--489",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:00:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Wirth:1968:PPL}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anonymous:1968:CJA,
  author =       "Anonymous",
  title =        "Contributions to the {Journal of the Association for
                 Computing Machinery}; {ACM} Author Instructions for
                 Manuscript Documentation Unit; Categories of the
                 Computing Sciences",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "490--492",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 05 23:48:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gotlieb:1968:SCI,
  author =       "C. C. Gotlieb and S. Kumar",
  title =        "Semantic Clustering of Index Terms",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "493--513",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morrison:1968:PPA,
  author =       "Donald R. Morrison",
  title =        "{PATRICIA}--Practical Algorithm To Retrieve
                 Information Coded in Alphanumeric",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "514--534",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:21:57 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Trie structure based on character keys for branching.
                 Keys are abbreviated. Structure is primary memory
                 oriented.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lowe:1968:IDB,
  author =       "Thomas C. Lowe",
  title =        "The Influence of Data Base Characteristics and Usage
                 on Direct Access File Organization",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "535--548",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 5 23:50:07 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Analysis of text data files using an index or linkage
                 to index terms.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coffman:1968:FQM,
  author =       "Edward G. Coffman and Leonard Kleinrock",
  title =        "Feedback Queueing Models for Time-Shared Systems",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "549--576",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 5 23:50:40 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Time-shared processing systems are studied by
                 considering priority disciplines operating in a
                 stochastic environment. Results are obtained for the
                 average time spent in the system, conditioned on the
                 length of required service. Two distinct feedback
                 models with a single quantum-controlled service are
                 considered. The first is a round-robin (RR) system and
                 the second is a feedback (FBn) system with $N$
                 queues.",
  descriptors =  "Feedback queue; model; analysis; priority; round
                 robin; time sharing; computer system",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Abate:1968:QAI,
  author =       "Joseph Abate and Harvey Dubner and Sheldon B.
                 Weinberg",
  title =        "Queueing Analysis of the {IBM 2314} Disk Storage
                 Facility",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "577--589",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 12 22:26:11 1981",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Queueing",
}

@Article{Reiter:1968:SPC,
  author =       "Raymond Reiter",
  title =        "Scheduling Parallel Computations",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "590--599",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:48:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Montanari:1968:MOS,
  author =       "U. Montanari",
  title =        "A Method for Obtaining Skeletons Using a
                 Quasi-{Euclidean} Distance",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "600--624",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Quinlan:1968:FDP,
  author =       "J. R. Quinlan and E. B. Hunt",
  title =        "A Formal Deductive Problem-Solving System",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "625--646",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aho:1968:IGE,
  author =       "Alfred V. Aho",
  title =        "Indexed Grammars --- An Extension of Context-Free
                 Grammars",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "647--671",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:26:59 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenberg:1968:IRT,
  author =       "Arnold L. Rosenberg",
  title =        "On the Independence of Real-Time Definability and
                 Certain Structural Properties of Context-Free
                 Languages",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "672--679",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cudia:1968:DUF,
  author =       "Dennis F. Cudia and Wilson E. Singletary",
  title =        "Degrees of Unsolvability in Formal Grammars",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "680--692",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:22:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mukhopadhyay:1968:REN,
  author =       "Amar Mukhopadhyay",
  title =        "Representation of Events in the {von Neumann} Cellular
                 Model",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "693--705",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Karim:1968:TSG,
  author =       "Abbas I. Abdel Karim",
  title =        "A Theorem for the Stability of General
                 Predictor-Corrector Methods for the Solution of Systems
                 of Differential Equations",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "706--711",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dyer:1968:GMM,
  author =       "James Dyer",
  title =        "Generalized Multistep Methods in Satellite Orbit
                 Computation",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "712--719",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:10:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Andrews:1968:CCR,
  author =       "Peter B. Andrews",
  title =        "A Correction Concerning Resolution",
  journal =      j-J-ACM,
  volume =       "15",
  number =       "4",
  pages =        "720--720",
  month =        oct,
  year =         "1968",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:23:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Andrews:1968:RM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1969:PJ,
  author =       "G. Salton",
  title =        "A Policy for {JACM}",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 00:14:28 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hamming:1969:OMV,
  author =       "R. W. Hamming",
  title =        "One Man's View of Computer Science",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "3--12",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321495.321497",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:49:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A number of observations and comments are directed
                 toward suggesting that more than the usual engineering
                 flavor be given to computer science. The engineering
                 aspect is important because most present difficulties
                 in this field do not involve the theoretical question
                 of whether certain things can be done, but rather the
                 practical question of how can they be accomplished well
                 and simply. The teaching of computer science could be
                 made more effective by various alterations, for
                 example, the inclusion of a laboratory course in
                 programming, the requirement for a strong minor in
                 something other than mathematics, and more practical
                 coding and less abstract theory, as well as more
                 seriousness and less game playing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This is the 1968 ACM Turing Award Lecture.",
}

@Article{Brown:1969:MSC,
  author =       "W. S. Brown and J. F. Traub",
  title =        "{MERCURY}: a System for the Computer-Aided
                 Distribution of Technical Reports",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "13--25",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kochen:1969:AQA,
  author =       "Manfred Kochen",
  title =        "Automatic Question-Answering of {English}-Like
                 Questions About Simple Diagrams",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "26--48",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Guard:1969:SAM,
  author =       "J. R. Guard and F. C. Oglesby and J. H. Bennett and L.
                 G. Settle",
  title =        "Semi-Automated Mathematics",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "49--62",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Trauboth:1969:RFE,
  author =       "H. H. Trauboth",
  title =        "Recursive Formulas for the Evaluation of the
                 Convolution Integral",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "63--72",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coffman:1969:ADI,
  author =       "E. G. {Coffman, Jr.}",
  title =        "Analysis of a Drum Input\slash Output Queue Under
                 Scheduled Operation in a Paged Computer System",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "73--90",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:49:28 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "In this paper magnetic drums in the role of auxiliary
                 memories are studied in the context of multiprogramming
                 systems featuring a paged environment. Mathematical
                 models are defined such that two extremes in scheduling
                 disciplines are represented in a sys-tem in which page
                 requests are assumed to arrive singly and at random.
                 The analysis leads to results for a measure of drum
                 uti-lization and a generating function for the queue
                 length probab.",
  descriptors =  "Analysis; scheduling; mathematical model; generating
                 function; queue length; waiting time",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Greibach:1969:IHC,
  author =       "Sheila A. Greibach",
  title =        "An Infinite Hierarchy of Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "91--106",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:49:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenkrantz:1969:PGC,
  author =       "Daniel J. Rosenkrantz",
  title =        "Programmed Grammars and Classes of Formal Languages",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "107--131",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:49:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brzozowski:1969:DRE,
  author =       "J. A. Brzozowski and Rina Cohen",
  title =        "On Decompositions of Regular Events",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "132--144",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chaitin:1969:LPC,
  author =       "Gregory J. Chaitin",
  title =        "On the Length of Programs for Computing Finite Binary
                 Sequences: {Statistical} Considerations",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "145--159",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321495.321506",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:05:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "An attempt is made to carry out a program (outlined in
                 a previous paper) for defining the concept of a random
                 or patternless, finite binary sequence, and for
                 subsequently defining a random or patternless, infinite
                 binary sequence to be a sequence whose initial segments
                 are all random or patternless finite binary sequences.
                 A definition based on the bounded-transfer Turing
                 machine is given detailed study, but insufficient
                 understanding of this computing machine precludes a
                 complete treatment. A computing machine is introduced
                 which avoids these difficulties.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1969:CUP,
  author =       "J. Hartmanis",
  title =        "On the Complexity of Undecidable Problems in Automata
                 Theory",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "160--167",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hopcroft:1969:SRT,
  author =       "J. E. Hopcroft and J. D. Ullman",
  title =        "Some Results on Tape-Bounded {Turing} Machines",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "168--177",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Waksman:1969:MR,
  author =       "Abraham Waksman",
  title =        "A Model of Replication",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "1",
  pages =        "178--188",
  month =        jan,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/alife.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1969:ESP,
  author =       "James H. Slagle and John K. Dixon",
  title =        "Experiments With Some Programs That Search Game
                 Trees",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "189--207",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/tree-search.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grzymala-Busse:1969:APA,
  author =       "Jerzy W. Grzymala-Busse",
  title =        "Automorphisms of Polyadic Automata",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "208--219",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:07:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Grzymala-Busse:1969:EAP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Meyer:1969:NSF,
  author =       "Albert R. Meyer",
  title =        "A Note on Star-Free Events",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "220--225",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reynolds:1969:SGR,
  author =       "B. G. Reynolds and W. F. Cutlip",
  title =        "Synchronization and General Repetitive Machines, with
                 Applications to Ultimate Definite Automata",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "226--234",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Spira:1969:TRG,
  author =       "Philip M. Spira",
  title =        "The Time Required for Group Multiplication",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "235--243",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Manna:1969:PPF,
  author =       "Zohar Manna",
  title =        "Properties of Programs and the First-Order Predicate
                 Calculus",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "244--255",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maurer:1969:DPI,
  author =       "Herman A. Maurer",
  title =        "A Direct Proof of the Inherent Ambiguity of a Simple
                 Context-Free Language",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "256--260",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wegner:1969:TNF,
  author =       "Peter Wegner",
  title =        "Translation Networks and Function Composition",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "261--263",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Edmundson:1969:NMA,
  author =       "H. P. Edmundson",
  title =        "New Methods in Automatic Extracting",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "264--285",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Berman:1969:LAM,
  author =       "Gerald Berman",
  title =        "Lattice Approximations to the Minima of Functions of
                 Several Variables",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "286--294",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Linz:1969:LMM,
  author =       "Peter Linz",
  title =        "Linear Multistep Methods for {Volterra}
                 Integro-Differential Equations",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "295--301",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pease:1969:IMP,
  author =       "Marshall C. Pease",
  title =        "Inversion of Matrices by Partitioning",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "302--314",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:27:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Adiri:1969:TSQ,
  author =       "I. Adiri and B. Avi-Itzhak",
  title =        "A Time-Sharing Queue with a Finite Number of
                 Customers",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "315--323",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A time-sharing queue serving a finite number of
                 customers is described. It is assumed that the service
                 time and the time elapsing between termination of
                 service and the next arrival of the same customer at
                 the queue (service station) are exponential. Some
                 results are presented in terms of steady-state
                 expectations",
  descriptors =  "Analysis; time sharing; queueing system; Markov
                 process",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{DiPaola:1969:RUD,
  author =       "Robert A. {Di Paola}",
  title =        "The Recursive Unsolvability of the Decision Problem
                 for the Class of Definite Formulas",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "324--327",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:50:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Young:1969:TTE,
  author =       "Paul R. Young",
  title =        "Toward a Theory of Enumerations",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "2",
  pages =        "328--348",
  month =        apr,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loveland:1969:SFM,
  author =       "D. W. Loveland",
  title =        "A Simplified Format for the Model Elimination
                 Theorem-Proving Procedure",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "349--363",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:45:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sandewall:1969:PPS,
  author =       "Erik J. Sandewall",
  title =        "A Planning Problem Solver Based on Look-Ahead in
                 Stochastic Game Trees",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "364--382",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aho:1969:NSA,
  author =       "Alfred V. Aho",
  title =        "Nested Stack Automata",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "383--406",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chaitin:1969:SSP,
  author =       "Gregory J. Chaitin",
  title =        "On the Simplicity and Speed of Programs for Computing
                 Infinite Sets of Natural Numbers",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "407--422",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:05:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kasami:1969:SAP,
  author =       "T. Kasami and K. Torii",
  title =        "A Syntax-Analysis Procedure for Unambiguous
                 Context-Free Grammars",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "423--431",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grzymala-Busse:1969:PRR,
  author =       "Jerzy W. Grzymala-Busse",
  title =        "On the Periodic Representations and the Reducibility
                 of Periodic Automata",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "432--441",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun May 02 10:01:51 1999",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also
                 \cite{Grzymala-Busse:1969:PRR,Grzymala-Busse:1970:EPR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Liu:1969:LFP,
  author =       "C. L. Liu",
  title =        "Lattice Functions, Pair Algebras, and Finite-State
                 Machines",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "442--454",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Moyles:1969:AFM,
  author =       "Dennis M. Moyles and Gerald L. Thompson",
  title =        "An Algorithm for Finding a Minimum Equivalent Graph of
                 a Digraph",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "455--460",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reed:1969:GSR,
  author =       "I. S. Reed and Rein Turn",
  title =        "A Generalization of Shift-Register Sequence
                 Generators",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "461--473",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pease:1969:OLS,
  author =       "Marshall C. Pease",
  title =        "Organization of Large Scale {Fourier} Processors",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "474--482",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:27:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lyness:1969:NAS,
  author =       "J. N. Lyness",
  title =        "Notes on the Adaptive {Simpson} Quadrature Routine",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "483--495",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rahme:1969:NLN,
  author =       "H. S. Rahme",
  title =        "A New Look at the Numerical Integration of Ordinary
                 Differential Equations",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "496--506",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tal:1969:MDO,
  author =       "A. Tal",
  title =        "On Monotone Decomposable Operators",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "507--510",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shimizu:1969:SAM,
  author =       "Tamio Shimizu",
  title =        "A Stochastic Approximation Method for Optimization
                 Problems",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "3",
  pages =        "511--516",
  month =        jul,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ernst:1969:SCS,
  author =       "George W. Ernst",
  title =        "Sufficient Conditions for the Success of {GPS}",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "517--533",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Montanari:1969:CSD,
  author =       "Ugo Montanari",
  title =        "Continuous Skeletons from Digitized Images",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "534--549",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:50:25 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ullman:1969:HSA,
  author =       "J. D. Ullman",
  title =        "Halting Stack Automata",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "550--563",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gibbs:1969:CGA,
  author =       "Norman E. Gibbs",
  title =        "A Cycle Generation Algorithm for Finite Undirected
                 Linear Graphs",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "564--568",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ghosh:1969:FOS,
  author =       "S. P. Ghosh and M. E. Senko",
  title =        "File Organization: {On} the Selection of Random Access
                 Index Points for Sequential Files",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "569--579",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Btrees with probing.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loizou:1969:NJC,
  author =       "Georghios Loizou",
  title =        "Nonnormality and {Jordan} Condition Numbers of
                 Matrices",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "580--584",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "condition; eig; la; nonormal matrix; pert",
}

@Article{Zafarullah:1969:FDS,
  author =       "A. Zafarullah",
  title =        "Finite Difference Scheme for a Third Boundary Value
                 Problem",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "585--591",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zohar:1969:TMI,
  author =       "Shalhav Zohar",
  title =        "{Toeplitz} Matrix Inversion: {The} Algorithm of {W. F.
                 Trench}",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "592--601",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "inverse matrix; nla; Toeplitz matrix",
}

@Article{Frank:1969:AOD,
  author =       "H. Frank",
  title =        "Analysis and Optimization of Disk Storage Devices for
                 Time-Sharing Systems",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "602--620",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Oct 9 14:51:24 1981",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Analysis of seek times and queuing.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "memory hierarchy; Performance Evaluation",
}

@Article{DiPaola:1969:RSS,
  author =       "Robert A. {Di Paola}",
  title =        "Random Sets in Subrecursive Hierarchies",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "621--630",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 00:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Adiri:1969:CTS,
  author =       "Igal Adiri",
  title =        "Computer Time-Sharing Queues with Priorities",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "631--645",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:50:34 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "The paper deals with computer time-sharing disciplines
                 in which external priorities are introduced. For a
                 computer system under a time-sharing discipline, the
                 following priority disciplines are discussed: (a)
                 head-of-the-line; (b) preemptive repeat; and (c) mixed
                 preemptive strategy. All models in question assume that
                 customers arrive according to homogeneous Poisson
                 processes. Results are given in terms of steady-state
                 expectations.",
  descriptors =  "Time sharing; queueing system; priority",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coffman:1969:EAD,
  author =       "E. G. {Coffman, Jr.}",
  title =        "Errata: ``{Analysis} of a Drum Input\slash Output
                 Queue Under Scheduled Operation in a Paged Computer
                 System''",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "646--646",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:03:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grzymala-Busse:1969:EAP,
  author =       "Jerzy W. Grzymala-Busse",
  title =        "Errata: ``{Automorphisms} of Polyadic Automata''",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "646--646",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Grzymala-Busse:1969:APA}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loveland:1969:EMT,
  author =       "Donald W. Loveland",
  title =        "Errata: ``{Mechanical} Theorem-Proving by Model
                 Elimination''",
  journal =      j-J-ACM,
  volume =       "16",
  number =       "4",
  pages =        "646--646",
  month =        oct,
  year =         "1969",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:50:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Loveland:1968:MTP}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1970:RAJ,
  author =       "G. Salton",
  title =        "On the Role of the {ACM Journal}",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 11:16:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1970:TWB,
  author =       "Seymour Ginsburg and John Hopcroft",
  title =        "Two-Way Balloon Automata and {AFL}",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "3--13",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:52:24 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Colmerauer:1970:TPR,
  author =       "Alain Colmerauer",
  title =        "Total Precedence Relations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "14--30",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:52:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cudia:1970:GPF,
  author =       "Dennis F. Cudia",
  title =        "General Problems of Formal Grammars",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "31--43",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:25:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenberg:1970:NAC,
  author =       "Arnold L. Rosenberg",
  title =        "A Note on Ambiguity of Context-Free Languages and
                 Presentations of Semilinear Sets",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "44--50",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:52:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Corneil:1970:EAG,
  author =       "D. G. Corneil and C. C. Gotlieb",
  title =        "An Efficient Algorithm for Graph Isomorphism",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "51--64",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:16 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gurk:1970:SRI,
  author =       "Herbert M. Gurk and Jack Minker",
  title =        "Storage Requirements for Information Handling
                 Centers",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "65--77",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:01:49 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chand:1970:ACP,
  author =       "Donald R. Chand and Sham S. Kapur",
  title =        "An Algorithm for Convex Polytopes",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "78--86",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:18 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gustavson:1970:SGO,
  author =       "F. G. Gustavson and W. Liniger and R. Willoughby",
  title =        "Symbolic Generation of an Optimal {Crout} Algorithm
                 for Sparse Systems of Linear Equations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "87--109",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "lud; nla; pivoting; sparse",
}

@Article{Meyer:1970:NLS,
  author =       "C. D. Meyer and R. J. Painter",
  title =        "Note on a Least Squares Inverse for a Matrix",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "110--112",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chang:1970:ASC,
  author =       "S. K. Chang and A. Gill",
  title =        "Algorithmic Solution of the Change-Making Problem",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "113--122",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Coffman:1970:WTD,
  author =       "E. G. {Coffman, Jr.} and R. R. Muntz and H. Trotter",
  title =        "Waiting Time Distributions for Processor-Sharing
                 Systems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "123--130",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rasch:1970:QTS,
  author =       "Philip J. Rasch",
  title =        "A Queueing Theory Study of Round-Robin Scheduling of
                 Time-Shared Computer Systems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "131--145",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "(VBI-000103)",
  descriptors =  "Time sharing; round robin",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenfeld:1970:CDP,
  author =       "Azriel Rosenfeld",
  title =        "Connectivity in Digital Pictures",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "146--160",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:32 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sklansky:1970:TCO,
  author =       "J. Sklansky",
  title =        "Thresholded Convolution Operations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "161--165",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Breuer:1970:SCP,
  author =       "M. A. Breuer",
  title =        "Simplification of the Covering Problem with
                 Application to {Boolean} Expressions",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "166--181",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stone:1970:AMP,
  author =       "Harold S. Stone",
  title =        "An Algorithm for Modular Partitioning",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "1",
  pages =        "182--195",
  month =        jan,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:51:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Minsky:1970:FCC,
  author =       "Marvin L. Minsky",
  title =        "Form and Content in Computer Science",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "197--215",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321574.321575",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 5 19:52:01 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This is the 1969 ACM Turing Award Lecture.",
}

@Article{Nevins:1970:PLA,
  author =       "Arthur J. Nevins",
  title =        "A Programming Language with Automatic Goal Generation
                 and Selection",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "216--230",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bavel:1970:CRA,
  author =       "Zamir Bavel and David E. Muller",
  title =        "Connectivity and Reversibility in Automata",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "231--240",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Willis:1970:CCP,
  author =       "David G. Willis",
  title =        "Computational Complexity and Probability
                 Constructions",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "241--259",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Andrews:1970:KMC,
  author =       "H. C. Andrews and J. Kane",
  title =        "{Kronecker} Matrices, Computer Implementation, and
                 Generalized Spectra",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "260--268",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:26:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Haber:1970:SNA,
  author =       "Seymour Haber",
  title =        "Sequences of Numbers That Are Approximately Completely
                 Equidistributed",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "269--272",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321574.321580",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:52 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Henrici:1970:MSS,
  author =       "Peter Henrici",
  title =        "Methods of Search for Solving Polynomial Equations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "273--283",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:54:55 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "Lehmer's method; nlop; polynomial",
}

@Article{Rahme:1970:SAN,
  author =       "H. S. Rahme",
  title =        "Stability Analysis of a New Algorithm Used for
                 Integrating a System of Ordinary Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "284--293",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:28:14 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zafarullah:1970:AML,
  author =       "A. Zafarullah",
  title =        "Application of the Method of Lines to Parabolic
                 Partial Differential Equations with Error Estimates",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "294--302",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Roth:1970:ASL,
  author =       "Richard H. Roth",
  title =        "An Approach to Solving Linear Discrete Optimization
                 Problems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "303--313",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Delbrouck:1970:FQS,
  author =       "L. E. N. Delbrouck",
  title =        "A Feedback Queueing System with Batch Arrivals, Bulk
                 Service, and Queue-Dependent Service Time",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "314--323",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Muntz:1970:PSR,
  author =       "R. R. Muntz and E. G. {Coffman, Jr.}",
  title =        "Preemptive Scheduling of Real-Time Tasks on
                 Multiprocessor Systems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "324--338",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hodes:1970:LCG,
  author =       "Louis Hodes",
  title =        "The Logical Complexity of Geometric Properties in the
                 Plane",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "339--347",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:08 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Montanari:1970:LPD,
  author =       "G. Ugo Montanari",
  title =        "On Limit Properties in Digitization Schemes",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "348--360",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Boyle:1970:ASA,
  author =       "J. M. Boyle and A. A. Grau",
  title =        "An Algorithmic Semantics for {ALGOL 60} Identifier
                 Denotation",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "361--382",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fox:1970:ALP,
  author =       "B. L. Fox",
  title =        "Accelerating List Processing in Discrete Programming",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "383--384",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:19 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Caviness:1970:CFS,
  author =       "B. F. Caviness",
  title =        "On Canonical Forms and Simplification",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "385--396",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kagiwada:1970:IVT,
  author =       "H. H. Kagiwada and R. Kalaba",
  title =        "An Initial-Value Theory for {Fredholm} Integral
                 Equations with Semidegenerate Kernels",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "412--419",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tsuda:1970:NIM,
  author =       "Takao Tsuda and Kozo Ichida",
  title =        "Nonlinear Interpolation of Multivariable Functions by
                 the {Monte Carlo} Method",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "2",
  pages =        "420--425",
  month =        apr,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cryer:1970:ASF,
  author =       "C. W. Cryer",
  title =        "On the Approximate Solution of Free Boundary Problems
                 Using Finite Differences",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "397--411",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ramamoorthy:1970:OMH,
  author =       "C. V. Ramamoorthy and K. M. Chandy",
  title =        "Optimization of Memory Hierarchies in Multiprogrammed
                 Systems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "426--445",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 12 12:30:13 1981",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Allocate frequently used records to faster devices.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "memory hierarchy; Performance Evaluation: Analytic",
}

@Article{Shrager:1970:NRL,
  author =       "Richard I. Shrager",
  title =        "Nonlinear Regression With Linear Constraints: {An}
                 Extension of the Magnified Diagonal Method",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "446--452",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:33 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shaw:1970:PGR,
  author =       "Alan C. Shaw",
  title =        "Parsing of Graph-Representable Pictures",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "453--481",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Beus:1970:UIS,
  author =       "H. Lynn Beus",
  title =        "The Use of Information in Sorting",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "482--495",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:38 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Frazer:1970:SSA,
  author =       "W. D. Frazer and A. C. McKellar",
  title =        "{Samplesort}: a Sampling Approach to Minimal Storage
                 Tree Sorting",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "496--507",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Dec 05 19:52:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stanfel:1970:TSO,
  author =       "Larry E. Stanfel",
  title =        "Tree Structures for Optimal Searching",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "508--517",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mowle:1970:CNS,
  author =       "Frederic J. Mowle",
  title =        "Controllability of Nonlinear Sequential Networks",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "518--524",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Anderson:1970:LFR,
  author =       "Robert Anderson and W. W. Bledsoe",
  title =        "A Linear Format for Resolution With Merging and a New
                 Technique for Establishing Completeness",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "525--534",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1970:ITR,
  author =       "James R. Slagle",
  title =        "Interpolation Theorems for Resolution in Lower
                 Predicate Calculus",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "535--542",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baer:1970:LOP,
  author =       "J. L. Baer and D. P. Bovet and G. Estrin",
  title =        "Legality and Other Properties of Graph Models of
                 Computations",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "543--554",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Manna:1970:FPF,
  author =       "Zohar Manna and Amir Pnueli",
  title =        "Formalization of Properties of Functional Programs",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "3",
  pages =        "555--569",
  month =        jul,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Augustson:1970:ASG,
  author =       "J. Gary Augustson and Mack Minker",
  title =        "An Analysis of Some Graph Theoretical Cluster
                 Techniques",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "571--588",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Akima:1970:NMI,
  author =       "Hiroshi Akima",
  title =        "A New Method of Interpolation and Smooth Curve Fitting
                 Based on Local Procedures",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "589--602",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:52 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Good:1970:CIA,
  author =       "Donald I. Good and Ralph L. London",
  title =        "Computer Interval Arithmetic: {Definition} and Proof
                 of Correct Implementation",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "603--612",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gruttke:1970:PRK,
  author =       "William B. Gruttke",
  title =        "Pseudo-{Runge--Kutta} Methods of the Fifth Order",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "613--628",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hashimoto:1970:MSL,
  author =       "Masahiro Hashimoto",
  title =        "A Method for Solving Large Matrix Equations Reduced
                 from {Fredholm} Integral Equations of the Second Kind",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "629--636",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kaneko:1970:ARE,
  author =       "Toyohisa Kaneko and Bede Liu",
  title =        "Accumulation of Round-off Error in Fast {Fourier}
                 Transforms",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "637--654",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shampine:1970:EPN,
  author =       "L. F. Shampine",
  title =        "Efficiency of a Procedure for Near-Minimax
                 Approximation",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "655--660",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1970:EBZ,
  author =       "Brian T. Smith",
  title =        "Error Bounds for Zeros of a Polynomial Based Upon
                 {Gerschgorin}'s Theorems",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "661--674",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:55:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bonzon:1970:NSC,
  author =       "P. Bonzon",
  title =        "Necessary and Sufficient Conditions for Dynamic
                 Programming of Combinatorial Type",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "675--682",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:56:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Purdom:1970:SPB,
  author =       "Paul W. {Purdom, Jr.} and Stephen M. Stigler",
  title =        "Statistical Properties of the Buddy System",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "683--697",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:56:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chang:1970:UPI,
  author =       "C. L. Chang",
  title =        "The Unit Proof and the Input Proof in Theorem
                 Proving",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "698--707",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:56:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

%% Pages 176--176 contain ads

@Article{Pager:1970:EA,
  author =       "David Pager",
  title =        "On the Efficiency of Algorithms",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "708--714",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:56:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sethi:1970:GOC,
  author =       "Ravi Sethi and J. D. Ullman",
  title =        "The Generation of Optimal Code for Arithmetic
                 Expressions",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "715--728",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Reprinted as pp. 229--247 in {\em Compiler
                 Techniques}, B. W. Pollack, ed., Auerbach, Princeton NJ
                 (1972).",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tsichritzis:1970:EPS,
  author =       "D. Tsichritzis",
  title =        "The Equivalence Problem of Simple Programs",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "729--738",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 11:56:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grzymala-Busse:1970:EPR,
  author =       "Jerzy W. Grzymala-Busse",
  title =        "Errata: ``{On} the Periodic Representations and the
                 Reducibility of Periodic Automata''",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "739--739",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Grzymala-Busse:1969:PRR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1971:EST,
  author =       "G. Salton",
  title =        "Editorial: {Some} Thoughts on Scientific Information
                 Dissemination",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "1--3",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cook:1971:CPM,
  author =       "Stephen A. Cook",
  title =        "Characterizations of Pushdown Machines in Terms of
                 Time-Bounded Computers",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "4--18",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321623.321625",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kautz:1971:ACA,
  author =       "William H. Kautz",
  title =        "An Augmented Content-Addressed Memory Array for
                 Implementation with Large-Scale Integration",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "19--33",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kernighan:1971:OSP,
  author =       "Brian W. Kernighan",
  title =        "Optimal Sequential Partitions of Graphs",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "34--40",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Abdelmalek:1971:LAD,
  author =       "Nabih N. Abdelmalek",
  title =        "Linear ${L}_1$ Approximation for a Discrete Point Set
                 and ${L}_1$ Solutions of Overdetermined Linear
                 Equations",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "41--47",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Benschop:1971:MSE,
  author =       "N. F. Benschop and H. C. Ratz",
  title =        "A Mean Square Estimate of the Generated Roundoff Error
                 in Constant Matrix Iterative Processes",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "48--62",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cryer:1971:TPA,
  author =       "Colin W. Cryer",
  title =        "Topological Problems Arising When Solving Boundary
                 Value Problems for Elliptic Partial Differential
                 Equations by the Method of Finite Differences",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "63--74",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dill:1971:GSS,
  author =       "C. Dill and C. W. Gear",
  title =        "A Graphical Search for Stiffly Stable Methods for
                 Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "75--79",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aho:1971:POP,
  author =       "Alfred V. Aho and Peter J. Denning and Jeffrey D.
                 Ullman",
  title =        "Principles of Optimal Page Replacement",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "80--93",
  month =        jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 10 15:22:50 1981",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "MH Software",
}

@Article{Philippatos:1971:ECI,
  author =       "G. C. Philippatos and D. R. Moscato",
  title =        "Effects of Constrained Information on Player Decisions
                 in Experimental Business Simulation: {Some} Empirical
                 Evidence",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "94--104",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Alexander:1971:BCD,
  author =       "J. C. Alexander and A. I. Thaler",
  title =        "The Boundary Count of Digital Pictures",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "105--112",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hueckel:1971:OWL,
  author =       "Manfred H. Hueckel",
  title =        "An Operator Which Locates Edges in Digitized
                 Pictures",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "113--125",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chang:1971:CLR,
  author =       "C. L. Chang and J. R. Slagle",
  title =        "Completeness of Linear Refutation for Theories with
                 Equality",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "126--136",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harrison:1971:GCO,
  author =       "Michael A. Harrison and Mario Schkolnick",
  title =        "A Grammatical Characterization of One-Way
                 Nondeterministic Stack Languages",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "148--172",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goffman:1971:MMA,
  author =       "William Goffman",
  title =        "A Mathematical Method for Analyzing the Growth of a
                 Scientific Discipline",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "173--185",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gaver:1971:PMB,
  author =       "Donald P. {Gaver, Jr.} and Peter A. W. Lewis",
  title =        "Probability Models for Buffer Storage Allocation
                 Problems",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "186--198",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 9 01:30:58 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "This paper considers some of the issues that arise
                 when messages or jobs inbound to a computer facility
                 are buffered prior to being processed. Models are
                 developed that describe (a) the results of blocking a
                 single memory unit for the use of diverse messages, (b)
                 the occupancy behavior of a buffer that is tied to a
                 single message source, and (c) the occupancy of a
                 buffer dynamically shared among many independent
                 sources.",
  descriptors =  "Buffer memory; queueing system; evaluation",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lewis:1971:CQM,
  author =       "P. A. W. Lewis and G. S. Shedler",
  title =        "A Cyclic-Queue Model of System Overhead in
                 Multiprogrammed Computer Systems",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "1",
  pages =        "199--220",
  month =        Jan,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 23:20:10 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A probabilistic model is presented of a
                 multiprogrammed computer system operating under demand
                 paging. The model contains an explicit representation
                 of system overhead, the CPU requirements and paging
                 characteristics of the program load being described
                 statistically. Expressions for steady-state CPU problem
                 program time, CPU overhead time, and channel
                 utilization are obtained. Some numerical results are
                 which quantify the gains in CPU utilization \ldots{}.",
  descriptors =  "Memory management; multiprogramming; overhead time;
                 utilization; numerical method; heuristics; loop queue;
                 channel utilization",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilkinson:1971:SCN,
  author =       "J. H. Wilkinson",
  title =        "Some Comments from a Numerical Analyst",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "137--147",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321637.321638",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:00:46 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  remark =       "This is the 1970 ACM Turing Award Lecture. Subsequent
                 lectures are published in {\em Communications of the
                 ACM}. Wilkinson comments ``It is perhaps salutary to be
                 reminded that as early as 1946 Turing had considered
                 the possibility of working with both interval and
                 significant digit arithmetic and the report recalled
                 forgotten conversations, not to mention heated
                 arguments, which we had on this topic.'' He also says
                 ``I think it is of vital importance that all the work
                 that has been expended on the development of
                 satisfactory algorithms should be made fully available
                 to the people who need to use it. I would go further
                 than this and claim that it is a social duty to see
                 that this is achieved.''",
}

@Article{Bhat:1971:BPA,
  author =       "U. Narayan Bhat and Richard E. Nance",
  title =        "Busy Period Analysis of a Time-Sharing System Modeled
                 as a Semi-{Markov} Process",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "221--238",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 9 00:04:23 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "\ldots{} working from the model of task completions as
                 a semi-Markov process, the busy period distribution of
                 the central processor is derived in terms of its
                 Laplace--Stieltjes transforms. Limiting behavior of the
                 process describing the number of tasks in queue is
                 developed for arbitrary time points as well as task
                 completion epochs. While the latter has been given in
                 earlier papers, the former represents a new result.
                 \ldots{}",
  descriptors =  "Busy period; feedback; time sharing; semi Markov
                 process; utilization; analytical model",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mylopoulos:1971:TPQa,
  author =       "J. P. Mylopoulos and T. Pavlidis",
  title =        "On the Topological Properties of Quantized Spaces.
                 {I}. The Notion of Dimension",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "239--246",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:53:01 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mylopoulos:1971:TPQb,
  author =       "J. P. Mylopoulos and T. Pavlidis",
  title =        "On the Topological Properties of Quantized Spaces.
                 {II}. Connectivity and Order of Connectivity",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "247--254",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:53:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Steffanelli:1971:SPT,
  author =       "R. Steffanelli and A. Rosenfeld",
  title =        "Some Parallel Thinning Algorithms for Digital
                 Pictures",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "255--264",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Winder:1971:CPT,
  author =       "Robert O. Winder",
  title =        "{Chow} Parameters in Threshold Logic",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "265--289",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blum:1971:EPS,
  author =       "Manuel Blum",
  title =        "On Effective Procedures for Speeding Up Algorithms",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "290--305",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cole:1971:DPS,
  author =       "Stephen N. Cole",
  title =        "Deterministic Pushdown Store Machines and Real-Time
                 Computation",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "2",
  pages =        "306--328",
  month =        apr,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Case:1971:NDS,
  author =       "John Case",
  title =        "A Note on Degrees of Self-Describing {Turing}
                 Machines",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "329--338",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:24:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1971:SCU,
  author =       "Alvy Ray {Smith III}",
  title =        "Simple Computation-Universal Cellular Spaces",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "339--353",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:04:29 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/cellular.automata.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Proof that 1D cellular automata are capable of
                 supporting universal computation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Simon:1971:OSS,
  author =       "Richard Simon and Richard C. T. Lee",
  title =        "On the Optimal Solutions to {\sc AND\slash OR}
                 Series-Parallel Graphs",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "354--372",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mock:1971:NAN,
  author =       "M. S. Mock",
  title =        "Numerical Analysis of a Nonlinear Diffusion Problem",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "373--380",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tootill:1971:RPT,
  author =       "J. P. R. Tootill and W. D. Robinson and A. G. Adams",
  title =        "The Runs Up-and-Down Performance of {Tausworthe}
                 Pseudo-Random Number Generators",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "381--399",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321650.321657",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Any Tausworthe generator based upon a primitive
                 trinomial over $gf(2), x^p+x^q+1$, can be represented
                 as a simple linear recurrence in $gf(2^p)$. For a
                 generator producing a sequence of $p$-bit pseudorandom
                 numbers, $(p,2^p-1)=1$, which is guaranteed by
                 Tausworthe's theory to be 1-distributed, the recurrence
                 may reveal combinatorial relationships implying a poor
                 runs up-and-down performance. This occurs when $q$ is
                 small, too near $p/2$, or nearly \ldots{}",
  descriptors =  "Tausworthe generator; shift register sequences; rng;
                 test; runtime/storage efficiency",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Burge:1971:AM,
  author =       "William H. Burge and Alan G. Konheim",
  title =        "An Accessing Model",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "400--404",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Exact solution to sector queuing in drums.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gaver:1971:ART,
  author =       "Donald P. Gaver",
  title =        "Analysis of Remote Terminal Backlogs under Heavy
                 Demand Conditions",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "405--415",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 9 00:04:35 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Models are developed to describe delays and backlogs
                 at remote terminals polled in turn by a single
                 computer. The effects modeled include transmission
                 delays caused by line noise, and the number and types
                 of terminals (passive input, and active or two-way
                 response). Use is made of the diffusion approximation
                 to state variables, the latter being especially
                 relevant when the system is heavily loaded. A limited
                 amount of mathematical and stimul",
  descriptors =  "Data network; network delay; diffusion approximation;
                 time in system; carried traffic; performance
                 evaluation; model; normal distribution; heavy load",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Robson:1971:ESS,
  author =       "J. M. Robson",
  title =        "An Estimate of the Store Size Necessary for Dynamic
                 Storage Allocation",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "416--423",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:01:19 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Related to online graph coloring.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lions:1971:SRC,
  author =       "John Lions",
  title =        "Some Results Concerning the Reduction of Binary
                 Matrices",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "424--430",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{deVries:1971:MSD,
  author =       "Ronald C. de Vries",
  title =        "Minimal Sets of Distinct Literals for a Logically
                 Passive Function",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "431--443",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hartmanis:1971:OTC,
  author =       "J. Hartmanis and J. E. Hopcroft",
  title =        "An Overview of the Theory of Computational
                 Complexity",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "3",
  pages =        "444--476",
  month =        jul,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:02:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1971:I,
  author =       "G. Salton",
  title =        "Introduction",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "477--477",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:01:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brown:1971:EAC,
  author =       "W. S. Brown",
  title =        "On {Euclid}'s Algorithm and the Computation of
                 Polynomial Greatest Common Divisors",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "478--504",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321662.321664",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:03:27 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brown:1971:EAT,
  author =       "W. S. Brown and J. F. Traub",
  title =        "On {Euclid}'s Algorithm and the Theory of
                 Subresultants",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "505--514",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321662.321665",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Collins:1971:CMP,
  author =       "George E. Collins",
  title =        "The Calculation of Multivariate Polynomial
                 Resultants",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "515--532",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Heindel:1971:IAA,
  author =       "Lee E. Heindel",
  title =        "Integer Arithmetic Algorithms for Polynomial Real Zero
                 Determination",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "533--548",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Martin:1971:DEA,
  author =       "William A. Martin",
  title =        "Determining the Equivalence of Algebraic Expressions
                 by Hash Coding",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "549--558",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jul 20 23:02:13 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Johnson:1971:PRZ,
  author =       "S. C. Johnson",
  title =        "On the Problem of Recognizing Zero",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "559--565",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bunch:1971:ESM,
  author =       "James R. Bunch",
  title =        "Equilibration of Symmetric Matrices in the Max-Norm",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "566--572",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "nla; scaling; symmetric matrix",
}

@Article{Rose:1971:NCO,
  author =       "Donald J. Rose",
  title =        "A Note on Consistent Ordering and Zero Circulation",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "573--575",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "iter; nla; sparse",
}

@Article{Kaplan:1971:NQI,
  author =       "M. A. Kaplan and R. A. Papetti",
  title =        "A Note on Quadrilateral Interpolation",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "576--585",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1971:MPR,
  author =       "C. S. Smith",
  title =        "Multiplicative Pseudo-Random Number Generators with
                 Prime Modulus",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "586--593",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:57 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wasserstrom:1971:SBV,
  author =       "E. Wasserstrom",
  title =        "Solving Boundary-Value Problems by Imbedding",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "594--602",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Adiri:1971:DTS,
  author =       "Igal Adiri",
  title =        "A Dynamic Time-Sharing Priority Queue",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "603--610",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:04:18 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "\ldots{} In such a priority regime, long and unknown
                 in advance service requirements in all priority classes
                 are dynamically penalized by degrading their priority
                 degree. This paper derives mathematical expressions for
                 calculating the expected total flow time of $j$-th
                 customer whose service requirement is known.",
  descriptors =  "M/M/1; time sharing; priority; feedback; analytical
                 model; dynamic priority; single server; queueing
                 system",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Adiri:1971:NSM,
  author =       "Igal Adiri",
  title =        "A Note on Some Mathematical Models of Time-Sharing
                 Systems",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "611--615",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 00:04:52 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "This note deals with time-sharing disciplines where
                 the arrival process is homogeneous poisson and service
                 requirements are exponentially distributed. The
                 investigated regimes are: (A) ordinary round-robin (R.
                 R.), (B) R. R. with the quantum allocated to a customer
                 is a function of the number of quanta he has already
                 received. \ldots{}",
  descriptors =  "Analytical model; feedback; time sharing; M/M/1; round
                 robin; queueing approximation",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Irani:1971:NLC,
  author =       "K. B. Irani and V. L. Wallace",
  title =        "On Network Linguistics and the Conversational Design
                 of Queueing Networks",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "616--629",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:03:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reiter:1971:TRO,
  author =       "Raymond Reiter",
  title =        "Two Results on Ordering for Resolution with Merging
                 and Linear Format",
  journal =      j-J-ACM,
  volume =       "18",
  number =       "4",
  pages =        "630--646",
  month =        oct,
  year =         "1971",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 9 00:04:57 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1972:EWC,
  author =       "G. Salton",
  title =        "Editorial: {What} Is Computer Science?",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fleck:1972:CSA,
  author =       "A. C. Fleck and S. T. Hedetniemi and R. H. Oehmke",
  title =        "{\cal S}-Semigroups of Automata",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "3--10",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 00:19:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pavlidis:1972:LCF,
  author =       "T. Pavlidis",
  title =        "Linear and Context-Free Graph Grammars",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "11--22",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Earnest:1972:AGO,
  author =       "C. P. Earnest and K. G. Balke and J. Anderson",
  title =        "Analysis of Graphs by Ordering of Nodes",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "23--42",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Weinblatt:1972:NSA,
  author =       "Herbert Weinblatt",
  title =        "A New Search Algorithm for Finding the Simple Cycles
                 of a Finite Directed Graph",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "43--56",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chen:1972:MRM,
  author =       "Y. E. Chen and D. L. Epley",
  title =        "Memory Requirements in a Multiprocessing Environment",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "57--69",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Heacox:1972:ATT,
  author =       "Harry C. {Heacox, Jr.} and Paul W. {Purdom, Jr.}",
  title =        "Analysis of Two Time-Sharing Queueing Models",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "70--91",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:04:59 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Two time-sharing models are described. One is the
                 conventional round-robin model. The second model is a
                 modification of the round-robin system in which the
                 amount of service per pass depends on the rate at which
                 programs arrive in the system. The models are analyzed
                 under the assumption of constant, nonzero overhead when
                 the processor swaps one program for another.
                 Expressions are derived for the mean waiting time and
                 system cost.",
  descriptors =  "Analysis; time sharing; queueing system; model; round
                 robin; waiting time; cost",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Konheim:1972:SLS,
  author =       "Alan G. Konheim and Bernd Meister",
  title =        "Service in a Loop System",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "92--108",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "The statistical behaviour of a loop service system is
                 studied. The system consists of a main station, a
                 server and $N$ stations arranged on a loop. Customers
                 arrive at each station according to a random process.
                 The server makes successive tours along the loop
                 bringing customers from the $N$ stations to the main
                 station. Two related measures of the grade of service
                 are considered: the average queue length and virtual
                 waiting time at each station.",
  descriptors =  "Loop system; queue length; virtual waiting time;
                 random process",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lee:1972:FLR,
  author =       "Richard C. T. Lee",
  title =        "Fuzzy Logic and the Resolution Principle",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "109--119",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1972:ATP,
  author =       "James R. Slagle",
  title =        "Automatic Theorem Proving with Built-in Theories
                 Including Equality, Partial Ordering, and Sets",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "120--135",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:28:18 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blikle:1972:AUC,
  author =       "Andrzej Blikle",
  title =        "Addressless Units for Carrying Out Loop-Free
                 Computations",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "136--157",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Borodin:1972:CCE,
  author =       "A. Borodin",
  title =        "Computational Complexity and the Existence of
                 Complexity Gaps",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "158--174",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 23:26:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Borodin:1972:CCC}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Constable:1972:OG,
  author =       "Robert L. Constable",
  title =        "The Operator Gap",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "175--183",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zadeh:1972:TEE,
  author =       "Norman Zadeh",
  title =        "Theoretical Efficiency of the {Edmonds-Karp} Algorithm
                 for Computing Maximal Flows",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "1",
  pages =        "184--192",
  month =        jan,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Greibach:1972:MA,
  author =       "Sheila Greibach and Seymour Ginsburg",
  title =        "Multitape {AFA}",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "193--221",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Santos:1972:NBG,
  author =       "Eugene S. Santos",
  title =        "A Note on Bracketed Grammars",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "222--224",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Aho:1972:WMS,
  author =       "A. V. Aho and P. J. Denning and J. D. Ullman",
  title =        "Weak and Mixed Strategy Precedence Parsing",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "225--243",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:05:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mulligan:1972:CBA,
  author =       "Gordon D. Mulligan and D. G. Corneil",
  title =        "Corrections to {Bierstone}'s Algorithm for Generating
                 Cliques",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "244--247",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:40:24 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "graph coloring related topics",
}

@Article{Edmonds:1972:TIA,
  author =       "Jack Edmonds and Richard M. Karp",
  title =        "Theoretical Improvements in Algorithmic Efficiency for
                 Network Flow Problems",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "248--264",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:05:44 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hammer:1972:MPB,
  author =       "Peter L. Hammer and Uri N. Peled",
  title =        "On the Maximization of a Pseudo-{Boolean} Function",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "265--282",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:42 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Selkow:1972:OPC,
  author =       "Stanley M. Selkow",
  title =        "One-Pass Complexity of Digital Picture Properties",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "283--295",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Landweber:1972:RPA,
  author =       "L. H. Landweber and E. L. Robertson",
  title =        "Recursive Properties of Abstract Complexity Classes",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "296--308",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenberg:1972:ADG,
  author =       "Arnold L. Rosenberg",
  title =        "Addressable Data Graphs",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "309--340",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tarjan:1972:SUN,
  author =       "Robert Tarjan",
  title =        "Sorting Using Networks of Queues and Stacks",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "341--346",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{vanWestrhenen:1972:SST,
  author =       "S. C. {van Westrhenen}",
  title =        "Statistical Studies of Theoremhood in Classical
                 Propositional and First Order Predicate Calculus",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "347--365",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:25:54 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Loveland:1972:UVS,
  author =       "D. W. Loveland",
  title =        "A Unifying View of Some Linear {Herbrand} Procedures",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "2",
  pages =        "366--384",
  month =        apr,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McAfee:1972:ADS,
  author =       "J. McAfee and L. Presser",
  title =        "An Algorithm for the Design of Simple Precedence
                 Grammars",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "385--395",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ellis:1972:HPP,
  author =       "Clarence A. Ellis",
  title =        "The Halting Problem for Probabilistic Context-Free
                 Generators",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "396--399",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Even:1972:PGT,
  author =       "S. Even and A. Pnueli and A. Lempel",
  title =        "Permutation Graphs and Transitive Graphs",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "400--410",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pfaltz:1972:GS,
  author =       "John L. Pfaltz",
  title =        "Graph Structures",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "411--422",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yen:1972:FLA,
  author =       "Jin Y. Yen",
  title =        "Finding the Lengths of All Shortest Paths in
                 ${N}$-Node Nonnegative-Distance Complete Networks Using
                 $1/2 {N}^3$ Additions and ${N}^3$ Comparisons",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "423--424",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stanfel:1972:PAD,
  author =       "L. E. Stanfel",
  title =        "Practical Aspects of Doubly Chained Trees for
                 Retrieval",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "425--436",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Huang:1972:IPM,
  author =       "Nancy M. Huang and Randall E. Cline",
  title =        "Inversion of Persymmetric Matrices Having {Toeplitz}
                 Inverses",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "437--444",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Mitrani:1972:NMS,
  author =       "I. Mitrani",
  title =        "Nonpriority Multiprogramming Systems Under Heavy
                 Demand Conditions --- Customers' Viewpoint",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "445--452",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:27:04 1998",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Nance:1972:BPA,
  author =       "Richard E. Nance and U. Narayan Bhat and Billy G.
                 Claybrook",
  title =        "Busy Period Analysis of a Time-Sharing System:
                 Transform Inversion",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "453--463",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kleinrock:1972:PSQ,
  author =       "L. Kleinrock and R. R. Muntz",
  title =        "Processor Sharing Queueing Models of Mixed Scheduling
                 Disciplines for Time Shared Systems",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "464--482",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "(VBI-001294)",
  descriptors =  "Processor sharing",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schultz:1972:SMM,
  author =       "Gary D. Schultz",
  title =        "A Stochastic Model for Message Assembly Buffering with
                 a Comparison of Block Assignment Strategies",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "483--495",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:44 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Slagle:1972:AFL,
  author =       "James R. Slagle",
  title =        "An Approach for Finding ${C}$-Linear Complete
                 Inference Systems",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "496--516",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 22:29:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bruno:1972:EAC,
  author =       "J. Bruno and K. Steiglitz",
  title =        "The Expression of Algorithms by Charts",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "517--525",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:40 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Constable:1972:SPL,
  author =       "Robert L. Constable and Allan B. Borodin",
  title =        "Subrecursive Programming Languages, {Part I}:
                 Efficiency and Program Structure",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "526--568",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 12:28:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ullman:1972:NEH,
  author =       "J. D. Ullman",
  title =        "A Note on the Efficiency of Hashing Functions",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "569--575",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:06:56 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Early work on the problem of finding optimal hash
                 functions for open addressing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Borodin:1972:CCC,
  author =       "A. Borodin",
  title =        "Corrigendum: ``{Computational} Complexity and the
                 Existence of Complexity Gaps''",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "3",
  pages =        "576--576",
  month =        jul,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Borodin:1972:CCE}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Beck:1972:CAR,
  author =       "Robert E. Beck and Bernard Kolman",
  title =        "Computer Approaches to the Representation of {Lie}
                 Algebras",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "577--589",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper surveys the methods of computing the inner
                 multiplicities of an irreducible representation of a
                 complex simple Lie algebra. It provides a descriptive
                 background of Lie algebra representation theory to
                 enable the reader to follow the computations. FORTRAN
                 programs to evaluate inner multiplicities using the
                 Kostant and Racah formulas are described. their
                 features are compared and suggestions are made for
                 combining and extending existing programs.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages --- Fortran;
                 mathematical techniques",
}

@Article{Fischer:1972:RTS,
  author =       "Patrick C. Fischer and Albert R. Meyer and Arnold L.
                 Rosenberg",
  title =        "Real-Time Simulation of Multihead Tape Units",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "590--607",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The main result of this paper is that, given a Turing
                 machine with several read-write heads per tape, one can
                 effectively construct an equivalent multitape Turing
                 machine with a single read-write head per tape, which
                 runs at precisely the same speed. This result implies
                 that serial storage may be used to handle files
                 requiring several points of immediate two-way
                 read-write access without interruptions for rewinds,
                 etc. it yields simplified proofs of several results in
                 the literature of computational complexity.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory; simulation",
}

@Article{Ibarra:1972:NCN,
  author =       "Oscar H. Ibarra",
  title =        "A Note Concerning Nondeterministic Tape Complexities",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "608--612",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A set of sufficient conditions on tape functions
                 $L_1(n)$ and $L_2(n)$ is presented that guarantees the
                 existence of a set accepted by an $L_1(n)$-tape bounded
                 nondeterministic Turing machine, but not accepted by
                 any $L_2(n)$-tape bounded nondeterministic Turing
                 machine.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Beatty:1972:AAC,
  author =       "James C. Beatty",
  title =        "An Axiomatic Approach to Code Optimization for
                 Expressions",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "613--640",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Beatty:1973:EAAa,Beatty:1973:EAAb}.",
  abstract =     "An axiomatic approach is proposed as a means of
                 specifying precisely what liberties are permitted in
                 evaluating expressions. Specific axiom systems are
                 introduced for arithmetic expressions, which permit
                 free grouping of terms within parentheses, in the
                 spirit of American National Standard Fortran. Using
                 these axiom systems, two algorithms are given for
                 finding optimal equivalent forms of an expression not
                 having multiple references to any variable. The first
                 algorithm is intended for highly parallel computers and
                 is a slight generalization of that of Baer and Bovet.
                 The concept of delay is introduced as a measure of the
                 serial dependency of a computation and the algorithm is
                 shown to minimize delay. This provides, as a special
                 case, a proof of the level minimality claimed by Baer
                 and Bovet. The second algorithm is shown to produce an
                 equivalent expression which can be evaluated with a
                 minimal number of instructions on a computer of the IBM
                 System\slash 360 type. It is an extension of a result
                 of Sethi and Ullman, which relates only to commutative
                 and associative operations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "codes, symbolic; computer operating systems ---
                 Program Compilers; computer programming languages ---
                 Fortran; computer systems, digital --- Parallel
                 Processing",
}

@Article{Frazer:1972:BOM,
  author =       "W. D. Frazer and B. T. Bennett",
  title =        "Bounds on Optimal Merge Performance, and a Strategy
                 for Optimality",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "641--648",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The length of a sorted sequence produced by the
                 internal sort phase of a large scale general purpose
                 sort routine is a random variable. In a random access
                 environment, any given set of such sequences can be
                 merged in an optimal way, and in practice this often
                 done. the expected work per item required by an optimal
                 merge depends upon the probability distribution for
                 sequence length, and it is this dependence which is
                 studied. Reasonable sharp upper and lower bounds are
                 derived. The distribution which is optimal in the sense
                 of minimizing the lower bound on any bounded interval
                 is determined, and it is shown that this is the
                 strongest result of its kind.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; data storage, digital
                 --- Random Access",
}

@Article{Reingold:1972:OSS,
  author =       "Edward M. Reingold",
  title =        "On the Optimality of Some Set Algorithms",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "649--659",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper is concerned with establishing lower bounds
                 on the number of comparisons required to solve various
                 combinatorial problems; in particular, the problems of
                 testing set equality, computing the maximum of a set,
                 and computing the median of a set are discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Savage:1972:CWT,
  author =       "J. E. Savage",
  title =        "Computational Work and Time on Finite Machines",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "660--674",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Exchange inequalities are developed for random access,
                 tape, and drum machines to show that product
                 inequalities between storage and time, number of drum
                 tracks and time, number of bits in an address and time,
                 etc., must be satisfied to compute finite functions on
                 bounded machines.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory; data storage, digital --- Random
                 Access",
}

@Article{Gray:1972:CRP,
  author =       "James N. Gray and Michael A. Harrison",
  title =        "On the Covering and Reduction Problems for
                 Context-Free Grammars",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "675--698",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A formal definition of one grammar ``covering''
                 another grammar is presented. It is argued that this
                 definition has the property that $G$ prime covers $G$
                 when and only when the ability to parse $G$ double
                 prime suffices for parsing $G$. It is shown that every
                 grammar may be covered by a grammar in canonical two
                 form. Every $A$-free grammar is covered by an operator
                 normal form grammar while there exist grammars which
                 cannot be covered by any grammar in Greibach form. any
                 grammar may be covered by an invertible grammar. Each
                 $A$-free and chain reduced LR($k$) (bounded right
                 context) grammar is covered by a precedence detectable,
                 LR($k$) (bounded right context) reducible grammar.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory; context free grammars",
}

@Article{Chang:1972:GMT,
  author =       "Shi-Kuo Chang",
  title =        "The Generation of Minimal Trees with a {Steiner}
                 Topology",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "699--711",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An iterative method is described which generates a
                 minimal tree with a Steiner topology in at most $n-2$
                 steps, where $n$ is the number of fixed vertices. The
                 SI algorithm is formulated. When $n$ less than
                 equivalent to $4$, the SI algorithm converges to a
                 proper tree. Experimental studies indicate that this
                 algorithm generates trees close to optimal Steiner
                 minimal trees.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Srinivasan:1972:AAL,
  author =       "V. Srinivasan and G. L. Thompson",
  title =        "Accelerated Algorithms for Labeling and Relabeling of
                 Trees, with Applications to Distribution Problems",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "712--726",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Adjacent extreme point problems involving a tree basis
                 (e.g. the transportation problem) require the
                 determination of cycles which are created when edges
                 not belonging to the basis are added to the basis-tree.
                 This paper offers an improvement over the
                 predecessor-index method for finding such cycles and
                 involves the use of a distance function defined on the
                 nodes of the tree, in addition to the predecessor
                 labels. It is shown that the relabeling associated with
                 a basis change can be minimized by defining yet another
                 function called the successor function. The algorithms
                 for labeling and relabeling are then specialized for
                 the specific case of transportation problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "912",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques --- Graph Theory; mathematical
                 techniques --- Trees; operations research",
}

@Article{Harris:1972:NFQ,
  author =       "Carl M. Harris and Paul G. Marlin",
  title =        "A Note on Feedback Queues with Bulk Service",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "727--733",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This note provides some extensions of work by
                 Delbrouck, which dealt with a queuing model of a
                 feedback system with queue-dependent service times. The
                 emphasis of this present work is upon necessary and
                 sufficient conditions for ergodicity, the relationship
                 of the imbedded and general-time queuing processes, and
                 the relaxation of the extent of state dependence for
                 the service times.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "This note provides some extensions of recent work by
                 Delbrouck, which dealt with a queuing model of a
                 feedback system with queue-dependent service times. The
                 emphasis of this present work is upon necessary and
                 sufficient conditions for ergodicity, the relationship
                 of the imbedded and general-time queuing processes, and
                 the relaxation of the extent of state dependence for
                 the service times.",
  classification = "718; 723; 922",
  descriptors =  "Analysis; feedback queue; bulk service; ergodicity;
                 state dependent service; stochastic process;
                 probability",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems, digital; probability; telephone
                 exchanges",
}

@Article{Bayes:1972:MVS,
  author =       "A. J. Bayes",
  title =        "A Minimum Variance Sampling Technique for Simulation
                 Models",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "734--741",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1972.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A technique is presented to allow the sampling
                 frequency of the states of the simulation to be
                 independent of their natural frequency. By representing
                 a simulation model as a Markov chain, the theory is
                 applied to estimate some statistics of the simulation
                 model with minimum variance; for instance, the
                 frequency of overload of a teleprocessing computer
                 system. A numerical case is presented in which the
                 sampling effort is reduced by a factor of sixty
                 compared to a normal simulation run.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A sampling theory of Markov chains is developed which
                 allows some statistics of the Markov state frequencies
                 to be estimated with minimum variance for a given
                 sampling effort. A technique is presented to allow the
                 sampling frequency of the states of the simulation to
                 be independent of their natural frequency. By re-
                 presenting a simulation model as a Markov chain, the
                 theory is applied to estimate some statistics of the
                 simulation.",
  classification = "913; 922",
  descriptors =  "Simulation; simulation model; Markov chain; variance",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical models; probability --- Random Processes;
                 sampling; simulation",
}

@Article{Zeigler:1972:TFT,
  author =       "Bernard P. Zeigler",
  title =        "Towards a Formal Theory of Modeling and Simulation:
                 Structure Preserving Morphisms",
  journal =      j-J-ACM,
  volume =       "19",
  number =       "4",
  pages =        "742--764",
  month =        oct,
  year =         "1972",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:22:17 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A simulation consists of a triple of automata (system
                 to be simulated, model of this system, computer
                 realizing the model). In a valid simulation these
                 elements are connected by behavior and structure
                 preserving morphisms. Informational and complexity
                 considerations motivate the development of structure
                 preserving morphisms which can preserve not only
                 global, but also local dynamic structure. A formalism
                 for automaton structure assignment and the relevant
                 weak and strong structure preserving morphisms are
                 introduced. It is shown that these preservation notions
                 properly refine the usual automaton homomorphism
                 concepts. Sufficient conditions are given under which
                 preservation of the local state space structure (weak
                 morphism) also forces the preservation of component
                 interaction. The strong sense in which these conditions
                 are necessary is also demonstrated. This provides a
                 rationale for making valid inferences about the local
                 structure of a system when that of a behaviorally valid
                 model is known.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory; computational complexity;
                 mathematical models; simulation",
}

@Article{Nievergelt:1973:UBT,
  author =       "J. Nievergelt and C. K. Wong",
  title =        "Upper Bounds for the Total Path Length of Binary
                 Trees",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "1--6",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:07:15 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sloate:1973:SCM,
  author =       "Harry M. Sloate and Theodore A. Bickart",
  title =        "${A}$-Stable Composite Multistep Methods",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "7--26",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:07:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stone:1973:EPA,
  author =       "Harold S. Stone",
  title =        "An Efficient Parallel Algorithm for the Solution of a
                 Tridiagonal Linear System of Equations",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "27--38",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/ovr.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "linear system; nla; prll; tridiagonal matrix",
}

@Article{Burnett:1973:CPR,
  author =       "G. J. Burnett and E. G. {Coffman, Jr.}",
  title =        "A Combinatorial Problem Related to Interleaved Memory
                 Systems",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "39--45",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Liu:1973:SAM,
  author =       "C. L. Liu and James W. Layland",
  title =        "Scheduling Algorithms for Multiprogramming in a
                 Hard-Real-Time Environment",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "46--61",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:08:01 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/scheduling.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Griffith:1973:MMA,
  author =       "Arnold K. Griffith",
  title =        "Mathematical Models for Automatic Line Detection",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "62--80",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenfeld:1973:ACD,
  author =       "Azriel Rosenfeld",
  title =        "Arcs and Curves in Digital Pictures",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "81--87",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Richards:1973:EESa,
  author =       "Donald L. Richards",
  title =        "Efficient Exercising of Switching Elements in Nets of
                 Identical Gates",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "88--111",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:20:05 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{DiPaola:1973:SDP,
  author =       "Robert A. {Di Paola}",
  title =        "The Solvability of the Decision Problem for Classes of
                 Proper Formulas and Related Results",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "112--126",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dixon:1973:RTP,
  author =       "John K. Dixon",
  title =        "${Z}$-Resolution: {Theorem-Proving} with Compiled
                 Axioms",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "127--147",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:00:09 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/hybrid.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hwang:1973:CMA,
  author =       "F. K. Hwang and D. N. Deutsch",
  title =        "A Class of Merging Algorithms",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "148--159",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosen:1973:TMS,
  author =       "Barry K. Rosen",
  title =        "Tree-Manipulation Systems and {Church--Rosser}
                 Theorems",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "160--187",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Beatty:1973:EAAa,
  author =       "James C. Beatty",
  title =        "Errata: ``{An} Axiomatic Approach to Code Optimization
                 for Expressions''",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "1",
  pages =        "188--188",
  month =        jan,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:00:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Beatty:1972:AAC,Beatty:1973:EAAb}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salkin:1973:SCA,
  author =       "Harvey M. Salkin and Ronald D. Koncal",
  title =        "Set Covering by an All Integer Algorithm:
                 Computational Experience",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "189--193",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:33:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Srinivasan:1973:BCA,
  author =       "V. Srinivasan and G. L. Thompson",
  title =        "Benefit-Cost Analysis of Coding Techniques for the
                 Primal Transportation Algorithm",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "194--213",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:13:09 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gray:1973:CPS,
  author =       "James N. Gray and Michael A. Harrison",
  title =        "Canonical Precedence Schemes",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "214--234",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lomet:1973:FTD,
  author =       "David Bruce Lomet",
  title =        "A Formalization of Transition Diagram Systems",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "235--257",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/da.3d-metaphors.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Formal, Sprachtheorie (Vorbehalt)",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Salton:1973:RSA,
  author =       "G. Salton",
  title =        "Recent Studies in Automatic Text Analysis and Document
                 Retrieval",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "258--278",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dalphin:1973:BLS,
  author =       "John F. Dalphin and Victor Lovass-Nagy",
  title =        "Best Least Squares Solutions to Finite Difference
                 Equations Using the Generalized Inverse and Tensor
                 Product Methods",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "279--289",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Friedli:1973:OCA,
  author =       "Armin Friedli",
  title =        "Optimal Covering Algorithms in Methods of Search for
                 Solving Polynomial Equations",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "290--300",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Goldstein:1973:MP,
  author =       "A. J. Goldstein and P. L. Richman",
  title =        "A Midpoint Phenomenon",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "301--304",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Morgenstern:1973:NLB,
  author =       "Jacques Morgenstern",
  title =        "Note on a Lower Bound of the Linear Complexity of the
                 Fast {Fourier} Transform",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "305--306",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Arora:1973:OSL,
  author =       "S. R. Arora and A. Gallo",
  title =        "Optimization of Static Loading and Sizing of
                 Multilevel Memory Systems",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "307--319",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Richards:1973:EESb,
  author =       "Donald L. Richards",
  title =        "Efficient Exercising of Switching Elements in
                 Combinational Nets",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "320--332",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 22 21:19:37 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pietrzykowski:1973:CMS,
  author =       "Tomasz Pietrzykowski",
  title =        "A Complete Mechanization of Second-Order Type Theory",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "2",
  pages =        "333--364",
  month =        apr,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Berztiss:1973:BPI,
  author =       "A. T. Berztiss",
  title =        "A Backtrack Procedure for Isomorphism of Directed
                 Graphs",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "365--377",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:13:41 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Green:1973:PEF,
  author =       "Christopher D. Green",
  title =        "A Path Entropy Function for Rooted Trees",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "378--384",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Johnson:1973:NDS,
  author =       "Donald B. Johnson",
  title =        "A Note on {Dijkstra}'s Shortest Path Algorithm",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "385--388",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Williams:1973:NYA,
  author =       "Thomas A. Williams and Gregory P. White",
  title =        "A Note on {Yen}'s Algorithm for Finding the Length of
                 All Shortest Paths in ${N}$-Node Nonnegative-Distance
                 Networks",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "389--390",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:14:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kaneko:1973:LRE,
  author =       "Toyohisa Kaneko and Bede Liu",
  title =        "On Local Roundoff Errors in Floating-Point
                 Arithmetic",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "391--398",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321765.321771",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "65G05",
  MRnumber =     "49 8318",
  bibdate =      "Tue Oct 09 10:18:49 2007",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A bound on the relative error in floating-point
                 addition using a single-precision accumulator with
                 guard digits is derived. It is shown that even with a
                 single guard digit, the accuracy can be almost as good
                 as that using a double-precision accumulator. A
                 statistical model for the roundoff error in
                 double-precision multiplication and addition is also
                 derived. The model is confirmed by experimental
                 measurements.",
  acknowledgement = ack-nhfb # " and " # ack-nj,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  reviewer =     "V. V. Ivanov",
}

@Article{Miller:1973:TAN,
  author =       "Webb Miller",
  title =        "Toward Abstract Numerical Analysis",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "399--408",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Watson:1973:AIB,
  author =       "G. A. Watson",
  title =        "An Algorithm for the Inversion of Block Matrices of
                 {Toeplitz} Form",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "409--415",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "block algorithm; block Toeplitz matrix; inverse
                 matrix; nla",
}

@Article{Adiri:1973:CQB,
  author =       "Igal Adiri",
  title =        "Cyclic Queues with Bulk Arrivals",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "416--428",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:54:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Grossman:1973:PRS,
  author =       "David D. Grossman and Harvey F. Silverman",
  title =        "Placement of Records on a Secondary Storage Device to
                 Minimize Access Time",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "429--438",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tourlakis:1973:SRC,
  author =       "G. Tourlakis and J. Mylopoulos",
  title =        "Some Results in Computational Topology",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "439--455",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/pre75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lewis:1973:GFS,
  author =       "T. G. Lewis and W. G. Payne",
  title =        "Generalized Feedback Shift Register Pseudorandom
                 Number Algorithm",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "456--468",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321765.321777",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Dec 22 07:42:23 2011",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "See important errata, and algorithm and code
                 improvements, in \cite{Fushimi:1990:RNG}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Feedback configurations for SR's of length > 45",
  descriptors =  "Shift register sequences",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Tootill:1973:ART,
  author =       "J. P. R. Tootill and W. D. Robinson and D. J. Eagle",
  title =        "An Asymptotically Random {Tausworthe} Sequence",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "469--481",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "The theoretical limitations on the orders of
                 equidistribution attainable by Tausworthe sequences are
                 derived from first principles and are stated in the
                 form of a criterion to be achieved. A second criterion,
                 extending these limitations to multidimensional
                 uniformity, is also defined. A sequence possessing both
                 properties is said to be asymptotically random as no
                 other sequence of the same period could be more random
                 in these respects. \ldots{}",
  descriptors =  "Tausworthe generator; shift register sequences; rng;
                 test; runtime/storage efficiency; multidimensional
                 uniformity",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Worrell:1973:EOS,
  author =       "R. B. Worrell and B. L. Hulme",
  title =        "Efficient Ordering of Set Expressions for Symbolic
                 Expansion",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "482--488",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ashcroft:1973:DPM,
  author =       "Edward Ashcroft and Zohar Manna and Amir Pnueli",
  title =        "Decidable Properties of Monadic Functional Schemas",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "489--499",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:16:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ehrlich:1973:LAG,
  author =       "Gideon Ehrlich",
  title =        "Loopless Algorithms for Generating Permutations,
                 Combinations, and Other Combinatorial Configurations",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "500--513",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Keller:1973:PPSa,
  author =       "Robert M. Keller",
  title =        "Parallel Program Schemata and Maximal Parallelism {I}.
                 {Fundamental} Results",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "514--537",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Beatty:1973:EAAb,
  author =       "James C. Beatty",
  title =        "Errata: ``{An} Axiomatic Approach to Code Optimization
                 for Expressions''",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "538--538",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:00:53 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Beatty:1972:AAC,Beatty:1973:EAAa}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Jenkins:1973:BMI,
  author =       "M. A. Jenkins",
  title =        "{Bernouilli}'s Method with Implicit Shifting",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "3",
  pages =        "539--544",
  month =        jul,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:07 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krogh:1973:TSN,
  author =       "Fred T. Krogh",
  title =        "On Testing a Subroutine for the Numerical Integration
                 of Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "545--562",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McClellan:1973:ESS,
  author =       "Michael T. McClellan",
  title =        "The Exact Solution of Systems of Linear Equations with
                 Polynomial Coefficients",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "563--588",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Adiri:1973:MQ,
  author =       "I. Adiri and M. Hofri and M. Yadin",
  title =        "A Multiprogramming Queue",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "589--603",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1973.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Description of a simple computer system (CPU, I/O
                 unit) which works in a multiprogramming manner under a
                 heavy load. The incoming queue is never empty and the
                 service times are exponentially distributed independent
                 random variables. Head of the line priority of programs
                 which are being processed over newcomers is considered.
                 The system is compared with two others: one working in
                 ``batch mode'' and another multiprogramming system.",
  descriptors =  "Queueing system; priority",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gotlieb:1973:PMH,
  author =       "C. C. Gotlieb and G. H. MacEwen",
  title =        "Performance of Movable-Head Disk Storage Devices",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "604--623",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:27:18 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Gotlieb:1975:EPM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yue:1973:OPR,
  author =       "P. C. Yue and C. K. Wong",
  title =        "On the Optimality of the Probability Ranking Scheme in
                 Storage Applications",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "624--633",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hueckel:1973:LVO,
  author =       "Manfred H. Hueckel",
  title =        "A Local Visual Operator Which Recognizes Edges and
                 Lines",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "634--647",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:21:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Hueckel:1974:ELV}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Stillman:1973:CWS,
  author =       "Rona B. Stillman",
  title =        "The Concept of Weak Substitution in Theorem-Proving",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "648--667",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:10 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Bass:1973:OHN,
  author =       "Leonard Bass and Paul Young",
  title =        "Ordinal Hierarchies and Naming Complexity Classes",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "668--686",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:03 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Daley:1973:EIC,
  author =       "Robert P. Daley",
  title =        "An Example of Information and Computation Resource
                 Trade-Off",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "687--695",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 17:55:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Keller:1973:PPSb,
  author =       "Robert M. Keller",
  title =        "Parallel Program Schemata and Maximal Parallelism
                 {II}: {Construction} of Closures",
  journal =      j-J-ACM,
  volume =       "20",
  number =       "4",
  pages =        "696--710",
  month =        oct,
  year =         "1973",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:16:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Herr:1974:SMS,
  author =       "David G. Herr",
  title =        "On a Statistical Model of {Strand} and {Westwater} for
                 the Numerical Solution of a {Fredholm} Integral
                 Equation of the First Kind",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "1--5",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The purpose of this paper is to present a statistical
                 model useful in the numerical solution of a Fredholm
                 integral equation of the first kind and equivalent to
                 one proposed by O. N. Strand and E. R. Westwater. The
                 model presented here is familiar to statisticians from
                 the study of regression analysis. In fact, this
                 familiarity and the consequent rich store of results
                 available for the analysis of the general linear model
                 are the principal reasons for proposing that this model
                 is the appropriate way to view the problem posed by
                 Strand and Westwater.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Tsao:1974:SPE,
  author =       "Nai-Kuan Tsao",
  title =        "Some a Posteriori Error Bounds in Floating-Point
                 Computations",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "6--17",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Efficiently computable a posteriori error bounds are
                 attained by using a posteriori models for bounding
                 roundoff errors in the basic floating-point operations.
                 Forward error bounds are found for inner product and
                 polynomial evaluations. An analysis of the Crout
                 algorithm in solving systems of linear algebraic
                 equations leads to sharper backward a posteriori
                 bounds. The results in the analysis of the iterative
                 refinement give bounds useful in estimating the rate of
                 convergence. Some numerical experiments are included.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Cotten:1974:PTS,
  author =       "L. W. Cotten and A. M. Abd-Alla",
  title =        "Processing Times for Segmented Jobs with {I/O} Compute
                 Overlap",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "18--30",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Using a queueing model with tandem servers for the
                 performance analysis, two cases, single-segment overlap
                 and unlimited overlap, are considered. Segmental
                 compute and output (or input) service times are taken
                 to be exponentially distributed; however, the approach
                 is not limited to the exponential case if service is
                 independent. The ratio of mean output time to mean
                 computer time is varied to explore the full range
                 between compute-bound and output-bound extremes. Final
                 results are presented as relative gain over sequential
                 processing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Franaszek:1974:SDF,
  author =       "P. A. Franaszek and T. J. Wagner",
  title =        "Some Distribution-Free Aspects of Paging Algorithm
                 Performance",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "31--39",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/cache.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The topic of this paper is a probabilistic analysis of
                 demand paging algorithms for storage hierarchies. Two
                 aspects of algorithm performance are studied under the
                 assumption that the sequence of page requests is
                 statistically independent; the page fault probability
                 for a fixed memory size and the variation of
                 performance with memory. Performance bounds are
                 obtained which are independent of the page request
                 probabilities. It is shown that simple algorithms exist
                 which yield fault probabilities close to optimal with
                 only a modest increase in memory.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Ingargiola:1974:FOD,
  author =       "Giorgio Ingargiola and James F. Korsh",
  title =        "Finding Optimal Demand Paging Algorithms",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "40--53",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In this paper the authors introduce a formal
                 stochastic program model and cost criterion for a
                 replacement policy. This model serves to obviate the
                 need to know the sequence, or number, of actual page
                 references of a program, in order to determine an
                 optimal replacement policy. The existence of an optimal
                 policy and cost is proved under rather general
                 assumptions, and an algorithm is presented which
                 largely reduces the computational complexity involved
                 in finding optimal policies in the non-time-varying
                 case. Still, only moderate size programs may be
                 analyzed by this method, if the computations are to be
                 carried out in a reasonable amount of time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Mitra:1974:SAH,
  author =       "Debasis Mitra",
  title =        "Some Aspects of Hierarchical Memory Systems",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "54--65",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A class of demand paging algorithms for some two-level
                 memory hierarchies is analyzed. The typical memory
                 hierarchy is comprised of the core and a backing
                 device. A distance matrix characterizes the properties
                 of the latter device. The sequence of address
                 references directed to the hierarchy by the CPU and
                 channels is modeled as a Markov process. A compact
                 expression for the mean time required to satisfy the
                 page demands is derived and this expression provides
                 the basis for some optimization problems concerning
                 partitionings and rearrangements of pages in the
                 backing device. In connection with these problems, a
                 class of random processes is defined in terms of an
                 ordering property of a joint probability matrix which
                 is central to memory hierarchies. Three results are
                 given on the ordering property, its relation
                 specifically to partitionings inherent in hierarchies
                 and the problem of optimal rearrangements. Finally, for
                 such a class of ordered processes, certain results due
                 to the author are specialized to yield the solution to
                 the problem of optimal rearrangement of pages on an
                 assembly of magnetic bubble loops.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Sevcik:1974:SMT,
  author =       "Kenneth C. Sevcik",
  title =        "Scheduling for Minimum Total Loss Using Service Time
                 Distributions",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "66--75",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In this paper the authors define a new scheduling rule
                 and prove that it minimizes expected total loss when
                 preemption is allowed and service time distributions
                 are known. It is shown that certain forms of service
                 time distributions cause the optimal rule to schedule
                 as such well-known rules as first-come first-served,
                 random, or multilevel feedback.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Earnest:1974:STC,
  author =       "Christopher Earnest",
  title =        "Some Topics in Code Optimization",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "76--102",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper presents and explains a class of algorithms
                 for performing the code optimizations known as common
                 subexpression elimination and code motion. It attempts
                 to clarify the connection between the solution of the
                 equations and the program being optimized, and presents
                 a number of improvements and extensions to the basic
                 method.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Crane:1974:SSSa,
  author =       "Michael A. Crane and Donald L. Iglehart",
  title =        "Simulating Stable Stochastic Systems, {I}: {General}
                 Multiserver Queues",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "103--113",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A technique is introduced for analyzing simulations of
                 stochastic systems in the steady state. From the
                 viewpoint of classical statistics, questions of
                 simulation run duration and of starting and stopping
                 simulations are addressed. This is possible because of
                 the existence of a random grouping of observations
                 which produces independent identically distributed
                 blocks from the start of the simulation. The analysis
                 is presented in the context of the general multiserver
                 queue, with arbitrarily distributed interarrival and
                 service times. In this case, it is the busy period
                 structure of the system which produces the grouping
                 mentioned above. Numerical illustrations are given for
                 the M/M/1 queue. Statistical methods are employed so as
                 to obtain confidence intervals for a variety of
                 parameters of interest, such as the expected value of
                 the stationary customer waiting time, the expected
                 value of a function of the stationary waiting time, the
                 expected number of customers served and length of a
                 busy cycle, the tail of the stationary waiting time
                 distribution, and the standard deviation of the
                 stationary waiting time. Consideration is also given to
                 determining system sensitivity to errors and
                 uncertainty in the input parameters.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "731; 922",
  descriptors =  "Simulation; statistical technique",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "control systems; probability --- Queueing Theory",
}

@Article{Crane:1974:SSSb,
  author =       "Michael A. Crane and Donald L. Iglehart",
  title =        "Simulating Stable Stochastic Systems, {II}: {Markov}
                 Chains",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "114--123",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A technique for simulating GI/G/s queues is shown to
                 apply to simulations of discrete and continuous-time
                 Markov chains. It is possible to address questions of
                 simulation run duration and of starting and stopping
                 simulations because of the existence of a random
                 grouping of observations which produces independent
                 identically distributed blocks from the start of the
                 simulation. This grouping allows confidence intervals
                 to be obtained for a general function of the
                 steady-state distribution of the Markov chain. The
                 technique is illustrated with simulation of an (s, S)
                 inventory model in discrete time and the classical
                 repairman problem in continuous time. Consideration is
                 also given to determining system sensitivity to errors
                 and uncertainty in the input parameters.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "731; 922",
  descriptors =  "Simulation; statistical technique",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "control systems; probability --- Random Processes",
}

@Article{Fleisig:1974:IME,
  author =       "S. Fleisig and D. Loveland and A. K. {Smiley III} and
                 D. L. Yarmush",
  title =        "An Implementation of the Model Elimination Proof
                 Procedure",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "124--139",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/prolog.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The model elimination (ME) and resolution algorithms
                 for mechanical theorem-proving were implemented so as
                 to maximize shared features. The identical data
                 structures and large amount of common programming
                 permit meaningful comparisons when the two programs are
                 run on standard problems. ME does better on some
                 classes of problems, and resolution better on others.
                 The depth-first search strategy used in this ME
                 implementation affects the performance profoundly.
                 Other novel features in the implementation are new
                 control parameters to govern extensions, and modified
                 rules for generating and rejecting chains. The
                 resolution program incorporates unit preference and
                 set-of-support. An appendix reproduces the steps of a
                 machine-derived ME refutation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming; prolog",
}

@Article{Kohler:1974:CTC,
  author =       "Walter H. Kohler and Kenneth Steiglitz",
  title =        "Characterization and Theoretical Comparison of
                 Branch-and-Bound Algorithms for Permutation Problems",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "140--156",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Branch-and-bound implicit enumeration algorithms for
                 permutation problems (discrete optimization problems
                 where the set of feasible solutions is the permutation
                 group S//n) are characterized in terms of a sextuple
                 (B//p, S,E,D,L,U), where B//p is the branching rule for
                 permutation problems, $S$ is the next node selection
                 rule, $E$ is the set of node elimination rules, $D$ is
                 the node dominance function, $L$ is the node
                 lower-bound cost function, and U is an upper-bound
                 solution cost. A general algorithm based on this
                 characterization is presented and the dependence of the
                 computational requirements on the choice of algorithm
                 parameters S, E, D, L, and U is investigated
                 theoretically. The results verify some intuitive
                 notions but disprove others.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Kritzinger:1974:TTC,
  author =       "P. S. Kritzinger and J. W. Graham",
  title =        "A Theorem in the Theory of Compromise Merge Methods",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "157--160",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $r$ be the total number of cycles required to
                 complete a compromise merge of a given number of
                 initial strings. Define row vectors $m_{r-j}$ and $d_j$
                 whose components represent the number and length
                 respectively of strings at the end of the $j$th cycle
                 of the merge. It is shown in this paper that there are
                 asymptotic approximations to these vectors, which
                 enables one to compute their respective components
                 directly. Consequently, the number of cycles $r$ can be
                 computed directly, as in the case of the balanced
                 merge.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Shaw:1974:NME,
  author =       "Mary Shaw and J. F. Traub",
  title =        "On the Number of Multiplications for the Evaluation of
                 a Polynomial and Some of Its Derivatives",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "161--167",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321796.321810",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A family of new algorithms is given for evaluating the
                 first $m$ derivatives of a polynomial. In particular,
                 it is shown that all derivatives may be evaluated in $
                 3 n - 2 $ multiplications. The best previous result
                 required $ (1/2) n (n + 1) $ multiplications. Some
                 optimality results are presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Wagner:1974:SSC,
  author =       "Robert A. Wagner and Michael J. Fischer",
  title =        "The String-to-String Correction Problem",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "1",
  pages =        "168--173",
  month =        jan,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The string-to-string correction problem is to
                 determine the distance between two strings as measured
                 by the minimum cost sequence of ``edit operations''
                 needed to change the one string into the other. The
                 edit operations investigated allow changing one symbol
                 of a string into another single symbol, deleting one
                 symbol from a string, or inserting a single symbol into
                 a string. An algorithm is presented which solves this
                 problem in the time proportional to the product of the
                 lengths of the two strings. Possible applications are
                 to the problems of automatic spelling correction and
                 determining the longest subsequence of characters
                 common to two strings.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  comment =      "A dynamic programming algorithm is presented to find
                 the minimum distance between two strings. A good
                 definition of distance is presented. The algorithm runs
                 in $\Theta(|m| \cdot |n|)$ time. A special case to find
                 the longest common subsequence is presented.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Michie:1974:SBD,
  author =       "D. Michie and E. E. Sibert",
  title =        "Some Binary Derivation Systems",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "175--190",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A family of search procedures controlled by evaluation
                 functions of a very general sort is considered, having
                 the form $f_{\Lambda (x, L_k)}$, where $L_k$ is that
                 portion of the graph generated thus far by the
                 procedure, and the node $x$ is a candidate for
                 incorporation into $L_k$. Completeness and minimality
                 results are obtained for a number of procedures in this
                 family, including methods analogous to those of Moore,
                 Dijkstra, and Pohl.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Overbeek:1974:NCA,
  author =       "Ross A. Overbeek",
  title =        "A New Class of Automated Theorem-Proving Algorithms",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "191--200",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A procedure is defined for deriving from any statement
                 $S$ an infinite sequence of statements $S_0$, $S_1$,
                 $S_2$, $S_3$, \ldots{} such that: (a) if there exists
                 an $i$ such that $S_i$ is unsatisfiable, then $S$ is
                 unsatisfiable; (b) if $S$ is unsatisfiable, then there
                 exists an $i$ such that $S_i$ is unsatisfiable; (c) for
                 all $i$ the Herbrand universe of $S_i$ is finite;
                 hence, for each $i$ the satisfiability of $S_i$ is
                 decidable. The new algorithms are then based on the
                 idea of generating successive $S_i$ in the sequence and
                 testing each $S_i$ for satisfiability. Each element in
                 the class of new algorithms is complete.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Brent:1974:PEG,
  author =       "Richard P. Brent",
  title =        "The Parallel Evaluation of General Arithmetic
                 Expressions",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "201--206",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that arithmetic expressions with $n \geq
                 1$ variables and constants; operations of addition,
                 multiplication, and division; and any depth of
                 parenthesis nesting can be evaluated in time $4
                 \log_{2n} + 10^(n-1)/p$ using $p$ greater than
                 equivalent to $1$ processors which can independently
                 perform arithmetic operations in unit time. This bound
                 is within a constant factor of the best possible. A
                 sharper result is given for expressions without the
                 division operation, and the question of numerical
                 stability is discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Pager:1974:FRP,
  author =       "David Pager",
  title =        "Further Results on the Problem of Finding Minimal
                 Length Programs for Decision Tables",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "207--212",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In this paper it is shown that whatever the length
                 function employed, the problem of finding the shortest
                 program for a decision table with two (or more) entries
                 is not recursively solvable (whereas for decision
                 tables with a single entry the problem is solvable for
                 some length functions and unsolvable for others).
                 Moreover, it is shown that there is a pair of finite
                 sets of programs and a single entry $E$ such that the
                 shortest program for the decision table formed by
                 adding a single additional entry to $E$ is in all cases
                 in one of the two sets, but it is undecidable in which.
                 Some consequences of these results are then presented,
                 such as showing that for a wide range of restrictions
                 the results remain true, even when the repertoire of
                 possible programs for a decision table is narrowed by
                 only considering programs which meet certain
                 restrictions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Gabrielian:1974:GS,
  author =       "Armen Gabrielian and Seymour Ginsburg",
  title =        "Grammar Schemata",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "213--226",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A solution is presented for the following problem:
                 Determine a procedure that produces, for each full trio
                 $L$ of context-free languages (more generally, each
                 trio of r.e.\ languages), a family of context-free
                 (phrase structure) grammars which (a) defines $L$, (b)
                 is simple enough for practical and theoretical
                 purposes, and (c) in most cases is a subfamily of a
                 well-known family of context-free (phrase structure)
                 grammars for $L$ if such a well-known family exists.
                 The key notion in the paper is that of a grammar
                 schema. With each grammar schema there is associated a
                 family of interpretations. In turn, each interpretation
                 of a grammar schema gives rise to a phrase structure
                 grammar. Given a full trio (trio) $L$ of context-free
                 (r.e.) languages, one constructs a grammar schema whose
                 interpretations ($\epsilon$-limited interpretations)
                 then give rise to the desired family of grammars for
                 $L$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Berman:1974:MLT,
  author =       "G. Berman and A. W. Colijn",
  title =        "A Modified List Technique Allowing Binary Search",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "227--232",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A modification of linked lists is presented which
                 permits searching almost as efficiently as a pure
                 binary search. The method depends on using consecutive
                 memory locations for consecutive list elements whenever
                 possible.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Binary searching of an index structure",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; data processing",
}

@Article{Chien:1974:DSM,
  author =       "R. T. Chien and E. A. Mark",
  title =        "A Document Storage Method Based on Polarized
                 Distance",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "233--245",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Some elementary mathematical properties of term
                 matching document retrieval systems are developed.
                 These properties are used as a basis for a new file
                 organization technique. Some of the advantages of this
                 new method are: (1) the key-to-address transformation
                 is easily determined; (2) the documentary is stored
                 only once in the file; (3) the file organization allows
                 the use of various matching functions and thresholds,
                 and (4) the dimensionality of the transform is easily
                 expanded to accommodate various sized data bases.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems",
}

@Article{Elias:1974:ESR,
  author =       "Peter Elias",
  title =        "Efficient Storage and Retrieval by Content and Address
                 of Static Files",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "246--260",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A set of static files or inventories is considered,
                 each consisting of the same number of entries, each
                 entry a binary word of the same fixed length selected
                 (with replacement) from the set of all binary sequences
                 of that length, and the entries in each file sorted
                 into lexical order. Several retrieval questions of
                 interest for each such file are considered. One is to
                 find the value of the jth entry, another to find the
                 number of entries of value less than $k$. When a binary
                 representation of such a file is stored in computer
                 memory and an algorithm or machine which knows only the
                 file parameters (i.e. number of entries, number of
                 possible values per entry) accesses some of the stored
                 bits to answer a retrieval question, the number of bits
                 stored and the number of bits accessed per retrieval
                 question are cost measures for the storage and
                 retrieval task which have been used by Minsky and
                 Papert. Bits stored depends on the representation
                 chosen: bits accessed also depends on the retrieval
                 question asked and on the algorithm used. Firm lower
                 bounds are given to minimax measures of bits stored and
                 bits accessed for each of four retrieval questions, and
                 construct representations and algorithms for a
                 bit-addressable machine which come within factors of
                 two or three of attaining all four bounds at once for
                 files of any size. All four factors approach one for
                 large enough files.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems",
}

@Article{Blevins:1974:CED,
  author =       "M. M. Blevins and G. W. Stewart",
  title =        "Calculating the Eigenvectors of Diagonally Dominant
                 Matrices",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "261--271",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is proposed for calculating the
                 eigenvectors of a diagonally dominant matrix all of
                 whose elements are known to high relative accuracy.
                 Eigenvectors corresponding to pathologically close
                 eigenvalues are treated by computing the invariant
                 subspace that they span. If the off-diagonal elements
                 of the matrix are sufficiently small, the method is
                 superior to standard techniques, and indeed it may
                 produce a complete set of eigenvectors with an amount
                 of work proportional to the square of the order of the
                 matrix. An analysis is given of the effects of
                 perturbations in the matrix on the eigenvectors.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "diagonal dominance; eig; mathematical techniques;
                 nla",
}

@Article{Zohar:1974:STS,
  author =       "Shalhav Zohar",
  title =        "The Solution of a {Toeplitz} Set of Linear Equations",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "272--276",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The solution of a set of $m$ linear equations with a
                 non-Hermitian Toeplitz associated matrix is considered.
                 Presently available fast algorithms solve this set with
                 $4 m^2$ ``operations'' (an ``operation'' is defined
                 here as a set of one addition and one multiplication).
                 An improved algorithm requiring only $3 m^2$
                 ``operations'' is presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Horowitz:1974:CPA,
  author =       "Ellis Horowitz and Sartaj Sahni",
  title =        "Computing Partitions with Applications to the Knapsack
                 Problem",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "277--292",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Given $r$ numbers $s_1$, \ldots{}, $s_r$, algorithms
                 are investigated for finding all possible combinations
                 of these numbers which sum to $M$. This problem is a
                 particular instance of the $0$--$1$ unidimensional
                 knapsack problem. All of the usual algorithms for this
                 problem are investigated in terms of both asymptotic
                 computing times and storage requirements, as well as
                 average computing times. A technique is developed which
                 improves all of the dynamic programming methods by a
                 square root factor. Empirical studies indicate this new
                 algorithm to be generally superior to all previously
                 known algorithms. It is then shown how this improvement
                 can be incorporated into the more general $0$--$1$
                 knapsack problem obtaining a square root improvement in
                 the asymptotic behavior. A new branch and search
                 algorithm that is significantly faster than the
                 Greenberg and Hegerich algorithm is also presented. The
                 results of extensive empirical studies comparing these
                 knapsack algorithms are given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming, dynamic",
}

@Article{Gordon:1974:BBM,
  author =       "William J. Gordon and Richard F. Riesenfeld",
  title =        "{Bernstein-B\'ezier} Methods for the Computer-Aided
                 Design of Free Form Curves and Surfaces",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "293--310",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The present paper provides a development in which the
                 Bezier methods emerge as an application of the
                 Bernstein polynomial approximation operator to
                 vector-valued functions. In this context, higher order
                 methods of the Bezier type are studied which have the
                 practical advantage of providing the designer a greater
                 degree of flexibility in controlling the shape of the
                 curve, but which maintain the basic simplicity of the
                 original Bezier technique. In a later paper, the
                 extension of the Bezier technique to splines will be
                 examined.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Also Research Publication GMR-1176, General Motors
                 Research Laboratories, March 1972.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "approximation theory; computer graphics; curves and
                 surfaces; design and modeling; patch; splines",
}

@Article{Dunham:1974:ECA,
  author =       "Charles B. Dunham",
  title =        "Efficiency of {Chebyshev} Approximation on Finite
                 Subsets",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "311--313",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Chebyshev approximation on an interval and closed
                 subsets by a Haar subspace are considered. The
                 closeness of best approximations on subsets to the best
                 approximation on the interval is examined. It is shown
                 that under favorable conditions the difference is $0$
                 ((density of the subset)$^2$), making it unnecessary to
                 use very large finite subsets to get good
                 approximations on the interval.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Balkovich:1974:CPG,
  author =       "E. Balkovich and W. Chiu and L. Presser and R. Wood",
  title =        "Comments on a Paper by {Gaver}",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "314--315",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 19:06:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kobayashi:1974:ADAa,
  author =       "Hisashi Kobayashi",
  title =        "Application of the Diffusion Approximation to Queueing
                 Networks {I}: {Equilibrium} Queue Distributions",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "316--328",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The paper introduces a vector-valued normal process
                 and its diffusion equation in order to obtain an
                 approximate solution to the joint distribution of queue
                 lengths in a general network of queues. In this model,
                 queueing processes of various service stations which
                 interact with each other are approximated by a
                 vector-valued Wiener process with some appropriate
                 boundary conditions. Some numerical examples are
                 presented and compared with Monte Carlo simulation
                 results. A companion paper, Part II, discusses
                 transient solutions via the diffusion approximation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  descriptors =  "Queueing network; analysis",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Michel:1974:SFQ,
  author =       "J. A. Michel and E. G. {Coffman, Jr.}",
  title =        "Synthesis of a Feedback Queueing Discipline for
                 Computer Operation",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "329--339",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Considerable effort has been invested in devising and
                 analyzing sequencing rules for multiprogrammed or
                 time-shared systems. A much studied discipline of this
                 kind is the so-called system with feedback to lower
                 priority queues. This discipline contains many
                 parameters, in general, which must be fixed in order to
                 achieve the desired waiting-time performance of the
                 discipline. In this paper the problem of synthesizing a
                 system of the above type is solved, by setting
                 parameter values so that the prespecified waiting time
                 criteria are satisfied, assuming Poisson arrival and
                 general service time parameters are known.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computers --- Data Communication Systems;
                 probability",
}

@Article{Katz:1974:PDL,
  author =       "Steven Katz and Alan G. Konheim",
  title =        "Priority Disciplines in a Loop System",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "340--349",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A loop system with $N$ buffered terminals sharing a
                 common time-multiplexed channel is studied. The service
                 discipline is prescribed by a permutation pi equals
                 (pi(1), \ldots{}, pi(N)) which gives the relative
                 ranking of the terminals. Data from the ith terminal
                 may be buffered at an intermediate terminal --- its
                 transmission to the CPU interrupted --- if there is a
                 conflict with data from a terminal with higher ranking.
                 It is shown how such systems may be analyzed and how
                 the system performance, as measured by average response
                 time, may be improved by imposing a suitable priority
                 discipline.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computers --- Data Communication Systems;
                 probability",
}

@Article{Hueckel:1974:ELV,
  author =       "Manfred H. Hueckel",
  title =        "Erratum: ``{A} Local Visual Operator Which Recognizes
                 Edges and Lines''",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "2",
  pages =        "350--350",
  month =        apr,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:20:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Hueckel:1973:LVO}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Batni:1974:EAF,
  author =       "Ramachendra P. Batni and Jeffrey D. Russell and
                 Charles R. Kime",
  title =        "An Efficient Algorithm for Finding an Irredundant Set
                 Cover",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "351--355",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:22:29 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The set covering problem is considered and an
                 efficient procedure for finding an irredundant cover is
                 presented. For an $m \times n$ cover table, the
                 execution time of the procedure is, in the worst case,
                 proportional to $m n$. Methods are suggested for
                 obtaining alternate irredundant covers based on an
                 initially obtained irredundant cover. The basic
                 cost-independent algorithm is heuristically extended to
                 consider costs so that a reduced-cost irredundant cover
                 can be obtained. A summary of some computational
                 experience is presented, which indicates that the
                 procedure is fast and applicable to large problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Haralick:1974:DRD,
  author =       "Robert M. Haralick",
  title =        "The {Diclique} Representation and Decomposition of
                 Binary Relations",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "356--366",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The binary relation is often a useful mathematical
                 structure for representing simple relationships whose
                 essence is a directed connection. To better aid in
                 interpreting or storing a binary relation the authors
                 suggest a diclique decomposition. An algorithm is
                 described for determining the dicliques of a binary
                 reaction; it is proved that the set of such dicliques
                 has a nice algebraic structure. The algebraic structure
                 is used to show how dicliques can be coalesced, the
                 relationship between cliques and dicliques is
                 discussed, and an algorithm for determining cliques
                 from dicliques is described.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Hecht:1974:CRF,
  author =       "M. S. Hecht and J. D. Ullman",
  title =        "Characterizations of Reducible Flow Graphs",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "367--375",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is established that if $G$ is a reducible flow
                 graph, then edge $(n, m)$ is backward (a back latch) if
                 and only if either $n$ equals $m$ or $m$ dominates $n$
                 in $G$. Thus, the backward edges of a reducible flow
                 graph are unique. Further characterizations of
                 reducibility are presented. In particular, the
                 following are equivalent: (a) $G = (N, E, n_o)$ is
                 reducible. (b) The ``dag'' of $G$ is unique. (A dag of
                 a flow graph $G$ is a maximal acyclic flow graph which
                 is a subgraph of $G$.) (c) $E$ can be partitioned into
                 two sets $E_1$ and $E_2$ such that $E_1$ forms a dag
                 $D$ of $G$ and each $(n, m)$ in $E_2$ has $n$ equals
                 $m$ dominates $n$ in $G$. (d) Same as (c), except each
                 $(n, m)$ in $E_2$ has $n$ equals $m$ or $m$ dominates
                 $n$ in $D$. (e) Same as (c), except $E_2$ is the back
                 edge set of a depth-first spanning tree of $G$. (f)
                 Every cycle of $G$ has a node which dominates the other
                 nodes of the cycle. Finally, it is shown that there is
                 a ``natural'' single-entry loop associated with each
                 backward edge of a reducible flow graph.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Palmer:1974:EBC,
  author =       "E. M. Palmer and M. A. Rahimi and R. W. Robinson",
  title =        "Efficiency of a Binary Comparison Storage Technique",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "376--384",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The efficiency of an information storage technique
                 based on binary comparisons is analyzed. Generating
                 functions are applied to finding the mean and variance
                 of the number of comparisons needed to retrieve one
                 item from a store of $n$ items. Surprisingly, the
                 variance approaches $7^{-2/3}=pi^2$ for large $n$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems",
}

@Article{Wang:1974:ACN,
  author =       "Chung C. Wang",
  title =        "An Algorithm for the Chromatic Number of a Graph",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "385--391",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "N. Christofides' algorithm for finding the chromatic
                 number of a graph is improved both in speed and memory
                 space by using a depth-first search rule to search for
                 a shortest path in a reduced subgraph tree.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "graph color; mathematical techniques",
}

@Article{Wong:1974:CPR,
  author =       "C. K. Wong and Don Coppersmith",
  title =        "A Combinatorial Problem Related to Multimodule Memory
                 Organizations",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "392--402",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Neural/neural.5.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper deals with a combinatorial minimization
                 problem arising from studies on multimodule memory
                 organizations. Instead of searching for an optimum
                 solution, a particular solution is proposed and it is
                 demonstrated that it is close to optimum. Lower bounds
                 for the objective functions are obtained and compared
                 with the corresponding values of the particular
                 solution. The maximum percentage deviation of this
                 solution from optimum is also established.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; mathematical techniques",
}

@Article{Chaitin:1974:ITL,
  author =       "Gregory J. Chaitin",
  title =        "Information-Theoretic Limitations of Formal Systems",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "403--424",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Math/hilbert10.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An attempt is made to apply information-theoretic
                 computational complexity to meta-mathematics. The paper
                 studies the number of bits of instructions that must be
                 given to a computer for it to perform finite and
                 infinite tasks, and also the time it takes the computer
                 to perform these tasks. This is applied to measuring
                 the difficulty of proving a given set of theorems, in
                 terms of the number of bits of axioms that are assumed,
                 and the size of the proofs needed to deduce the
                 theorems from the axioms.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; mathematical programming",
}

@Article{Gill:1974:AEC,
  author =       "John Gill and Manuel Blum",
  title =        "On Almost Everywhere Complex Recursive Functions",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "425--435",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $h$ be a recursive function. A partial recursive
                 function $\psi$ is i.o. (infinitely often) $h$-complex
                 if every program for $\psi$ requires more than $h(x)$
                 steps to compute $\psi(x)$ for infinitely many input
                 $x$. A more stringent notion is that of $\psi$ being
                 a.e. (almost everywhere) $h$-complex: $\psi$ is a.e.
                 $h$-complex if every program for $\psi$ requires more
                 than $h(x)$ steps to compute $\psi(x)$ for all but
                 finitely many inputs $x$. The construction of almost
                 everywhere complex recursive functions appears much
                 more difficult than the construction of infinitely
                 often complex recursive functions. There have been
                 found no ``natural'' examples of recursive functions
                 requiring more than polynomial time for all but
                 finitely many inputs. It is shown that from a single
                 example of a moderately a.e. complex recursive
                 function, one can obtain a.e. very complex recursive
                 functions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Schubert:1974:ILR,
  author =       "L. K. Schubert",
  title =        "Iterated Limiting Recursion and the Program
                 Minimization Problem",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "436--445",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The general problem of finding minimal programs
                 realizing given ``program descriptions'' is considered,
                 where program descriptions may be of finite length and
                 may specify arbitrary program properties. The problem
                 of finding minimal programs consistent with finite or
                 infinite input-output lists is a special case (for
                 infinite input-output lists, this is a variant of E. M.
                 Gold's function identification problem). Although most
                 program minimization problems are not recursively
                 solvable, they are found to be no more difficult than
                 the problem of deciding whether any given program
                 realizes any given description, or the problem of
                 enumerating programs in order of nondecreasing length
                 (whichever is harder). This result is formulated in
                 terms of $k$-limiting recursive predicates and
                 functionals, defined by repeated application of Gold's
                 limit operator. A simple consequence is that the
                 program minimization problem is limiting recursively
                 solvable for finite input-output lists and 2-limiting
                 recursively solvable for infinite input-output lists,
                 with weak assumptions about the measure of program
                 size.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Hibbard:1974:CLG,
  author =       "Thomas N. Hibbard",
  title =        "Context-Limited Grammars",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "446--453",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A phrase structure grammar is called context-limited
                 if there exists a partial ordering on its alphabet such
                 that any letter on the left of any production is less
                 than some letter on the right of the same production.
                 It is proved that context-limited grammars are
                 equivalent to context-free grammars, the equivalence
                 including ambiguity. The notion of ambiguity in phrase
                 structure grammars is discussed, and a new formal model
                 for ambiguity, based on directed plane graphs was
                 labeled edges, is outlined and compared with other
                 models.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Richman:1974:CSI,
  author =       "Paul L. Richman",
  title =        "Computing a Subinterval of the Image",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "454--458",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of computing a desired function value to
                 within a prescribed tolerance can be formulated in the
                 following two distinct ways: Formulation I: Given $x$
                 and $\epsilon > 0$, compute $f(x)$ to within
                 $\epsilon$. Formulation II: Given only that $x$ is in a
                 closed interval $X$, compute a subinterval of the
                 image, $f(x)$ equals $\{ f(x):x \subset X\}$. The first
                 formulation is applicable when $x$ is known to
                 arbitrary accuracy. The second formulation is
                 applicable when $x$ is known only to a limited
                 accuracy, in which case the tolerance is prescribed
                 albeit indirectly by the interval $X$, and one must be
                 satisfied with all or part of the set $X$ of possible
                 function values. Elsewhere the author has presented an
                 efficient solution to Formulation I for any rational
                 $f$ and many nonrational $f$. B. A. Chartres has
                 presented an efficient solution to Formulation II for a
                 very restricted class of rational $f$ and for a few
                 nonrational $f$. In this paper a solution to
                 Formulation II for the arbitrary nonconstant rational
                 $f$ is presented. By bounding $df/dx$ away from zero
                 over some subset of $X$, it is shown how to reduce
                 Formulation II to Formulation I, yielding the solution
                 given here.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Kobayashi:1974:ADAb,
  author =       "Hisashi Kobayashi",
  title =        "Application of the Diffusion Approximation to Queueing
                 Networks {II}: {Nonequilibrium} Distributions and
                 Applications to Computer Modeling",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "459--469",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Quite often explicit information about the behavior of
                 a queue over a fairly short period is wanted. This
                 requires solving the nonequilibrium solution of the
                 queue-length distribution, which is usually quite
                 difficult mathematically. The first half of Part II
                 shows how the diffusion process approximation can be
                 used to answer this question. A transient solution is
                 obtained for a cyclic queueing model using the
                 technique of eigenfunction expansion. The second half
                 of Part II applies the earlier results of Part I to
                 modeling and performance problems of a typical
                 multiprogrammed computer system. Such performance
                 measures as utilization, throughput, response time and
                 its distribution, etc., are discussed in some detail.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  descriptors =  "Queueing network; analysis",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; probability",
}

@Article{Konheim:1974:WLT,
  author =       "Alan G. Konheim and Bernd Meister",
  title =        "Waiting Lines and Times in a System with Polling",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "470--490",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A communication system consisting of a number of
                 buffered input terminals connected to a computer by a
                 single channel is analyzed. The terminals are polled in
                 sequence and the data is removed from the terminal's
                 buffer. When the buffer has been emptied, the channel,
                 for an interval of randomly determined length, is used
                 for system overhead and\slash or to transmit data to
                 the terminals. The system then continues with a poll of
                 the next terminal. The stationary distributions of the
                 length of the waiting line and the queueing delay are
                 calculated for the case of identically distributed
                 input processes.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A communication system consisting of a number of
                 buffers input terminals connected to a computer by a
                 single channel is analyzed. The terminals are polled in
                 sequence and the data is removed from the terminal's
                 buffer. When the buffer has been emptied, the channel,
                 for an interval of randomly determined length, is used
                 for system overhead and/or to transmit data to the
                 terminals. The system then continues with a poll of the
                 next terminal. \ldots{}",
  classification = "922",
  descriptors =  "Queueing system; overhead time; polling; multidrop",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Robson:1974:BSF,
  author =       "J. M. Robson",
  title =        "Bounds for Some Functions Concerning Dynamic Storage
                 Allocation",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "491--499",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The amount of store necessary to operate a dynamic
                 storage allocation system, subject to certain
                 constraints, with no risk of breakdown due to storage
                 fragmentation, is considered. Upper and lower bounds
                 are given for this amount of store, both of them
                 stronger than those established earlier. The lower
                 bound is the exact solution of a related problem
                 concerning allocation of blocks whose size is always a
                 power of 2.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Bellmore:1974:TMP,
  author =       "Mandell Bellmore and Saman Hong",
  title =        "Transformation of Multisalesmen Problem to the
                 Standard Traveling Salesman Problem",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "500--504",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that the multisalesmen problem can be
                 solved by solving the standard traveling salesman
                 problem on an expanded graph. The expanded graph has $m
                 1$ more nodes than the original graph where $m$ is the
                 number of salesmen available at the base.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming; mathematical techniques",
}

@Article{Trotter:1974:ABV,
  author =       "L. E. {Trotter, Jr.} and C. M. Shetty",
  title =        "An Algorithm for the Bounded Variable Integer
                 Programming Problem",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "505--513",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is proposed for the bounded variable pure
                 integer programming problem which treats general
                 integer variables directly in an implicit enumeration
                 procedure closely related to that advanced by E. Balas
                 and A. M. Geoffrion for binary programming problems.
                 Means of obtaining near optimum solutions through a
                 slight modification of the algorithm are discussed.
                 Techniques which use bounds on variables to improve
                 algorithmic efficiency are developed and examined
                 computationally. Further computational results indicate
                 that direct treatment of general integer variables is
                 significantly more effective than binary expansion.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "integer programming; mathematical programming",
}

@Article{Fenner:1974:SNB,
  author =       "T. I. Fenner and G. Loizou",
  title =        "Some New Bounds on the Condition Numbers of Optimally
                 Scaled Matrices",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "514--524",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "New lower bounds on the minimal condition numbers of a
                 matrix with respect to both one-sided and two-sided
                 scaling by diagonal matrices are obtained. These bounds
                 improve certain results obtained by F. L. Bauer.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "condition; la; mathematical techniques; scaling",
}

@Article{Anonymous:1974:CJA,
  author =       "Anonymous",
  title =        "Contributions to the {Journal of the Association of
                 Computing Machinery}",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "3",
  pages =        "525--526",
  month =        jul,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 08 22:02:36 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Pages unnumbered, but follow 524. Next issue starts
                 with 525.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harrison:1974:PDL,
  author =       "Michael A. Harrison and Ivan M. Havel",
  title =        "On the Parsing of Deterministic Languages",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "525--548",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:22:42 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A parsing method for strict deterministic grammars is
                 presented and a technique for using it to parse any
                 deterministic language is indicated. An important
                 characterization of the trees of strict deterministic
                 grammars is established. This is used to prove
                 iteration theorems for (strict) deterministic
                 languages, and hence proving that certain sets are not
                 in these families becomes comparatively
                 straightforward. It is shown that every strict
                 deterministic grammar is LR(0) and that any strict
                 deterministic grammar is equivalent to a bounded right
                 context (1,0) grammar. Thus rigorous proofs that the
                 families of deterministic, LR(k), and bounded right
                 context languages are coextensive are presented for the
                 first time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory; parsing",
}

@Article{Hopcroft:1974:EPT,
  author =       "John Hopcroft and Robert Tarjan",
  title =        "Efficient Planarity Testing",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "549--568",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See comments and errata in \cite{Deo:1976:NHT}.",
  abstract =     "This paper describes an efficient algorithm to
                 determine whether an arbitrary graph $G$ can be
                 embedded in the plane. The algorithm may be viewed as
                 an iterative version of a method originally proposed by
                 L. Auslander and S. V. Parter and correctly formulated
                 by A. J. Goldstein. The algorithm uses depth-first
                 search and has $O(V)$ time and space bounds, where $V$
                 is the number of vertices in $G$. An ALGOL
                 implementation of the algorithm successfully tested
                 graphs with as many as 900 vertices in less than 12
                 seconds.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques",
}

@Article{Lehot:1974:OAD,
  author =       "Philippe G. H. Lehot",
  title =        "An Optimal Algorithm to Detect a Line Graph and Output
                 Its Root Graph",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "569--575",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Given a graph $H$ with $E$ edges and $N$ nodes, a
                 graph $G$ is sought such that $H$ is the line graph of
                 $G$, if $G$ exists. The algorithm does this within the
                 order of $E$ steps, in fact in $E$ plus $O(N)$ steps.
                 This algorithm is optimal in its complexity.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques",
}

@Article{Rubin:1974:SPH,
  author =       "Frank Rubin",
  title =        "A Search Procedure for {Hamilton} Paths and Circuits",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "576--580",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A search procedure is given which will determine
                 whether Hamilton paths or circuits exist in a given
                 graph, and will find one or all of them. A combined
                 procedure is given for both directed and undirected
                 graphs. The search consists of creating partial paths
                 and making deductions which determine whether each
                 partial path is a section of any Hamilton path
                 whatever, and which direct the extension of the partial
                 paths.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques",
}

@Article{Plemmons:1974:LLS,
  author =       "Robert J. Plemmons",
  title =        "Linear Least Squares by Elimination and {MGS}",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "581--585",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm combining Gaussian elimination with the
                 modified Gram--Schmidt (MGS) procedure is given for
                 solving the linear least squares problem. The method is
                 based on the operational efficiency of Gaussian
                 elimination for LU decompositions and the numerical
                 stability of MGS for unitary decompositions and is
                 designed for slightly overdetermined linear systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Cited in {\AA ke Bj\"orck's} bibliography on least
                 squares, which is available by anonymous ftp from {\tt
                 math.liu.se} in {\tt pub/references}.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Gram--Schmidt algorithm; lsq; lud; mathematical
                 techniques; nla",
}

@Article{Wang:1974:UEZ,
  author =       "Paul S. Wang",
  title =        "The Undecidability of the Existence of Zeros of Real
                 Elementary Functions",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "586--589",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Math/hilbert10.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "From Richardson's undecidability results, it is shown
                 that the predicate ``there exists a real number such
                 that $G(r)$ equals 0'' is recursively undecidable for
                 $G(x)$ in a class of functions which involves
                 polynomials and the sine function. The deduction
                 follows that the convergence of a class of improper
                 integrals is recursively undecidable.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Henschen:1974:URH,
  author =       "L. Henschen and L. Wos",
  title =        "Unit Refutations and {Horn} Sets",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "590--605",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The key concepts for this automated theorem-proving
                 paper are those of Horn set and strictly-unit
                 refutation. A Horn set is a set of clauses such that
                 none of its members contains more than one positive
                 literal. A strictly-unit refutation is a proof by
                 contradiction in which no step is justified by applying
                 a rule of inference to a set of clauses all of which
                 contain more than one literal. Horn sets occur in many
                 fields of mathematics such as the theory of groups,
                 rings, Moufang loops, and Henkin models. The usual
                 translation into first-order predicate calculus of the
                 axioms of these and many other fields yields a set of
                 Horn clauses. The striking feature of the Horn property
                 for finite sets of clauses is that its presence or
                 absence can be determined by inspection. Thus, the
                 determination of the applicability of the theorems and
                 procedures of this paper is immediate.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Nevins:1974:HOL,
  author =       "Arthur J. Nevins",
  title =        "A Human Oriented Logic for Automatic Theorem-Proving",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "606--621",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A deductive system is described which combines aspects
                 of resolution (e.g. unification and the use of Skolem
                 functions) with that of natural deduction and whose
                 performance compares favorably with the best predicate
                 calculus theorem provers.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Slagle:1974:ATP,
  author =       "James R. Slagle",
  title =        "Automated Theorem-Proving for Theories with
                 Simplifiers, Commutativity, and Associativity",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "622--642",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "To prove really difficult theorems, resolution
                 principle programs need to make better inferences and
                 to make them faster. An approach is presented for
                 taking advantage of the structure of some special
                 theories. These are theories with simplifiers,
                 commutativity, and associativity, which are valuable
                 concepts to build in, since they so frequently occur in
                 important theories, for example, number theory (plus
                 and times) and set theory (union and intersection). The
                 object of the approach is to build in such concepts in
                 a (refutation) complete, valid, efficient (in time)
                 manner by means of a ``natural'' notation and\slash or
                 new inference rules. Some of the many simplifiers that
                 can be built in are axioms for (left and right)
                 identities, inverses, and multiplication by zero.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Kung:1974:OOO,
  author =       "H. T. Kung and J. F. Traub",
  title =        "Optimal Order of One-Point and Multipoint Iteration",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "643--651",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem is presented of calculating a simple zero
                 of a nonlinear function $f$ by iteration. There is
                 exhibited a family of iterations of order $2^{n - 1}$
                 which use $n$ evaluations of $f$ and no derivative
                 evaluations, as well as a second family of iterations
                 of order $2^{n - 1}$ based on $n - 1$ evaluations of
                 $f$ and one of $f'$. In particular, with four
                 evaluations an iteration of eighth order is
                 constructed. The best previous result for four
                 evaluations was fifth order. It is proved that the
                 optimal order of one general class of multipoint
                 iterations is $2^{n - 1}$ and that an upper bound on
                 the order of a multipoint iteration based on $n$
                 evaluations of $f$ (no derivatives) is $2^n$. It is
                 conjectured that a multipoint iteration without memory
                 based on $n$ evaluations has optimal order $2^{n -
                 1}$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Rosenberg:1974:ASE,
  author =       "Arnold L. Rosenberg",
  title =        "Allocating Storage for Extendible Arrays",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "652--670",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Rosenberg:1975:CAS}.",
  abstract =     "The problem of allocating storage for extendible
                 arrays is examined in the light of the author's earlier
                 work on data graphs and addressing schemes. A formal
                 analog of the assertion that simplicity of array
                 extension precludes simplicity of traversal (marching
                 along rows\slash columns) is proved. Two strategies for
                 constructing extendible realizations of arrays are
                 formulated, and certain inherent limitations of such
                 realizations are established.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; computer operating systems ---
                 Storage Allocation",
}

@Article{Sethi:1974:TCR,
  author =       "Ravi Sethi",
  title =        "Testing for the {Church--Rosser} Property",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "671--679",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Sethi:1975:ETC}.",
  abstract =     "The central notion in a replacement system is one of a
                 transformation on a set of objects. Starting with a
                 given object, in one ``move'' it is possible to reach
                 one of a set of objects. An object from which no move
                 is possible is called irreducible. A replacement system
                 is Church--Rosser if starting with any object a unique
                 irreducible object is reached. A generalization of the
                 above notion is a replacement system consisting of a
                 set of objects ($S$), a transformation, and an
                 equivalence relation on $S$. A replacement system is
                 Church--Rosser if starting with objects equivalent
                 under an equivalence relation on S, equivalent
                 irreducible objects are reached. Necessary and
                 sufficient conditions are determined that simplify the
                 task of testing if a replacement system is
                 Church--Rosser. Attention will be paid to showing that
                 a replacement system is Church--Rosser using
                 information about parts of the system.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Wojcik:1974:ASR,
  author =       "Anthony S. Wojcik and Gernot Metze",
  title =        "An Analysis of Some Relationships Between Post and
                 {Boolean} Algebras",
  journal =      j-J-ACM,
  volume =       "21",
  number =       "4",
  pages =        "680--696",
  month =        oct,
  year =         "1974",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The fundamentals of Post algebras are presented and
                 Post and Boolean functions are examined. A functional
                 representation is developed that facilitates the
                 comparison of Post and Boolean algebras. Based on this
                 representation, relationships between finite,
                 higher-order (that is, more than 2-valued) Boolean
                 algebras and functions in these algebras and finite,
                 higher-order Post algebras and their corresponding
                 functions are developed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Valiant:1975:RRP,
  author =       "Leslie G. Valiant",
  title =        "Regularity and Related Problems for Deterministic
                 Pushdown Automata",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "1--10",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that to decide whether the language
                 accepted by an arbitrary deterministic pushdown
                 automaton is LL(k), or whether it is accepted by some
                 one-counter or finite-turn pushdown machine, must be at
                 least as difficult as to decide whether it is regular.
                 The regularity problem itself is analyzed in detail,
                 and R. E. Stearns' decision procedure for this (see
                 Engineering Index 1968 p 184) is improved by one level
                 of exponentiation. Upper bounds, close to known lower
                 bounds, are obtained for the succinctness with which a
                 pushdown automaton, and various restrictions of it, can
                 express equivalent finite-state machines.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Hsu:1975:AFM,
  author =       "Harry T. Hsu",
  title =        "An Algorithm for Finding a Minimal Equivalent Graph of
                 a Digraph",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "11--16",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An efficient algorithm for finding a minimal
                 equivalent graph (MEG) is presented. First, all the
                 strongly connected (s.c.) components are found. Then
                 the set of vertices is reordered such that the set of
                 vertices in an s.c. component is ordered by consecutive
                 integers. The rows and columns of the adjacency matrix
                 are permuted accordingly. Then an MEG for each s.c.
                 component is found. Finally, the parallel and the
                 superfluous edges are removed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Yu:1975:FCT,
  author =       "Clement T. Yu",
  title =        "A Formal Construction of Term Classes",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "17--37",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The computational complexity of a formal process for
                 the construction of term classes is examined. While the
                 process is proved to be difficult computationally,
                 heuristic methods are applied. Experimental results are
                 obtained to illustrate the maximum possible improvement
                 in system performance of retrieval using the formal
                 construction over simple term retrieval.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems --- Evaluation;
                 information science",
}

@Article{Horowitz:1975:CED,
  author =       "E. Horowitz and S. Sahni",
  title =        "On Computing the Exact Determinant of Matrices with
                 Polynomial Entries",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "38--50",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of computing the determinant of a matrix
                 of polynomials is considered. Four algorithms are
                 compared: expansion by minors, Gaussian elimination
                 over the integers, a method based on evaluation and
                 interpolation, and a procedure which computes the
                 characteristic polynomial of the matrix. Each method is
                 analyzed with respect to its computing time and storage
                 requirements using several models for polynomial
                 growth. First, the asymptotic time and storage is
                 developed for each method within each model. In
                 addition to these asymptotic results, the analysis is
                 done exactly for certain especially small, yet
                 practical and important cases. Then the results of
                 empirical studies are given which support conclusions
                 about which of the methods will work best within an
                 actual computing environment.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques",
}

@Article{Micchelli:1975:HOS,
  author =       "C. A. Micchelli and W. L. Miranker",
  title =        "High Order Search Methods for Finding Roots",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "51--60",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A class of search algorithms for locating the root of
                 a function is devised and studied. Each member of the
                 class of algorithms is globally convergent as is the
                 classical method of binary search. However, the class
                 contains members of higher order of convergence as
                 well. These higher order methods require the existence
                 of bounds on derivatives of the function whose root is
                 sought, and they proceed by exploiting these bounds.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques; root finding",
}

@Article{Rice:1975:MAQ,
  author =       "John R. Rice",
  title =        "A Metalgorithm for Adaptive Quadrature",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "61--82",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The few adaptive quadrature algorithms that have
                 appeared are significantly superior to traditional
                 numerical integration algorithms. The concept of
                 metalgorithm is introduced to provide a framework for
                 the systematic study of the range of interesting
                 adaptive quadrature algorithms. A principal result is
                 that there are from 1 to 10 million potentially
                 interesting and distinct algorithms. This is followed
                 by a considerable development of metalgorithm analysis.
                 In particular, theorems about the convergence
                 properties of various classes of algorithms are
                 established which theoretically show the experimentally
                 observed superiority of these algorithms. The final
                 part of the paper introduces the concept of a
                 characteristic length and its role is illustrated in an
                 analysis of three concrete realizations of the
                 metalgorithm.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques; numerical integration",
}

@Article{Fuller:1975:ADS,
  author =       "Samuel H. Fuller and Forest Baskett",
  title =        "An Analysis of Drum Storage Units",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "83--105",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Also published in/as: Stanford, DSL, SEL TR.26,.",
  abstract =     "The modeling and analysis of drum-like storage units
                 are discussed. Two common forms of drum organizations
                 and two common scheduling disciplines are considered:
                 the file drum and the paging drum; first-in-first-out
                 (FIFO) scheduling and shortest latency-time-first
                 (SLTF) scheduling. The modeling of the I/O requests to
                 the drum is an important aspect of this analysis. An
                 exact analysis of all the models except the SLTF file
                 drum is presented; in this case the complexity of the
                 drum organization has forced the acceptance of an
                 approximate analysis. In order to examine the error
                 introduced into the analysis of the SLTF file drum by
                 the approximations presented, the results of the
                 analytic models are compared to a simulation model of
                 the SLTF file drum. Comparisons of the models indicate
                 that the scheduling discipline is more important to
                 performance than drum organization.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A complete review of drum performance and queuing.",
  classification = "722; 723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; computer systems
                 programming --- Input Output Programs; data storage
                 units; probability --- Queueing Theory",
}

@Article{Kohler:1975:EAG,
  author =       "Walter H. Kohler and Kenneth Steiglitz",
  title =        "Exact, Approximate, and Guaranteed Accuracy Algorithms
                 for the Flow-Shop Problem $n/2/{F}/{\overline F}$",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "106--114",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Improved exact and approximate algorithms for the
                 $n$-job two-machine mean finishing time flow-shop
                 problem, n/2/F/mean value of F, are presented. While
                 other researchers have used a variety of approximate
                 methods to generate suboptimal solutions and
                 branch-and-bound algorithms to generate exact solutions
                 to sequencing problems, this work demonstrates the
                 computational effectiveness of coupling the two methods
                 to generate solutions with a guaranteed accuracy. The
                 computational requirements of exact, approximate, and
                 guaranteed accuracy algorithms are compared
                 experimentally on a set of test problems ranging in
                 size from 10 to 50 jobs. The approach is readily
                 applicable to other sequencing problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 912; 913",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; operations
                 research; production control",
}

@Article{Sahni:1975:AAK,
  author =       "Sartaj Sahni",
  title =        "Approximate Algorithms for the 0/1 Knapsack Problem",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "115--124",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A series of increasingly accurate algorithms to obtain
                 approximate solutions to the 0/1 one-dimensional
                 knapsack problem is presented. Each algorithm
                 guarantees a certain minimal closeness to the optimal
                 solution value. The approximate algorithms are of
                 polynomial time complexity and require only linear
                 storage. Computational experience with these algorithms
                 is also presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 912; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; knapsack
                 problem; mathematical programming; operations
                 research",
}

@Article{Wright:1975:CMP,
  author =       "J. W. Wright",
  title =        "The Change-Making Problem",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "125--128",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A cashier has a number of coins of different
                 denominations at his disposal and wishes to make a
                 selection, using the least number of coins, to meet a
                 given total. The solution given here employs dynamic
                 programming. Suggestions are made which reduce the
                 volume of computation required in handling the
                 recursive equations. The method can be applied to the
                 one-dimensional cargo-loading and stock-cutting
                 problem, and it can be extended to the two-dimensional
                 problem.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 913; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "knapsack problem; mathematical programming, dynamic;
                 operations research",
}

@Article{Boyer:1975:PTA,
  author =       "Robert S. Boyer and J. Strother Moore",
  title =        "Proving Theorems About {LISP} Functions",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "129--144",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/lisp.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Program verification is the idea that properties of
                 programs can be precisely stated and proved in the
                 mathematical sense. Some simple heuristics combining
                 evaluation and mathematical induction are described,
                 which have been implemented in a program that
                 automatically proves a wide variety of theorems about
                 recursive LISP functions. The method the program uses
                 to generate induction formulas is described at length.
                 The theorems proved by the program include that REVERSE
                 is its own inverse and that a particular SORT program
                 is correct. A list of theorems proved by the program is
                 given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory --- Theorem Proving; computer
                 programming languages; LISP",
}

@Article{Yelowitz:1975:DPC,
  author =       "Lawrence Yelowitz",
  title =        "Derivation of a Path-Connectivity Matrix for Tagged
                 Flowcharts",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "145--154",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A procedure is given to derive a Boolean matrix M
                 corresponding to a flowchart in which certain edges are
                 distinguished as ``tagged.'' For any pair of tagged
                 edges $i$ and $j$, $M(i, j) = 1$ if and only if there
                 is at least one flowchart path from $i$ to $j$ in which
                 all of the intermediate edges are untagged. Such a
                 flowchart path is known as a ``tagged path''.
                 Modifications to the procedure are then given that
                 answer the related questions of determining the exact
                 number of tagged paths as well as an explicit listing
                 of these paths between two given edges. A computer
                 representation is described which leads to efficient
                 implementation of the procedure.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages; mathematical
                 techniques --- Graph Theory",
}

@Article{Ladner:1975:SPT,
  author =       "Richard E. Ladner",
  title =        "On the Structure of Polynomial Time Reducibility",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "1",
  pages =        "155--171",
  month =        jan,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Two notions of polynomial time reducibility, denoted
                 by $\leq T^P$ and $\leq m_P$, were defined by S. A.
                 Cook and R. M. Karp, respectively. The abstract
                 properties of these two relations on the domain of
                 computable sets are investigated. Both relations prove
                 to be dense and to have minimal pairs. Further, there
                 is a strictly ascending sequence with a minimal pair of
                 upper bounds to the sequence. The author's method of
                 showing density yields and the result that if P does
                 not equal NP then there are members of NP--P that are
                 not polynomial complete.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Gotlieb:1975:EPM,
  author =       "C. C. Gotlieb and G. H. MacEwen",
  title =        "Errata: ``{Performance} of Movable-Head Disk Storage
                 Devices''",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "172--172",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat May 11 07:19:31 1996",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Gotlieb:1973:PMH}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lowrance:1975:ESS,
  author =       "Roy Lowrance and Robert A. Wagner",
  title =        "An Extension of the String-to-String Correction
                 Problem",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "177--183",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:27:10 1998",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The string-to-string correction problem asks for a
                 sequence $S$ of ``edit operations'' of minimal cost
                 such that S(A) equals B, for given strings A and B. The
                 edit operations previously investigated allow changing
                 one symbol of a string into another single symbol,
                 deleting one symbol from a string, or inserting a
                 single symbol into a string. This paper extends the set
                 of allowable edit operations to include the operation
                 of interchanging the positions of two adjacent
                 characters. Under certain restrictions on
                 edit-operation costs, it is shown that the extended
                 problem can still be solved in time proportional to the
                 product of the lengths of the given strings.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  comment =      "``The string to string correction problem asks for a
                 sequence $S$ of `edit operations' of minimal cost such
                 that $S(A) = B$, for given strings $A$ and $B$. The
                 edit operations previously investigated allow changing
                 one symbol of a string into another single symbol,
                 deleting one symbol from a string, or inserting a
                 single symbol into a string. This paper extends the set
                 of allowable edit operations to include the operation
                 of interchanging the positions of two adjacent
                 characters. Under certain restrictions on
                 edit-operation costs, it is shown that the extended
                 problem can still be solved in time proportional to the
                 product of the lengths of the given strings.''",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; edit operations;
                 string-to-string correction",
}

@Article{Morgenstern:1975:LCC,
  author =       "Jacques Morgenstern",
  title =        "The Linear Complexity of Computation",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "184--194",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The notion of the linear algorithm to compute a family
                 F of linear forms in r variables over a field is
                 defined. Ways to save additions are investigated by
                 analyzing the combinatorial aspects of linear
                 dependences between subrows of a given matrix F.
                 Further, an additive degree of freedom is defined,
                 which turns out to be an exact measure of the
                 complexity of computation of F.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computational complexity; mathematical techniques",
}

@Article{Muller:1975:BCN,
  author =       "David E. Muller and Franco P. Preparata",
  title =        "Bounds to Complexities of Networks for Sorting and for
                 Switching",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "195--201",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321879.321882",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A network which sorts $n$ numbers, when used to sort
                 numbers of only two sizes, $0$ and $1$, can be regarded
                 as forming the $n$ frontal (unate) symmetric Boolean
                 functions of $n$ arguments. When sorting networks are
                 constructed from comparator modules they have been
                 widely conjectured to require: (1) delay time or number
                 of levels of order $(\log_2 n)^2$, (2) size or number
                 of elements of order $n(\log_2 n)^2$, and (3) formula
                 length or number of literals of order $(n^{\log_2
                 n})^2$. It is proved constructively in the paper that,
                 if one permits the use of negations in constructing the
                 corresponding Boolean functions, these three measures
                 of complexity can be reduced to the orders of $\log_2
                 n$, $n$, and $n^5$, respectively. The latter network,
                 however, is incapable of sorting numbers other than
                 $0$'s and $1$'s and may be thought of as merely
                 counting the number of inputs which are $1$. It is
                 shown, however, that one may incorporate this network
                 in a larger network which does sort and In time
                 proportional to only $\log_2 n$ This network is the
                 first known example of a nonadaptive network capable of
                 sorting in time less than $(\log_2 n)^2$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computational complexity; computer metatheory",
}

@Article{Perl:1975:EGO,
  author =       "Y. Perl and M. R. Garey and S. Even",
  title =        "Efficient Generation of Optimal Prefix Code:
                 Equiprobable Words Using Unequal Cost Letters",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "202--214",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm for constructing an optimal prefix code
                 of $n$ equiprobable words over r unequal cost coding
                 letters is given. The discussion is in terms of rooted
                 labeled trees. The algorithm consists of two parts. The
                 first one is an extension algorithm which constructs a
                 prefix code of $n$ words. This code is either optimal
                 or is a ``good'' approximation. The second part is a
                 mending algorithm which changes the code constructed by
                 the extension algorithm into an optimal code in case it
                 is not already optimal. The validity of the combined
                 algorithm is proved and its structure is analyzed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "codes, symbolic; mathematical techniques --- Trees",
}

@Article{Tarjan:1975:EGL,
  author =       "Robert Endre Tarjan",
  title =        "Efficiency of a Good But Not Linear Set Union
                 Algorithm",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "215--225",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Two types of instructions for manipulating a family of
                 disjoint sets which partition a universe of $n$
                 elements are considered FIND($x$) computes the name of
                 the (unique) set containing element $x$. UNION($A,B,C$)
                 combines sets $A$ and $B$ into a new set named $C$. A
                 known algorithm for implementing sequences of these
                 instructions is examined. It is shown that, if $(m, n)$
                 is the maximum time required by a sequence of $m \geq
                 n$ FINDs and $n - 1$ intermixed UNIONs, then $k_1 m
                 \alpha(m, n) \leq t(m, n) \leq k_2 m \alpha(m, n)$ for
                 some positive constants $k_1$ and $k_2$, where $\alpha
                 (m, n)$ is related to a functional inverse of
                 Ackermann's function and is very slow-growing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Trees",
}

@Article{Knauer:1975:SPC,
  author =       "Bernd Knauer",
  title =        "A Simple Planarity Criterion",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "226--230",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is presented which either directly
                 establishes the nonplanarity of a graph $G$ or
                 completes $G$ to a locally Hamiltonian graph in such a
                 way that the locally Hamiltonian graph is planar if and
                 only if $G$ is. The planarity of the locally
                 Hamiltonian graph may be verified readily by a theorem
                 of Skupien.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Hamiltonian graph; mathematical techniques; planarity
                 algorithms",
}

@Article{Babad:1975:GME,
  author =       "Jair M. Babad",
  title =        "A Generalized Multi-Entrance Time-Sharing Priority
                 Queue",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "231--247",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A generalized multientrance and multipriority $M/G/1$
                 time-sharing system is dealt with. The system maintains
                 many separate queues, each identified by two integers:
                 the priority level and the entry level. The arrival
                 process of users is a homogeneous Poisson process,
                 while service requirements are identically distributed
                 and have a finite second moment. Upon arrival a user
                 joins one of the levels, through the entry queue of
                 this level. In the $(n, k)$-th queue, where $n$ is the
                 priority level and $k$ is the entry level, a user is
                 eligible to a (finite or infinite) quantum of service.
                 If the service requirements of the user are satisfied
                 during the quantum, the user departs, and otherwise, is
                 transferred to the end of the $(n + 1, k)$-th queue for
                 additional service. When a quantum of service is
                 completed, the highest priority nonempty level is
                 chosen to be served next.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  descriptors =  "Queueing system; priority; analysis",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; probability --- Queueing
                 Theory",
}

@Article{Baskett:1975:OCM,
  author =       "Forest Baskett and K. Mani Chandy and Richard R. Muntz
                 and Fernando G. Palacios",
  title =        "Open, Closed and Mixed Networks of Queues with
                 Different Classes of Customers",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "248--260",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:22:58 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Load.Balance.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The joint equilibrium distribution of queue sizes in a
                 network of queues containing $N$ service centers and
                 $R$ classes of customers is derived. The equilibrium
                 state probabilities have the general form $P(S)$ equals
                 $C_d(S)$ $f_1(x_1) f_2(x_2) \ldots{} f_N(x_N)$, where
                 $S$ is the state of the system, $x_i$ is the
                 configuration of customers at the ith service center,
                 $d(S)$ is a function of the state of the model, $f_i$
                 is a function that depends on the type of the $i$th
                 service center, and $C$ is a normalizing constant. It
                 is assumed that the equilibrium probabilities exist and
                 are unique. Four types of service centers to model
                 central processors, data channels, terminals, and
                 routing delays are considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "The joint equilibrium distribution of queue sizes in a
                 network of queues containing $n$ service centers and
                 $r$ classes of customers is derived. The equilibrium
                 state probabilities have the general form $p(s)=cd(s)
                 f_1(x_1) f_2(x_2) \ldots f_n(x_n)$, where $s$ is the
                 state of the system, $x_i$ is the configuration of
                 customers at the $i$-th service center, $d(s)$ is a
                 function of the state of the model, $f_i$ is a function
                 that depends on the type of the $i$-th \ldots{}.",
  classification = "723; 922",
  descriptors =  "Exponential queueing network; imbedded Markov chain;
                 BCMP; processor sharing; stationary process; FIFO;
                 LIFO; number of elements in system; method",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; Laplace transforms;
                 Markov processes; probability --- Queueing Theory",
}

@Article{Gelenbe:1975:ACS,
  author =       "Erol Gelenbe",
  title =        "On Approximate Computer System Models",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "261--269",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new treatment of the boundary conditions of
                 diffusion approximations for interconnected queueing
                 systems is presented. The results have applications to
                 the study of the performance of multiple-resource
                 computer systems. In this approximation method
                 additional equations to represent the behavior of the
                 queues when they are empty are introduced. This reduces
                 the dependence of the model on heavy traffic
                 assumptions and yields certain results which would be
                 expected from queueing or renewal theory. The accuracy
                 of the approach is evaluated by comparison with certain
                 known exact or numerical results.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  descriptors =  "Computer System; Modeling; Approximation",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; probability --- Queueing
                 Theory",
}

@Article{Hofri:1975:PSD,
  author =       "Micha Hofri and Micha Yadin",
  title =        "A Processor in Series with Demand-Interrupting Devices
                 --- a Stochastic Model",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "270--290",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A demand-interrupting device is any attachment to a
                 computer which, when busy, blocks a processor that
                 requires further service from it. In this paper a
                 system is considered with a processor rendering two
                 types of service, so as to be able to take advantage of
                 enforced idle times, which is connected to one or two
                 demand-interrupting devices that feed back the programs
                 to the processor. The distribution of the holding time
                 in the processor and the utilization figures for all
                 the components are computed under several assumptions
                 on the distributions of the services performed by the
                 demand interrupting devices and the delay-type service
                 performed by the processor. The principal processor
                 service duration is assumed to be exponentially
                 distributed throughout the discussion.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; demand interrupting;
                 processors",
}

@Article{Musser:1975:MPF,
  author =       "David R. Musser",
  title =        "Multivariate Polynomial Factorization",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "291--308",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper describes algorithms for factoring a
                 polynomial in one or more variables, with integer
                 coefficients, into factors which are irreducible over
                 the integers. These algorithms are based on the use of
                 factorizations over finite fields and ``Hensel's lemma
                 constructions.'' ``Abstract algorithm'' descriptions
                 are used in the presentation of the underlying
                 algebraic theory. Included is a new generalization of
                 Hensel's $p$-adic construction which leads to a
                 practical algorithm for factoring multivariate
                 polynomials.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; factorization; statistical
                 methods",
}

@Article{Rosenberg:1975:CAS,
  author =       "Arnold L. Rosenberg",
  title =        "Corrigendum: ``{Allocating} Storage for Extendible
                 Arrays''",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "2",
  pages =        "308--308",
  month =        apr,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:31:00 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Rosenberg:1974:ASE}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schank:1975:IPC,
  author =       "Roger C. Schank and Neil M. Goldman and Charles J.
                 {Rieger III} and Christopher K. Riesbeck",
  title =        "Inference and Paraphrase by Computer",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "309--328",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The MARGIE system is a set of three programs that
                 attempt to understand natural language. They are based
                 on the Conceptual Dependency system for meaning
                 representation. The analysis program maps sentences
                 into conceptual structures. The memory program makes
                 inferences from input conceptual structures. The
                 generator codes conceptual structures back into natural
                 language. Together the programs function as a
                 paraphrase and inference system.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 731",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; paraphrase and inference system;
                 systems science and cybernetics",
}

@Article{Chaitin:1975:TPS,
  author =       "Gregory J. Chaitin",
  title =        "A Theory of Program Size Formally Identical to
                 Information Theory",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "329--340",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new definition of program-size complexity is made.
                 H(A,B/C,D) is defined to be the size in bits of the
                 shortest self-delimiting program for calculating
                 strings A and B if one is given a minimal-size
                 self-delimiting program for calculating strings C and
                 D. This differs from previous definitions: (1) programs
                 are required to be self-delimiting, i.e., no program is
                 a prefix of another, and (2) instead of being given C
                 and $D$ directly, one is given a program for
                 calculating them that is minimal in size. Unlike
                 previous definitions, this one has precisely the formal
                 properties of the entropy concept of information
                 theory.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 731",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "codes, symbolic; computer metatheory; information
                 theory",
}

@Article{Lynch:1975:RCS,
  author =       "Nancy Lynch",
  title =        "On Reducibility to Complex or Sparse Sets",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "341--345",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Sets which are efficiently reducible (in Karp's sense)
                 to arbitrarily complex sets are shown to be polynomial
                 computable. Analogously, sets efficiently reducible to
                 arbitrarily sparse sets are polynomial computable. A
                 key lemma for both proofs shows that any set which is
                 not polynomial computable has an infinite recursive
                 subset of its domain, on which every algorithm runs
                 slowly on almost all arguments.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "731",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "complex sets; reducibility; sparse sets; systems
                 science and cybernetics",
}

@Article{Manacher:1975:NLT,
  author =       "Glenn Manacher",
  title =        "A New Linear-Time ``On-Line'' Algorithm for Finding
                 the Smallest Initial Palindrome of a String",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "346--351",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Despite significant advances in linear-time scanning
                 algorithms, particularly those based wholly or in part
                 on either Cook's linear-time simulation of two-way
                 deterministic pushdown automata or Weiner's algorithm,
                 the problem of recognizing the initial leftmost nonvoid
                 palindrome of a string in time proportional to the
                 length $N$ of the palindrome, examining no symbols
                 other than those in the palindrome, has remained open.
                 The algorithm presented solves this problem, assuming
                 that addition of two integers less than or equal to $N$
                 may be performed in a single operation. Like the
                 Knuth-Morris-Pratt algorithm, it runs in time
                 independent of the size of the input alphabet. The
                 algorithm as presented finds only even palindromes.
                 However, an extension allows one to recognize the
                 initial odd or even palindrome of length 2 or
                 greater.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; computer systems, digital --- On
                 Line Operation; linear-time algorithm; palindromes",
}

@Article{Goodman:1975:AHC,
  author =       "S. E. Goodman and S. T. Hedetniemi and P. J. Slater",
  title =        "Advances on the {Hamiltonian} Completion Problem",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "352--360",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The Hamiltonian completion problem for an arbitrary
                 graph $G$ consists of determining the minimum number of
                 new lines which can be added to $G$ in order to produce
                 a Hamiltonian cycle in $G$. A solution to this problem
                 would be useful in situations where it is necessary to
                 traverse periodically a network or data structure in
                 such a way as to visit all nodes and minimize the
                 length of the traversal. Linear algorithms are
                 presented for solving the Hamiltonian completion
                 problem for several classes of graphs, in particular
                 for trees and unicyclic graphs. Several more general
                 results are also given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Hamiltonian cycle; linear algorithms; mathematical
                 techniques",
}

@Article{Pfaltz:1975:RGK,
  author =       "John L. Pfaltz",
  title =        "Representing Graphs by {Knuth} Trees",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "361--366",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "By means of the Knuth transform, arbitrary rooted
                 trees may be represented compactly as binary trees. In
                 this paper it is shown that the domain of this
                 transform may be extended to a much wider class of
                 graphs, while still maintaining its fundamental
                 properties. Graphs, G, belonging to this extended
                 domain are characterized first in terms of properties
                 of an induced graph, G*, and then in terms of local
                 properties of $G$ itself. A classic kind of
                 ``forbidden'' subgraph theorem characterizes
                 nonrepresentable graphs. Finally, it is shown that any
                 directed graph can be modified to make it representable
                 under the transform.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Knuth transform; Knuth trees; mathematical techniques;
                 mathematical transformations",
}

@Article{Elias:1975:CSS,
  author =       "Peter Elias and Richard A. Flower",
  title =        "The Complexity of Some Simple Retrieval Problems",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "367--379",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Four costs of a retrieval algorithm are the number of
                 bits needed to store a representation of a data base,
                 the number of those bits which must be accessed to
                 answer a retrieval question, the number of bits of
                 state information required, and the logic complexity of
                 the algorithm. Firm lower bounds are given to measures
                 of the first three costs for simple binary retrieval
                 problems. Systems are constructed which attain each
                 bound separately. A system which finds the value of the
                 $k$th bit in an $N$-bit string attains all bounds
                 simultaneously. For two other more complex retrieval
                 problems there are trading curves between storage and
                 worst-case access, and between storage and average
                 access. Lower and upper bounds to the trading curves
                 are found.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems",
}

@Article{Dressler:1975:PPS,
  author =       "Robert E. Dressler and S. Thomas Parker",
  title =        "Primes with a Prime Subscript",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "380--381",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:23:20 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $p_i$ be the $i$th prime and let $\{q_i\}$ be the
                 very thin subsequence of the primes defined by $q_i =
                 p_{p_i}$. It is shown, with the aid of a computer, that
                 every integer greater than $96$ is representable as a
                 sum of distinct members of the sequence $\{q_i\}$.
                 Furthermore, the lower bound is the best possible.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques; primes",
}

@Article{Bruno:1975:GOC,
  author =       "J. L. Bruno and T. Lassagne",
  title =        "The Generation of Optimal Code for Stack Machines",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "382--396",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of generating ``optimal'' programs for the
                 evaluation of arithmetic expressions on a machine with
                 a finite depth stack is studied. Efficient algorithms
                 are given for constructing optimal programs in the case
                 where the expressions are trees, there are no data
                 dependencies, and the operators have limited algebraic
                 properties.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 731; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "codes, symbolic; mathematical techniques --- Trees",
}

@Article{Oney:1975:QAS,
  author =       "Walter C. Oney",
  title =        "Queueing Analysis of the Scan Policy for Moving-Head
                 Disks",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "397--412",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A brief survey of queueing-theory analyses of disk
                 service policies is given. The SCAN policy for
                 moving-head devices is examined in detail using three
                 models. An idealized model in which the head always
                 covers the entire disk is exactly analyzed to determine
                 the spatial bias in queueing time. A realistic model is
                 used to obtain an exact numeric solution as well as an
                 asymptotic formula valid in saturation. Finally, the
                 time required to clear a clump of demands for both the
                 FIFO and SCAN strategies is computed. Simulations and
                 theoretic calculations are reported for two different
                 disk units.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721; 722; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data storage, magnetic --- Disk; probability",
}

@Article{Ross:1975:CSE,
  author =       "G. Terry Ross and D. Klingman and A. Napier",
  title =        "A Computational Study of the Effects of Problem
                 Dimensions on Solution Times for Transportation
                 Problems",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "413--424",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:23:34 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An in-depth study of the influence of problem
                 structure on the computational efficiency of the primal
                 simplex transportation algorithm is presented. The
                 input of the study included over 1000 randomly
                 generated problems with 185 different combinations of
                 the number of sources, the number of destinations, and
                 the number of variables. Objective function
                 coefficients were generated using three different
                 probability distributions to study the effects of
                 variance and skewness in these parameters.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "430; 723; 921; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming, linear; mathematical
                 statistics --- Random Number Generation;
                 transportation",
}

@Article{Sethi:1975:ETC,
  author =       "Ravi Sethi",
  title =        "Errata: ``{Testing} for the {Church--Rosser}
                 Property''",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "424--424",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:01:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Sethi:1974:TCR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Svoboda:1975:CTE,
  author =       "Antonin Svoboda",
  title =        "The Concept of Term Exclusiveness and Its Effect on
                 the Theory of {Boolean} Functions",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "3",
  pages =        "425--440",
  month =        jul,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 19:53:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Easton:1975:ECC,
  author =       "M. C. Easton and C. K. Wong",
  title =        "The Effect of a Capacity Constraint on the Minimal
                 Cost of a Partition",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "441--449",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of finding a partition of nonnegative
                 numbers into $m$ groups to minimize a certain cost, the
                 sum of the squares of the group sums, is applicable to
                 the allocation of data records to disks so as to
                 minimize arm contention, under certain assumptions
                 about record accessing behavior. Previous treatment has
                 assumed that the disk capacities were so large that
                 capacity constraints could be ignored. Consideration of
                 the effect of such constraints, assuming equal-sized
                 data records and equal-sized disks, leads to the
                 problem of partitioning numbers (which represent access
                 probabilities) into $m$ groups of at most $k$ numbers
                 each. A practical method for partitioning is shown to
                 yield a cost no more than $4/3$ of the minimal cost
                 without the constraint on group size. Therefore,
                 increasing the disk capacity and arbitrarily changing
                 the partition cannot reduce the arm contention cost
                 below 75 percent of that achieved on the existing
                 system with the suggested partition. The result also
                 shows that the proposed partition has a cost for the
                 constrained problem at most $4/3$ of the minimal cost
                 for the constrained problem.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data storage, magnetic",
}

%% Page 470 is notice page

@Article{Horowitz:1975:SAP,
  author =       "Ellis Horowitz",
  title =        "A Sorting Algorithm for Polynomial Multiplication",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "450--462",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Given two polynomials with $n$ nonzero terms and $t$
                 terms in the product, $2n - 1 \leq t \leq n^2$, it is
                 shown that the conventional polynomial multiplication
                 algorithm can take as many as $O(n^3)$ operations. An
                 alternate algorithm which does a binary merge-sort is
                 given which has a worst-case bound of $O(n^2 \log_2 n)$
                 exponent comparisons but may require $O(n^2)$ storage.
                 A new algorithm, based upon a sorting strategy for the
                 exponents, is given which behaves as $O(n^2 \log_2 n)$
                 and requires only $O(t)$ storage. Moreover, the
                 algorithm works in linear time for several important
                 special cases, namely for completely dense and
                 completely sparse polynomials.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; computer systems programming ---
                 Sorting",
}

@Article{Ibarra:1975:FAA,
  author =       "Oscar H. Ibarra and Chul E. Kim",
  title =        "Fast Approximation Algorithms for the Knapsack and Sum
                 of Subset Problems",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "463--468",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:23:45 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is presented which finds for any 0 less
                 than epsilon less than 1 an approximate solution P
                 prime satisfying (P* minus P prime)/P* less than
                 equivalent to epsilon, where P* is the desired optimal
                 sum. Moreover, for any fixed epsilon, the algorithm has
                 time complexity $O(n \log n)$ and space complexity
                 $O(n)$. Modification of the algorithm for the unbounded
                 knapsack problem results in a $O(n)$ computing time. A
                 linear-time algorithm is also obtained for a special
                 class of 0/1 knapsack problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming; mathematical techniques ---
                 Combinatorial Mathematics",
}

@Article{Kung:1975:FMS,
  author =       "H. T. Kung and F. Luccio and F. P. Preparata",
  title =        "On Finding the Maxima of a Set of Vectors",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "469--476",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/75.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $U_1$, $U_2$, \ldots{}, $U_d$ be totally ordered
                 sets and let $V$ be a set of $n$ $d$-dimensional
                 vectors in $U_1 \times U_2 \cdots{} \times U_d$. A
                 partial ordering is defined on $V$ in a natural way.
                 The problem of finding all maximal elements of $V$ with
                 respect to the partial ordering is considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Winograd:1975:PEC,
  author =       "S. Winograd",
  title =        "On the Parallel Evaluation of Certain Arithmetic
                 Expressions",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "477--492",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321906.321911",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The time required to evaluate arithmetic expressions
                 using parallel processing is investigated. It is shown
                 that for the evaluation of an arithmetic expression of
                 $n$ variables without division, in which every variable
                 appears only once, at most $ 3 n / 2p + o(n)$ time
                 units are required if $p$ processors are used. In case
                 the expression includes the division operation, the
                 bound is raised to $5 n / 2 p + o(n)$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computational complexity; computer arithmetic;
                 mathematical programming; parallel processing",
}

@Article{Bertsch:1975:ORP,
  author =       "Eberhard Bertsch",
  title =        "An Observation on Relative Parsing Time",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "493--498",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 19:53:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sudborough:1975:NTB,
  author =       "I. H. Sudborough",
  title =        "A Note on Tape-Bounded Complexity Classes and Linear
                 Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "499--500",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 6 19:53:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Dass:1975:SBC,
  author =       "Bal Kishan Dass",
  title =        "A Sufficient Bound for Codes Correcting Bursts with
                 Weight Constraint",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "501--503",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An upper bound on the sufficient number of
                 parity-check positions of a linear code capable of
                 correcting bursts of a given length or less having a
                 weight constraint over them is presented. An example of
                 a code which corrects all bursts of length 3 or less
                 that have weight 2 or less is given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "burst error correcting codes; codes, symbolic",
}

@Article{Cash:1975:CIR,
  author =       "J. R. Cash",
  title =        "A Class of Implicit {Runge--Kutta} Methods for the
                 Numerical Integration of Stiff Ordinary Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "504--511",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "One-step methods similar in design to the well-known
                 class of Runge--Kutta methods are developed for the
                 efficient numerical integration of both stiff and
                 nonstiff systems of first-order ordinary differential
                 equations. The algorithms developed combine accuracy in
                 the limit $h$ approaches 0 with a large region of
                 absolute stability and are demonstrated by direct
                 application to certain particular examples.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Miller:1975:CSN,
  author =       "Webb Miller",
  title =        "Computer Search for Numerical Instability",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "512--521",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/auto.diff.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is often possible to define a measure, $\omega(d)
                 \geq 0$, of the effect of rounding error upon a fixed
                 numerical algorithm given data $d$. One reasonable
                 choice is for $\omega$ to measure how much the exact
                 computational problem must be perturbed to compensate
                 for rounding error. Such ``Wilkinson numbers''
                 $\omega(d)$ are investigated, with particular attention
                 given to their numerical evaluation. Also, an automatic
                 roundoff analysis is described, which shows that the
                 usual algorithm for inverting triangular matrices does
                 not enjoy a certain very stringent stability
                 property.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming; mathematical techniques",
}

@Article{Krause:1975:AST,
  author =       "K. L. Krause and V. Y. Shen and H. D. Schwetman",
  title =        "Analysis of Several Task-Scheduling Algorithms for a
                 Model of Multiprogramming Computer Systems",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "522--550",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Krause:1977:EAS}.",
  abstract =     "An abstract system model is presented which consists
                 of several identical and independent task processors
                 and a memory of arbitrary size. Tasks are represented
                 by processing-time and memory requirements which must
                 be met by the model. Worst-case performance bounds are
                 derived for several simple scheduling algorithms. A new
                 heuristic algorithm, which uses a look-ahead strategy,
                 is introduced. This algorithm is shown to be better in
                 many cases than the simpler algorithms when the
                 worst-case performance bounds are compared.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Hayes:1975:FSS,
  author =       "John P. Hayes",
  title =        "The Fanout Structure of Switching Functions",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "551--571",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of determining the amount of fanout
                 required to realize a switching function is
                 investigated. The significance of fanout in switching
                 networks is discussed. Fanout-free functions are
                 introduced and their properties examined. Two
                 relations, adjacency and masking, are defined on the
                 variables $X$ of a function $f(X)$, and these relations
                 are used to characterize fanout-free functions. A
                 quantity $\tau(f)$ called the input fanout index of $f$
                 is defined for arbitrary switching functions; $\tau(f)$
                 represents the minimum number of input variables that
                 require fanout in any realization of $f$. It is shown
                 that $\tau(f)$ can be determined from the prime
                 implicants and prime implicates of $f$ using two
                 additional relations on $X$, the conjugate property and
                 compatibility. An algorithm is presented for finding a
                 realization of $f$ in which only $\tau(f)$ variables
                 fan out. Some other measures of fanout are briefly
                 considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "switching theory",
}

@Article{Kowalski:1975:PPU,
  author =       "Robert Kowalski",
  title =        "A Proof Procedure Using Connection Graphs",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "572--595",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/formal.hardware.verification.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Various deficiencies of resolution systems are
                 investigated and a new theorem-proving system designed
                 to remedy those deficiencies is presented. The system
                 is notable for eliminating redundancies present in
                 SL-resolution, for incorporating preprocessing
                 procedures, for liberalizing the order in which
                 subgoals can be activated, for incorporating
                 multidirectional searches, and for giving immediate
                 access to pairs of clauses which resolve. Examples of
                 how the new system copes with the deficiencies of other
                 theorem-proving systems are chosen from the areas of
                 predicate logic programming and language parsing. The
                 opportunities for using look-ahead to guide the search
                 for proofs are discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Logic; mathematical programming; mathematical
                 techniques --- Graph Theory",
}

@Article{Jump:1975:IAC,
  author =       "J. Robert Jump and P. S. Thiagarajan",
  title =        "On the Interconnection of Asynchronous Control
                 Structures",
  journal =      j-J-ACM,
  volume =       "22",
  number =       "4",
  pages =        "596--612",
  month =        oct,
  year =         "1975",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The closure properties of a class of control systems
                 which can be represented by a graphical model called an
                 MG-control system (MGCS) are studied. Necessary and
                 sufficient conditions are presented for the composite
                 system, obtained by interconnecting two of these
                 systems, to be represented as an MGCS. These results
                 are then extended to networks composed of several
                 interconnected control systems. In solving this
                 problem, it is shown that whenever the interconnection
                 of two or more systems results in a system that is not
                 representable as an MGCS, it is due to the presence of
                 ``deadlock'' in the composite system. Hence, these
                 results provide a means of detecting deadlock in a
                 network of control systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "731",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "asynchronous control systems; control systems",
}

@Article{Aho:1976:BCL,
  author =       "A. V. Aho and D. S. Hirschberg and J. D. Ullman",
  title =        "Bounds on the Complexity of the Longest Common
                 Subsequence Problem",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "1--12",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:27:14 1998",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of finding a longest common subsequence of
                 two strings is discussed. This problem arises in data
                 processing applications such as comparing two files and
                 in genetic applications such as studying molecular
                 evolution. The difficulty of computing a longest common
                 subsequence of two strings is examined using the
                 decision tree model of computation, in which vertices
                 represent ``equal --- unequal'' comparisons. It is
                 shown that unless a bound on the total number of
                 distinct symbols is assumed, every solution to the
                 problem can consume an amount of time that is
                 proportional to the product of the lengths of the two
                 strings. A general lower bound as a function of the
                 ratio of alphabet size to string length is derived. The
                 case where comparisons between symbols of the same
                 string are forbidden is also considered and it is shown
                 that this problem is of linear complexity for a
                 two-symbol alphabet and quadratic for an alphabet of
                 three or more symbols.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  comment =      "``The problem of finding a longest common subsequence
                 of two strings is discussed. This problem arises in
                 data processing applications such as comparing two
                 files and in genetic applications such as studying
                 molecular evolution. The difficulty of computing a
                 longest common subsequence of two strings is examined
                 using the decision tree model of computation, in which
                 vertices represent `equal -- unequal' comparisons. It
                 is shown that unless a bound on the total number of
                 distinct symbols is assumed, every solution to the
                 problem can consume an amount of time that is
                 proportional to the product of the length of the two
                 strings. A general lower bound as a function of the
                 ratio of alphabet size to string length is derived. The
                 case where comparisons between symbols of the same
                 string are forbidden is also considered and it is shown
                 that this problem is of linear complexity for a
                 two-symbol alphabet and quadratic for an alphabet of
                 three or more''",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; computer programming ---
                 Subroutines",
}

@Article{Wong:1976:BSE,
  author =       "C. K. Wong and Ashok K. Chandra",
  title =        "Bounds for the String Editing Problem",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "13--16",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The string editing problem is to determine the
                 distance between two strings as measured by the minimal
                 cost sequence of deletions, insertions, and changes of
                 symbols needed to transform one string into the other.
                 The longest common subsequence problem can be viewed as
                 a special case. R. A. Wagner and M. J. Fischer proposed
                 an algorithm that runs in time $0(n m)$, where $n$, $m$
                 are the lengths of the two strings. In the present
                 paper, it is shown that if the operations on symbols of
                 the strings are restricted to tests of equality, then
                 $O(n m)$, operations are necessary (and sufficient) to
                 compute the distance.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  comment =      "``The string editing problem is to determine the
                 distance between two strings as measured by the minimal
                 cost sequence of deletions, insertions, and changes of
                 symbols needed to transform one string into the other.
                 The longest common subsequence problem can be viewed as
                 a special case. Wagner and Fischer proposed an
                 algorithm that runs in time $O(nm)$, where $n,\; m$ are
                 the lengths of the two strings. In the present paper,
                 it is shown that if the operations on symbols of the
                 strings are restricted to tests of equality, then
                 $O(nm)$ operations are necessary (and sufficient) to
                 compute the distance.''",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Mickunas:1976:CCP,
  author =       "M. Dennis Mickunas",
  title =        "On the Complete Covering Problem for {LR}(k)
                 Grammars",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "17--30",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A direct, one-step transformation is presented for
                 transforming an arbitrary LR(k) context-free grammar,
                 $G$, to an LR(1) grammar, $G$ prime, which completely
                 covers $G$. Under additional hypotheses, $G$ prime may
                 be made LR(0).",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Ullmann:1976:ASI,
  author =       "J. R. Ullmann",
  title =        "An Algorithm for Subgraph Isomorphism",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "31--42",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Subgraph isomorphism can be determined by means of a
                 brute-force tree-search enumeration procedure. A new
                 algorithm is introduced that attains efficiency by
                 inferentially eliminating successor nodes in the tree
                 search. To assess the time actually taken by the new
                 algorithm, subgraph isomorphism, clique detection,
                 graph isomorphism, and directed graph isomorphism
                 experiments have been carried out with random and with
                 various nonrandom graphs. A parallel asynchronous
                 logic-in-memory implementation of a vital part of the
                 algorithm is also described, although this hardware has
                 not actually been built. The hardware implementation
                 would allow very rapid determination of isomorphism.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Garey:1976:CNO,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "The Complexity of Near-Optimal Graph Coloring",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "43--49",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Graph coloring problems, in which one would like to
                 color the vertices of a given graph with a small number
                 of colors so that no two adjacent vertices receive the
                 same color, arise in many applications, including
                 various scheduling and partitioning problems. The
                 complexity and performance of algorithms which
                 construct such colorings are investigated. It is proved
                 that even coming close to the minimum number of
                 necessary colors with a fast algorithm is hard.
                 Instead, an analogous fast ``approximation algorithm''
                 is devised.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Show that there exists no algorithm that colors a
                 graph using within two times the optimal number of
                 colors unless P=NP.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; graph color; mathematical
                 techniques --- Graph Theory",
}

@Article{Wagner:1976:SPA,
  author =       "Robert A. Wagner",
  title =        "A Shortest Path Algorithm for Edge-Sparse Graphs",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "50--57",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm (FLOW) for finding the shortest distance
                 from a given node $S$ to each node $X$ of a directed
                 graph with nonnegative integer are lengths less than or
                 equal to WM is presented. FLOW is compared with its
                 best-known competitor, that of E. W. Dijkstra and J. Y.
                 Yen (DFLO). The new algorithm is shown to execute in
                 time of order $\max(V, E, D)$, where $D$ is the maximum
                 distance computed in a graph with $E$ edges and $V$
                 nodes. By counting the number of operands fetched
                 during execution of FLOW and DFLO, an estimate of the
                 running time of each is obtained. FLOW also will solve
                 the all-pairs shortest distance problem.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Martelli:1976:GEA,
  author =       "Alberto Martelli",
  title =        "A {Gaussian} Elimination Algorithm for the Enumeration
                 of Cut Sets in a Graph",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "58--73",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "By defining a suitable algebra for cut sets, it is
                 possible to reduce the problem of enumerating the cut
                 sets between all pairs of modes in a graph to the
                 problem of solving a system of linear equations. An
                 algorithm for solving this system using Gaussian
                 elimination is presented. The efficiency of the
                 algorithm depends on the implementation of sum and
                 multiplication. Therefore, some properties of cut sets
                 are investigated, which greatly simplify the
                 implementation of these operations for the case of
                 undirected graphs. The time required by the algorithm
                 is shown to be linear with the number of cut sets for
                 complete graphs. Some experimental results are given,
                 proving that the efficiency of the algorithm increases
                 by increasing the number of pairs of nodes for which
                 the cut sets are computed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Deo:1976:NHT,
  author =       "Narsingh Deo",
  title =        "Note on {Hopcroft} and {Tarjan}'s Planarity
                 Algorithm",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "74--75",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:39:39 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/siggraph/76.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Hopcroft:1974:EPT}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yu:1976:PWE,
  author =       "C. T. Yu and G. Salton",
  title =        "Precision Weighting --- An Effective Automatic
                 Indexing Method",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "76--88",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:27:19 1998",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The precision weighting procedure described in the
                 present study uses relevance criteria to weight the
                 terms occurring in user queries as a function of the
                 balance between relevant and nonrelevant documents in
                 which these terms occur; this approximates a semantic
                 know-how of term importance. Formal mathematical proofs
                 are given under well-defined conditions of the
                 effectiveness of the method.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Crump:1976:NIL,
  author =       "Kenny S. Crump",
  title =        "Numerical Inversion of {Laplace} Transforms Using a
                 {Fourier} Series Approximation",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "89--96",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A method is presented for numerically inverting a
                 Laplace transform that requires, in addition to the
                 transform function itself, only sine, cosine, and
                 exponential functions. In test problems using the
                 method it has routinely been possible to evaluate
                 inverse transforms with considerable accuracy over a
                 wide range of value of the independent variable using a
                 relatively few determinations of the Laplace transform
                 itself.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A method is presented for numerical inverting a
                 Laplace transform that requires, only sine, cosine and
                 exponential functions. The method is conceptually like
                 the method of Dubner and Abate (Dubner, H.; Abate, J.),
                 but differs from theirs in two aspects. In this method
                 the error of the approximation is less and a
                 transformation is incorporated which transforms the
                 approximation series into one that converges rapidly.",
  classification = "921",
  descriptors =  "Laplace transform; approximation; numerical method",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Laplace transforms; mathematical techniques",
}

@Article{Potier:1976:AAC,
  author =       "D. Potier and E. Gelenbe and J. Lenfant",
  title =        "Adaptive Allocation of Central Processing Unit
                 Quanta",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "97--102",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The allocation of the central processing unit (CPU) of
                 a computer system in quanta of fixed length in
                 round-robin fashion favors jobs with shorter total CPU
                 processing time by reducing the time they spend waiting
                 in queue below what it would be if all the jobs were
                 served in first-come-first-served order. This effect
                 can be accentuated by the use of short quanta. The main
                 disadvantage of this allocation policy is the resulting
                 time the CPU spends in overhead activities when
                 switching from one task to the other. An adoptive CPU
                 allocation policy is considered which reduces the
                 overhead during high traffic conditions when saturation
                 of this resource is more likely while keeping a small
                 quantum during periods of low arrival traffic. It is
                 assumed that each time at least r (a threshold)
                 arrivals occur during a quantum, the job currently
                 using the CPU is allocated an additional quantum (if it
                 is needed). This policy, which can be easily
                 implemented in hardware, is analyzed using a
                 mathematical model yielding the average response time
                 for jobs as a function of mean total CPU time, the
                 quantum size, $r$, and a fixed overhead for switching
                 tasks, with a Poisson arrival process. Numerical
                 results to illustrate the effect of this policy are
                 presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; computer systems
                 programming --- Time Sharing Programs",
}

@Article{Cody:1976:RAM,
  author =       "R. A. Cody and E. G. {Coffman, Jr.}",
  title =        "Record Allocation for Minimizing Expected Retrieval
                 Costs on Drum-Like Storage Devices",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "103--115",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/bin-packing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Cody:1976:ERA}.",
  abstract =     "The problem is examined of distributing a set of
                 equal-size records among the sectors of a drum-like
                 storage device in order to exploit known access
                 frequencies and reduce the average access time. A
                 simple catenated search model is defined for which the
                 problem is shown to be NP-complete. Heuristics are then
                 defined and analyzed in terms of worst-case bounds. It
                 is shown that easily implemented
                 highest-access-frequency-first assignment rules provide
                 an average access time very close to optimal.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Sahni:1976:ASI,
  author =       "Sartaj K. Sahni",
  title =        "Algorithms for Scheduling Independent Tasks",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "116--127",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The following job sequencing problems are studied:
                 single processor job sequencing with deadlines; job
                 sequencing on $m$-identical processors to minimize
                 finish time and related problems; job sequencing on
                 2-identical processors to minimize weighted mean flow
                 time. Dynamic programming type algorithms are presented
                 to obtain optimal solutions to these problems, and
                 three general techniques are presented to obtain
                 approximate solutions for optimization problems
                 solvable in this way. The techniques are applied to the
                 problems above to obtain polynomial time algorithms
                 that generate ``good'' approximate solutions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; mathematical
                 programming, dynamic",
}

@Article{Fagin:1976:IMR,
  author =       "Ronald Fagin and Malcolm C. Easton",
  title =        "The Independence of Miss Ratio on Page Size",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "128--146",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A theoretical justification is given to the empirical
                 observation that in some computing systems with a
                 paged, 2-level storage hierarchy, long-term miss ratio
                 is roughly independent of page size. This result is
                 used to argue the approximate independence of miss
                 ratio on page size in more realistic models of page
                 references.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; memory hierarchy",
}

@Article{Hirschberg:1976:PTA,
  author =       "D. S. Hirschberg and C. K. Wong",
  title =        "A Polynomial-Time Algorithm for the Knapsack Problem
                 with Two Variables",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "147--154",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The general knapsack problem is known to be
                 NP-complete. In this paper a very special knapsack
                 problem is studied, namely, one with only two
                 variables. A polynomial-time algorithm is presented and
                 analyzed. However, it remains an open problem that for
                 any fixed $n > 2$, the knapsack problems with $n$
                 variables can be solved in polynomial time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Harris:1976:CTP,
  author =       "Britton Harris",
  title =        "A Code for the Transportation Problem of Linear
                 Programming",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "155--157",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Methods are described and results presented for
                 greatly reducing the computation time for long narrow
                 problems of the transportation problem of linear
                 programming. The code builds on known methods with two
                 principal innovations: a substantial reduction in the
                 size of the tree representation of shipments, and a set
                 of methods for calculating improved starting
                 solutions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "codes, symbolic; mathematical programming, linear",
}

@Article{Kam:1976:GDF,
  author =       "John B. Kam and Jeffrey D. Ullman",
  title =        "Global Data Flow Analysis and Iterative Algorithms",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "158--171",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Graham:1976:FUL,
  author =       "Susan L. Graham and Mark Wegman",
  title =        "A Fast and Usually Linear Algorithm for Global Flow
                 Analysis",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "172--202",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new algorithm for global flow analysis on reducible
                 graphs is presented. The algorithm is shown to treat a
                 very general class of function spaces. For a graph of
                 $e$ edges, the algorithm has a worst-case time bound of
                 $O(e \log e)$ function operations. It is also shown
                 that in programming terms, the number of operations is
                 proportional to e plus the number of exits from program
                 loops. Consequently a restriction to one-entry one-exit
                 control structures guarantees linearity. The algorithm
                 can be extended to yet larger classes of function
                 spaces and graphs by relaxing the time bound. Examples
                 are given of code improvement problems which can be
                 solved using the algorithm.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical programming",
}

@Article{Hoffmann:1976:CTS,
  author =       "Christoph M. Hoffmann and Lawrence H. Landweber",
  title =        "A Completeness Theorem for Straight-Line Programs with
                 Structured Variables",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "1",
  pages =        "203--220",
  month =        jan,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A program scheme which models straight-line code
                 admitting structured variables such as arrays, lists,
                 and queues is considered. A set of expressions is
                 associated with a program reflecting the input-output
                 transformations. A basic set of axioms is given and
                 program equivalence is defined in terms of expression
                 equivalence. Program transformations are then defined
                 such that two programs are equivalent if and only if
                 one program can be transformed to the other via the
                 transformations. An application of these results to
                 code optimization is then discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Gabow:1976:EIE,
  author =       "Harold N. Gabow",
  title =        "An Efficient Implementation of {Edmonds}' Algorithm
                 for Maximum Matching in Graphs",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "221--234",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A matching on a graph is a set of edges, no two of
                 which share a vertex. A maximum matching contains the
                 greatest number of edges possible. This paper presents
                 an efficient implementation of Edmonds' algorithm for
                 finding a maximum matching. The computation time is
                 proportional to $V^3$, where $V$ is the number of
                 vertices; previous implementations of Edmonds'
                 algorithm have computation time proportional to $V^4$.
                 The implementation is based on a system of labels that
                 encodes the structure of alternating paths.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Larson:1976:ECC,
  author =       "Richard G. Larson",
  title =        "Efficiency of Computation of {Cayley} Tables of
                 $2$-Groups",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "235--241",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 01 16:57:55 2002",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Two algorithms for computing the multiplication table
                 of a 2-group are described and discussed. One of the
                 algorithms works in an element-by-element fashion; the
                 other works in terms of subgroups generated by initial
                 subsequences of the given sequence of generators.
                 Estimates of computation times are given which show
                 that the second algorithm is much more efficient than
                 the first. It is also shown how the second algorithm
                 can be modified to make it more useful, without using
                 significantly more time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Brent:1976:FMP,
  author =       "Richard P. Brent",
  title =        "Fast Multiple-Precision Evaluation of Elementary
                 Functions",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "242--251",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321941.321944",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "68A20 (68A10)",
  MRnumber =     "52 \#16111",
  MRreviewer =   "Amnon Barak",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $f(x)$ be one of the usual elementary functions
                 ($\exp$, $\log$, $\arctan$, $\sin$, $\cosh$, etc.), and
                 let $M(n)$ be the number of single-precision operations
                 required to multiply $n$-bit integers. It is shown that
                 $f(x)$ can be evaluated, with relative error $O(2-n)$,
                 in $O(M(n)log (n))$ operations as $n \rightarrow
                 \infty$, for any floating-point number $x$ (with an
                 $n$-bit fraction) in a suitable finite interval. From
                 the Sch{\"o}nhage--Strassen bound on $M(n)$, it follows
                 that an $n$-bit approximation to $f(x)$ may be
                 evaluated in $O(n \log_(n) \log \log(n))$ operations.
                 Special cases include the evaluation of constants such
                 as $\pi^e$, and $e^\pi$. The algorithms depend on the
                 theory of elliptic integrals, using the
                 arithmetic-geometric mean iteration and ascending
                 Landen transformations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computational complexity; computer arithmetic;
                 computer programming",
}

@Article{Kung:1976:NAL,
  author =       "H. T. Kung",
  title =        "New Algorithms and Lower Bounds for the Parallel
                 Evaluation of Certain Rational Expressions and
                 Recurrences",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "252--261",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The parallel evaluation of rational expressions is
                 considered. New algorithms which minimize the number of
                 multiplication or division steps are given. They are
                 faster than the usual algorithms when multiplication or
                 division takes more time than addition or subtraction.
                 It is shown, for example, that $x^n$ can be evaluated
                 in two steps of parallel division and $[\log_2 n]$
                 steps of parallel addition, while the usual algorithm
                 takes $[\log_2 n]$ steps of parallel multiplication.
                 Lower bounds on the time required are obtained in terms
                 of the degree of expressions to be evaluated. From
                 these bounds, the algorithms presented in the paper are
                 shown to be asymptotically optimal.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{McCreight:1976:SES,
  author =       "Edward M. McCreight",
  title =        "A Space-Economical Suffix Tree Construction
                 Algorithm",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "262--272",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new algorithm is presented for constructing
                 auxiliary digital search trees to aid in exact-match
                 substring searching. This algorithm has the same
                 asymptotic running time bound as previously published
                 algorithms, but is more economical in space. Some
                 implementation considerations are discussed, and new
                 work on the modification of these search trees in
                 response to incremental changes in the strings they
                 index (the update problem) is presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  comment =      "Algorithms to build, use, and modify suffix tree are
                 presented. The advantage of this algorithm over other
                 linear time algorithms to perform similar tasks is that
                 this algorithm uses less space. This seems to the
                 primary reference for suffix trees.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; information science ---
                 Information Retrieval",
}

@Article{Yu:1976:SMR,
  author =       "C. T. Yu and W. S. Luk and T. Y. Cheung",
  title =        "A Statistical Model for Relevance Feedback in
                 Information Retrieval",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "273--286",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A statistical model is presented for the investigation
                 of a practical method used in relevance feedback. A
                 necessary and sufficient condition for the two
                 parameters used in this method to define a better query
                 than the original query is given. A region in the plane
                 of the parameters is shown to satisfy the sufficient
                 condition. While the points for producing optimal
                 queries are not exactly located, they are shown to be
                 lying on a finite portion of a hyperbola. Experimental
                 results support some of the theoretical findings.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Feldstein:1976:CED,
  author =       "Alan Feldstein and Richard Goodman",
  title =        "Convergence Estimates for the Distribution of Trailing
                 Digits",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "287--297",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321941.321948",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An analysis is made of the distribution of trailing
                 digits (tail end digits) of positive real
                 floating-point numbers represented in arbitrary base
                 $\beta$ and randomly chosen from a logarithmic
                 distribution. The analysis shows that the $n$th digit
                 for $n \geq 2$ is actually approximately uniformly
                 distributed. The approximation depends upon both $n$
                 and the base beta. It becomes better as $n$ increases,
                 and it is exact in the limit as $n \rightarrow \infty$.
                 A table of this distribution is presented for various
                 $\beta$ and $n$, along with a table of the maximum
                 digit by digit deviation $\Delta$ of the logarithmic
                 distribution from the uniform distribution. Various
                 asymptotic results for $\Delta$ are included.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Benford's Law; computer arithmetic; computer
                 programming; Law of Anomalous Numbers; Zipf's Law",
}

@Article{Fraser:1976:API,
  author =       "Donald Fraser",
  title =        "Array Permutation by Index-Digit Permutation",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "298--309",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An array may be reordered according to a common
                 permutation of the digits of each of its element
                 indices. The digit-reversed reordering which results
                 from common fast Fourier transform (FFT) algorithms is
                 an example. By examination of this class of permutation
                 in detail, very efficient algorithms for transforming
                 very long arrays are developed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Pagano:1976:LCC,
  author =       "Marcello Pagano",
  title =        "On the Linear Convergence of a Covariance
                 Factorization Algorithm",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "310--316",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:23:55 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm for factoring a covariance function into
                 its Hurwitz factors, which is based on the Cholesky
                 factors of a certain matrix, was proposed by F. L.
                 Bauer and others. This algorithm bears a close
                 connection to the theory of orthogonal polynomials, and
                 a closer one to the theory of prediction of stationary
                 time series. In this paper these relations are pointed
                 out and then used to advantage to prove the linear
                 convergence of this algorithm.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Horowitz:1976:EAA,
  author =       "Ellis Horowitz and Sartaj Sahni",
  title =        "Exact and Approximate Algorithms for Scheduling
                 Nonidentical Processors",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "317--327",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Exact and approximate algorithms are presented for
                 scheduling independent tasks in a multiprocessor
                 environment in which the processors have different
                 speeds. Dynamic programming type algorithms are
                 presented which minimize finish time and weighted mean
                 flow time on two processors. The generalization to $m$
                 processors is direct. These algorithms have a
                 worst-case complexity which is exponential in the
                 number of tasks. Therefore approximation algorithms of
                 low polynomial complexity are also obtained for the
                 above problems. These algorithms are guaranteed to
                 obtain solutions that are close to the optimal. For the
                 case of minimizing mean flow time on $m$-processors an
                 algorithm is given whose complexity is $O(n \log
                 mn)$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems --- Program Processors;
                 computer programming --- Subroutines; computer systems
                 programming",
}

@Article{Konheim:1976:QMF,
  author =       "Alan G. Konheim and Martin Reiser",
  title =        "A Queueing Model with Finite Waiting Room and
                 Blocking",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "328--341",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A two-stage queueing network with feedback and a
                 finite intermediate waiting room is studied. The
                 first-stage server is blocked whenever M requests are
                 enqueued in the second stage. The analysis of this
                 system under exponential assumptions is carried out. An
                 algorithm to calculate the stationary state
                 probabilites is given and some special cases are
                 considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A two-stage queueing network with feedback and a
                 finite intermediate waiting room is studied. The
                 first-stage server is blocked whenever $m$ requests are
                 enqueued in the second stage. The analysis of this
                 system under exponential assumptions is carried out. An
                 algorithm to calculate the stationary state
                 probabilities is given and some special cases are
                 considered.",
  classification = "723; 922",
  descriptors =  "Queueing system; tandem queue; Analytical model;
                 M/M/1; M/M/1/S; FIFO; round robin; blocking",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; probability --- Queueing
                 Theory",
}

@Article{Price:1976:NEC,
  author =       "Thomas G. Price",
  title =        "A Note on the Effect of the Central Processor Service
                 Time Distribution on Processor Utilization in
                 Multiprogrammed Computer Systems",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "342--346",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Upper and lower bounds on processor utilization for
                 the queueing model M/G/1/N are derived. The upper bound
                 is equal to the utilization for constant service times
                 and the lower bound is approached when the average
                 number of operations per busy period approaches one.
                 These bounds show that the form of the processing time
                 distribution can have a substantial effect on processor
                 utilization. It is shown that the utilization will be
                 near the lower bound if there are a large number of
                 short processing times. The variance does not always
                 give an accurate indication of the effect of the
                 distribution on utilization.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "(VBI-000855)",
  classification = "723",
  descriptors =  "Multiprogramming",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; computer systems
                 programming --- Multiprogramming",
}

@Article{Iglehart:1976:SSS,
  author =       "Donald L. Iglehart",
  title =        "Simulating Stable Stochastic Systems, {VI}: {Quantile}
                 Estimation",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "347--360",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In this paper the author continues his study of the
                 regenerative method for analyzing simulations of stable
                 stochastic systems. The principal concern is to
                 estimate the quantiles of the stationary distribution
                 of a regenerative process. Markov chains in discrete or
                 continuous time and multiple server queues in light
                 traffic provide concrete examples of regenerative
                 processes to which this technique applies. Approximate
                 confidence intervals for these quantiles are derived
                 from appropriate central limit theorems. The method has
                 been applied to three stochastic simulations, and the
                 numerical results are presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Simulation; statistical technique",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer simulation; computer systems, digital",
}

@Article{Rider:1976:SAA,
  author =       "Kenneth Lloyd Rider",
  title =        "A Simple Approximation to the Average Queue Size in
                 the Time-Dependent {M/M/1} Queue",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "361--367",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The time-dependent equations for the M/M/1 queue can
                 be reduced to a single equation for the expected queue
                 size, but the equation is dependent on $P_0(t)$, the
                 probability of no jobs in the system. An exact equation
                 for the behavior of $P_0(t)$ under special conditions
                 is derived and an approximation relating $P_0(t)$ to
                 $Q(t)$, the expected queue size at time $t$, is derived
                 for the case when the change in queue size is slow
                 compared to the service rate. It is found that the
                 approximation affords a significant improvement over
                 the use of a steady state approximation to the
                 time-dependent queue and is simpler to use than the
                 exact equations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Horowitz:1976:PST,
  author =       "Steven L. Horowitz and Theodosios Pavlidis",
  title =        "Picture Segmentation by a Tree Traversal Algorithm",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "368--388",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In the past, picture segmentation has been performed
                 by merging small primitive regions or by recursively
                 splitting the whole picture. This paper combines the
                 two approaches with significant increase in processing
                 speed while maintaining small memory requirements. The
                 data structure is described in detail and examples of
                 implementations are given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "image processing",
}

@Article{Wegbreit:1976:PPC,
  author =       "Ben Wegbreit and Jay M. Spitzen",
  title =        "Proving Properties of Complex Data Structures",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "2",
  pages =        "389--396",
  month =        apr,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "This paper is concerned with proving properties of
                 programs which use data structures. The goal is to be
                 able to prove that all instances of a class (e.g. as
                 defined in Simula) satisfy some property. A method of
                 proof which achieves this goal, generator induction, is
                 studied and compared to other proof rules and methods;
                 inductive assertions, recursion induction, computation
                 induction, and, in some detail, structural induction.
                 The paper concludes by using generator induction to
                 prove a characteristic property of an implementation of
                 hashtables.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Joyner:1976:RSD,
  author =       "William H. {Joyner, Jr.}",
  title =        "Resolution Strategies as Decision Procedures",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "398--417",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The resolution principle, an automatic inference
                 technique, is studied as a possible decision procedure
                 for certain classes of first-order formulas. It is
                 shown that most previous resolution strategies do not
                 decide satisfiability even for ``simple'' solvable
                 classes. Two new resolution procedures are described
                 and are shown to be complete (i.e. semidecision
                 procedures) in the general case and, in addition, to be
                 decision procedures for successively wider classes of
                 first-order formulas. These include many previously
                 studied solvable classes. The proofs that a complete
                 resolution procedure will always halt (without
                 producing the empty clause) when applied to satisfiable
                 formulas in certain classes provide demonstrations of
                 the solvability of these classes. A technique for
                 constructing a model for a formula shown satisfiable in
                 this way is also described.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 912",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory --- Programming Theory; systems
                 science and cybernetics",
}

@Article{Chang:1976:CCC,
  author =       "Lena Chang and James F. Korsh",
  title =        "Canonical Coin Changing and Greedy Solutions",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "418--422",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A natural, and readily computable, first guess at a
                 solution to the coin changing problem is the canonical
                 solution. This solution is a special case of the greedy
                 solution which is a reasonable heuristic guess for the
                 knapsack problem. Efficient tests are given here to
                 determine whether all greedy solutions are optimal with
                 respect to a given set of knapsack objects or coin
                 types. These results improve or extend previous tests
                 given in the literature. Both the incomplete and
                 complete cases are considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Pippenger:1976:SGT,
  author =       "Nicholas Pippenger and Leslie G. Valiant",
  title =        "Shifting Graphs and Their Applications",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "423--432",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Graphs that in a certain precise sense are rich in
                 sets of vertex-disjoint paths are studied. Bounds are
                 obtained on the minimum number of edges in such graphs,
                 and these are used to deduce nonlinear lower bounds on
                 the computational complexity of shifting, merging, and
                 matching problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; mathematical
                 techniques",
}

@Article{Schmidt:1976:FBA,
  author =       "Douglas C. Schmidt and Larry E. Druffel",
  title =        "A Fast Backtracking Algorithm to Test Directed Graphs
                 for Isomorphism Using Distance Matrices",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "433--445",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A backtracking algorithm for testing a pair of
                 digraphs for isomorphism is presented. The information
                 contained in the distance matrix representation of a
                 graph is used to establish an initial partition of the
                 graph's vertices. This distance matrix information is
                 then applied in a backtracking procedure to reduce the
                 search tree of possible mappings. While the algorithm
                 is not guaranteed to run in polynomial time, it
                 performs efficiently for a large class of graphs.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Slater:1976:DG,
  author =       "Peter J. Slater",
  title =        "${R}$-Domination in Graphs",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "446--450",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of finding a minimum $k$-basis of graph
                 $G$ is that of selecting as small a set B of vertices
                 as possible such that every vertex of $G$ is at
                 distance $k$ or less from some vertex in B. A linear
                 algorithm was previously developed to find a minimum
                 1-basis (a minimum dominating set) when $G$ is a tree.
                 In this paper the $k$-basis problem is placed in a more
                 general setting, and a linear algorithm is presented
                 that solves the problem for any forest.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Burge:1976:ABS,
  author =       "William H. Burge",
  title =        "An Analysis of Binary Search Trees Formed from
                 Sequences of Nondistinct Keys",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "451--454",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The expected depth of each key in the set of binary
                 search trees formed from all sequences composed from a
                 multiset is obtained, and hence the expected weight of
                 such trees. The expected number of left-to-right local
                 minima and the expected number of cycles in sequences
                 composed from a multiset are then deduced from these
                 results.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; information science;
                 mathematical techniques --- Trees",
}

@Article{Cash:1976:SIR,
  author =       "J. R. Cash",
  title =        "Semi-Implicit {Runge--Kutta} Procedures with Error
                 Estimates for the Numerical Integration of Stiff
                 Systems of Ordinary Differential Equations",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "455--460",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See comments and errata in \cite{Bui:1977:ECP}.",
  abstract =     "A-stable, semi-implicit Runge--Kutta procedures
                 requiring at most one Jacobian evaluation per time step
                 are developed for the approximate numerical integration
                 of stiff systems of ordinary differential equations. A
                 simple procedure for estimating the local truncation
                 error is described and, with the help of this estimate,
                 efficient integration procedures are derived. The
                 algorithms are illustrated by direct application to a
                 particular example.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Garey:1976:STN,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "Scheduling Tasks with Nonuniform Deadlines on Two
                 Processors",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "461--467",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Discrete.event.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Given a set of tasks, with each task having execution
                 time 1 and a deadline greater than 0, and a set of
                 precedence constraints which restrict allowable
                 schedules, the problem of determining whether there
                 exists a schedule using two processors in which each
                 task is completed before its deadline is examined. An
                 efficient algorithm for finding such a schedule,
                 whenever one exists, is given. The algorithm may also
                 be used to find the shortest such schedule. In addition
                 it is shown that the problem of finding a one-processor
                 schedule which minimizes the number of tasks failing to
                 meet their deadlines is NP-complete and, hence, is
                 likely to be computationally intractable.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Phuong:1976:SIP,
  author =       "Ta Huu Phuong",
  title =        "Solution of Integer Programs with a Quadratic
                 Objective Function",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "468--474",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A branch and bound method is presented for solving
                 problems in which the objective function is quadratic,
                 the constraints are linear, and some or all variables
                 are required to be integer. The algorithm is obtained
                 by grafting an inverse-basis version of Beale's method
                 onto the Land-Doig procedure. The code has been tested
                 on a computer, and computational results with various
                 strategies of branching are reported.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{Srinivasan:1976:LPC,
  author =       "V. Srinivasan",
  title =        "Linear Programming Computational Procedures for
                 Ordinal Regression",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "475--487",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The ordinal regression problem is an extension to the
                 standard multiple regression problem in terms of
                 assuming only ordinal properties for the dependent
                 variable while retaining the interval scale assumption
                 for independent (or predictor) variables. The linear
                 programming formulation for obtaining the regression
                 weights for ordinal regression is outlined and
                 computational improvements and alternatives which
                 utilize the special structure of this linear program
                 are developed and compared for their computational
                 efficiency and storage requirements. A procedure which
                 solves the dual of the original linear programming
                 formulation by the dual simplex method with upper
                 bounded variables, in addition to utilizing the special
                 structure of the constraint matrix from the point of
                 view of storage and computation, performs the best in
                 terms of both computational efficiency and storage
                 requirements. Using this special procedure, problems
                 with 100 observations and 4 independent variables take
                 less than one-half minute, on an average, on the IBM
                 360\slash 67. Results also show that the linear
                 programming solution procedure for ordinal regression
                 is valid.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming, linear",
}

@Article{Aho:1976:OCG,
  author =       "A. V. Aho and S. C. Johnson",
  title =        "Optimal Code Generation for Expression Trees",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "488--501",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:24:01 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "Also in {\em Proc. ACM Symp. on Theory of Computing},
                 pp. 207--217, 1975.",
  abstract =     "Algorithms are discussed which transform expression
                 trees into code for register machines. A necessary and
                 sufficient condition for optimality of such an
                 algorithm is derived, which applies to a broad class of
                 machines. A dynamic programming algorithm is then
                 presented which produces optimal code for any machine
                 in this class; this algorithm runs in time linearly
                 proportional to the size of the input.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "code generation; codes, symbolic; computer
                 programming",
}

@Article{Bruno:1976:CGO,
  author =       "John Bruno and Ravi Sethi",
  title =        "Code Generation for a One-Register Machine",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "502--510",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The majority of computers that have been built have
                 performed all computations in devices called
                 accumulators, or registers. It is shown that the
                 problem of generating minimal-length code for such
                 machines is hard in a precise sense; specifically it is
                 shown that the problem is NP-complete. The result is
                 true even when the programs being translated are
                 arithmetic expressions. Admittedly, the expressions in
                 question can become complicated.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "code generation; codes, symbolic; computer
                 programming",
}

@Article{Mickunas:1976:TLG,
  author =       "M. D. Mickunas and R. L. Lancaster and V. B.
                 Schneider",
  title =        "Transforming {LR($k$)} Grammars To {LR(1)}, {SLR(1)},
                 and (1,1) bounded right-context grammars",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "511--533",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A method is presented for directly transforming an
                 arbitrary LR(k) grammar to an equivalent LR(1) grammar.
                 It is further shown that the method transforms an
                 arbitrary prefix-free LR(k) grammar to an equivalent
                 LR(0) grammar. It is argued that the method is
                 efficient and offers some advantages over traditional
                 ``look-ahead'' parsing methods. Finally, it is
                 demonstrated that the method can be used to transform
                 an LR(1) grammar to an equivalent SLR(1) grammar, which
                 in turn can be easily transformed to an equivalent
                 (1,1) bounded right-context grammar.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Muller:1976:RAE,
  author =       "David E. Muller and Franco P. Preparata",
  title =        "Restructuring of Arithmetic Expressions For Parallel
                 Evaluation",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "534--543",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $E$ be an arithmetic expression involving $n$
                 variables, each of which appears just once, and the
                 possible operations of addition, multiplication, and
                 division. Although other cases are considered, when
                 these three operations take unit time the restructuring
                 algorithms presented in this paper yield evaluation
                 times no greater than $2.88 \log_2 (n + 1)$ and $2.08
                 \log_2 n$ for general expressions and division-free
                 expressions, respectively. The authors conjecture that
                 the present coefficients are the best possible, since
                 they have exhibited expressions which seem to require
                 these times within an additive constant. Upper bounds
                 are also given to the restructuring time of a given
                 expression $E$ and to the number of processors required
                 for its parallel evaluation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Papadimitriou:1976:CET,
  author =       "Christos H. Papadimitriou",
  title =        "On the Complexity of Edge Traversing",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "544--554",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that the Chinese Postman Problem, although
                 tractable in the totally directed and the totally
                 undirected cases, is NP-complete in the mixed case. A
                 simpler version of the same problem is shown
                 algorithmically equivalent to the max-flow problem with
                 unit edge capacities.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory --- Programming Theory; computer
                 programming; mathematical techniques --- Graph Theory",
}

@Article{Sahni:1976:CAP,
  author =       "Sartaj Sahni and Teofilo Gonzalez",
  title =        "${P}$-Complete Approximation Problems",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "555--565",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "For P-complete problems such as traveling salesperson,
                 cycle covers, $0$--$1$ integer programming,
                 multicommodity network flows, quadratic assignment,
                 etc., it is shown that the approximation problem is
                 also P-complete. In contrast with these results, a
                 linear time approximation algorithm for the clustering
                 problem is presented.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory --- Programming Theory; computer
                 programming; mathematical programming",
}

@Article{Yao:1976:LBM,
  author =       "Andrew Chi-Chih Yao and Foong Frances Yao",
  title =        "Lower Bounds on Merging Networks",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "3",
  pages =        "566--571",
  month =        jul,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let M$(m, n)$ be the minimum number or comparators
                 needed in an $(m, n)$-merging network. It is shown that
                 M$(m, n)$ greater than equivalent to $n(\lg(m + 1))/2$,
                 which implies that Batcher's merging networks are
                 optimal up to a factor of 2 plus epsilon for almost all
                 values of $m$ and $n$. The limit of M$(m, n)$/n as $n$
                 approaches infinity is determined to within 1.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Cody:1976:ERA,
  author =       "R. A. Cody and E. G. {Coffman, Jr.}",
  title =        "Errata: ``{Record} Allocation for Minimizing Expected
                 Retrieval Costs on Drum-Like Storage Devices''",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "572--572",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Cody:1976:RAM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Peterson:1976:TPL,
  author =       "G. E. Peterson",
  title =        "Theorem Proving with Lemmas",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "573--581",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 3 00:45:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ginsburg:1976:SCC,
  author =       "Seymour Ginsburg and Nancy Lynch",
  title =        "Size Complexity in Context-Free Grammar Forms",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "582--598",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Grammar forms are compared for their efficiency in
                 representing languages, as measured by the sizes of
                 interpretation grammars. For every regular set,
                 right-and left-linear forms are essentially equal in
                 efficiency. Any form for the regular sets provides, at
                 most, polynomial improvement over right-linear form.
                 Moreover, any polynomial improvement is attained by
                 some such form, at least on certain languages. Greater
                 improvement for some languages is possible using forms
                 expressing larger classes of languages than the regular
                 sets. However, there are some languages for which no
                 improvement over right-linear form is possible. While a
                 similar set of results holds for forms expressing
                 exactly the linear languages, only linear improvement
                 can occur for forms expressing all the context-free
                 languages.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Yakimovsky:1976:BOD,
  author =       "Yoram Yakimovsky",
  title =        "Boundary and Object Detection in Real World Images",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "599--618",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A computer solution to the problem of automatic
                 location of objects in digital pictures is presented. A
                 self-scaling local edge detector that can be applied in
                 parallel on a picture is described. Clustering
                 algorithms and sequential boundary following algorithms
                 process the edge data to local images of objects and
                 generate a data structure that represents the imaged
                 objects.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "image processing",
}

@Article{Eisner:1976:MTE,
  author =       "Mark J. Eisner and Dennis G. Severance",
  title =        "Mathematical Techniques for Efficient Record
                 Segmentation in Large Shared Databases",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "619--635",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is possible to significantly reduce the average
                 cost of information from a large shared database by
                 partitioning data items stored within each record into
                 a primary and a secondary record segment. An analytic
                 model, based upon knowledge of data item lengths,
                 transportation costs, and retrieval patterns, is
                 developed to assist an analyst with this assignment
                 problem. The model is generally applicable to
                 environments in which a database resides in secondary
                 storage, and is useful for both uniprogramming and
                 multiprogramming systems. A computationally tractable
                 record design algorithm has been implemented as a
                 Fortran program and applied to numerous problems.
                 Realistic examples are presented which demonstrate a
                 potential for reducing total system cost by more than
                 65 percent.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "vertical fragmentation",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems",
}

@Article{Heller:1976:AIM,
  author =       "D. E. Heller and D. K. Stevenson and J. F. Traub",
  title =        "Accelerated Iterative Methods for the Solution of
                 Tridiagonal Systems on Parallel Computers",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "636--654",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/ovr.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Iterative methods for the solution of tridiagonal
                 systems are considered, and a new iteration is
                 presented, whose rate of convergence is comparable to
                 that of the optimal two-cyclic Chebyshev iteration but
                 which does not require the calculation of optimal
                 parameters. The convergence rate depends only on the
                 magnitude of the elements of the tridiagonal matrix and
                 not on its dimension or spectrum. The theory also has a
                 natural extension to block tridiagonal systems.
                 Numerical experiments suggest that on a parallel
                 computer this new algorithm is the best of the
                 iterative algorithms considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; mathematical
                 techniques",
}

@Article{Bruno:1976:SJS,
  author =       "John L. Bruno",
  title =        "Sequencing Jobs with Stochastic Task Structures on a
                 Single Machine",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "655--664",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321978.321984",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A sequencing problem wherein there is a single
                 processor and a finite number of jobs needing service
                 is considered. Each job consists of a sequence of tasks
                 generated probabilistically by a finite state Markov
                 chain. Each state in the Markov chain is identified
                 with a task and has a service-time requirement and a
                 deferral cost, both of which are random variables. The
                 goal is to minimize the expected value of the sum of
                 the weighted finishing times of all the tasks. The
                 sequencing discipline is nonpreemptive. It is shown
                 that there exists an optimal priority sequencing rule
                 based on a rank defined for each task; an efficient
                 algorithm for calculating the rank is given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 912",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; operations research",
}

@Article{Gonzalez:1976:OSS,
  author =       "Teofilo Gonzalez and Sartaj Sahni",
  title =        "Open Shop Scheduling to Minimize Finish Time",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "665--679",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A linear time algorithm to obtain a minimum finish
                 time schedule for the two-processor open shop together
                 with a polynomial time algorithm to obtain a minimum
                 finish time preemptive schedule for open shops with
                 more than two processors are obtained. It is also shown
                 that the problem of obtaining minimum finish time
                 nonpreemptive schedules when the open shop has more
                 than two processors is NP-complete.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; operations research",
}

@Article{Rosberg:1976:MQE,
  author =       "Z. Rosberg and I. Adiri",
  title =        "Multilevel Queues with External Priorities",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "680--690",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321978.321986",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A single server serving $N$ priority classes (N being
                 finite or infinite) and working under an FB$_\infty$
                 regime is considered, namely, one in which the waiting
                 line consists of infinitely many separate queues
                 obeying the FIFO rule. Each priority class is assigned
                 to one of the queues. A customer from the $k$th
                 priority class (``k-customer'') in the $n$th queue is
                 eligible for $\Theta_n^k$ time units of service, at the
                 end of which he either departs, because his requirement
                 is satisfied, or joins the tail of the $(n + 1)$-th
                 queue. When a quantum of service is completed, the
                 server turns to the first customer in the lowest index
                 (highest priority) nonempty queue. The arrival process
                 of $k$-customers is assumed to be homogeneous Poisson,
                 and their service requirements are independent,
                 generally distributed, random variable. A set of
                 recursive linear equations is derived for the expected
                 flow time of a $k$-customer whose service requirement
                 is known, and some examples are discussed and presented
                 graphically.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  descriptors =  "Queueing system; priority; analysis",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Wegbreit:1976:VPP,
  author =       "Ben Wegbreit",
  title =        "Verifying Program Performance",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "691--699",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that specifications of program performance
                 can be formally verified. Formal verification
                 techniques, in particular, the method of inductive
                 assertions, can be adapted to show that a program's
                 maximum or mean execution time is correctly described
                 by specifications supplied with the program. To
                 formally establish the mean execution time, branching
                 probabilities are expressed using inductive assertions
                 which involve probability distributions. Verification
                 conditions are formed and proved which establish that
                 if the input distribution is correctly described by the
                 input specifications, then the inductive assertions
                 correctly describe the probability distributions of the
                 data during execution. Once the inductive assertions
                 are shown to be correct, branching probabilities are
                 obtained and mean computation time is computed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Hayes:1976:EFF,
  author =       "John P. Hayes",
  title =        "Enumeration of Fanout-Free {Boolean} Functions",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "700--709",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A solution to the problem of counting the number of
                 fanout-free Boolean functions of $n$ variables is
                 presented. The relevant properties of fanout-free
                 functions and circuits are summarized. The AND and OR
                 ranks of a fanout-free function is defined. Recursive
                 formulas for determining the number of distinct
                 functions of specified rank are derived. Based on
                 these, expressions are obtained for $\phi_D(n)$,
                 $phi_{N_D(n)}$, and $\phi(n)$, which denote the number
                 of degenerate, nondegenerate, and all $n$-variables
                 fanout-free functions, respectively. Simple
                 nonrecursive bounds on the various $\phi$ functions are
                 also computed and are used to determine some asymptotic
                 properties of the $\phi$ functions. It is shown that
                 for large $n$ almost all fanout-free functions are
                 nondegenerate, and that almost all unate functions are
                 not fanout-free. The relationship between the
                 fanout-free function enumeration problem and other
                 function enumeration problems in switching theory is
                 discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Even:1976:CPW,
  author =       "S. Even and R. E. Tarjan",
  title =        "A Combinatorial Problem Which Is Complete in
                 Polynomial Space",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "710--719",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A generalization, called the Shannon switching game on
                 vertices, of a familiar board game called Hex is
                 considered. It is shown that determining who wins such
                 a game if each player plays perfectly is very hard; in
                 fact, if this game problem is solvable in polynomial
                 time, then any problem solvable in polynomial space is
                 solvable in polynomial time. This result suggests that
                 the theory of combinatorial games is difficult.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques; probability --- Game Theory",
}

@Article{Lipton:1976:STH,
  author =       "R. J. Lipton and S. C. Eisenstat and R. A. DeMillo",
  title =        "Space and Time Hierarchies for Classes of Control
                 Structures and Data Structures",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "720--732",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Control structures and data structures are modeled by
                 directed graphs. In the control case nodes represent
                 executable statements and arcs represent possible flow
                 of control; in the data case nodes represent memory
                 locations and arcs represent logical adjacencies in the
                 data structure. Classes of graphs are compared by a
                 relation $\leq_{S,T}$ where $G \leq_{S,T} H$ if $G$ can
                 be embedded in $H$ with at most a $T$-fold increase in
                 distance between embedded nodes by making at most $S$
                 ``copies'' of any node in $G$. For both control
                 structures and data structures, $S$ and $T$ are
                 interpreted as space and time constants, respectively.
                 Results are presented that establish hierarchies with
                 respect to $\leq_{S,T}$ for data structures, sequential
                 program schemata normal forms, and sequential control
                 structures.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 731; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "control systems --- Theory; data processing --- Data
                 Structures; mathematical techniques",
}

@Article{VanEmden:1976:SPL,
  author =       "M. H. {Van Emden} and R. A. Kowalski",
  title =        "The Semantics of Predicate Logic as a Programming
                 Language",
  journal =      j-J-ACM,
  volume =       "23",
  number =       "4",
  pages =        "733--742",
  month =        oct,
  year =         "1976",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Sentences in first-order predicate logic can be
                 usefully interpreted as programs. In this paper the
                 operational and fixpoint semantics of predicate logic
                 programs are defined, and the connections with the
                 proof theory and model theory of logic are
                 investigated. It is concluded that operational
                 semantics is a part of proof theory and that fixpoint
                 semantics is a special case of model-theoretic
                 semantics.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; foundations; logical semantics;
                 prolog",
}

@Article{Johnson:1977:EAS,
  author =       "Donald B. Johnson",
  title =        "Efficient Algorithms for Shortest Paths in Sparse
                 Networks",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "1--13",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "(VBI-001010)",
  descriptors =  "Routing; shortest path",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilhelm:1977:GMP,
  author =       "Neil C. Wilhelm",
  title =        "A General Model for the Performance of Disk Systems",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "14--31",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/simulan.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A general queueing model for disk systems, which
                 incorporates the characteristics common to most disk
                 systems is introduced and used in the approximate
                 analyses of models of the IBM 2314 and 3330 disk
                 systems. Comparisons with simulation statistics show
                 that the approximations made are very good over a wide
                 range of arrival rates and system parameters. The
                 analytic results are also used to investigate
                 performance differences between devices.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data storage, magnetic; probability --- Queueing
                 Theory; queueing",
}

@Article{Horvath:1977:LAP,
  author =       "Edward C. Horvath and Shui Lam and Ravi Sethi",
  title =        "A Level Algorithm for Preemptive Scheduling",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "32--43",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A level algorithm that constructs optimal preemptive
                 schedules on identical processors when the task system
                 is a tree or when there are only two processors
                 available is adapted to handle processors of different
                 speeds. The new algorithm is optimal for independent
                 tasks on any number of processors and for arbitrary
                 task systems on two processors, but not on three or
                 more processors, even for trees. By taking the
                 algorithm as a heuristic on m processors and using the
                 ratio of the lengths of the constructed and optimal
                 schedules as a measure, an upper bound on its
                 performance is derived in terms of the speeds of the
                 processors.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Burstall:1977:TSD,
  author =       "R. M. Burstall and John Darlington",
  title =        "A Transformation System for Developing Recursive
                 Programs",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "44--67",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A system of rules for transforming programs is
                 described, with the programs in the form of recursion
                 equations. An initially very simple, lucid, and
                 hopefully correct program is transformed into a more
                 efficient one by altering the recursion structure.
                 Illustrative examples of program transformations are
                 given, and a tentative implementation is described.
                 Alternative structures for programs are shown, and a
                 possible initial phase for an automatic or
                 semiautomatic program manipulation system is
                 indicated.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; functional; recursive programs",
}

@Article{Goguen:1977:IAS,
  author =       "J. A. Goguen and J. W. Thatcher and E. G. Wagner and
                 J. B. Wright",
  title =        "Initial Algebra Semantics and Continuous Algebras",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "68--95",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:48:31 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/algebraic.spec.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "An early version is ``Initial Algebra Semantics'',
                 with James Thatcher, IBM T. J. Watson Research Center,
                 Report RC 4865, May 1974",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  checked =      "January 1988",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Graham:1977:PTA,
  author =       "Susan L. Graham",
  title =        "Papers from {Third ACM Symposium on Principles of
                 Programming Languages}",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "96--97",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:47:58 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Baker:1977:ASF,
  author =       "Brenda S. Baker",
  title =        "An Algorithm for Structuring Flowgraphs",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "98--120",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321992.321999",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is described which transforms a flowgraph
                 into a program containing control constructs such as if
                 then else statements, repeat (do forever) statements,
                 multilevel break statements (causing jumps out of
                 enclosing repeats), and multilevel next statements
                 (causing jumps to iterations of enclosing repeats). The
                 algorithm can be extended to create other types of
                 control constructs, such as while or until. The program
                 appears natural because the constructs are used
                 according to common programming practices. The
                 algorithm does not copy code, create subroutines, or
                 add new variables. Instead, goto statements are
                 generated when no other available control construct
                 describes the flow of control. The algorithm has been
                 implemented in a program called STRUCT which rewrites
                 Fortran programs using constructs such as while,
                 repeat, and if then else statements. The resulting
                 programs are substantially more readable than their
                 Fortran counterparts.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Loveman:1977:PIS,
  author =       "David B. Loveman",
  title =        "Program Improvement by Source-to-Source
                 Transformation",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "121--145",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The use of source-to-source program transformations
                 has proved valuable in improving program performance.
                 The concept of program manipulation is elucidated by
                 describing its role in both conventional optimization
                 and high level modification of conditional, looping,
                 and procedure structures. An example program fragment
                 written in an Algol-like language is greatly improved
                 by transformations enabled by a user-provided assertion
                 about a data array. A compilation model based on the
                 use of source-to-source program transformations is used
                 to provide a framework for discussing issues of code
                 generation, compilation of high level languages such as
                 APL, and eliminating overhead commonly associated with
                 modular structured programming. Application of the
                 compilation model to several different languages is
                 discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; optimization compilation",
}

@Article{Aho:1977:CGE,
  author =       "A. V. Aho and S. C. Johnson and J. D. Ullman",
  title =        "Code Generation for Expressions with Common
                 Subexpressions",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "146--160",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "functional",
}

@Article{Summers:1977:MLP,
  author =       "Phillip D. Summers",
  title =        "A Methodology for {LISP} Program Construction from
                 Examples",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "1",
  pages =        "161--175",
  month =        jan,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/colt.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An automatic programming system, THESYS, for
                 constructing recursive LISP programs for examples of
                 what they do is described. The construction methodology
                 is illustrated as a series of transformations from the
                 set of examples to a program satisfying the examples.
                 The transformations consist of (1) deriving the
                 specific computation associated with specific example,
                 (2) deriving control flow predicates, and (3) deriving
                 an equivalent program specification in the form of
                 recurrence relations. Equivalence between certain
                 recurrence relations and various program schemata is
                 proved. A detailed description of the construction of
                 four programs is presented to illustrate the
                 application of the methodology.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{deChampeaux:1977:IBH,
  author =       "Dennis de Champeaux and Lenie Sint",
  title =        "An Improved Bidirectional Heuristic Search Algorithm",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "177--191",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:54:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Boesch:1977:CPD,
  author =       "F. T. Boesch and J. F. Gimpel",
  title =        "Covering the Points of a Digraph with Point-Disjoint
                 Paths and Its Application to Code Optimization",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "192--198",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:18:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Rosenberg:1977:HSE,
  author =       "Arnold L. Rosenberg and Larry J. Stockmeyer",
  title =        "Hashing Schemes for Extendible Arrays",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "199--221",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 01 22:49:27 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Brandwajn:1977:QMM,
  author =       "Alexandre Brandwajn",
  title =        "A Queueing Model of Multiprogrammed Computer Systems
                 Under Full Load Conditions",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "222--240",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A queueing model of a multiprogrammed computer system
                 with virtual memory is presented. Two system
                 organizations are considered: (i) all the processes
                 present in the system share primary storage; (ii)
                 processes which have generated a file request (slow
                 I/O) lose their memory space until the I/O is
                 completed. The model assumes balanced memory allocation
                 among processes, and accounts for the memory sharing
                 effect through the use of lifetime functions. The model
                 explicitly takes into account the fact that, if a
                 written-onto page is to be replaced at the moment of a
                 page fault, it first has to be saved in the secondary
                 memory. An approximate closed form solution is obtained
                 by using an equivalence and decomposition approach. A
                 procedure for evaluating the accuracy of the
                 approximation is presented. The numerical examples
                 illustrate the influence of the system and program
                 behavior parameters taken into account.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Queueing system; decomposition",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; computer systems
                 programming --- Multiprogramming",
}

@Article{Hofri:1977:COB,
  author =       "Micha Hofri",
  title =        "On Certain Output-Buffer Management Techniques --- a
                 Stochastic Model",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "241--249",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A queueing-type model is used to analyze the storage
                 requirements of a component of a real-time data entry
                 system. The objectives and criteria of the buffer
                 management procedure are identified and related to the
                 variables of the model. Both infinite and finite
                 buffers are considered. The analysis is done
                 symbolically in part and numerically in part to
                 accommodate input processes that are peculiar to the
                 system. Techniques to obtain overflow probabilities are
                 described in detail. It is shown that creating a pool
                 of storage blocks for all the terminals is a better
                 policy than maintaining a separate buffer for each
                 station. The savings brought about by this policy are
                 remarkably insensitive to the characteristics of the
                 input process.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A queueing-type model is used to analyze the storage
                 requirements of a component of a real-time data entry
                 system. The objectives and criteria of the buffer
                 management procedure are identified and related to the
                 variables of the model. Both infinite and finite
                 buffers are considered. The analysis is done
                 symbolically in part and numerically in part to
                 accommodate input processes that are peculiar to the
                 system. Techniques to obtain overflow \ldots{}.",
  classification = "723",
  descriptors =  "Buffer length; overflow; method; real time; steady
                 state probability; memory management; bulk arrival",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Chandy:1977:PFL,
  author =       "K. Mani Chandy and John H. Howard and Donald F.
                 Towsley",
  title =        "Product Form and Local Balance in Queueing Networks",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "250--263",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 16:01:30 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1977.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A new property of queueing discipline, station
                 balance, seems to explain why some disciplines yield
                 product form solutions for queues and networks using
                 nonexponential service disciplines and other
                 disciplines do not. A queueing discipline satisfies
                 station balance if rates at which customers receive
                 service at each position of the queue are proportional
                 to the probability that a customer arrives at that
                 position. Station and local balance in \ldots{}.",
  descriptors =  "Exponential queueing network",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ibaraki:1977:PDR,
  author =       "Toshihide Ibaraki",
  title =        "The Power of Dominance Relations in Branch-and-Bound
                 Algorithms",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "264--279",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:37:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ibarra:1977:HAS,
  author =       "Oscar H. Ibarra and Chul E. Kim",
  title =        "Heuristic Algorithms for Scheduling Independent Tasks
                 on Nonidentical Processors",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "280--289",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:38:31 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hehner:1977:ICP,
  author =       "Eric C. R. Hehner",
  title =        "Information Content of Programs and Operation
                 Encoding",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "290--297",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:39:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Davis:1977:PCT,
  author =       "Philip J. Davis",
  title =        "Proof, Completeness, Transcendentals, and Sampling",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "298--310",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 01:40:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fiduccia:1977:AHL,
  author =       "C. M. Fiduccia and Y. Zalcstein",
  title =        "Algebras Having Linear Multiplicative Complexities",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "311--331",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:50:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hopcroft:1977:TVS,
  author =       "John Hopcroft and Wolfgang Paul and Leslie Valiant",
  title =        "On Time Versus Space",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "332--337",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:51:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Jones:1977:ESP,
  author =       "N. D. Jones and S. S. Muchnick",
  title =        "Even Simple Programs Are Hard to Analyze",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "2",
  pages =        "338--350",
  month =        apr,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:49:37 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/absint.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ballantyne:1977:APT,
  author =       "A. Michael Ballantyne and W. W. Bledsoe",
  title =        "Automatic Proofs of Theorems in Analysis Using
                 Nonstandard Techniques",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "353--374",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:18:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fayolle:1977:SOC,
  author =       "Guy Fayolle and Erol Gelenbe and Jacques Labetoulle",
  title =        "Stability and Optimal Control of the Packet Switching
                 Broadcast Channel",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "375--386",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The behavior of the broadcast channel for a packet
                 transmission operating in the slotted mode is analyzed
                 and optimized. Mathematical methods of Markov chain
                 theory are used to prove the inherent instability of
                 the system. If no control is applied, the effective
                 throughput of the system will tend to zero if the
                 population of user terminals is sufficiently large. Two
                 classes of control policies are examined; the first
                 acts on admissions to the channel from active
                 terminals, and the second modifies the retransmission
                 rate of packets. In each case sufficient conditions for
                 channel stability are given. Simulations illustrating
                 channel instability and the effect of the optimal
                 control are provided.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer networks; packet switching; switching
                 systems",
}

@Article{Hunt:1977:ECP,
  author =       "Harry B. {Hunt III} and Daniel J. Rosenkrantz",
  title =        "On Equivalence and Containment Problems for Formal
                 Languages",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "387--396",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:18:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Attar:1977:LFF,
  author =       "R. Attar and A. S. Fraenkel",
  title =        "Local Feedback in Full-Text Retrieval Systems",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "397--417",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In a full-text natural-language retrieval system,
                 local feedback is the process of formulating a new
                 improved search based on clustering terms from the
                 documents returned in a previous search of any given
                 query. Experiments were run on a database of US
                 patents. It is concluded that in contrast to global
                 clustering, where the size of matrices limits
                 applications to small databases and improvements are
                 doubtful, local clustering is practical also for large
                 databases and appears to improve overall performance,
                 especially if metrical constraints and weighting by
                 proximity are embedded in the local feedback. The local
                 methods adapt themselves to each individual search and
                 produce useful searchonyms --- terms which are
                 ``synonymous'' in the context of one query. Searchonyms
                 lead to new improved search formulations both via
                 manual and via automated feedback.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems; information science ---
                 Information Retrieval",
}

@Article{Bookstein:1977:ORA,
  author =       "Abraham Bookstein and Don Kraft",
  title =        "Operations Research Applied to Document Indexing and
                 Retrieval Decisions",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "418--427",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Earlier work is reviewed in which a model of word
                 occurrence formed the basis of a decision-making
                 procedure for indexing or, more generally, retrieving
                 documents in response to a request. In the earlier
                 work, words were considered individually. The earlier
                 model is extended to include interactions among terms.
                 The elaborated model allows one to decide whether to
                 retrieve a document by taking into consideration
                 occurrences of all the words in the text. Retrieval in
                 response to Boolean expressions is also considered, as
                 are procedures for ranking documents in accordance with
                 their assessed relevance to a request. The discussion
                 is within the framework of Bayesian decision theory.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901; 912",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "bibliographic information retrieval; information
                 science; operations research --- Applications",
}

@Article{Comer:1977:CTI,
  author =       "Douglas Comer and Ravi Sethi",
  title =        "The Complexity of Trie Index Construction",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "428--440",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Trie structures are a convenient way of indexing files
                 in which a key consists of a number of attributes.
                 Records correspond to leaves in the trie. Retrieval
                 proceeds by following a path from the root to a leaf,
                 the choice of edges being determined by attribute
                 values. The size of a trie for a file depends on the
                 order in which attributes are tested. It is shown that
                 determining minimal size tries is an NP-complete
                 problem for several variants of tries and that, for
                 tries in which leaf chains are deleted, determining the
                 trie for which average access time is minimal is also
                 an NP-complete problem. These results hold even for
                 files in which attribute values are chosen from a
                 binary or ternary alphabet.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Hwang:1977:OBS,
  author =       "K. Hwang and S. B. Yao",
  title =        "Optimal Batched Searching of Tree Structured Files in
                 Multiprocessor Computer Systems",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "441--454",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jan 17 16:24:11 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Parallel processing and batching techniques are used
                 to improve the response time of search algorithms for
                 high speed information processing in a multiprocessor
                 computer system (MPS) containing multiple processors
                 and multiple memory modules, all of which are under the
                 control of an integral operating system. It is
                 demonstrated that with proper processor assignment and
                 memory allocation the high order search trees are a
                 better access structure for either fixed or distributed
                 batch searching of a large number of records as an
                 online process in an overlapped fashion. It is shown
                 that the optimal tree order is sensitive to the file
                 size, to the batch size or batch distribution, and to
                 the processor\slash memory number in an MPS. Contrary
                 to previous results, binary search trees are shown to
                 be not necessarily optimal for use in many
                 multiprocessing applications. Two simple optimization
                 algorithms are developed to determine the optimal tree
                 order for either fixed size batch or distributed
                 batched searching processes based on a small set of
                 system parameters. Necessary and sufficient conditions
                 are also found for which batched binary searching is
                 still optimal as an asymptotic sense.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Lipton:1977:LTA,
  author =       "R. J. Lipton and L. Snyder",
  title =        "A Linear Time Algorithm for Deciding Subject
                 Security",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "455--464",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A particular protection mechanism from the protection
                 literature --- the take and grant system --- is
                 presented. For this particular mechanism, it is shown
                 that the safety problem can be solved in linear time.
                 Moreover, the security policies that this mechanism can
                 enforce, are characterized.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing",
}

@Article{Lin:1977:DPG,
  author =       "Benjamin W. Y. Lin and Ronald L. Rardin",
  title =        "Development of a Parametric Generating Procedure for
                 Integer Programming Test Problems",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "465--472",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:39:30 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kou:1977:LDA,
  author =       "Lawrence T. Kou",
  title =        "On Live-Dead Analysis for Global Data Flow Problems",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "473--483",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:42:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reynolds:1977:SDF,
  author =       "John C. Reynolds",
  title =        "Semantics of the Domain of Flow Diagrams",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "484--503",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  checked =      "18 June 1990",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wegbreit:1977:CSI,
  author =       "Ben Wegbreit",
  title =        "Complexity of Synthesizing Inductive Assertions",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "504--512",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:43:48 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hyafil:1977:CPE,
  author =       "L. Hyafil and H. T. Kung",
  title =        "The Complexity of Parallel Evaluation of Linear
                 Recurrences",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "513--521",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 09:54:59 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/conc.scientific.computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lipton:1977:WPS,
  author =       "Richard J. Lipton and Yechezkel Zalcstein",
  title =        "Word Problems Solvable in Logspace",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "522--526",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:53:54 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Krause:1977:EAS,
  author =       "K. L. Krause and V. Y. Shen and H. D. Schwetman",
  title =        "Errata: ``{Analysis} of Several Task-Scheduling
                 Algorithms for a Model of Multiprogramming Computer
                 Systems''",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "3",
  pages =        "527--527",
  month =        jul,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:50:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Krause:1975:AST}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Shostak:1977:SIM,
  author =       "Robert E. Shostak",
  title =        "On the {SUP-INF} Method for Proving {Presburger}
                 Formulas",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "529--543",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:50:23 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{DeMillo:1977:SSM,
  author =       "R. A. DeMillo and K. Vairavan and E. Sycara-Cyranski",
  title =        "A Study of Schedules as Models of Synchronous Parallel
                 Computation",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "544--565",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:18:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Maekawa:1977:QMC,
  author =       "Mamoru Maekawa",
  title =        "Queueing Models for Computer Systems Connected by a
                 Communication Line",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "566--582",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A system consisting of two identical computer systems
                 connected by a communication line is analyzed by using
                 queueing theory to obtain the turnaround time
                 distribution, the traffic intensity between the two
                 computer systems, and the intertransfer time
                 distribution. The analysis is carried out under the
                 assumptions of Poisson arrivals and exponential service
                 times. The queue discipline analyzed is
                 first-come-first-served with queue adjustments on both
                 job arrivals and completions. The results indicate that
                 the turnaround times are more dispersed in networks
                 than in centralized systems. Another queue discipline,
                 still first-come-first-served but with queue
                 adjustments only on job completions, is analyzed for
                 the traffic intensity between the computer systems. The
                 result shows that the queue discipline with queue
                 adjustments only on job completions produces much less
                 traffic for a high input traffic rate than the one with
                 queue adjustments on both job arrivals and completions.
                 Simulation results suggest that the above observation
                 holds independent of the form of interarrival and
                 service time distributions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer networks; probability --- Queueing Theory",
}

@Article{Lynch:1977:LSR,
  author =       "Nancy Lynch",
  title =        "Log Space Recognition and Translation of Parenthesis
                 Languages",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "583--590",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sun Nov 06 22:18:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Blake:1977:BBB,
  author =       "Ian F. Blake and Alan G. Konheim",
  title =        "Big Buckets Are (Are Not) Better!",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "591--606",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/bin-packing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yu:1977:AER,
  author =       "C. T. Yu and W. S. Luk",
  title =        "Analysis of Effectiveness of Retrieval in Clustered
                 Files",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "607--622",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of multiple key retrieval using clustered
                 search is considered. a probabilistic model which
                 allows the estimation of the ratio of the number of
                 desired records in one cluster to that of another is
                 presented. An analysis of the ratio is made under
                 variations of different parameters of the model. The
                 results provide guidelines for the rejection of a
                 cluster under appropriate situations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Bui:1977:ECP,
  author =       "T. D. Bui",
  title =        "Errata and Comments on a Paper by {J. R. Cash}",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "623--623",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:52:32 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Cash:1976:SIR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sahasrabudhe:1977:SFI,
  author =       "S. E. Sahasrabudhe and A. D. Kulkarni",
  title =        "On Solving {Fredholm} Integral Equations of the First
                 Kind",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "624--629",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Nov 1 22:52:16 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kinariwala:1977:FSA,
  author =       "Bharat Kinariwala and A. G. Rao",
  title =        "Flow Switching Approach to the Maximum Flow Problem:
                 {I}",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "630--645",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:56:49 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Omahen:1977:CBM,
  author =       "Kenneth J. Omahen",
  title =        "Capacity Bounds for Multiresource Queues",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "646--663",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:40:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hirschberg:1977:ALC,
  author =       "Daniel S. Hirschberg",
  title =        "Algorithms for the Longest Common Subsequence
                 Problem",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "664--675",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Dec 10 15:57:11 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Das:1977:MRF,
  author =       "Shawpawn Kumar Das",
  title =        "A Machine Representation of Finite ${T}_0$
                 Topologies",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "676--692",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 2 23:53:47 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Young:1977:OAP,
  author =       "Paul Young",
  title =        "Optimization Among Provably Equivalent Programs",
  journal =      j-J-ACM,
  volume =       "24",
  number =       "4",
  pages =        "693--700",
  month =        oct,
  year =         "1977",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Nov 03 22:29:17 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Perl:1978:FTD,
  author =       "Y. Perl and Y. Shiloach",
  title =        "Finding Two Disjoint Paths Between Two Pairs of
                 Vertices in a Graph",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "1--9",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:57:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Logrippo:1978:REM,
  author =       "Luigi Logrippo",
  title =        "Renamings and Economy of Memory in Program Schemata",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "10--22",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:58:12 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Book:1978:SRC,
  author =       "Ronald V. Book",
  title =        "Simple Representations of Certain Classes of
                 Languages",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "23--31",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:58:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hunt:1978:LBR,
  author =       "Harry B. {Hunt, III} and Thomas G. Szymanski",
  title =        "Lower Bounds and Reductions Between Grammar Problems",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "32--51",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:59:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Hunt:1978:CLB}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Attar:1978:KLT,
  author =       "R. Attar and Y. Choueka and N. Dershowitz and A. S.
                 Fraenkel",
  title =        "Kedma --- Linguistic Tools for Retrieval Systems",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "52--66",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In a full-text natural-language retrieval system,
                 frequent need for automatic linguistic analysis arises,
                 e.g. for keyword expansion in a search process, content
                 analysis, or automatic construction of concordances.
                 The availability of sophisticated linguistic tools,
                 which is highly desirable for languages such as
                 English, is quite imperative for, say, Semitic
                 languages, whose complex morphological structure
                 renders simple-minded and approximate solutions such as
                 suffix stripping totally useless. Sophisticated tools
                 were designed and constructed via the fusion of
                 grammatical analysis and grammatical synthesis,
                 resulting in a set of global files which provide in
                 some sense a complete grammatical and lexical
                 description of the language. These files induce a set
                 of local files which adapt to the database at hand and
                 permit flexible on-line morphological analysis.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information retrieval systems",
}

@Article{Cooper:1978:FPU,
  author =       "W. S. Cooper and M. E. Maron",
  title =        "Foundations of Probabilistic and Utility-Theoretic
                 Indexing",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "67--80",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "One of the most perplexing problems of information
                 retrieval has been the establishment of rational
                 criteria for deciding what index terms or descriptors
                 to assign to a unit of stored information for purposes
                 of later retrieval. Both probabilistic and
                 utility-theoretic criteria have in the past been
                 proposed for this purpose. The present paper derives
                 explicit decision rules of both kinds from a common
                 conceptual and mathematical foundation. The result is a
                 unified theory of indexing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Sameh:1978:SPL,
  author =       "A. H. Sameh and D. J. Kuck",
  title =        "On Stable Parallel Linear System Solvers",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "81--91",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:01:00 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  keywords =     "linear system; nla; prll",
}

@Article{Gonzalez:1978:PSU,
  author =       "Teofilo Gonzalez and Sartaj Sahni",
  title =        "Preemptive Scheduling of Uniform Processor Systems",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "92--101",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An $O(n)$ time algorithm is presented to obtain an
                 optimal finish time preemptive schedule for $n$
                 independent tasks on $m$ uniform processors. This
                 algorithm assumes that the tasks are initially ordered
                 by task length and that the uniform processors are
                 ordered by processor speed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; computer systems
                 programming",
}

@Article{Galil:1978:LTL,
  author =       "Zvi Galil and Joel Seiferas",
  title =        "A Linear-Time On-Line Recognition Algorithm for
                 ``Palstar''",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "102--111",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:02:09 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Gentleman:1978:SCR,
  author =       "W. Morven Gentleman",
  title =        "Some Complexity Results for Matrix Computations on
                 Parallel Processors",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "112--115",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:02:36 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/conc.scientific.computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Ibarra:1978:RBM,
  author =       "O. H. Ibarra",
  title =        "Reversal-Bounded Multicounter Machines and Their
                 Decision Problems",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "116--133",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:02:57 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/traces.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "For some variants of two-way multicounter machines the
                 paper investigates the decidability of the emptiness,
                 infiniteness, disjointness, containment, universe, and
                 equivalence problems. In particular, it shows
                 decidability of these problems for deterministic
                 two-way multicounter machines whose input and counters
                 are reversal-bounded.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lewis:1978:RSC,
  author =       "Harry R. Lewis",
  title =        "Renaming a Set of Clauses as a {Horn} Set",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "134--135",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:03:45 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Schnorr:1978:SQC,
  author =       "C. P. Schnorr",
  title =        "Satisfiability is Quasilinear Complete in {NQL}",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "136--145",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:04:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Seiferas:1978:SNT,
  author =       "Joel I. Seiferas and Michael J. Fischer and Albert R.
                 Meyer",
  title =        "Separating Nondeterministic Time Complexity Classes",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "146--167",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:04:55 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wand:1978:NIR,
  author =       "Mitchell Wand",
  title =        "A new Incompleteness Result for {Hoare}'s System",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "168--175",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Horvath:1978:SSA,
  author =       "Edward C. Horvath",
  title =        "Stable Sorting in Asymptotically Optimal Time and
                 Extra Space",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "177--199",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that a stable sorting algorithm may be
                 derived directly from a stable merging algorithm. A
                 definition is presented of the concept of a contiguent,
                 and shows that a contiguent-forming algorithm may be
                 used as the basis for a stable merging algorithm. A
                 class of contiguent-forming algorithms which exhibit a
                 space\slash time tradeoff is presented. In the
                 extremes, one algorithm in the class gives rise to a
                 stable merge requiring $O(N)$ time and $O(N \log N)$
                 bits of extra space; another algorithm requires $O(N
                 \log N)$ time and $O(\log N)$ bits of extra space to
                 merge. A description is given of the Stable Kronrod
                 Merge, which requires $O(N)$ time and $O(\log N)$ bits
                 of extra space, but is not applicable to all cases. How
                 the Stable Kronrod Merge may be combined with
                 contiguent-forming algorithms to yield a generally
                 applicable class of stable merging algorithms is
                 outlined.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming",
}

@Article{Rivest:1978:OAK,
  author =       "Ronald L. Rivest",
  title =        "Optimal Arrangement of Keys in a Hash Table",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "200--209",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "when open addressing is used to resolve collisions in
                 a hash table, a given set of keys may be arranged in
                 many ways; typically this depends on the order in which
                 the keys are inserted. It is shown that arrangements
                 minimizing either the average or worst-cast number of
                 probes required to retrieve any key in the table can be
                 found using an algorithm for the assignment problem.
                 The worst-case retrieval time can be reduced to
                 $O(\log_2(M))$ with probability $1 - \epsilon(M)$ when
                 storing $M$ keys in a table of size M, where
                 $\epsilon(M)$ goes to $0$ as $M$ goes to infinity. Also
                 examined are insertion algorithms to see how to apply
                 these ideas for a dynamically changing set of keys.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Yu:1978:EAI,
  author =       "C. T. Yu and G. Salton and M. K. Siu",
  title =        "Effective Automatic Indexing Using Term Addition and
                 Deletion",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "210--225",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In information retrieval indexing is the task
                 consisting of the assignment to stored records and
                 incoming information requests of content identifiers
                 capable of representing record or query content. If the
                 indexing is performed automatically and the records are
                 written documents, an initial set of index terms might
                 be chosen by taking words extracted from document
                 titles or abstracts; this initial term assignment might
                 then be improved by adding related terms chosen from a
                 thesaurus, by deleting extraneous or marginal terms,
                 and by replacing single terms by term combinations and
                 phrases. Formal proofs are given of the retrieval
                 effectiveness under well-defined conditions of indexing
                 policies based on the use of single terms, term
                 additions and deletions, and term combinations or
                 phrases.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "information science",
}

@Article{Baudet:1978:AIM,
  author =       "G\'erard M. Baudet",
  title =        "Asynchronous Iterative Methods for Multiprocessors",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "226--244",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/dai.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A class of asynchronous iterative methods is presented
                 for solving a system of equations. Existing iterative
                 methods are identified in terms of asynchronous
                 iterations, and new schemes are introduced
                 corresponding to a parallel implementation on a
                 multiprocessor system with no synchronization between
                 cooperating processes. A sufficient condition is given
                 to guarantee the convergence of any asynchronous
                 iterations, and results are extended to include
                 iterative methods with memory. Asynchronous iterative
                 methods are then evaluated from a computational point
                 of view, and bounds are derived for the efficiency. The
                 bounds are compared with actual measurements obtained
                 by running various asynchronous iterations on a
                 multiprocessor, and the experimental results show
                 clearly the advantage of purely asynchronous iterative
                 methods.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; computer systems
                 programming",
}

@Article{Kung:1978:AAF,
  author =       "H. T. Kung and J. F. Traub",
  title =        "All Algebraic Functions Can Be Computed Fast",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "245--260",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Sep 08 17:07:02 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.1.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The expansions of algebraic functions can be computed
                 ``fast'' using the Newton Polygon Process and any
                 ``normal'' iteration. Let $M(j)$ be the number of
                 operations sufficient to multiply two $j$th-degree
                 polynomials. It is shown that the first $N$ terms of an
                 expansion of any algebraic function defined by an
                 $n$th-degree polynomial can be computed in $O(nM(N))$
                 operations, while the classical method needs $O(N^n)$
                 operations. Among the numerous applications of
                 algebraic functions are symbolic mathematics and
                 combinatorial analysis. Reversion, reciprocation, and
                 $n$th root of a polynomial are all special cases of
                 algebraic functions.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{McKie:1978:ESF,
  author =       "William McKie",
  title =        "An Example of a Skewing Function",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "261--265",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In the interactive computer-aided design of shapes, it
                 is often advantageous to distort a well-known function
                 so that it more closely represents the desired shape.
                 The shape is then compactly describable by the original
                 function and some parameter associated with the amount
                 of distortion. General characteristics of a function
                 which will skew a two-dimensional function are
                 described. A specific example of one of these skewing
                 functions is then presented and discussed. It is
                 compared to skewing functions of more limited scope,
                 and the results of distortion using the proposed
                 skewing function are presented in several plots.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer aided design; computer graphics",
}

@Article{Mulvey:1978:PSP,
  author =       "John M. Mulvey",
  title =        "Pivot Strategies for Primal-Simplex Network Codes",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "266--270",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Techniques are presented for improving the efficiency
                 of primal-simplex network codes. An adaptive candidate
                 list, enumerating the pivot variables, is provided.
                 Proper use of this list greatly reduces computation
                 time (especially in large-scale network problems) and
                 experimental data is included. It is again shown that
                 the number of iterations, i.e. pivots, is a poor
                 surrogate for measuring the performance of
                 primal-simplex network algorithms.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming, linear",
}

@Article{Musser:1978:EPI,
  author =       "David R. Musser",
  title =        "On the Efficiency of a Polynomial Irreducibility
                 Test",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "271--282",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:09:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Omahen:1978:AAD,
  author =       "K. Omahen and V. Marathe",
  title =        "Analysis and Applications of the Delay Cycle for the
                 {M/M/C} Queueing System",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "283--303",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The method of analysis employing decomposition of busy
                 periods has, in various forms, been applied to the
                 M/G/1 queueing system under a variety of scheduling
                 rules. This work extends the technique of decomposition
                 of busy periods in order to deal with the M/M/c
                 queueing system. Particular attention is given to a
                 special busy period referred to as a ``delay cycle''.
                 The delay cycle commences with a delay period (of
                 general distribution) in which jobs arrive but are not
                 serviced; at the conclusion of the delay period,
                 processing begins and continues until the system is
                 empty. Closed form solutions are obtained for various
                 entities such as distribution of busy period length and
                 expected waiting time conditioned on the type of busy
                 period in progress at the time of job arrival. These
                 results are applied and extended to the analysis of six
                 examples of multiprocessor systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems, digital --- Multiprocessing;
                 probability",
}

@Article{Zoltners:1978:DDB,
  author =       "Andris A. Zoltners",
  title =        "A Direct Descent Binary Knapsack Algorithm",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "304--311",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A direct descent algorithm for the binary knapsack
                 problem is presented. The problem variables are entered
                 into a list according to decreasing (increasing)
                 contribution\slash resource ratios. The variables are
                 examined in descending order until one of several
                 fathoming conditions establishes that further descent
                 is not necessary. A backtrack up the list ensues,
                 followed by a subsequent descent. This pattern
                 continues until the optimum is located. This strategy
                 has two advantages: (1) A linear programming bound is
                 available at each point, and (2) the search is easily
                 managed; in fact, the current position in the search is
                 completely characterized by the set of variables fixed
                 at 1 and the index of the variable being examined.
                 Since the binary knapsack usually has many incumbents,
                 a reduction is incorporated into the search. Results
                 are examined.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "integer programming; mathematical programming",
}

@Article{Jones:1978:CFM,
  author =       "Neil D. Jones and Steven S. Muchnick",
  title =        "The Complexity of Finite Memory Programs with
                 Recursion",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "312--321",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In order to study the effects of recursion on the
                 complexity of program analysis, a finite memory machine
                 with recursive calls is defined, as well as two
                 parameter passing mechanisms which extend the power of
                 the language. Close upper and lower bounds on the
                 complexity of determining whether a program accepts the
                 empty language are given for each of the three program
                 models. It is shown that such questions as acceptance
                 of the empty set, equivalence, and so on are
                 intractable even for these relatively simple
                 programs.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Maier:1978:CSP,
  author =       "David Maier",
  title =        "The Complexity of Some Problems on Subsequences and
                 Supersequences",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "322--336",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Dec 16 07:28:59 1998",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  comment =      "A subsequence of $S = s_1 s_2 \ldots s_n$ is any
                 sequence $S$ with some number of the $n$ elements
                 deleted. It is shown that a yes/no version of the
                 longest common subsequence problem is NP-complete for
                 sequences over an alphabet of size two. It is also
                 shown that a yes/no version of the shortest common
                 superstring problem is NP-complete for sequences over
                 an alphabet of size five.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Yao:1978:HBT,
  author =       "Andrew C. Yao and Ronald L. Rivest",
  title =        "$k + 1$ Heads Are Better than $k$",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "337--340",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:12:34 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Harrison:1978:AGR,
  author =       "Harrison and Rubin",
  title =        "Another Generalization of Resolution",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "341--351",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:13:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Landweber:1978:PCF,
  author =       "L. H. Landweber and E. L. Robertson",
  title =        "Properties of Conflict-Free and Persistent {Petri}
                 Nets",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "2",
  pages =        "352--364",
  month =        apr,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:13:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Kafura:1978:ADM,
  author =       "D. G. Kafura and V. Y. Shen",
  title =        "An Algorithm to Design the Memory Configuration of a
                 Computer Network",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "365--377",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A model of a minicomputer network which consists of an
                 arbitrary number of identical processors is considered.
                 Each processor in the network has a fixed, though
                 possibly different sized, private memory. The network
                 processes a set of tasks with known execution times and
                 memory requirements. One of the problems a designer of
                 such a network must solve is to determine the memory
                 sizes for such a system. Algorithms to determine the
                 memory configuration are presented and analyzed using
                 worst-case bounds and computer simulation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer networks; computers, miniature",
}

@Article{Rao:1978:PAC,
  author =       "Gururaj S. Rao",
  title =        "Performance Analysis of Cache Memories",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "378--395",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/distmem.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Using the Independent Reference assumption to model
                 program behavior, the performance of different buffer
                 organizations (Fully Associative, Direct Mapping, Set
                 Associative, and Sector) are analyzed: (1) The
                 expressions for their fault rate are derived. To show
                 more explicitly the dependence of the fault rate on the
                 factors that affect it, distribution-free upper bounds
                 on fault rates are computed for the Direct Mapping, Set
                 Associative, and Sector buffers. The use of such bounds
                 is illustrated in the case of the Direct Mapping
                 buffer. (2) The performance of the buffers for FIFO and
                 Random Replacement are shown to be identical. (3) It is
                 possible to restructure programs to take advantage of
                 the basic organization of the buffers. The effect of
                 such restructuring is quantified for the Direct Mapping
                 buffer. It is shown that the performance of the Direct
                 Mapping buffer under near-optimal restructuring is
                 comparable to the performance of the Fully Associative
                 buffer. Further, the effect of this restructuring is
                 shown to be potentially stronger than that of buffer
                 replacement algorithms.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; memory hierarchy;
                 Performance Evaluation: Analytic",
}

@Article{Rotem:1978:GBT,
  author =       "Doron Rotem and Y. L. Varol",
  title =        "Generation of Binary Trees from Ballot Sequences",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "396--404",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:15:25 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Sudborough:1978:TCD,
  author =       "I. H. Sudborough",
  title =        "On the Tape Complexity of Deterministic Context-Free
                 Languages",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "405--414",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:37:56 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wilf:1978:GBA,
  author =       "Herbert S. Wilf",
  title =        "A Global Bisection Algorithm for Computing the Zeros
                 of Polynomials in the Complex Plane",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "415--420",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:16:26 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{McKellar:1978:DPR,
  author =       "A. C. McKellar and C. K. Wong",
  title =        "Dynamic Placement of Records in Linear Storage",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "421--434",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/bin-packing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Allocation of space in a linear storage medium is
                 considered when space must be allocated dynamically as
                 customers arrive. A heuristic is proposed for this
                 problem and for a simple model of the resulting
                 reference sequence, we show that the average distance
                 between consecutive references is asymptotically
                 7n\slash 30, where $n$ is the size of the storage. For
                 optimal static placement where one waits for all
                 arrivals before any space allocation, the average
                 distance is shown to be asymptotically 7n\slash 30. For
                 random placement, the average distance is
                 asymptotically n/3. Thus, the heuristic is
                 asymptotically optimal in a strong sense. For
                 reasonable values of $n$, it is shown that the
                 heuristic is nearly as good as optimal static placement
                 and much better than random placement.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Garfinkel:1978:BTS,
  author =       "R. S. Garfinkel and K. C. Gilbert",
  title =        "The Bottleneck Traveling Salesman Problem:
                 {Algorithms} and Probabilistic Analysis",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "435--448",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:17:50 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Iglehart:1978:RSR,
  author =       "Donald L. Iglehart and Gerald S. Shedler",
  title =        "Regenerative Simulation of Response Times in Networks
                 of Queues",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "449--460",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Nov 09 18:43:00 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Although much progress has been made in obtaining
                 solutions for queueing network models of computer
                 systems, relatively little has been made in determining
                 the response time distributions in such models.
                 \ldots{} The authors extend the regenerative method to
                 response time processes by marking a job and using an
                 expanded state space to assure that one can obtain
                 regeneration points for the marked job's response time
                 process.",
  descriptors =  "Simulation; response time; distribution; queueing
                 network; independent cycles; model",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Hoare:1978:SPP,
  author =       "C. A. R. Hoare",
  title =        "Some Properties of Predicate Transformers",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "461--480",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:18:37 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Butler:1978:ADF,
  author =       "Jon T. Butler",
  title =        "Analysis and Design of Fanout-Free Networks of
                 Positive Symmetric Gates",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "481--498",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm is presented for assigning functions to
                 gates in a fanout-free network so that a given function
                 is realized. Since the method is tabular, it is easily
                 programmed. As long as the gates used are symmetric and
                 positive the synthesis technique can be tailored to the
                 particular set of gates available, for example, AND,
                 OR, and majority gates. It is shown that the functions
                 realized by such networks are a proper subset of the
                 set of unate functions but not of threshold functions.
                 Also, it is shown that the fanout-free functions that
                 are threshold realizable are exactly those realized by
                 the cascade, a special case of the fanout-free
                 network.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "logic circuits; logic devices --- Gates",
}

@Article{Garey:1978:SNC,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "``Strong'' {NP}-Completeness Results: {Motivation},
                 Examples, and Implications",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "499--508",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:20:13 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Pippenger:1978:TST,
  author =       "Nicholas Pippenger",
  title =        "A Time-Space Trade-Off",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "509--515",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:20:49 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Itai:1978:SMP,
  author =       "Alon Itai and Michael Rodeh and Steven L. Tanimoto",
  title =        "Some Matching Problems for Bipartite Graphs",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "517--525",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 16 10:53:25 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Certain applications require finding a perfect
                 matching in a bipartite graph that satisfies some
                 additional properties. For one such type of restriction
                 the problem is proven to be NP-complete. If for a
                 single subset of edges no more than r edges may be
                 included in the matching then an $O(n e)$ algorithm is
                 given. An efficient algorithm for finding all perfect
                 matchings is presented. It requires $O(e)$ time per
                 matching and a total of $O(e)$ space. This algorithm
                 may be used to calculate the permanent of a matrix.
                 Finally, the algorithm is generalized to find all
                 maximum matchings. These results are applicable to
                 marching problems that arise in several areas of
                 automatic data processing.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing; mathematical techniques",
}

@Article{Allen:1978:SOB,
  author =       "Brian Allen and Ian Munro",
  title =        "Self-Organizing Binary Search Trees",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "526--535",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 16 10:53:22 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Heuristics are considered which attempt to maintain a
                 binary search tree in a near optimal form, assuming
                 that elements are requested with fixed, but unknown,
                 independent probabilities. A ``move to root'' heuristic
                 is shown to yield an expected search time within a
                 constant factor of that of an optimal static binary
                 search tree. On the other hand, a closely related
                 ``simple exchange'' technique is shown not to have this
                 property. The rate of convergence of the move to root
                 heuristic is discussed. Also considered is the more
                 general case in which elements not in the tree may have
                 nonzero probability of being requested.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing; mathematical techniques --- Trees",
}

@Article{Bentley:1978:ANM,
  author =       "J. L. Bentley and H. T. Kung and M. Schkolnick and C.
                 D. Thompson",
  title =        "On the Average Number of Maxima in a Set of Vectors
                 and Applications",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "536--543",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 16 10:58:45 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/78.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A maximal vector of a set is one which is not less
                 than any other vector in all components. A recurrence
                 relation is derived for computing the average number of
                 maximal vectors in a set of $n$ vectors in $d$-space
                 under the assumption that all $(n!)^d$ relative
                 orderings are equally probable. Solving the recurrence
                 shows that the average number of maxima is $O((\ln
                 n)^{d 1})$ for fixed $d$. This result is used to
                 construct an algorithm for finding all the maxima that
                 have expected running time linear in $n$ (for sets of
                 vectors drawn under these assumptions). The result is
                 then used to find an upper bound on the expected number
                 of convex hull points in a random point set.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming, dynamic",
}

@Article{Guibas:1978:AHT,
  author =       "Leo J. Guibas",
  title =        "The Analysis of Hashing Techniques that Exhibit
                 $k$-ary Clustering",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "544--555",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The performance of hashing algorithms is related to
                 the notion of clustering, that is, the pile-up
                 phenomenon that occurs because many keys may probe the
                 table locations in the same sequence. A hashing
                 technique is said to exhibit $k$-ary clustering if the
                 search for a key begins with $k$ independent random
                 probes and the subsequent sequence of probes is
                 completely determined by the location of the $k$
                 initial probes. Such techniques may be very bad; for
                 instance, the average number of probes necessary for
                 insertion may grow linearly with the table size.
                 However, on the average (that is if the permutations
                 describing the method are randomly chosen), $k$-ary
                 clustering techniques for $k$ greater than 1 are very
                 good. In fact the average performance is asymptotically
                 equivalent to the performance of uniform probing, a
                 method that exhibits no clustering and is known to be
                 optimal in a certain sense.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; hashing
                 algorithms; information science",
}

@Article{Johnson:1978:LBS,
  author =       "Donald B. Johnson and Samuel D. Kashdan",
  title =        "Lower Bounds for Selection in ${X} + {Y}$ and Other
                 Multisets",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "556--570",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:24:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Crespi-Reghizzi:1978:NCF,
  author =       "S. Crespi-Reghizzi and G. Guida and D. Mandrioli",
  title =        "Noncounting Context-Free Languages",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "571--580",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The class of noncounting (aperiodic) context-free
                 parenthesis languages is introduced here and is found
                 to extend the classical theory of noncounting regular
                 languages. It is proved that it is possible to decide
                 whether or not a context-free parenthesis grammar is
                 noncounting. The class of $k$-distinct-homogeneous
                 grammars (previously introduced in connection with
                 studies on grammatical inference or language
                 acquisition) is rigorously defined and proved to be
                 noncounting. It is argued that the noncounting model
                 fits the syntactic aspects of natural or artificial
                 languages more closely than the context-free model.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Brent:1978:FAM,
  author =       "R. P. Brent and H. T. Kung",
  title =        "Fast Algorithms for Manipulating Formal Power Series",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "581--595",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322092.322099",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/auto.diff.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The classical algorithms require order $n^3$
                 operations to compute the first $n$ terms in the
                 reversion of a power series or the composition of two
                 series, and order $n^2 \log n$ operations if the fast
                 Fourier transform is used for power series
                 multiplication. It is shown that the composition and
                 reversion problems are equivalent (up to constant
                 factors), and we give algorithms which require only
                 order $(n \log n)^{3/2}$ operations. In many cases of
                 practical importance only order $n \log n$ operations
                 are required; these include certain special functions
                 of power series and power series solution of certain
                 differential equations. Applications to root-finding
                 methods which use inverse interpolation and to queueing
                 theory are described, some results on multivariate
                 power series are stated, and several open questions are
                 mentioned.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Itai:1978:TCF,
  author =       "Alon Itai",
  title =        "Two-Commodity Flow",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "596--611",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:25:25 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lawler:1978:PSU,
  author =       "E. L. Lawler and J. Labetoulle",
  title =        "On Preemptive Scheduling of Unrelated Parallel
                 Processors by Linear Programming",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "612--619",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "It is shown that certain problems of optimal
                 preemptive scheduling of unrelated parallel processors
                 can be formulated and solved as linear programming
                 problems. As a by-product of the linear programming
                 formulations of these problems, upper bounds are
                 obtained on the number of preemptions required for
                 optimal schedules. In particular it is shown that no
                 more than $O(m^2)$ preemptions are necessary, in order
                 to schedule $n$ jobs on m unrelated processors so as to
                 minimize makespan.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems, digital; mathematical programming,
                 linear",
}

@Article{Vantilborgh:1978:EAE,
  author =       "Hendrik Vantilborgh",
  title =        "Exact Aggregation in Exponential Queueing Networks",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "620--629",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Aggregation is often used for the investigation of
                 large systems. This technique is particularly
                 attractive for nearly completely decomposable systems.
                 It is essentially an approximate method, but it remains
                 attractive since the error is small and bounds for it
                 can be obtained. The condition under which aggregation
                 will, in an exponential queueing network with a single
                 type of customer, yield exact results is derived and
                 discussed. It is shown how this result can be of use
                 for the parameterized investigation of subnetworks.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  descriptors =  "Queueing network; product form; aggregation",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Brand:1978:PCP,
  author =       "Daniel Brand",
  title =        "Path Calculus in Program Verification",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "630--651",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A method for proving and disproving properties of
                 programs is described. Its main features are:
                 recursively defined procedures can be used in
                 assertions; loop invariants are not necessary; absence
                 of run time errors is proven; counterexamples to
                 incorrect programs can be given. Experience with the
                 method's implementation is reported.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; program verification",
}

@Article{Downey:1978:ACA,
  author =       "Peter J. Downey and Ravi Sethi",
  title =        "Assignment Commands with Array References",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "652--666",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Straight line programs with assignment statements
                 involving both simple and array variables are
                 considered. Two such programs are equivalent if they
                 compute the same values as a function of the inputs.
                 Testing the equivalence of array programs is shown to
                 be NP-hard. If array variables are updated but never
                 subsequently referenced, equivalence can be tested in
                 polynomial time. Programs without array variables can
                 be tested for equivalence in expected linear time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Sethi:1978:CEE,
  author =       "Ravi Sethi",
  title =        "Conditional Expressions with Equality Tests",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "667--674",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Oct 27 00:28:04 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Arvillias:1978:PPC,
  author =       "A. C. Arvillias and D. G. Maritsas",
  title =        "Partitioning the Period of a Class of $m$-Sequences
                 and Application to Pseudorandom Number Generation",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "4",
  pages =        "675--686",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322092.322106",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A criterion is derived for the ``$q$-equipartition''
                 of the period of $m$-sequences based on primitive
                 trinomials (PT's), $1 + D^q + D^p$. It is shown that
                 the class of PT's with $q = 2^t$, where $t$ is an
                 integer, can be implemented efficiently so as to
                 produce in parallel $q$ phase-shifted versions of the
                 same $m$-sequence with relative delays analytically
                 evaluated. These implementations lead to the
                 construction of efficient algorithms for the generation
                 of $q$-bit pseudorandom number sequences equivalent in
                 correlation performance to the Tausworthe-type
                 generators. The algorithms are of the GFSR type. The
                 advantage of utilizing the specific class of PT's is
                 that the initialization procedures is not required. The
                 corresponding linear recurrences directly yield coding
                 for the generators which deliver $q$-bit number
                 sequences uncorrelated over a length approximately
                 equal to $(2^p 1)/q$. It is important that three
                 members of this class, of degrees $p = 127, 175, 521$,
                 respectively, are Mersenne prime.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical statistics",
}

@Article{Hunt:1978:CLB,
  author =       "H. B. {Hunt, III} and T. G. Szymanski",
  title =        "Corrigendum: ``{Lower} Bounds and Reductions Between
                 Grammar Problems''",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "687--688",
  month =        oct,
  year =         "1978",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:26:59 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See \cite{Hunt:1978:LBR}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Parchmann:1979:CSM,
  author =       "Rainer Parchmann",
  title =        "Control System Model for Critically Timed Sources",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "1--5",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 22:21:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Parchmann:1980:CCS}.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Smith:1979:CSP,
  author =       "Alan Jay Smith",
  title =        "Characterizing the Storage Process and its Effect on
                 the Update of Main Memory by Write Through",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "6--27",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of multiple, nonidentical copies of the
                 same data in computer systems with both local cache and
                 shared main memory has led some manufacturers to use
                 ``write-through'' updating for main memory despite some
                 known efficiency advantages favoring ``swap'' updating.
                 It is proposed that write throughs to main memory be
                 buffered, thus reducing the probability that the CPU
                 will have to wait for a main memory write operation to
                 take place. Statistics on the nonstationary point
                 process of stores to memory lead to a model in which
                 the sequence of stores is considered to be described by
                 a Poisson process which proceeds at rate $\lambda_i$
                 for a fraction of time $\beta_i$. This type of process
                 has been described as a regime process. Values for
                 $\lambda_i$ and $\beta_i$ are obtained by (least
                 squares) fitting the distribution function for the
                 number of stores per 100 memory cycles. This model is a
                 model for the effect of the storage process on
                 write-through updating, but is not a model of the
                 storage process itself. The model is then used to
                 estimate the frequency of blocking in a computer system
                 using a finite queue to buffer write-through
                 operations. The predicted frequency of blocking is
                 found to agree well with the actual frequency of
                 blocking as determined by trace driven simulation.
                 Comparisons are made with swap updating.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Architectures; computer operating systems; memory
                 hierarchy; Performance Evaluation: Queueing",
}

@Article{Gupta:1979:BSC,
  author =       "Udaiprakash Gupta",
  title =        "Bounds on Storage for Consecutive Retrieval",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "28--36",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A file with m permissible queries (that are known a
                 priori) can be partitioned into $2^m$-disjoint bins,
                 each consisting of exactly those records that are
                 pertinent to one specific set of queries, and not
                 pertinent to the remaining queries. A generalized
                 version of the consecutive retrieval organization (CRO)
                 called $f$-graph CRO (one in which redundancy of
                 records and explicit pointers are permitted) is
                 examined. It is shown that any $f$-graph CRO requires
                 at least one-half $m 2^{m - 1}$ bin occurrences. With
                 some additional restrictions on the structure of the
                 acyclic organization, the lower bound can be tightened
                 to $4/7 m 2^{m - 1}$. An $f$-graph CRO which requires
                 only $9/16 m 2^{m - 1}$ bin occurrences is also
                 exhibited and it is shown that with a broad class of
                 $f$-graph CRO's, it is not possible to do any better.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing --- File Organization; information
                 science",
}

@Article{Mendelzon:1979:AMD,
  author =       "Alberto O. Mendelzon",
  title =        "On Axiomatizing Multivalued Dependencies in Relational
                 Databases",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "37--44",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A complete set of inference rules for deriving
                 multivalued dependencies in a relational database has
                 recently been presented. The questions of independence
                 and redundancy of these rules are investigated and all
                 minimal complete subsets of the proposed set are
                 determined.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems",
}

@Article{Reiss:1979:SDC,
  author =       "Steven P. Reiss",
  title =        "Security in Databases; a Combinatorial Study",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "45--57",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Security is considered in the context of an abstract
                 model of a database where queries involving the mean or
                 median of a privileged field are allowed. For this
                 model, the method of limiting the number and types of
                 queries that can be asked of such a database is
                 considered as a means for providing statistical access
                 while insuring that no individual data are compromised.
                 The resultant questions are primarily combinatorial in
                 nature and are interesting in themselves.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems; data processing --- Security of
                 Data",
}

@Article{Galil:1979:FSA,
  author =       "Zvi Galil and Nimrod Megiddo",
  title =        "A Fast Selection Algorithm and the Problem of Optimum
                 Distribution of Effort",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "58--64",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:02:06 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Lemme:1979:SPA,
  author =       "James M. Lemme and John R. Rice",
  title =        "Speedup in Parallel Algorithms for Adaptive
                 Quadrature",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "65--71",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A fast metalgorithm is described for adaptive
                 quadrature on a MIMD (Multiple Instruction, Multiple
                 Data) parallel computer and show that its speedup is at
                 least constant times $M / \log M$ using a total of $M$
                 processors.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer processing",
}

@Article{Rodrigue:1979:OER,
  author =       "Garry H. Rodrigue and Niel K. Madsen and Jack I.
                 Karush",
  title =        "Odd-Even Reductions for Banded Linear Equations",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "72--81",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:03:29 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Fishman:1979:EMC,
  author =       "George S. Fishman and Louis R. Moore",
  title =        "Estimating the Mean of a Correlated Binary Sequence
                 with an Application to Discrete Event Simulation",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "82--94",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A procedure is discussed for interval estimation of
                 the mean $\Theta$ of a correlated binary $(0, 1)$
                 sequence. The proposed method can be applied to
                 simulation data that are not intrinsically binary in
                 nature. The procedure is applied to interval estimation
                 of the waiting time distribution in a simulation of the
                 M/M/1 queue with activity level 0.9 for $\Theta = 0.1$
                 and $0.5$. The proposed method works well. For $\Theta
                 = 0.9$ results show some degradation. An error analysis
                 leads to a set of recommendations for keeping
                 performance in practice close to the desired
                 theoretical levels. Algorithms are described for
                 computing the critical quantities upon which the
                 proposed method relies.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Simulation; time series analysis; correlation; M/M/1",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer simulation",
}

@Article{Papadimitriou:1979:OFF,
  author =       "Christos H. Papadimitriou",
  title =        "Optimality of the Fast {Fourier} Transform",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "95--102",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:05:08 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Savitch:1979:TBR,
  author =       "Walter J. Savitch and Michael J. Stimson",
  title =        "Time Bounded Random Access Machines with Parallel
                 Processing",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "103--118",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 16 10:59:12 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The RAM model of S. A. Cook and R. A. Reckhow is
                 extended to allow parallel recursive calls and the
                 elementary theory of such machines is developed. The
                 uniform cost criterion is used. The results include
                 proofs of (1) the equivalence of nondeterministic and
                 deterministic polynomial time for such parallel
                 machines and (2) the equivalence of polynomial time on
                 such parallel machines and polynomial space on ordinary
                 nonparallel RAM's. Also included are results showing
                 that parallelism appears to be strictly more powerful
                 than nondeterminism.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems programming; computer systems,
                 digital",
}

@Article{Cherniavsky:1979:CCH,
  author =       "John C. Cherniavsky and Samuel N. Kamin",
  title =        "A Complete and Consistent {Hoare} Axiomatics for a
                 Simple Programming Language",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "119--128",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A simple programming language $L_m$ is defined for
                 which a complete axiomatics is obtainable. Completeness
                 is shown by presenting a relatively complete Hoare
                 axiomatics, demonstrating, by direct construction, that
                 the first-order theory of addition $P_+$ is expressive,
                 and noting that $P_+$ is complete. It is then shown
                 that $L_m$ is maximal with this property. Further, a
                 notion of complexity of a Hoare system is introduced
                 based upon the lengths of proofs (disregarding proofs
                 in the underlying logic), and the system $L_m$, $P_+$
                 is shown to have polynomial complexity. The notion is
                 shown to be nontrivial by presenting a language for
                 which any Hoare axiom system has exponential
                 complexity.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  conference =   "ACM Symp on Princ of Program Lang, 5th, Pap",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
  meetingaddress = "Tucson, AZ, USA",
  meetingdate =  "Jan 23--25 1978",
  meetingdate2 = "01/23--25/78",
}

@Article{Clarke:1979:PLC,
  author =       "Edmund Melson {Clarke, Jr.}",
  title =        "Programming Language Constructs for Which It Is
                 Impossible To Obtain Good {Hoare} Axiom Systems",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "129--147",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Hoare axiom systems for establishing partial
                 correctness of programs may fail to be complete because
                 of (a) incompleteness of the assertion language
                 relative to the underlying interpretation or (b)
                 inability of the assertion language to express the
                 invariants of loops. S. A. Cook has shown that if there
                 is a complete proof system for the assertion language
                 (i.e. all true formulas of the assertion language) and
                 if the assertion language satisfies a natural
                 expressibility condition then a sound and complete
                 axiom system for a large subset of Algol may be
                 devised. Programming language constructs are exhibited
                 for which it is impossible to obtain sound and complete
                 sets of Hoare axioms even in this special sense of
                 Cook's. These constructs include (i) recursive
                 procedures with procedure parameters in a programming
                 language which uses static scope of identifiers and
                 (ii) coroutines in a language which allows
                 parameterless recursive procedures. Modifications of
                 these constructs for which sound and complete systems
                 of axioms may be obtained are also discussed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  conference =   "ACM Symp on Princ of Program Lang, 5th, Pap",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
  meetingaddress = "Tucson, AZ, USA",
  meetingdate =  "Jan 23--25 1978",
  meetingdate2 = "01/23--25/78",
}

@Article{Berry:1979:MOC,
  author =       "G\'erard Berry and Jean-Jacques L\'evy",
  title =        "Minimal and Optimal Computations of Recursive
                 Programs",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "148--175",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "J. Vuillemin's results on optimal computations of
                 recursive programs are generalized. New syntactic
                 results are obtained by considering spaces of
                 derivations instead of terms. The results apply to
                 classes of interpretations more general than the
                 sequential interpretations of Vuillemin.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  conference =   "ACM Symp on Princ of Program Lang, 5th, Pap",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
  meetingaddress = "Tucson, AZ, USA",
  meetingdate =  "Jan 23--25 1978",
  meetingdate2 = "01/23--25/78",
}

@Article{Hwang:1979:ARM,
  author =       "F. K. Hwang",
  title =        "An {$O(n \log n)$} Algorithm for Rectilinear Minimal
                 Spanning Tree",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "177--182",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $P$ be a set of points in the plane with
                 rectilinear distance. An $O(n \log n)$ algorithm for
                 the construction of a Voronoi diagram for $P$ is given.
                 By using previously known results, a minimal spanning
                 tree for $P$ can be derived from a Voronoi diagram for
                 $P$ in linear time.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; mathematical techniques ---
                 Trees",
}

@Article{Lueker:1979:LTA,
  author =       "George S. Lueker and Kellogg S. Booth",
  title =        "A Linear Time Algorithm for Deciding Interval Graph
                 Isomorphism",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "183--195",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A graph is an interval graph if and only if each of
                 its vertices can be associated with an internal on the
                 real line in such a way that two vertices are adjacent
                 in the graph exactly when the corresponding intervals
                 have a nonempty intersection. An efficient algorithm
                 for testing isomorphism of interval graphs is
                 implemented using a data structure called a PQ-tree.
                 The algorithm runs in $O(n + e)$ steps for graphs
                 having $n$ vertices and $e$ edges. It is shown that for
                 a somewhat larger class of graphs, namely the chordal
                 graphs, isomorphism is as hard as for general graphs.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; mathematical techniques --- Graph
                 Theory",
}

@Article{Bolour:1979:OPM,
  author =       "Azad Bolour",
  title =        "Optimality Properties of Multiple-Key Hashing
                 Functions",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "196--210",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An analysis of the achievable efficiency of retrieval
                 algorithms based on hashing for answering partial-match
                 queries is presented. The remarkable power of hashing
                 in limiting the search of a given key value in a file
                 is well known. Similarly, it is possible to avoid
                 searching major portions of a file in answering
                 partial-match or multiattribute queries by hashing a
                 multiattribute file into a number of buckets.
                 Multiple-key hashing is a simple procedure for doing so
                 and works by combining the effects of a number of
                 hashing functions, one for each attribute in a record.
                 By using a measure of retrieval efficiency in which
                 queries specifying the same set of attributes are given
                 equal weight, it is shown that multiple-key hashing
                 often provides about the most efficient means of
                 partitioning a file for the purpose of answering
                 partial-match queries.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Brown:1979:FMA,
  author =       "Mark R. Brown and Robert E. Tarjan",
  title =        "A Fast Merging Algorithm",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "211--226",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm that merges sorted lists represented as
                 height-balanced binary trees is given. If the lists
                 have lengths $m$ and $n$ ($m \leq n$) then the merging
                 procedure runs in $O(m \log(n/m))$ steps, which is the
                 same order as the lower bound on all comparison-based
                 algorithms for this problem.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Fussenegger:1979:CAL,
  author =       "Frank Fussenegger and Harold N. Gabow",
  title =        "A Counting Approach to Lower Bounds for Selection
                 Problems",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "227--238",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Lower bounds are derived on the number of comparisons
                 to solve several well-known selection problems. Among
                 the problems are finding the $t$ largest elements of a
                 given set in order $(W_t)$; finding the $s$ smallest
                 and $t$ largest elements in order $(W_{s,t})$; and
                 finding the $t$-th largest element $(V_t)$. The results
                 follow from bounds for more general selection problems,
                 where an arbitrary partial order is given. The bounds
                 for $W_t$ and $V_t$ generalize to the case where
                 comparisons between linear functions of the input are
                 allowed. The approach is to show that a comparison tree
                 for a selection problem contains a number of trees for
                 smaller problems, thus establishing a lower bound on
                 the number of leaves. An equivalent approach uses an
                 adversary, based on a numerical ``chaos'' function that
                 measures the number of unknown relations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; mathematical techniques ---
                 Trees",
}

@Article{Kacewicz:1979:IKS,
  author =       "Boleslaw Kacewicz",
  title =        "Integrals with a Kernel in the Solution of Nonlinear
                 Equations in ${N}$ Dimensions",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "239--249",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:13:20 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Traub:1979:CCN,
  author =       "J. F. Traub and H. Wo{\'z}niakowski",
  title =        "Convergence and Complexity of {Newton} Iteration for
                 Operator Equations",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "250--258",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An optimal convergence condition for Newton iteration
                 in a Banach space is established. It is shown that
                 there exist problems for which the iteration converges
                 but the complexity is unbounded. Thus for actual
                 computation convergence is not enough. What stronger
                 condition must be imposed to also assure ``good
                 complexity'' is shown.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Gelenbe:1979:OCI,
  author =       "Erol Gelenbe",
  title =        "On the Optimum Checkpoint Interval",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "259--270",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "One of the basic problems related to the efficient and
                 secure operation of a transaction oriented file or
                 database system is the choice of the checkpoint
                 interval. It is shown that the optimum checkpoint
                 interval (i.e. the time interval between successive
                 checkpoints which maximizes system availability) is a
                 function of the load of the system. It is proved that
                 the total operating time of the system (and not the
                 total real time) between successive checkpoints should
                 be a deterministic quantity in order to maximize the
                 availability. An explicit expression for this time
                 interval is obtained. The results are a significant
                 departure from previous work where load independent
                 results have been obtained. A rigorous analysis of the
                 queueing process related to the requests for
                 transaction processing arriving at the system is also
                 presented, and the ergodicity conditions for the system
                 are proved.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "database systems",
}

@Article{Iglehart:1979:RSI,
  author =       "Donald L. Iglehart and Peter A. W. Lewis",
  title =        "Regenerative Simulation with Internal Controls",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "271--282",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322123.322132",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "A new variance reduction technique called internal
                 control variables is introduced. This technique is to
                 be used in regenerative simulations. The idea is to
                 identify a sequence of control random variables, each
                 one defined within a regenerative cycle, whose mean can
                 be calculated analytically. These controls should be
                 highly correlated with the usual quantities observed in
                 a regenerative simulation. This correlation reduces the
                 variance of the estimate for the parameter of interest.
                 Numerical examples are included for the waiting time
                 process of an M/M/1 queue and for several Markov
                 chains.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 922",
  descriptors =  "Simulation; control variable; independent cycles;
                 M/M/1; Markov process",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer simulation; probability --- Queueing Theory",
}

@Article{Kowaltowski:1979:DSC,
  author =       "Tomasz Kowaltowski",
  title =        "Data Structures and Correctness of Programs",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "283--301",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A technique for proving correctness of programs
                 manipulating data structures is proposed. Its three
                 major components are: (i) an abstract representation of
                 the data structures called free state description
                 (FSD), (ii) a set of propositions which allow
                 transformations of such FSD's, and (iii) semantics of
                 assignment statements in terms of FSD transformations.
                 The technique provides a framework for rigorous proofs
                 about programs manipulating data structures with
                 arbitrary sharing of pointers and circularities.
                 Examples of applications include the
                 Deutsch--Schorr--Waite marking algorithm. A graphical
                 interpretation of proofs is sketched to illustrate the
                 intuitive concepts hidden behind this technique. The
                 method extends the one devised by R. M. Burstall by
                 allowing arbitrary data structures.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; data processing --- Data
                 Structures",
}

@Article{Milne:1979:CPT,
  author =       "George Milne and Robin Milner",
  title =        "Concurrent Processes and Their Syntax",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "302--321",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/CLiCS.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A mathematical model of concurrent computation is
                 presented. Starting from synchronized communication as
                 the only primitive notion, a process is defined as a
                 set of communication capabilities. The domain of
                 processes is built using the weak powerdomain
                 construction of M. Smyth. A minimal set of operations
                 for composing processes is defined. These operations
                 suggest a corresponding minimal syntax --- the language
                 of flowgraphs --- in which to specify these
                 compositions. The concept of flow algebra is defined;
                 processes and flowgraphs are examples of flow algebras.
                 It is shown that processes are a flow algebra, and
                 therefore constitute a suitable semantics for
                 flowgraphs. However, it is emphasized that the notion
                 of flowgraph evolved from the notion of process and not
                 the reverse.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; pcalc semantics domains",
}

@Article{Rosen:1979:DFA,
  author =       "Barry K. Rosen",
  title =        "Data Flow Analysis for Procedural Languages",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "322--344",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Global analysis and optimization techniques presuppose
                 local data flow information about the effects of
                 program statements on the values associated with names.
                 For procedure calls this information is not immediately
                 available but can presumably be obtained through flow
                 analysis of procedure bodies. Accurate information
                 proves to be surprisingly difficult to obtain. A
                 language independent formulation of the problem, an
                 interprocedural data flow algorithm, and a proof that
                 the algorithm is correct are presented. Symbolic data
                 flow analysis is introduced in the course of optimizing
                 the algorithm: We move much of the work outside of a
                 loop by manipulating partially evaluated symbolic
                 expressions for the data within the loop. Foundational
                 difficulties are revealed when the theory of data flow
                 analysis is extended to support extensive optimization
                 of procedural language programs: Several widespread
                 assumptions become false or ambiguous. A few of the
                 problems are resolved here. Inductive arguments are
                 facilitated by a simple path tree representation of
                 control flow that allows for both recursion and side
                 effects.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
}

@Article{Culik:1979:PHC,
  author =       "K. {Culik, II}",
  title =        "A Purely Homomorphic Characterization of Recursively
                 Enumerable Sets",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "345--350",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Characterizations of recursively enumerable sets as
                 mappings of equality and minimal sets are given. An
                 equality (minimal) set is the set of all (minimal)
                 solutions of an instance of the Post correspondence
                 problem where the solutions are viewed as strings. The
                 main result is that every recursively enumerable set
                 can be expressed (effectively) as a homomorphic image
                 of a minimal set. From the algebraic point of view this
                 seems to be the simplest characterization of
                 recursively enumerable languages. A corollary of the
                 main result is the solution of an open problem
                 formulated by A. Salomaa. A purely homomorphic
                 characterization of regular sets is derived. How such a
                 characterization can be obtained for various time and
                 space complexity classes for languages is outlined.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory; computer programming languages",
}

@Article{Shostak:1979:PDP,
  author =       "Robert E. Shostak",
  title =        "A Practical Decision Procedure for Arithmetic with
                 Function Symbols",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "351--360",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/Constr.logic.prog.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A practical procedure is presented for an extension of
                 quantifier-free Presburger arithmetic that permits
                 arbitrary uninterpreted predicate and function symbols.
                 This theory includes many of the formulas one tends to
                 encounter in program verification and is powerful
                 enough to encode the semantics of array operators as
                 well as MAX, MIN, and ABSVALUE. An implementation of
                 the procedure has proved to be of great value in a
                 program verification system developed at SRI for the
                 United States Air Force.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; program verification",
}

@Article{Pippenger:1979:RAC,
  author =       "Nicholas Pippenger and Michael J. Fischer",
  title =        "Relations Among Complexity Measures",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "361--381",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322123.322138",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Various computational models (such as machines and
                 combinational logic networks) induce various and, in
                 general, different computational complexity measures.
                 Relations among these measures are established by
                 studying the ways in which one model can ``simulate''
                 another. It is shown that a machine with
                 $k$-dimensional storage tapes (respectively, with
                 tree-structured storage media) can be simulated on-line
                 by a machine with one-dimensional storage tapes in time
                 $O(n^{2 - 1 / k})$ respectively, in time $O(n^2 / \log
                 n)$. An oblivious machine is defined to be one whose
                 head positions, as functions of time, are independent
                 of the input, and it is shown that any machine with
                 one-dimensional tapes can be simulated on-line by an
                 oblivious machine with two one-dimensional tapes in
                 time $O(n \log n)$. All of these results are the best
                 possible, at least insofar as on-line simulation is
                 concerned. By similar methods it is shown that $n$
                 steps of the computation of an arbitrary machine with
                 one-dimensional tapes can be performed by a
                 combinational logic network of cost $O(n \log n)$ and
                 delay $O(n)$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Anonymous:1979:CPF,
  author =       "Anonymous",
  title =        "Corrigendum: ``{Papers} from the {Fourth ACM Symposium
                 on Principles of Programming Languages}''",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "2",
  pages =        "382--382",
  month =        apr,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 23:27:02 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Henschen:1979:TPC,
  author =       "L. J. Henschen",
  title =        "Theorem Proving by Covering Expressions",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "385--400",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:22:21 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Cohen:1979:TAD,
  author =       "Jacques Cohen and Timothy Hickey",
  title =        "Two Algorithms for Determining Volumes of Convex
                 Polyhedra",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "401--414",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Determining volumes of convex $n$-dimensional
                 polyhedra defined by a linear system of inequalities is
                 useful in program analysis. Two methods for computing
                 these volumes are proposed: (1) summing the volumes of
                 simplices which form the polyhedron, and (2) summing
                 the volumes of (increasingly smaller) parallelepipeds
                 which can be fit into the polyhedron. Assuming that
                 roundoff errors are small, the first method is
                 analytically exact whereas the second one converges to
                 the exact solution at the expense of additional
                 computer time. Examples of polyhedra whose volumes were
                 computed by programs representing the algorithms are
                 also provided.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Lee:1979:OAF,
  author =       "D. T. Lee and F. P. Preparata",
  title =        "An Optimal Algorithm for Finding the Kernel of a
                 Polygon",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "415--421",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The kernel $K(P)$ of a simple polygon $P$ with $n$
                 vertices is the locus of the points internal to $P$
                 from which all vertices of $P$ are visible.
                 Equivalently, $K(P)$ is the intersection of appropriate
                 half-planes determined by the polygon's edges. Although
                 it is known that to find the intersection of $n$
                 generic half-planes requires time $O(n \log n)$, it is
                 shown that one can exploit the ordering of the
                 half-planes corresponding to the sequence of the
                 polygon's edges to obtain a kernel finding algorithm
                 which runs in time $O(n)$ and is therefore optimal.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Tai:1979:TTC,
  author =       "Kuo-Chung Tai",
  title =        "The Tree-to-Tree Correction Problem",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "422--433",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The tree-to-tree correction problem is to determine,
                 for two labeled ordered trees $T$ and $T'$, the
                 distance from $T$ to $T'$ as measured by the minimum
                 cost sequence of edit operations needed to transform T
                 into $T'$. The edit operations investigated allow
                 changing one node of a tree into another node, deleting
                 one node from a tree, or inserting a node into a tree.
                 An algorithm which solves this problem is presented.
                 Possible applications are to the problems of measuring
                 the similarity between trees, automatic error recovery
                 and correction for programming languages, and
                 determining the largest common substructure of two
                 trees.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages; data processing",
}

@Article{Manacher:1979:SIH,
  author =       "Glenn K. Manacher",
  title =        "Significant Improvements to the {Hwang-Lin} Merging
                 Algorithm",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "434--440",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The Hwang-Lin merging algorithm is the best
                 general-purpose merging algorithm that has been found.
                 Many improvements to it have been devised, but these
                 are either for special values of $m$ and $n$, the
                 number of items being merged, or else improvements by a
                 term less than linear in $n + m$ when the ratio $n / m$
                 is fixed. A new methodology is developed in which, for
                 fixed ratio $n / m$, it is possible to decrease the
                 number of comparisons by a factor proportional to $m$,
                 in fact $m / 12$, provided $n / m \geq 8$ and $m \geq
                 24$. It is shown that the coefficient $1/12$ is not
                 best possible, and a technique for improving it
                 slightly to $31 / 336$ is sketched.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; computer systems programming ---
                 Merging",
}

@Article{Manacher:1979:FJS,
  author =       "Glenn K. Manacher",
  title =        "The {Ford-Johnson} Sorting Algorithm Is Not Optimal",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "441--456",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "One way of expressing the efficiency of a sorting
                 algorithm is in terms of the number of pairwise
                 comparisons required in the worst case to sort t items.
                 The most efficient algorithm known is that of L. R.
                 Ford and S. B. Johnson [FJA], which achieves the
                 ``information-theoretic'' lower bound $[\log t]$ for $1
                 \leq t \leq 11$ and $21 \leq t \leq 22$. No value of
                 $t$ has been discovered for which $S(t)$ less than
                 $F(t)$, where $S(t)$ is the smallest number of
                 comparisons required and $F(t)$ is the number of
                 comparisons required by the FJA. It has been uncertain
                 since the FJA first appeared in 1959 whether it is
                 optimal in the sense that $F(t)$ equals $S(t)$ for all
                 $t$. It is shown that this is not the case, and it is
                 shown constructively how to compute infinitely many
                 $t$, $t \geq 189$, for which $F(t) - S(t) = kt - O(\log
                 t)$ for positive $k$. No algorithm is known that will
                 sort $t$ items with fewer comparisons than the FJA for
                 any $t$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; computer systems programming ---
                 Sorting",
}

@Article{Strong:1979:SWP,
  author =       "H. R. Strong and G. Markowsky and A. K. Chandra",
  title =        "Search Within a Page",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "457--482",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Three families of strategies for organizing an index
                 of ordered keys are investigated. It is assumed either
                 that the index is small enough to fit in main memory or
                 that some superstrategy organizes the index into pages
                 and that search within a page is being studied.
                 Examples of strategies within the three families are
                 B-tree Search, Binary Search, and Square Root Search.
                 The expected access times of these and other strategies
                 are compared, and their relative merits in different
                 indexing situations are discussed and conjectured on.
                 Considering time and space costs and complexity of
                 programming, it is concluded that a Binary Search
                 strategy is generally preferable.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 901",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing --- Data Structures; information
                 retrieval systems",
}

@Article{Bui:1979:SSS,
  author =       "T. D. Bui",
  title =        "Some ${A}$-Stable and ${L}$-Stable Methods for the
                 Numerical Integration of Stiff Ordinary Differential
                 Equations",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "483--493",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Some $A$-stable and $L$-stable Rosenbrock type
                 (semi-implicit Runge--Kutta) methods accurate to the
                 fourth local order with only one computation of a
                 Jacobian matrix per step of integration are constructed
                 for the solution of the Cauchy problem for systems of
                 stiff ordinary differential equations. Numerical
                 experiments show high efficiency of the proposed
                 methods for excessively stiff systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Skeel:1979:SNS,
  author =       "Robert D. Skeel",
  title =        "Scaling for Numerical Stability in {Gaussian}
                 Elimination",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "494--526",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Roundoff error in the solution of linear algebraic
                 systems is studied using a more realistic notion of
                 what it means to perturb a problem, namely, that each
                 datum is subject to a relatively small change. This is
                 particularly appropriate for sparse linear systems. The
                 condition number is determined for this approach. The
                 effect of scaling on the stability of Gaussian
                 elimination is studied, and it is discovered that the
                 proper way to scale a system depends on the right-hand
                 side. However, if only the norm of the error is of
                 concern, then there is a good way to scale that does
                 not depend on the right-hand side.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "lud; mathematical techniques; nla; rounding error;
                 scaling",
}

@Article{Werschulz:1979:MOO,
  author =       "Arthur G. Werschulz",
  title =        "Maximal Order and Order of Information for Numerical
                 Quadrature",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "527--537",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 23:26:43 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Frederickson:1979:AAS,
  author =       "Greg N. Frederickson",
  title =        "Approximation Algorithms for Some Postman Problems",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "538--554",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Approximation algorithms for several NP-complete
                 edge-covering routing problems are presented and
                 analyzed in terms of the worst-case ratio of the cost
                 of the obtained solution to the cost of the optimum
                 solution. A worst-case bound of 2 is proved for the
                 mixed postman algorithm of Edmonds and Johnson, and a
                 related algorithm for the mixed postman problem is
                 shown also to have a worst-case bound of 2. A mixed
                 strategy approach is used to obtain a bound of 5/3 for
                 the mixed postman problem. A second mixed strategy
                 algorithm, for the mixed postman on a planar graph, is
                 shown to have a worst-case bound of 3/2.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Baker:1979:CMB,
  author =       "Brenda S. Baker and S. Rao Kosaraju",
  title =        "A Comparison of Multilevel break and next Statements",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "555--566",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A study is made of the descriptive power of if then
                 else statements and repeat (do forever) statements,
                 multilevel break statements (which cause a jump out of
                 an enclosing repeat), and multilevel next statements
                 (which cause a jump to an iteration of an enclosing
                 repeat). Ledgard and Marcotty conjectured that
                 multilevel next statements could be removed without
                 increasing the number of levels of break statements to
                 obtain another program with operations executed in the
                 same order. The conjecture is shown to be true for one
                 level of next statement but false for next statements
                 with level greater than 1. It is also shown that next
                 statements are weaker than break statements in the
                 sense that $n$ levels of next statements can be
                 transformed into 2n levels of break statement, while
                 there is no function $f$ such that $n$ levels of break
                 can be replaced by f(n) levels of next.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
}

@Article{Gurari:1979:NCN,
  author =       "Eitan M. Gurari and Oscar H. Ibarra",
  title =        "An {NP}-Complete Number-Theoretic Problem",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "567--581",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Math/hilbert10.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  mr =           "80e:68107",
}

@Article{Kedem:1979:CDR,
  author =       "Zvi M. Kedem",
  title =        "Combining Dimensionality and Rate of Growth Arguments
                 for Establishing Lower Bounds on the Number of
                 Multiplications and Divisions",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "3",
  pages =        "582--601",
  month =        jul,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new method for establishing lower bounds on the
                 number of multiplications and divisions required to
                 compute rational functions is described. The method is
                 based on combining two known methods, dimensionality
                 and rate of growth. The method is applied to several
                 problems and new lower bounds are obtained.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Beyer:1979:LAI,
  author =       "T. Beyer and W. Jones and S. Mitchell",
  title =        "Linear Algorithms for Isomorphism of Maximal
                 Outerplanar Graphs",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "603--610",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Two linear algorithms are presented for solving the
                 isomorphism problem for maximal outerplanar graphs
                 (mops). These algorithms present improvements over
                 corresponding linear algorithms for planar graph
                 isomorphism when applied to mops. The algorithms are
                 based on a code for a mop $G$ which is obtained from a
                 unique Hamiltonian cycle in $G$. The first involves a
                 string-matching automation and the second involves the
                 removal of vertices of degree two in layers until
                 either an edge or triangular face remains.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Gross:1979:LTP,
  author =       "Jonathan L. Gross and Ronald H. Rosen",
  title =        "A Linear Time Planarity Algorithm for $2$-Complexes",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "611--617",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Apr 01 16:58:00 2002",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A linear time algorithm to decide whether a given
                 finite 2-complex is planar is described. Topological
                 results of Gross, Harary, and Rosen are the
                 mathematical basis for the algorithm. Optimal running
                 time is achieved by constructing various lists
                 simultaneously and keeping their orderings compatible.
                 If the complex is simplicial with$\rho$vertices, then
                 the algorithm has $O(\rho)$ time and space bounds. The
                 algorithm uses depth-first search both in application
                 of the graph planarity algorithm of J. Hopcroft and R.
                 Tarjan and elsewhere.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Graph Theory",
}

@Article{Yannakakis:1979:ECR,
  author =       "Mihalis Yannakakis",
  title =        "The Effect of a Connectivity Requirement on the
                 Complexity of Maximum Subgraph Problems",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "618--630",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "If pi is a property on graphs (or digraphs), the
                 corresponding maximum subgraph problem is: Given a
                 graph $G$ find a maximum (induced) subgraph of G
                 satisfying property pi. This problem was previously
                 shown to be NP-hard for a large class of properties
                 (the class of properties that are hereditary on induced
                 subgraphs). The effect of adding a connectivity
                 requirement to pi is now considered. It is shown that
                 for the same class of properties the connected maximum
                 subgraph problem is also NP-hard; moreover, for a
                 certain important subclass of properties, even
                 approximating the node-deletion version of it in any
                 ``reasonable'' ways is NP-hard.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Papadimitriou:1979:SCD,
  author =       "Christos H. Papadimitriou",
  title =        "The Serializability of Concurrent Database Updates",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "631--653",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/real.time.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A sequence of interleaved user transactions in a
                 database system may not be serializable, i.e.,
                 equivalent to some sequential execution of the
                 individual transactions. Using a simple transaction
                 model, it is shown that recognizing the transaction
                 histories that are serializable is an NP-complete
                 problem. Several efficiently recognizable subclasses of
                 the class of serializable histories are therefore
                 introduced; most of these subclasses correspond to
                 serializability principles existing in the literature
                 and used in practice. Two new principles that subsume
                 all previously known ones are also proposed. Necessary
                 and sufficient conditions are given for a class of
                 histories to be the output of an efficient history
                 scheduler; these conditions imply that there can be no
                 efficient scheduler that outputs all of serializable
                 histories, and also that all subclasses of serializable
                 histories studied above have an efficient scheduler.
                 Finally, it is shown how these results can be extended
                 to far more general transaction models, to transactions
                 with partly interpreted functions, and to distributed
                 database systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "A sequence of interleaved user transactions in a
                 database system may not be serializable. Eswaran
                 provided a simple criterion. here several recognizable
                 subclasses are introduced; most of these correspond to
                 serializability principles in the literature and used
                 in practice. Two principles that subsume all known ones
                 are proposed. These permit more schedules, but their
                 determination is NP-hard. The results can be extended
                 to more general transaction models, transactions with
                 partly interpreted functions, and to distributed
                 database systems.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems; database systems concurrency",
}

@Article{Mendelson:1979:PMO,
  author =       "Haim Mendelson and Uri Yechiali",
  title =        "Performance Measures for Ordered Lists in
                 Random-Access Files",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "654--667",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A random-access file with $N$ storage locations is
                 considered. Records are added to the file from time to
                 time. A record with key omega is hashed to storage
                 locations $F(\omega)$. A collision is resolved by the
                 following chaining method: All records hashed to the
                 same location are chained to each other to form an
                 ordered list, ordered in ascending order of the keys.
                 The first record of a list is stored either at location
                 $F(\omega)$ or at an alternative start if location
                 $F(\omega)$ is occupied. For this process the
                 multidimensional time-dependent generating function is
                 derived, and the expected values of various state
                 variables are calculated. These values are used to
                 obtain formulas for the expected number of I/O
                 operations needed for retrieval, addition, or updating
                 of a record. Two measures of retrieval performance are
                 calculated and addition of a record is considered.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing",
}

@Article{Rosenberg:1979:EDS,
  author =       "Arnold L. Rosenberg",
  title =        "Encoding Data Structures in Trees",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "668--689",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Encodings of data structures in trees are studied with
                 an eye toward developing techniques for analyzing such
                 encodings. Two guest structures are studied here,
                 namely, lines and arrays. Upper and lower bounds on the
                 costs of encodings of these structures in trees are
                 derived; in several cases these bounds are
                 asymptotically coincident, or at least very close. The
                 main results concerning line-guests exhibit certain
                 (best possible) sufficient conditions for the costs of
                 encodings of lines in trees to be independent of the
                 lengths of the lines. The main results concerning
                 array-guests are exemplified by the following: The
                 costs of encodings of $d$-dimensional arrays in
                 $2^d$-ary trees are shown to have coincident upper and
                 lower bounds of $4 + o(1)$; and the costs of encodings
                 of such arrays in binary trees are shown to have upper
                 and lower bounds of $3d + 1 + o(1)$ and $2.885 d + 1 +
                 0.116 / d + o(1)$, respectively; for the case $d$
                 equals $2$, the derived bounds are even closer than
                 this general result would suggest that the upper and
                 lower bounds for encodings of 2-dimensional arrays in
                 binary trees are $7 + O(1)$ and $6.98 + O(1)$,
                 respectively.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing; mathematical techniques --- Trees",
}

@Article{Tarjan:1979:APC,
  author =       "Robert Endre Tarjan",
  title =        "Applications of Path Compression on Balanced Trees",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "690--715",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Several fast algorithms are presented for computing
                 functions defined on paths in trees under various
                 assumptions. The algorithms are based on tree
                 manipulation methods first used to efficiently
                 represent equivalence relations. The algorithms have
                 $O((m + n) \alpha (m + n,n))$ running times, where $m$
                 and $n$ are measures of the problem size and $\alpha$
                 is a functional inverse of Ackermann's function. By
                 using one or more of these algorithms in combination
                 with other techniques, it is possible to solve several
                 graph problems in $O(m \alpha (m,n))$ time, where $m$
                 is the number of edges and $n$ is the number of
                 vertices in the problem graph.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming --- Subroutines; data processing;
                 mathematical techniques --- Trees",
}

@Article{Bustoz:1979:ITD,
  author =       "Joaqu{\'\i}n Bustoz and Alan Feldstein and Richard
                 Goodman and Seppo Linnainmaa",
  title =        "Improved Trailing Digits Estimates Applied to Optimal
                 Computer Arithmetic",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "716--730",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "New results are given on the distribution of trailing
                 digits for logarithmically distributed numbers and on
                 error in floating-point multiplication. Some of the
                 results have application to computer design. In
                 particular, there are certain values of the base
                 (indeed, $\beta=2,4,6$, and sometimes, $8$, but {\em
                 not\/} $16$) which, when carefully balanced with other
                 design parameters, minimize the mean multiplicative
                 error. For these special minimizing situations, it
                 suffices to have only one guard $\beta$it provided that
                 postnormalization occurs after symmetric rounding.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer arithmetic; computer programming;
                 floating-point multiplication; floating-point numbers;
                 floating-point precision and significance; fraction
                 error; guard digits; logarithmically distributed
                 numbers; mean and standard deviation of error;
                 nonleading digits; normalization options; roundoff
                 error; trailing digits; uniformly distributed numbers",
}

@Article{Butcher:1979:TIR,
  author =       "J. C. Butcher",
  title =        "A Transformed Implicit {Runge--Kutta} Method",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "731--738",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Certain implicit Runge--Kutta methods are capable of
                 being transformed into a form which makes the modified
                 Newton iterates in their implementation capable of
                 efficient computation. For the class of such methods
                 considered, the transformations are given explicitly,
                 and it is shown how error estimates, as well as initial
                 iterates for a succeeding step, can be expressed in
                 terms of the transformed variables.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques",
}

@Article{Johnson:1979:RAF,
  author =       "Donald B. Johnson and Webb Miller and Brian Minnihan
                 and Celia Wrathall",
  title =        "Reducibility Among Floating-Point Graphs",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "739--760",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The graph-theoretic models of this paper can be used
                 to compare the rounding-error behavior of numerical
                 programs. The models follow the approach, popularized
                 by Wilkinson, of assuming independent rounding errors
                 in each arithmetic operation. Models constructed on
                 this assumption are more tractable than would be the
                 case under more realistic assumptions. There are
                 identified two easily tested conditions on programs
                 which guarantee that error analyses are relatively
                 insensitive to the particular graph model employed. The
                 development has the additional benefit of sometimes
                 providing an elementary proof that one program is
                 comparable in stability to another. Examples of such
                 results are given.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Numerical Methods",
}

@Article{Bhat:1979:ECE,
  author =       "U. Narayan Bhat and Richard E. Nance",
  title =        "An Evaluation of {CPU} Efficiency Under Dynamic
                 Quantum Allocation",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "761--778",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A model for a time-sharing operating system is
                 developed in order to assess the effects of dynamic
                 quantum allocation and overhead variability on central
                 processing unit (CPU) efficiency. CPU efficiency is
                 determined by the proportion of time devoted to
                 user-oriented (problem state) tasks within a busy
                 period. Computational results indicate that a dynamic
                 quantum allocation strategy produces significant
                 differences in CPU efficiency compared to a constant
                 quantum. The differences are affected significantly by
                 the variability among allocated quantum values and the
                 demand on the system. Overhead variability also has a
                 pronounced effect. A function that depicts overhead as
                 decreasing with demand produces more stable values of
                 CPU efficiency. The interaction between demand and the
                 amount of overhead is observed to be significant.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Model; time sharing; performance evaluation; CPU;
                 feedback; overhead time; semi Markov process; operating
                 system",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems",
}

@Article{Noetzel:1979:GQD,
  author =       "Andrew S. Noetzel",
  title =        "A generalized queueing discipline for product form
                 network solutions",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "779--793",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Certain queueing disciplines, such as processor
                 sharing, the preemptive last-come-first-served
                 discipline, and the infinite server queue, are known to
                 result in network equilibrium state probabilities that
                 have a convenient product form. A generalization of the
                 above disciplines is introduced. The general class is
                 presented in the form of a parameterized discipline,
                 called the last-batch-processor-sharing (LBPS)
                 discipline. The equilibrium state probabilities for
                 disciplines of the LBPS class are shown, and, by use of
                 the concept of local balance, it is shown that
                 arbitrary networks of LBPS queues have product form
                 equilibrium state probabilities. It is also shown that
                 within the class of symmetric disciplines, the LBPS is
                 necessary if the product form solution is to be
                 obtained for general service time distributions. A
                 discipline is symmetric if the processor assignments to
                 the customers in the queue depend on total queue
                 occupancy and queue position (relative arrival time)
                 only. Generalizations of the LBPS rule beyond the
                 symmetric disciplines are discussed. A multiple
                 customer-class form of the LBPS discipline is also
                 demonstrated, and it is shown to have the local balance
                 property.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723; 922",
  descriptors =  "Queueing network; processor sharing; Markov process;
                 product form; network; local balance",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems, digital; probability --- Queueing
                 Theory",
}

@Article{Milner:1979:FFA,
  author =       "Robin Milner",
  title =        "Flowgraphs and Flow Algebras",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "794--818",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/dbase.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algebra $G$ of flowgraphs or nets is presented. It
                 is shown to be a free algebra of a simple equational
                 system F, which is called the laws of flow. This holds
                 both for the algebra of finite nets, and for the
                 algebra of finite or infinite nets in which certain
                 infinite nets may be described by recursion equations.
                 To demonstrate this fact, some results concerning
                 categories of continuous algebras, which are explicit
                 in the work of the ADJ group, are presented in a
                 self-contained form. It follows that the algebra of
                 processes, which satisfies the laws of flow F, is a
                 suitable semantics for flowgraphs. Some simple examples
                 of infinite nets are given, and their possible
                 interpretation.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Logrippo:1979:RMP,
  author =       "Luigi Logrippo",
  title =        "Renamings, Maximal Parallelism, and Space-Time
                 Tradeoff in Program Schemata",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "4",
  pages =        "819--833",
  month =        oct,
  year =         "1979",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Concepts such as ``maximal parallelism'', ``greater
                 parallelism'', and ``instruction look-ahead'' are
                 investigated in the framework of program schemata
                 theory. A method for increasing the parallelism of a
                 program schema by changing its control structure and
                 the name of its variables is given. A characterization
                 result of maximal parallelism, a method for
                 approximating the maximally parallel form of a given
                 finite schema, and a space-time tradeoff principle are
                 obtained. It is shown that maximal parallelism is a
                 decidable property for finite schemata, but that there
                 are finite schemata whose maximally parallel form
                 requires an infinite control and an infinite number of
                 memory variables.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Proskurowski:1980:GBT,
  author =       "Andrzej Proskurowski",
  title =        "On the Generation of Binary Trees",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A binary tree may be uniquely represented by a code
                 reflecting traversal of the corresponding extended
                 binary tree in a given monotonic order. A general
                 algorithm for constructing codes of all binary trees
                 with $n$ vertices is presented. Different orders of
                 traversal yield different orderings of the generated
                 trees. The algorithm is illustrated with an example of
                 the sequence of binary trees obtained from ballot
                 sequences.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "binary trees; computer programming; mathematical
                 techniques --- Trees",
}

@Article{Solomon:1980:NEB,
  author =       "Marvin Solomon and Raphael A. Finkel",
  title =        "A Note on Enumerating Binary Trees",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "3--5",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "G. Knott has presented algorithms for computing a
                 bijection between the set of binary trees on $n$ nodes
                 and an initial segment of the positive integers. D.
                 Rotem and Y. L. Varol presented a more complicated
                 algorithm that computes a different bijection, claiming
                 that their algorithm is more efficient and has
                 advantages if a sequence of several consecutive trees
                 is required. A modification of Knott's algorithm that
                 is simpler than Knott's and as efficient as Rotem and
                 Varol's is presented. Also given is a new linear-time
                 algorithm for transforming a tree into its successor in
                 the natural ordering of binary trees.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723; 921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; mathematical techniques ---
                 Trees",
}

@Article{Nassimi:1980:ORA,
  author =       "David Nassimi and Sartaj Sahni",
  title =        "An Optimal Routing Algorithm for Mesh-Connected
                 Parallel Computers",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "6--29",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.comm.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An optimal algorithm to route data in a mesh-connected
                 parallel computer is presented. This algorithm can be
                 used to perform any data routing that can be specified
                 by the permutation and complementing of the bits in a
                 PE address. Matrix transpose, bit reversal, vector
                 reversal, and perfect shuffle are examples of data
                 permutations that can be specified in this way. The
                 algorithm presented uses the minimum number of unit
                 distance routing steps for every data permutation that
                 can be specified as above.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming; computer systems, digital ---
                 Parallel Processing",
}

@Article{Pawlikowski:1980:MWT,
  author =       "Krzysztof Pawlikowski",
  title =        "Message Waiting Time in a Packet Switching System",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "30--41",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The behavior of a buffer having an arbitrary number of
                 common output channels in a packet switching system
                 with an arbitrary number of priority classes of
                 messages is studied. Because of the random lengths of
                 the messages and the fixed packet size, some messages
                 must be split into several packets. Packets of the same
                 message may not be sent immediately in sequence because
                 of the packets of higher priority messages. Therefore,
                 the message waiting time is defined as the waiting time
                 of the last packet carrying a part of the given
                 message. The limiting probability distribution of this
                 delay is calculated for the case of independent packet
                 arrival processes with stationary independent
                 increments. Some numerical results are also
                 presented.\\
                 The results obtained can be used in the analysis of
                 message path delay in certain store-and-forward
                 communication systems, particularly loop communication
                 systems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Queueing system; Markov process; packet switching;
                 priority; ring network; loop system",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer networks",
}

@Article{Swartz:1980:PLS,
  author =       "G. Boyd Swartz",
  title =        "Polling in a Loop System",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "42--59",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A communication system consisting of $n$ buffered
                 input terminals connected to a computer by a single
                 channel is analyzed. The terminals are polled in
                 sequence. Data are removed one unit at a time from the
                 terminal's buffer. When the buffer has been emptied,
                 the channel is used for system overhead for a randomly
                 determined length of time. The system continues with a
                 poll of the next terminal. The stationary distributions
                 of waiting times and queueing delay are determined for
                 independent input processes. The queueing delay is
                 minimized by proper selection of the polling order.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Communication network; queueing system; polling;
                 statistical multiplexing",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer networks",
}

@Article{Henderson:1980:SPS,
  author =       "Peter B. Henderson and Yechezkel Zalcstein",
  title =        "Synchronization Problems Solvable by Generalized {PV}
                 Systems",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "60--71",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A basic question in the area of asynchronous
                 computation is: Given a synchronization problem, what
                 synchronization primitives are needed for an
                 ``efficient'' solution? This study is directed toward
                 answering this question by providing characterizations
                 of those synchronization problems solvable by
                 Dijkstra's PV system of primitives and its various
                 generalizations including PV general, PV multiple, PV
                 chunk, Vector Addition, and Loopless Petri Net systems.
                 These characterizations form the foundations of a
                 formal synthesis procedure for determining efficient
                 solutions to synchronization problems.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer metatheory",
}

@Article{Silberschatz:1980:CHD,
  author =       "Abraham Silberschatz and Zvi Kedem",
  title =        "Consistency in Hierarchical Database Systems",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "72--80",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problems of locking and consistency in database
                 systems are examined. It is assumed that each
                 transaction, when executed alone, transforms a
                 consistent state into a consistent state. A set of
                 conditions is derived to guarantee that when
                 transactions are processed concurrently, the results
                 are the same as would be obtained by processing the
                 transactions serially. These conditions are used to
                 establish a locking protocol in hierarchical database
                 systems. The locking protocol allows transactions to
                 request new locks after releasing a lock. However, a
                 data item may be locked almost at once as a result of
                 each transaction. It is shown that the protocol ensures
                 consistency and that it is deadlock free.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems",
}

@Article{Lipton:1980:EHS,
  author =       "Richard J. Lipton and Arnold L. Rosenberg and Andrew
                 C. Yao",
  title =        "External Hashing Schemes for Collections of Data
                 Structures",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "81--95",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The use of external hashing schemes for storing broad
                 classes of data structures is studied. The general
                 framework of the paper considers a class of data
                 structures partitioned into smaller classes by the
                 number of positions in the structure. For instance, one
                 could start with the class of all binary trees and
                 partition that class into subclasses comprising all
                 $n$-node binary trees. The main results establish
                 nonconstructively the existence of an external hashing
                 scheme $h_n$ with $O(n)$ storage demand and $O(1)$
                 expected access time. Classes of data structures
                 subsumed by these results include ragged arrays, binary
                 trees, string-indexed arrays, and refinable arrays.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data processing",
}

@Article{Engelfriet:1980:SMC,
  author =       "Joost Engelfriet and Erik Meineche Schmidt and Jan van
                 Leeuwen",
  title =        "Stack Machines and Classes of Nonnested Macro
                 Languages",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "96--117",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A new class of generalized one-way stack automata,
                 called s-pd machines, is investigated. The machines are
                 obtained by augmenting a stack automaton with a
                 pushdown store, whose bottom is attached to the top of
                 the stack and whose top follows the movements of the
                 stack-pointer into the stack. Motivations for the model
                 include a possible protocol for macro expansion with
                 intermittent parameter evaluation. The language
                 recognized by these machines are characterized by a
                 natural class of grammars, viz., the class of OI macro
                 grammars with set-parameters and nonnested function
                 calls (the ``extended basic'' or EB macro grammars). If
                 the stack is required to be nonerasing or checking,
                 then a useful machine characterization for the ETOL
                 languages is obtained, together with the known
                 characterization of this family by means of extended
                 ``linear'' basic or ELB macro grammars. It follows that
                 the nonerasing one-way stack languages are (strictly)
                 included in ETOL.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "automata theory",
}

@Article{Kannan:1980:PAT,
  author =       "Ravindran Kannan",
  title =        "A Polynomial Algorithm for the Two-Variable Integer
                 Programming Problem",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "118--122",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A polynomial time algorithm is presented for solving
                 the following two-variable integer programming problem:
                 maximize $c_1x_1 + c_2x_2$ subject to $a_{i_1} x_1 +
                 a_{i_2} x_2 \leq b_i$, $i = 1, 2, \ldots{}, n$, and
                 $x_1, x_2 \geq 0$, integers, where $a_{i_j}$, $c_j$,
                 and $b_i$ are assumed to be nonnegative integers. This
                 generalizes a result of D. S. Hirschberg and C. K.
                 Wong, who developed a polynomial algorithm for the same
                 problem with only one constraint (i.e., where $n = 1$).
                 However, the techniques used here are quite
                 different.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical programming",
}

@Article{DeMillo:1980:STT,
  author =       "Richard A. DeMillo and Stanley C. Eisenstat and
                 Richard J. Lipton",
  title =        "Space-Time Trade-Offs in Structured Programming: {An}
                 Improved Combinatorial Embedding Theorem",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "123--127",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Let $G$ and G* be programs represented by directed
                 graphs. There is defined a relation less than
                 equivalent to $S, T$ between $G$ and $G*$ that
                 formalizes the notion of $G*$ simulating $G$ with
                 $S$-fold loss of space efficiency and $T$-fold loss of
                 time efficiency; it is proved that if $G$ less than or
                 equivalent to $S,T G*$, where $G$ has $n$ statements
                 and $G*$ is structured, then in the worst case $T +
                 \log_2 \log_2 S$ is greater than or equivalent to
                 $\log_2 n + O(\log_2 \log_2 n)$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Kaplan:1980:SAI,
  author =       "Marc A. Kaplan and Jeffrey D. Ullman",
  title =        "A Scheme for the Automatic Inference of Variable
                 Types",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "128--145",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm for the determination of run-time types
                 in a programming language requiring no type
                 declarations is presented. It is demonstrated that this
                 algorithm is superior to other published algorithms in
                 the sense that it produces stronger assertions about
                 the set of possible types for variables than do other
                 known algorithms. In fact this algorithm is to be the
                 best possible algorithm from among all those that use
                 the same set of primitive operators.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Prabhala:1980:ECE,
  author =       "Bhaskaram Prabhala and Ravi Sethi",
  title =        "Efficient Computation of Expressions with Common
                 Subexpressions",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "146--163",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Previous results have shown that it is easy to
                 generate optimal code from expression trees, and that
                 optimal code generation becomes very difficult if
                 arbitrary common subexpressions are handled. In this
                 paper a class of expressions containing restricted
                 common subexpressions from which optimal code can be
                 generated efficiently is studied. These expressions are
                 represented by a class of series-parallel graphs, which
                 the authors call collapsible graphs, that include trees
                 and are general enough to permit large common
                 subexpressions, but from which optimal code can be
                 generated in polynomial time for a class of stack
                 machines.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Wand:1980:CBP,
  author =       "Mitchell Wand",
  title =        "Continuation-Based Program Transformation Strategies",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "164--180",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Program transformations often involve the
                 generalization of a function to take additional
                 arguments. It is shown that in many cases such an
                 additional variable arises as a representation of the
                 continuation or global context in which the function is
                 evaluated. By considering continuations, local
                 transformation strategies can take advantage of global
                 knowledge. The general results are followed by two
                 examples: the $\alpha$--$\beta$ tree pruning algorithm
                 and an algorithm for the conversion of a propositional
                 formula to conjunctive normal form.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Bender:1980:NFF,
  author =       "Edward A. Bender",
  title =        "The Number of Fanout-Free Functions with Various
                 Gates",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "181--190",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Generating functions for the number of fanout-free and
                 cascade networks built from an arbitrary set of
                 symmetric gates are studied. Recursions and asymptotic
                 estimates are obtained. The average number of gates in
                 $n$-input networks is studied. It grows linearly with
                 $n$, in contrast to the situation when a much larger
                 set of gates is allowed.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "721",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "switching theory",
}

@Article{Suzuki:1980:VDP,
  author =       "Norihisa Suzuki and David Jefferson",
  title =        "Verification Decidability of {Pressburger} Array
                 Programs",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "1",
  pages =        "191--205",
  month =        jan,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A program annotated with inductive assertions is said
                 to be verification decidable if all of the verification
                 conditions generated from the program and assertions
                 are formulas in a decidable theory. A theory is
                 defined, which is called Presburger array theory,
                 containing two logical sorts: integer and array of
                 integer. Addition, subtraction, and comparisons are
                 permitted for integers. Array access and assignment
                 functions are allowed. Since the elements of the arrays
                 are integers, array accesses may be nested. First, it
                 is observed that the validity of unquantified formulas
                 in Presburger array theory is decidable, yet quantified
                 formulas in general are undecidable. It is then shown
                 that, with certain restrictions, one can add a new
                 predicate Perm(M, N) --- meaning array M is a
                 permutation of array $N$ --- to the assertion language
                 and still have a solvable decision problem for
                 verification conditions generated from unquantified
                 assertions. The significance of this result is that
                 almost all known one-array sorting programs are
                 verification decidable when annotated with inductive
                 assertions for proving that the output is a permutation
                 of the input.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Yao:1980:NAP,
  author =       "Andrew Chi-Chih Yao",
  title =        "New Algorithms for Bin Packing",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "207--227",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/bin-packing.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "In the bin-packing problem a list $L$ of $n$ numbers
                 are to be packed into unit-capacity bins. For any
                 algorithm $S$, let $r(S)$ be the maximum ratio
                 $S(L)/L*$ for large $L*$, where $S(L)$ denotes the
                 number of bins used by $S$ and $L*$ denotes the minimum
                 number needed. An on-line $O(n \log n)$-time algorithm
                 RFF with $r(RFF) = 5/3$ and an off-line polynomial-time
                 algorithm RFFD with $r(RFFD) \leq 11/9 - \epsilon$, for
                 some fixed epsilon greater than $0$, are given. These
                 are strictly better, respectively, than two prominent
                 algorithms: the First-Fit (FF), which is on-line with
                 $r(FF) = 17/10$, and the First-Fit-Decreasing (FFD)
                 with $r(FFD) = 11/9$. Furthermore, it is shown that any
                 on-line algorithm $S$ must have $r(S) \geq 3/2$. The
                 question, ``How well can an $o(n \log n)$-time
                 algorithm perform?'' is also discussed. It is shown
                 that in the generalized $d$-dimensional bin packing,
                 any $o(n \log n)$-time algorithm $S$ must have $r(S)
                 \geq d$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Pease:1980:RAP,
  author =       "M. Pease and R. Shostak and L. Lamport",
  title =        "Reaching Agreements in the Presence of Faults",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "228--234",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "This paper is similar to their 1982 publication
                 \cite{Lamport:1982:BGP}, but contains a rigorous proof
                 of the impossibility of Byzantine agreement for the
                 case $n=3$, $t=1$. As usual, $n$ is the total number of
                 processes and $t$ is the number of faulty processes.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  annote =       "Byzantine generals.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Reiter:1980:EDC,
  author =       "Raymond Reiter",
  title =        "Equality and Domain Closure for First-Order
                 Databases",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "235--249",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A class of first-order databases with no function
                 signs is considered. A closed database DB is one for
                 which the only existing individuals are those
                 explicitly referred to in the formulas of DB. Formally,
                 this is expressed by including in DB a domain closure
                 axiom. It is shown how to completely capture the
                 effects of this axiom by means of suitable
                 generalizations of the projection and division
                 operators of relational algebra, thereby permitting the
                 underlying theorem prover used for query evaluation to
                 ignore this axiom. A database is $E$-saturated if all
                 of its constants denote distinct individuals. It is
                 shown that such databases circumvent the usual problems
                 associated with equality, which arise in more general
                 databases. Finally, it is proved for Horn databases and
                 positive queries that only definite answers are
                 obtained, and for databases with infinitely many
                 constants that infinitely long indefinite answers can
                 arise.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "data base systems",
}

@Article{Sagiv:1980:AIM,
  author =       "Yehoshua Sagiv",
  title =        "An Algorithm for Inferring Multivalued Dependencies
                 with an Application to Propositional Logic",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "250--262",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Oct 26 22:08:45 1994",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Wasilkowski:1980:CSI,
  author =       "G. W. Wasilkowski",
  title =        "Can Any Stationary Iteration Using Linear Information
                 be Globally Convergent?",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "263--269",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "All known globally convergent iterations for the
                 solution of a nonlinear operator equation f(x) equals 0
                 are either nonstationary or use nonlinear information.
                 It is asked whether there exists a globally convergent
                 stationary iteration which uses linear information. It
                 is proved that even if global convergence is defined in
                 a weak sense, there exists no such iteration for as
                 simple a class of problems as the set of all analytic
                 complex functions having only simple zeros. It is
                 conjectured that even for the class of all real
                 polynomials which have real simple zeros there does not
                 exist a globally convergent stationary iteration using
                 linear information.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "921",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "mathematical techniques",
}

@Article{Kameda:1980:TDF,
  author =       "Tiko Kameda",
  title =        "Testing Deadlock-Freedom of Computer Systems",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "270--280",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The problem of determining whether it is possible for
                 a set of ``free-running'' processes to become
                 deadlocked is considered. It is assumed that any
                 request by a process is immediately granted as long as
                 there are enough free resource units to satisfy the
                 request. The question of whether or not there exists a
                 polynomial algorithm for predicting deadlock in a
                 ``claim-limited'' serially reusable resource system has
                 been open. An algorithm employing a network flow
                 technique is presented for this purpose. Its running
                 time is bounded by $O(m n^{1.5})$ if the system
                 consists of $n$ processes sharing $m$ types of serially
                 reusable resources.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer operating systems; concurrency control",
}

@Article{Chow:1980:CTD,
  author =       "We-Min Chow",
  title =        "The Cycle Time Distribution of Exponential Cyclic
                 Queues",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "281--286",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The cycle time distribution of a cyclic queue with two
                 exponential servers is derived. Results show that when
                 the population size $N$ is large enough, the cycle time
                 distribution is not sensitive to the ratio of service
                 rates and asymptotically approaches an Erlangian
                 distribution. If service rates are identical, however,
                 the cycle time has an exact Erlangian distribution for
                 any $N$.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "722; 723; 922",
  descriptors =  "loop queue; time in system; exponential distribution;
                 Erlang distribution; model; cyclic service; cycle
                 time",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer systems, digital; probability --- Queueing
                 Theory",
}

@Article{Gonzalez:1980:NAP,
  author =       "Teofilo F. Gonzalez and Donald B. Johnson",
  title =        "A New Algorithm for Preemptive Scheduling of Trees",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "287--312",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "An algorithm which schedules forests of $n$ tasks on
                 $m$ identical processors in $O(n\log m)$ time, offline,
                 is given. The schedules are optimal with respect to
                 finish time and contain at most $n-2$ preemptions, a
                 bound which is realized for all $n$. Also given is a
                 simpler algorithm which runs in $O(n\times m)$ time on
                 the same problem and can be adapted to give optimal
                 finish time schedules on-line for independent tasks
                 with release times.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  descriptors =  "Method; runtime/storage efficiency; queueing
                 discipline; optimization; preemptive scheduling; finish
                 time",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming",
}

@Article{Reiser:1980:MVA,
  author =       "M. Reiser and S. S. Lavenberg",
  title =        "Mean-Value Analysis of Closed Multichain Queuing
                 Networks",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "313--322",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  note =         "See also \cite{Reiser:1981:CMV}.",
  abstract =     "It is shown that mean queue sizes, mean waiting times,
                 and throughputs in closed multiple-chain queueing
                 networks which have product-form solution can be
                 computed recursively without computing product terms
                 and normalization constants. The resulting
                 computational procedures have improved properties
                 (avoidance of numerical problems and, in some cases,
                 fewer operations) compared to previous algorithms.
                 Furthermore, the new algorithms have a physically
                 meaningful interpretation which provides the basis for
                 heuristic extensions that allow the approximate
                 solution of networks with a very large number of closed
                 chains, and which is shown to be asymptotically valid
                 for large chain populations.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  descriptors =  "Method; queueing network; model; performance
                 evaluation; queueing approximation; closed queueing
                 network; expectation; waiting time; queue length;
                 runtime/storage efficiency; throughput performance",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Towsley:1980:QNM,
  author =       "Don Towsley",
  title =        "Queuing Network Models with State-Dependent Routing",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "323--337",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 16 10:53:42 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Discrete.event.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A model of a closed queueing network within which
                 customer routing between queues may depend on the state
                 of the network is presented. The routing functions
                 allowed may be rational functions of the queue lengths
                 of various downstream queues which reside within
                 special subnetworks called $p$-subnetworks. If a
                 network with no state-dependent routing has a
                 product-form joint equilibrium distribution of the
                 queue lengths, then the introduction of these routing
                 functions will preserve the product form of the
                 equilibrium distribution. An example to illustrate the
                 applicability of the model to the problem of analyzing
                 a load balancing strategy is presented. It is also
                 indicated how the parametric analysis of a network with
                 routing functions can be simplified through the
                 analysis of a simpler ``equivalent'' network.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "922",
  descriptors =  "Model; routing algorithm; closed queueing network;
                 product form; network; load balancing; state dependent
                 routing; local balance",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "probability",
}

@Article{Krishnaswamy:1980:CSS,
  author =       "Ramachandran Krishnaswamy and Arthur B. Pyster",
  title =        "On the Correctness of Semantic-Syntax-Directed
                 Translations",
  journal =      j-J-ACM,
  volume =       "27",
  number =       "2",
  pages =        "338--355",
  month =        apr,
  year =         "1980",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "The correctness of semantic-syntax-directed
                 translators (SSDTs) is examined. SSDTs are a
                 generalization of syntax-directed translators in which
                 semantic information is employed to partially direct
                 the translator. Sufficient conditions for an SSDT to be
                 ``semantic-preserving,'' or ``correct,'' are presented.
                 A further result shows that unless certain conditions
                 are met, it is undecidable, in general, whether an SSDT
                 is semantic-preserving.",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Assoc. Comput. Mach.",
  classification = "723",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "compilation; computer programming; valid",
}